/** \file
 * \brief TLP format parser utility declaration.
 *
 * \author Łukasz Hanuszczak
 *
 * \par License:
 * This file is part of the Open Graph Drawing Framework (OGDF).
 *
 * \par
 * Copyright (C)<br>
 * See README.md in the OGDF root directory for details.
 *
 * \par
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * Version 2 or 3 as published by the Free Software Foundation;
 * see the file LICENSE.txt included in the packaging of this file
 * for details.
 *
 * \par
 * This program 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.
 *
 * \par
 * You should have received a copy of the GNU General Public
 * License along with this program; if not, see
 * http://www.gnu.org/copyleft/gpl.html
 */

#pragma once

#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphAttributes.h>
#include <ogdf/cluster/ClusterGraph.h>
#include <ogdf/cluster/ClusterGraphAttributes.h>
#include <ogdf/fileformats/Tlp.h>
#include <ogdf/fileformats/TlpLexer.h>

#include <iostream>
#include <map>
#include <sstream>
#include <string>

namespace ogdf {

namespace tlp {


class Parser {
private:
	using Iterator = std::vector<Token>::const_iterator;
	std::map<int, node> m_idNode;
	std::map<int, edge> m_idEdge;

	std::istream& m_istream;
	Iterator m_begin, m_end;

	bool readEdge(Graph& G);
	bool readNodes(Graph& G, ClusterGraph* C, cluster c);
	bool readCluster(Graph& G, ClusterGraph* C, cluster c);
	bool readProperty(Graph& G, GraphAttributes* GA);

	bool readClusterStatement(Graph& G, ClusterGraph* C, cluster c);
	bool readStatement(Graph& G, GraphAttributes* GA, ClusterGraph* C);
	bool readPropertyStatement(GraphAttributes* GA, const Attribute& attr, NodeArray<bool>& nodeDone,
			std::string& nodeDefault, EdgeArray<bool>& edgeDone, std::string& edgeDefault);

	bool readGraph(Graph& G, GraphAttributes* GA, ClusterGraph* C);

	inline bool applyNodes(Graph& G, ClusterGraph* C, cluster c, const std::string& str);
	inline void tokenError(const char* str, bool got = true);
	inline void tokenError(const std::string& str, bool got = true);

public:
	explicit Parser(std::istream& is);

	bool read(Graph& G) { return readGraph(G, nullptr, nullptr); }

	bool read(Graph& G, GraphAttributes& GA) { return readGraph(G, &GA, nullptr); }

	bool read(Graph& G, ClusterGraph& C) { return readGraph(G, nullptr, &C); }

	bool read(Graph& G, ClusterGraph& C, ClusterGraphAttributes& CA) {
		return readGraph(G, &CA, &C);
	}
};

}
}
