hal2012-database2012.h

/*
 * hal2012-database2012.h
 *
 *  Created on: 07.06.2012
 *      Author: tobias
 */

#ifndef HAL2012_DATABASE2012_H_
#define HAL2012_DATABASE2012_H_

#include "hal2012-util2012.h"
#include "hal2012-xml2012.h"
#include "hal2012-tagger2012.h"
#include "hal2012-filterfacts2012.h"
#include "hal2012-serialization.h"

namespace grammar2012 {

// this resolves the chicken or egg causality dilemma between
// hal2012-xml2012.h and hal2012-database2012.h because both include both
class xml_fact;

template<typename DB>
class database : public freehal_base {
private:
	tagger* t;

	// IO variables
	typedef boost::unordered_map<string, uintmax_t> filesmap;
	filesmap files;

	// I/O
	int resume();
	int suspend();
	int read_xml_fact_file(const fs::path, DB*);

public:
	// constructor, destructor
	database();
	~database();

	// I/O
	int prepare(const fs::path&);
	int prepare(const fs::path&, const fs::path&);
	int find_by_word(vector<boost::shared_ptr<xml_fact> >&, const word&);
	int find_by_words(vector<boost::shared_ptr<xml_fact> >&,
			const vector<word>&);
	int find_by_fact(vector<boost::shared_ptr<xml_fact> >&,
			boost::shared_ptr<xml_fact>);
	int get_synonyms(vector<word>&, const word& w);

	// XML
	boost::shared_ptr<xml_obj> insert_synonyms(boost::shared_ptr<xml_obj>);

	// environment variables
	void set_lang(const string&);
	void set_path(const fs::path& _path);
	bool is_configured() const;
	void set_tagger(tagger*);
	tagger* get_tagger() const;

	// cache algorithm
	template<typename T1, typename T2>
	const fs::path disk_find_file(const string, T1, T1, T1, T1, T2);
	template<typename M>
	int disk_read_file(const fs::path&, M&);
	template<typename M>
	int disk_write_file(const fs::path&, const M&);

private:
	// serialization
	friend class boost::serialization::access;
	template<class Archive>
	void serialize(Archive & ar, const unsigned int version) {
	}
};

}

#include "hal2012-database2012.hpp"

#endif /* HAL2012_DATABASE2012_H_ */