2 Copyright (C) 2006 Paul Davis
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 #ifndef __ardour_chan_count_h__
21 #define __ardour_chan_count_h__
26 #include "ardour/data_type.h"
31 /** A count of channels, possibly with many types.
33 * Operators are defined so this may safely be used as if it were a simple
34 * (single-typed) integer count of channels.
38 ChanCount() { reset(); }
40 // Convenience constructor for making single-typed streams (stereo, mono, etc)
41 ChanCount(DataType type, uint32_t channels) {
47 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
52 void set(DataType t, uint32_t count) { assert(t != DataType::NIL); _counts[t] = count; }
53 uint32_t get(DataType t) const { assert(t != DataType::NIL); return _counts[t]; }
55 inline uint32_t n_audio() const { return _counts[DataType::AUDIO]; }
56 inline void set_audio(uint32_t a) { _counts[DataType::AUDIO] = a; }
58 inline uint32_t n_midi() const { return _counts[DataType::MIDI]; }
59 inline void set_midi(uint32_t m) { _counts[DataType::MIDI] = m; }
61 uint32_t n_total() const {
63 for (uint32_t i=0; i < DataType::num_types; ++i)
69 bool operator==(const ChanCount& other) const {
70 for (uint32_t i=0; i < DataType::num_types; ++i)
71 if (_counts[i] != other._counts[i])
77 bool operator!=(const ChanCount& other) const {
78 return ! (*this == other);
81 bool operator<(const ChanCount& other) const {
82 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
83 if (_counts[*t] > other._counts[*t]) {
87 return (*this != other);
90 bool operator<=(const ChanCount& other) const {
91 return ( (*this < other) || (*this == other) );
94 bool operator>(const ChanCount& other) const {
95 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
96 if (_counts[*t] < other._counts[*t]) {
100 return (*this != other);
103 bool operator>=(const ChanCount& other) const {
104 return ( (*this > other) || (*this == other) );
107 static ChanCount max(const ChanCount& a, const ChanCount& b) {
109 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
110 ret.set(*t, std::max(a.get(*t), b.get(*t)));
115 static const ChanCount INFINITE;
116 static const ChanCount ZERO;
119 uint32_t _counts[DataType::num_types];
122 } // namespace ARDOUR
124 std::ostream& operator<<(std::ostream& o, const ARDOUR::ChanCount& c);
126 #endif // __ardour_chan_count_h__