Flatten ingen source directory heirarchy a bit.

git-svn-id: http://svn.drobilla.net/lad/trunk/ingen@1551 a436a847-0d15-0410-975c-d299462d15a1

1 files changed, 0 insertions, 108 deletions

diff --git a/src/libs/shared/Store.cpp b/src/libs/shared/Store.cpp
deleted file mode 100644
index 9f0f3624..00000000
--- a/src/libs/shared/Store.cpp
+++ /dev/null
@@ -1,108 +0,0 @@
-/* This file is part of Ingen.
- * Copyright (C) 2008 Dave Robillard <http://drobilla.net>
- * 
- * Ingen is free software; you can redistribute it and/or modify it under the
- * terms of the GNU General Public License as published by the Free Software
- * Foundation; either version 2 of the License, or (at your option) 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 General Public License for details.
- * 
- * 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.,
- * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
- */
-
-#include <raul/PathTable.hpp>
-#include <raul/TableImpl.hpp>
-#include "common/interface/Node.hpp"
-#include "common/interface/Port.hpp"
-#include "Store.hpp"
-
-using namespace std;
-using namespace Raul;
-
-namespace Ingen {
-namespace Shared {
-
-
-void
-Store::add(GraphObject* o)
-{
-	if (find(o->path()) != end()) {
-		cerr << "[Store] ERROR: Attempt to add duplicate object " << o->path() << endl;
-		return;
-	}
-
-	insert(make_pair(o->path(), o));
-
-	Node* node = dynamic_cast<Node*>(o);
-	if (node) {
-		for (uint32_t i=0; i < node->num_ports(); ++i) {
-			add(node->port(i));
-		}
-	}
-}
-
-
-Store::const_iterator
-Store::children_begin(SharedPtr<Shared::GraphObject> o) const
-{
-	const_iterator parent = find(o->path());
-	assert(parent != end());
-	++parent;
-	return parent;
-}
-
-
-Store::const_iterator
-Store::children_end(SharedPtr<Shared::GraphObject> o) const
-{
-	const_iterator parent = find(o->path());
-	assert(parent != end());
-	return find_descendants_end(parent);
-}
-
-
-SharedPtr<Shared::GraphObject>
-Store::find_child(SharedPtr<Shared::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<Shared::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 Shared
-} // namespace Ingen