summaryrefslogtreecommitdiffstats
path: root/src/Store.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/Store.cpp')
-rw-r--r--src/Store.cpp98
1 files changed, 98 insertions, 0 deletions
diff --git a/src/Store.cpp b/src/Store.cpp
new file mode 100644
index 00000000..7036312b
--- /dev/null
+++ b/src/Store.cpp
@@ -0,0 +1,98 @@
+/*
+ This file is part of Ingen.
+ Copyright 2007-2012 David Robillard <http://drobilla.net/>
+
+ Ingen is free software: you can redistribute it and/or modify it under the
+ terms of the GNU Affero General Public License as published by the Free
+ Software Foundation, either version 3 of the License, or any later version.
+
+ Ingen is distributed in the hope that it will be useful, but WITHOUT ANY
+ WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
+ A PARTICULAR PURPOSE. See the GNU Affero General Public License for details.
+
+ You should have received a copy of the GNU Affero General Public License
+ along with Ingen. If not, see <http://www.gnu.org/licenses/>.
+*/
+
+#include <sstream>
+#include <string>
+
+#include "ingen/Store.hpp"
+#include "raul/PathTable.hpp"
+#include "raul/TableImpl.hpp"
+#include "raul/log.hpp"
+
+using namespace std;
+
+namespace Ingen {
+
+void
+Store::add(GraphObject* o)
+{
+ if (find(o->path()) != end()) {
+ Raul::error << "[Store] Attempt to add duplicate object " << o->path() << endl;
+ return;
+ }
+
+ insert(make_pair(o->path(), o));
+
+ for (uint32_t i = 0; i < o->num_ports(); ++i) {
+ add(o->port(i));
+ }
+}
+
+Store::const_iterator
+Store::children_begin(SharedPtr<const GraphObject> o) const
+{
+ const_iterator parent = find(o->path());
+ assert(parent != end());
+ ++parent;
+ return parent;
+}
+
+Store::const_iterator
+Store::children_end(SharedPtr<const GraphObject> o) const
+{
+ const_iterator parent = find(o->path());
+ assert(parent != end());
+ return find_descendants_end(parent);
+}
+
+SharedPtr<GraphObject>
+Store::find_child(SharedPtr<const GraphObject> parent,
+ const string& child_name) const
+{
+ const_iterator pi = find(parent->path());
+ assert(pi != end());
+ const_iterator children_end = find_descendants_end(pi);
+ const_iterator child = find(pi, children_end, parent->path().base() + child_name);
+ if (child != end())
+ return child->second;
+ else
+ return SharedPtr<GraphObject>();
+}
+
+unsigned
+Store::child_name_offset(const Raul::Path& parent,
+ const Raul::Symbol& symbol,
+ bool allow_zero)
+{
+ unsigned offset = 0;
+
+ while (true) {
+ std::stringstream ss;
+ ss << symbol;
+ if (offset > 0)
+ ss << "_" << offset;
+ if (find(parent.base() + ss.str()) == end() && (allow_zero || offset > 0))
+ break;
+ else if (offset == 0)
+ offset = 2;
+ else
+ ++offset;
+ }
+
+ return offset;
+}
+
+} // namespace Ingen