X-Git-Url: https://main.carlh.net/gitweb/?a=blobdiff_plain;f=libs%2Fardour%2Fardour%2Fchan_count.h;h=b24ff2336c42a44c4c4b09ba1e4d5c9aedd046f4;hb=e5c607123588b318f28022488d74790fc1b7bebe;hp=35052e4aea27aad41fcb8b4a968d1af08e739d04;hpb=9a4a9cbb63958484553ed981822ca97ceb1dc4f5;p=ardour.git

diff --git a/libs/ardour/ardour/chan_count.h b/libs/ardour/ardour/chan_count.h
index 35052e4aea..b24ff2336c 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: Dave 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,106 +15,140 @@
     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 <ardour/data_type.h>
+#include <cassert>
+#include <ostream>
+
+#include "pbd/xml++.h"
+#include "ardour/data_type.h"
 
 namespace ARDOUR {
 
 
+/** 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 ChanCount {
 public:
+	ChanCount(const XMLNode& node);
 	ChanCount() { reset(); }
-	
+
 	// Convenience constructor for making single-typed streams (stereo, mono, etc)
-	ChanCount(DataType type, size_t channels)
-	{
+	ChanCount(DataType type, uint32_t channels) {
 		reset();
 		set(type, channels);
 	}
 
-	void reset()
-	{
+	void reset() {
 		for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
-			_counts[(*t).to_index()] = 0;
+			_counts[*t] = 0;
 		}
 	}
-	
-	// -1 is what to_index does.  inlined for speed.  this should maybe be changed..
-	inline size_t n_audio() const { return _counts[DataType::AUDIO-1]; }
-	inline size_t n_midi()  const { return _counts[DataType::MIDI-1]; }
-
-	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)
+
+	void     set(DataType t, uint32_t count) { assert(t != DataType::NIL); _counts[t] = count; }
+	uint32_t get(DataType t) const { assert(t != DataType::NIL); return _counts[t]; }
+
+	inline uint32_t n_audio() const { return _counts[DataType::AUDIO]; }
+	inline void set_audio(uint32_t a) { _counts[DataType::AUDIO] = a; }
+
+	inline uint32_t n_midi()  const { return _counts[DataType::MIDI]; }
+	inline void set_midi(uint32_t m) { _counts[DataType::MIDI] = m; }
+
+	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 (*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
-	{
+
+	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 (*this != other);
 	}
 
-	bool operator>=(const ChanCount& other) const
-	{
+	bool operator>=(const ChanCount& other) const {
 		return ( (*this > other) || (*this == other) );
 	}
 
+	ChanCount operator+(const ChanCount& other) const {
+		ChanCount ret;
+		for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
+			ret.set(*t, get(*t) + other.get(*t));
+		}
+		return ret;
+	}
+
+	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
 
+std::ostream& operator<<(std::ostream& o, const ARDOUR::ChanCount& c);
+
 #endif // __ardour_chan_count_h__