/* This file is part of Ingen.
 * Copyright (C) 2007 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 <utility>
#include <vector>
#include <raul/List.hpp>
#include <raul/PathTable.hpp>
#include <raul/TableImpl.hpp>
#include "ObjectStore.hpp"
#include "Patch.hpp"
#include "Node.hpp"
#include "Port.hpp"
#include "ThreadManager.hpp"

using namespace std;
using namespace Raul;

namespace Ingen {


/** Find the Patch at the given path.
 */
Patch*
ObjectStore::find_patch(const Path& path) 
{
	GraphObject* const object = find_object(path);
	return dynamic_cast<Patch*>(object);
}


/** Find the Node at the given path.
 */
Node*
ObjectStore::find_node(const Path& path) 
{
	GraphObject* const object = find_object(path);
	return dynamic_cast<Node*>(object);
}


/** Find the Port at the given path.
 */
Port*
ObjectStore::find_port(const Path& path) 
{
	GraphObject* const object = find_object(path);
	return dynamic_cast<Port*>(object);
}


/** Find the Object at the given path.
 */
GraphObject*
ObjectStore::find_object(const Path& path)
{
	Objects::iterator i = _objects.find(path);
	return ((i == _objects.end()) ? NULL : i->second);
}


/** Add an object to the store. Not realtime safe.
 */
void
ObjectStore::add(GraphObject* o)
{
	assert(ThreadManager::current_thread_id() == THREAD_PRE_PROCESS);

	cerr << "[ObjectStore] Adding " << o->path() << endl;
	_objects.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->ports().at(i));
		}
	}
}


/** Add a family of objects to the store. Not realtime safe.
 */
void
ObjectStore::add(const Table<Path,GraphObject*>& table)
{
	assert(ThreadManager::current_thread_id() == THREAD_PRE_PROCESS);

	//cerr << "[ObjectStore] Adding " << o[0].second->path() << endl;
	_objects.cram(table);
	
	cerr << "[ObjectStore] Adding Table:" << endl;
	for (Table<Path,GraphObject*>::const_iterator i = table.begin(); i != table.end(); ++i) {
		cerr << i->first << " = " << i->second->path() << endl;
	}
}


/** Remove an object from the store.
 *
 * Returned is a vector containing all descendants of the object removed
 * including the object itself, in lexicographically sorted order by Path.
 */
Table<Path,GraphObject*>
ObjectStore::remove(const Path& path)
{
	return remove(_objects.find(path));
}


/** Remove an object from the store.
 *
 * Returned is a vector containing all descendants of the object removed
 * including the object itself, in lexicographically sorted order by Path.
 */
Table<Path,GraphObject*>
ObjectStore::remove(Objects::iterator object)
{
	assert(ThreadManager::current_thread_id() == THREAD_PRE_PROCESS);
	
	if (object != _objects.end()) {
		Objects::iterator descendants_end = _objects.find_descendants_end(object);
		cout << "[ObjectStore] Removing " << object->first << " {" << endl;
		Table<Path,GraphObject*> removed = _objects.yank(object, descendants_end);
		for (Table<Path,GraphObject*>::iterator i = removed.begin(); i != removed.end(); ++i) {
			cout << "\t" << i->first << endl;
		}
		cout << "}" << endl;
	
		return removed;

	} else {
		cerr << "[ObjectStore] WARNING: Removing " << object->first << " failed." << endl;
		return Table<Path,GraphObject*>();
	}
}


} // namespace Ingen