2 Copyright (C) 2009 Paul Davis
3 Author: David Robillard
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.
19 $Id: insert.cc 712 2006-07-28 01:08:57Z drobilla $
24 #include "ardour/chan_mapping.h"
30 ChanMapping::ChanMapping(ChanCount identity)
32 if (identity == ChanCount::INFINITE) {
36 for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
37 for (size_t i = 0; i < identity.get(*t); ++i) {
44 ChanMapping::get(DataType t, uint32_t from, bool* valid)
46 Mappings::iterator tm = _mappings.find(t);
47 if (tm == _mappings.end()) {
51 TypeMapping::iterator m = tm->second.find(from);
52 if (m == tm->second.end()) {
61 ChanMapping::set(DataType t, uint32_t from, uint32_t to)
63 assert(t != DataType::NIL);
64 Mappings::iterator tm = _mappings.find(t);
65 if (tm == _mappings.end()) {
66 tm = _mappings.insert(std::make_pair(t, TypeMapping())).first;
68 tm->second.insert(std::make_pair(from, to));
71 /** Offset the 'from' field of every mapping for type @a t by @a delta */
73 ChanMapping::offset_from(DataType t, int32_t delta)
75 Mappings::iterator tm = _mappings.find(t);
76 if (tm != _mappings.end()) {
78 for (TypeMapping::iterator m = tm->second.begin(); m != tm->second.end(); ++m) {
79 new_map.insert(make_pair(m->first + delta, m->second));
85 /** Offset the 'to' field of every mapping for type @a t by @a delta */
87 ChanMapping::offset_to(DataType t, int32_t delta)
89 Mappings::iterator tm = _mappings.find(t);
90 if (tm != _mappings.end()) {
91 for (TypeMapping::iterator m = tm->second.begin(); m != tm->second.end(); ++m) {
99 std::ostream& operator<<(std::ostream& o, const ARDOUR::ChanMapping& cm)
101 for (ARDOUR::ChanMapping::Mappings::const_iterator tm = cm.mappings().begin();
102 tm != cm.mappings().end(); ++tm) {
103 o << tm->first.to_string() << endl;
104 for (ARDOUR::ChanMapping::TypeMapping::const_iterator i = tm->second.begin();
105 i != tm->second.end(); ++i) {
106 o << "\t" << i->first << " => " << i->second << endl;