2 Copyright (C) 2006 Paul Davis
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
18 $Id: insert.cc 712 2006-07-28 01:08:57Z drobilla $
21 #ifndef __ardour_chan_count_h__
22 #define __ardour_chan_count_h__
24 #include <ardour/data_type.h>
31 ChanCount() { reset(); }
33 // Convenience constructor for making single-typed streams (stereo, mono, etc)
34 ChanCount(DataType type, size_t channels)
42 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
43 _counts[(*t).to_index()] = 0;
47 // -1 is what to_index does. inlined for speed. this should maybe be changed..
48 inline size_t n_audio() const { return _counts[DataType::AUDIO-1]; }
49 inline size_t n_midi() const { return _counts[DataType::MIDI-1]; }
50 inline void set_audio(size_t a) { _counts[DataType::AUDIO-1] = a; }
51 inline void set_midi(size_t m) { _counts[DataType::MIDI-1] = m; }
53 size_t n_total() const
56 for (size_t i=0; i < DataType::num_types; ++i)
62 void set(DataType type, size_t count) { _counts[type.to_index()] = count; }
63 size_t get(DataType type) const { return _counts[type.to_index()]; }
65 bool operator==(const ChanCount& other) const
67 for (size_t i=0; i < DataType::num_types; ++i)
68 if (_counts[i] != other._counts[i])
74 bool operator!=(const ChanCount& other) const
76 return ! (*this == other);
79 bool operator<(const ChanCount& other) const
81 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
82 if (_counts[(*t).to_index()] > other._counts[(*t).to_index()]) {
86 return (*this != other);
89 bool operator<=(const ChanCount& other) const
91 return ( (*this < other) || (*this == other) );
94 bool operator>(const ChanCount& other) const
96 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
97 if (_counts[(*t).to_index()] < other._counts[(*t).to_index()]) {
101 return (*this != other);
104 bool operator>=(const ChanCount& other) const
106 return ( (*this > other) || (*this == other) );
109 static const ChanCount INFINITE;
110 static const ChanCount ZERO;
114 size_t _counts[DataType::num_types];
118 } // namespace ARDOUR
120 #endif // __ardour_chan_count_h__