X-Git-Url: https://main.carlh.net/gitweb/?a=blobdiff_plain;f=libs%2Fardour%2Fardour%2Fchan_count.h;h=b5699b6743b34743b0e1a84f849baa4f6a482861;hb=79245a296b73c4ad49bc9b5a204cdda120e1ab90;hp=67ad5406e3baf44afede0809c1fb71db95831249;hpb=cbdf686e391bc2e7b93f37a5d3fa9197cb178078;p=ardour.git diff --git a/libs/ardour/ardour/chan_count.h b/libs/ardour/ardour/chan_count.h index 67ad5406e3..b5699b6743 100644 --- a/libs/ardour/ardour/chan_count.h +++ b/libs/ardour/ardour/chan_count.h @@ -1,5 +1,6 @@ /* - Copyright (C) 2006 Paul Davis + Copyright (C) 2006 Paul Davis + Author: David Robillard 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 @@ -14,112 +15,206 @@ 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., 675 Mass Ave, Cambridge, MA 02139, USA. - - $Id: insert.cc 712 2006-07-28 01:08:57Z drobilla $ */ #ifndef __ardour_chan_count_h__ #define __ardour_chan_count_h__ -#include +#include +#include + +#include "pbd/xml++.h" +#include "ardour/data_type.h" + +#ifdef INFINITE +#undef INFINITE +#endif namespace ARDOUR { -class ChanCount { +/** A count of channels, possibly with many types. + * + * Operators are defined so this may safely be used as if it were a simple + * (single-typed) integer count of channels. + */ +class LIBARDOUR_API ChanCount { public: + ChanCount(const XMLNode& node); ChanCount() { reset(); } - - // Convenience constructor for making single-typed streams (stereo, mono, etc) - ChanCount(DataType type, size_t channels) - { + + /** Convenience constructor for making single-typed streams (mono, stereo, midi, etc) + * @param type data type + * @param count number of channels + */ + ChanCount(DataType type, uint32_t count) { reset(); - set(type, channels); + set(type, count); } - void reset() - { + /** zero count of all data types */ + void reset() { for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) { - _counts[(*t).to_index()] = 0; + _counts[*t] = 0; } } - void set(DataType type, size_t count) { _counts[type.to_index()] = count; } - size_t get(DataType type) const { return _counts[type.to_index()]; } - - size_t get_total() const - { - size_t ret = 0; - for (size_t i=0; i < DataType::num_types; ++i) + /** set channel count for given type + * @param type data type + * @param count number of channels + */ + void set(DataType t, uint32_t count) { assert(t != DataType::NIL); _counts[t] = count; } + /** query channel count for given type + * @param type data type + * @returns channel count for given type + */ + uint32_t get(DataType t) const { assert(t != DataType::NIL); return _counts[t]; } + + inline uint32_t n (DataType t) const { return _counts[t]; } + + /** query number of audio channels + * @returns number of audio channels + */ + inline uint32_t n_audio() const { return _counts[DataType::AUDIO]; } + /** set number of audio channels + * @param a number of audio channels + */ + inline void set_audio(uint32_t a) { _counts[DataType::AUDIO] = a; } + + /** query number of midi channels + * @returns number of midi channels + */ + inline uint32_t n_midi() const { return _counts[DataType::MIDI]; } + /** set number of audio channels + * @param m number of midi channels + */ + inline void set_midi(uint32_t m) { _counts[DataType::MIDI] = m; } + + /** query total channel count of all data types + * @returns total channel count (audio + midi) + */ + uint32_t n_total() const { + uint32_t ret = 0; + for (uint32_t i=0; i < DataType::num_types; ++i) ret += _counts[i]; return ret; } - bool operator==(const ChanCount& other) const - { - for (size_t i=0; i < DataType::num_types; ++i) + bool operator==(const ChanCount& other) const { + for (uint32_t i=0; i < DataType::num_types; ++i) if (_counts[i] != other._counts[i]) return false; return true; } - - bool operator!=(const ChanCount& other) const - { + + bool operator!=(const ChanCount& other) const { return ! (*this == other); } - bool operator<(const ChanCount& other) const - { + bool operator<(const ChanCount& other) const { for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) { - if (_counts[(*t).to_index()] >= other._counts[(*t).to_index()]) { + if (_counts[*t] > other._counts[*t]) { return false; } } - return true; + return (*this != other); } - - bool operator<=(const ChanCount& other) const - { + + bool operator<=(const ChanCount& other) const { + return ( (*this < other) || (*this == other) ); + } + + bool operator>(const ChanCount& other) const { for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) { - if (_counts[(*t).to_index()] > other._counts[(*t).to_index()]) { + if (_counts[*t] < other._counts[*t]) { return false; } } - return true; + return (*this != other); + } + + bool operator>=(const ChanCount& other) const { + return ( (*this > other) || (*this == other) ); } - - bool operator>(const ChanCount& other) const - { + + ChanCount operator+(const ChanCount& other) const { + ChanCount ret; for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) { - if (_counts[(*t).to_index()] <= other._counts[(*t).to_index()]) { - return false; + ret.set(*t, get(*t) + other.get(*t)); + } + return ret; + } + + /** underflow safe subtraction */ + ChanCount operator-(const ChanCount& other) const { + ChanCount ret; + for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) { + if (get(*t) < other.get(*t)) { + ret.set(*t, 0); + } else { + ret.set(*t, get(*t) - other.get(*t)); } } - return true; + return ret; } - - bool operator>=(const ChanCount& other) const - { + + ChanCount operator*(const unsigned int factor) const { + ChanCount ret; for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) { - if (_counts[(*t).to_index()] < other._counts[(*t).to_index()]) { - return false; + ret.set(*t, get(*t) * factor ); + } + return ret; + } + + /** underflow safe subtraction */ + ChanCount& operator-=(const ChanCount& other) { + for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) { + if (_counts[*t] < other._counts[*t]) { + _counts[*t] = 0; + } else { + _counts[*t] -= other._counts[*t]; } } - return true; + return *this; } + ChanCount& operator+=(const ChanCount& other) { + for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) { + _counts[*t] += other._counts[*t]; + } + return *this; + } + + static ChanCount min(const ChanCount& a, const ChanCount& b) { + ChanCount ret; + for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) { + ret.set(*t, std::min(a.get(*t), b.get(*t))); + } + return ret; + } + + static ChanCount max(const ChanCount& a, const ChanCount& b) { + ChanCount ret; + for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) { + ret.set(*t, std::max(a.get(*t), b.get(*t))); + } + return ret; + } + + XMLNode* state(const std::string& name) const; + static const ChanCount INFINITE; static const ChanCount ZERO; private: - - size_t _counts[DataType::num_types]; + uint32_t _counts[DataType::num_types]; }; - } // namespace ARDOUR +LIBARDOUR_API std::ostream& operator<<(std::ostream& o, const ARDOUR::ChanCount& c); + #endif // __ardour_chan_count_h__