#pragma once

#include <climits>
#include "array.h"
#include "person.h"

enum Relation : U8
{
	Invalid = 0,
	Parent,
	Child,
	Sibling,
	HalfSibling,
	Spouse,
	ExSpouse
};

const U32 Nobody = UINT_MAX; //Òîçè íîìåð ùå áúäå çàïàçeí çà ëèïñà íà âðúçêà/÷îâåê

class Tree
{
public:
	using person_id = U32;

	Tree() = default;
	template <class Str>
	Tree(Str&& Name) : treeName(std::forward<Str>(Name)) {}
	/*Tree(const Tree&);
	Tree& operator= (const Tree& other);*/

	Tree operator+ (const Tree& other);
	Tree operator- (const Tree& other);
	Tree& operator+= (const Tree& other);
	Tree& operator-= (const Tree& other);

	void rename(const char* newName);

	unsigned findId(const char*, const short year=0, const unsigned char month=0, const unsigned char day=0)const;
	unsigned findOldestAncestor(const unsigned &id, const bool &sex = 0)const;//
	unsigned findCommonAncestor(const unsigned firstId, const unsigned secondId)const; //oldest common ancestor ID

	void saveTree()const;//
	bool loadTree();

	void addPerson(const char* name, bool isMale, unsigned father=Nobody, unsigned mother=Nobody, EventTime birth={}, EventTime death={});
	bool addRelation(const char* firstName, const Relation, const char* secondName);   //Adds a new relation or edits an old one. 0 - failure 1 - success
	bool addRelation(const unsigned firstId, const Relation, const unsigned secondId, bool opposite=0);   //0 - failure 1 - success

	void removePerson(const unsigned id);   //Removes a member and the last one takes his ID
	void removePerson(const char*, const short year = 0, const unsigned char month = 0, const unsigned char day = 0);
	void removeRelation(const unsigned firstId, const unsigned secondId);
	void removeRelation(const char* firstName, const char* secondName);

	void draw() const;

	void print()const;
	void printRel(const unsigned id)const; //Prints out close relatives
	void printMember(const unsigned id)const;
	void printOldestAncestors(const unsigned id)const;//

private:
	void commonAncestorRec(const unsigned &id, const Array<char> &visited)const;
	/* draw a line of people starting from person with id
	  return the farthest X that will be drawn */
	I16 drawLineRec(person_id id, I16 drawY, I16 drawX) const;

	std::string treeName = "Unnamed";
	unsigned numPeople = 0;
	Array<Person> people;  //The data for each member
	Array<Array<unsigned>> relatives;   //The relatives of each member
	Array<Array<Relation>> relations;   //The type of relation each member has with his relatives

	U16 offset = 0;

	//Search, ect.
};