/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set et sw=2 ts=2: */
/***************************************************************************
 *            nodemanager.h
 *
 *  Fri Feb 24 08:16:29 CET 2012
 *  Copyright 2012 Bent Bisballe Nyeng & Jonas Suhr Christensen
 *  deva@aasimon.org & jsc@umbraculum.org
 ****************************************************************************/

/*
 *  This file is part of Munia.
 *
 *  Munia 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.
 *
 *  Munia 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 more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with Munia; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA.
 */
#pragma once

#include <string>
#include <utility>

#include "node.h"
#include "nodetree.h"

typedef std::pair<NodeIdList, NodeIdList> NodeIdListPair;

class NodeManager
{
public:
	NodeManager();
	~NodeManager();

	void init(const std::string& filename);

	NodeIdList createNode(nodeid_t parentid, nodeid_t id,
	                      nodeid_t insertbeforeid);

	NodeIdList updateNode(nodeid_t id, const std::string& name,
	                      const std::string& value);

	NodeIdList removeNode(nodeid_t id);

	NodeIdListPair moveNode(nodeid_t id, nodeid_t newParent, nodeid_t beforeId);

	NodeIdList subNodes(nodeid_t id);

	node_t node(nodeid_t t);

	nodeid_t createId();

private:
	void flushNodes();
	bool hasId(nodeid_t id);
	bool isProtected(nodeid_t id) const;

	std::string file;
	NodeTree tree;
};

extern NodeManager node_manager;