2 Copyright (C) 2009 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_mapping_h__
21 #define __ardour_chan_mapping_h__
28 #include "ardour/data_type.h"
33 /** A mapping from one set of channels to another
34 * (e.g. how to 'connect' two BufferSets).
39 ChanMapping(ChanCount identity) {
40 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
41 for (size_t i = 0; i <= identity.get(*t); ++i)
46 uint32_t get(DataType t, uint32_t from) {
47 Mappings::iterator tm = _mappings.find(t);
48 assert(tm != _mappings.end());
49 TypeMapping::iterator m = tm->second.find(from);
50 assert(m != tm->second.end());
54 void set(DataType t, uint32_t from, uint32_t to) {
55 Mappings::iterator tm = _mappings.find(t);
56 if (tm == _mappings.end()) {
57 tm = _mappings.insert(std::make_pair(t, TypeMapping())).first;
59 tm->second.insert(std::make_pair(from, to));
62 /** Increase the 'to' field of every mapping for type @a t by @a delta */
63 void offset(DataType t, uint32_t delta) {
64 Mappings::iterator tm = _mappings.find(t);
65 if (tm != _mappings.end()) {
66 for (TypeMapping::iterator m = tm->second.begin(); m != tm->second.end(); ++m) {
73 typedef std::map<uint32_t, uint32_t> TypeMapping;
74 typedef std::map<DataType, TypeMapping> Mappings;
81 #endif // __ardour_chan_mapping_h__