2 Copyright (C) 2006 Paul Davis
4 This program is free software; you can redistribute it and/or modify it
5 under the terms of the GNU General Public License as published by the Free
6 Software Foundation; either version 2 of the License, or (at your option)
9 This program is distributed in the hope that it will be useful, but WITHOUT
10 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 You should have received a copy of the GNU General Public License along
15 with this program; if not, write to the Free Software Foundation, Inc.,
16 675 Mass Ave, Cambridge, MA 02139, USA.
19 #include <glibmm/ustring.h>
21 #include "ardour/port_set.h"
22 #include "ardour/midi_port.h"
23 #include "ardour/audio_port.h"
29 for (size_t i=0; i < DataType::num_types; ++i)
30 _ports.push_back( PortVec() );
33 static bool sort_ports_by_name (Port* a, Port* b)
35 Glib::ustring aname (a->name());
36 Glib::ustring bname (b->name());
38 Glib::ustring::size_type last_digit_position_a = aname.size();
39 Glib::ustring::const_reverse_iterator r_iterator = aname.rbegin();
41 while (r_iterator!= aname.rend() && Glib::Unicode::isdigit(*r_iterator)) {
43 last_digit_position_a--;
46 Glib::ustring::size_type last_digit_position_b = bname.size();
47 r_iterator = bname.rbegin();
49 while (r_iterator != bname.rend() && Glib::Unicode::isdigit(*r_iterator)) {
51 last_digit_position_b--;
54 // if some of the names don't have a number as posfix, compare as strings
56 if (last_digit_position_a == aname.size() or last_digit_position_b == bname.size()) {
60 const std::string prefix_a = aname.substr(0, last_digit_position_a - 1);
61 const unsigned int posfix_a = std::atoi(aname.substr(last_digit_position_a, aname.size() - last_digit_position_a).c_str());
62 const std::string prefix_b = bname.substr(0, last_digit_position_b - 1);
63 const unsigned int posfix_b = std::atoi(bname.substr(last_digit_position_b, bname.size() - last_digit_position_b).c_str());
65 if (prefix_a != prefix_b) {
68 return posfix_a < posfix_b;
73 PortSet::add(Port* port)
75 PortVec& v = _ports[port->type()];
78 sort(v.begin(), v.end(), sort_ports_by_name);
80 _count.set(port->type(), _count.get(port->type()) + 1);
82 assert(_count.get(port->type()) == _ports[port->type()].size());
86 PortSet::remove(Port* port)
88 for (std::vector<PortVec>::iterator l = _ports.begin(); l != _ports.end(); ++l) {
89 PortVec::iterator i = find(l->begin(), l->end(), port);
92 _count.set(port->type(), _count.get(port->type()) - 1);
100 /** Get the total number of ports (of all types) in the PortSet
103 PortSet::num_ports() const
107 for (std::vector<PortVec>::const_iterator l = _ports.begin(); l != _ports.end(); ++l)
114 PortSet::contains(const Port* port) const
116 for (std::vector<PortVec>::const_iterator l = _ports.begin(); l != _ports.end(); ++l)
117 if (find((*l).begin(), (*l).end(), port) != (*l).end())
124 PortSet::port(size_t n) const
126 // This is awesome. Awesomely slow.
128 size_t size_so_far = 0;
130 for (std::vector<PortVec>::const_iterator l = _ports.begin(); l != _ports.end(); ++l) {
131 if (n < size_so_far + (*l).size())
132 return (*l)[n - size_so_far];
134 size_so_far += (*l).size();
137 return NULL; // n out of range
141 PortSet::port(DataType type, size_t n) const
143 if (type == DataType::NIL) {
146 const PortVec& v = _ports[type];
147 assert(n < v.size());
153 PortSet::nth_audio_port(size_t n) const
155 return dynamic_cast<AudioPort*>(port(DataType::AUDIO, n));
159 PortSet::nth_midi_port(size_t n) const
161 return dynamic_cast<MidiPort*>(port(DataType::MIDI, n));