libardourcp and now libardour_midisurface are not control surfaces, but helper libraries for those. They need to be deployed to the library folder (shared between ctrl surfaces) and not scanned as ctrl surfaces at runtime.
114 lines
2.7 KiB
C++
114 lines
2.7 KiB
C++
/*
|
|
* Copyright (C) 2016 Paul Davis <paul@linuxaudiosystems.com>
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License along
|
|
* with this program; if not, write to the Free Software Foundation, Inc.,
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*/
|
|
#include "midi_byte_array.h"
|
|
|
|
#include <iostream>
|
|
#include <string>
|
|
#include <sstream>
|
|
#include <vector>
|
|
#include <algorithm>
|
|
#include <cstdarg>
|
|
#include <iomanip>
|
|
#include <stdexcept>
|
|
|
|
MidiByteArray::MidiByteArray (size_t size, MIDI::byte array[])
|
|
: std::vector<MIDI::byte>()
|
|
{
|
|
for (size_t i = 0; i < size; ++i)
|
|
{
|
|
push_back (array[i]);
|
|
}
|
|
}
|
|
|
|
MidiByteArray::MidiByteArray (size_t count, MIDI::byte first, ...)
|
|
: vector<MIDI::byte>()
|
|
{
|
|
push_back (first);
|
|
va_list var_args;
|
|
va_start (var_args, first);
|
|
for (size_t i = 1; i < count; ++i)
|
|
{
|
|
MIDI::byte b = va_arg (var_args, int);
|
|
push_back (b);
|
|
}
|
|
va_end (var_args);
|
|
}
|
|
|
|
|
|
void MidiByteArray::copy (size_t count, MIDI::byte * arr)
|
|
{
|
|
for (size_t i = 0; i < count; ++i) {
|
|
push_back (arr[i]);
|
|
}
|
|
}
|
|
|
|
MidiByteArray & operator << (MidiByteArray & mba, const MIDI::byte & b)
|
|
{
|
|
mba.push_back (b);
|
|
return mba;
|
|
}
|
|
|
|
MidiByteArray & operator << (MidiByteArray & mba, const MidiByteArray & barr)
|
|
{
|
|
std::back_insert_iterator<MidiByteArray> bit (mba);
|
|
copy (barr.begin(), barr.end(), bit);
|
|
return mba;
|
|
}
|
|
|
|
std::ostream & operator << (std::ostream & os, const MidiByteArray & mba)
|
|
{
|
|
os << "[";
|
|
char fill = os.fill('0');
|
|
for (MidiByteArray::const_iterator it = mba.begin(); it != mba.end(); ++it) {
|
|
if (it != mba.begin()) os << " ";
|
|
os << std::hex << std::setw(2) << (int)*it;
|
|
}
|
|
os.fill (fill);
|
|
os << std::dec;
|
|
os << "]";
|
|
return os;
|
|
}
|
|
|
|
MidiByteArray & operator << (MidiByteArray & mba, const std::string & st)
|
|
{
|
|
/* note that this assumes that "st" is ASCII encoded
|
|
*/
|
|
|
|
mba.insert (mba.end(), st.begin(), st.end());
|
|
return mba;
|
|
}
|
|
|
|
bool
|
|
MidiByteArray::compare_n (const MidiByteArray& other, MidiByteArray::size_type n) const
|
|
{
|
|
MidiByteArray::const_iterator us = begin();
|
|
MidiByteArray::const_iterator them = other.begin();
|
|
|
|
while (n && us != end() && them != other.end()) {
|
|
if ((*us) != (*them)) {
|
|
return false;
|
|
}
|
|
--n;
|
|
++us;
|
|
++them;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|