main.cpp

#define __CRTDBG_MAP_ALLOC
#include <crtdbg.h>
#define DEBUG_NEW new(_NORMAL_BLOCK, __FILE__, __LINE__)
#define new DEBUG_NEW

#include "fnrtree.hpp"

#include <iostream>
#include <iomanip>
#include <map>
#include <fstream>
#include <string>
#include <sstream>
#include <chrono>

void readNodes(const char* filename, std::map<long, std::pair<int, int> >* m) 
{
	std::ifstream infile(filename);
	if (!infile.is_open())
	{
		std::cout << "not open file: " << filename << std::endl;
	}
	std::string line{};
	while (std::getline(infile, line)) 
	{
		std::istringstream iss(line);
		long id; int x, y;
		if (!(iss >> id >> x >> y)) break;
		m->insert(std::make_pair(id, std::make_pair(x, y)));
		//std::cout << "id node: " << id << ", x: " << x << ", y: " << y << std::endl;
	}
}

void readEdges(const char* filename, std::map<long, std::pair<int, int> >* nodes, FNR_tree<long>* tree)
{
	std::ifstream infile(filename);
	if (!infile.is_open())
	{
		std::cout << "not open file: " << filename << std::endl;
	}
	std::string line;
	while (std::getline(infile, line)) 
	{
		std::istringstream iss(line);
		long id, A, B; 
		std::string name;
		if (!(iss >> id >> A >> B >> name)) break;


		std::pair<int, int> Acoord, Bcoord;
		Acoord = nodes->find(A)->second;
		Bcoord = nodes->find(B)->second;
		tree->insert_line(Acoord.first, Acoord.second, Bcoord.first, Bcoord.second, name);
	}
}

void readTrajectories(const char* filename, FNR_tree<long>* tree)
{
	std::map<long, std::pair<double, std::pair<int, int>>> Objects; // id -> (time, (x,y) )

	std::ifstream infile(filename);
	if (!infile.is_open())
	{
		std::cout << "not open file: " << filename << std::endl;
	}
	std::string line;

	while (std::getline(infile, line)) 
	{
		std::istringstream iss(line);
		char cls; long id; double time;
		int currX, currY;
		/*int cID, nextX, nextY; double speed;*/
		if (!(iss >> cls >> id >> time >> currX >> currY)) 
			break;
		/*if (!(iss >> cls >> id >> cID >>
			time >> currX >> currY >>
			speed >> nextX >> nextY)) break;*/

		if (cls == '0') /*начальные данные*/
		{
			Objects[id] = std::make_pair(time, std::make_pair(currX, currY));
		}
		else 
		{
			std::pair<double, std::pair<int, int> > lastPos = Objects[id];
			double t0 = lastPos.first;
			int x0 = lastPos.second.first;
			int y0 = lastPos.second.second;
			tree->insert_trip_segment(id, x0, y0, currX, currY, t0, time);
			Objects[id] = std::make_pair(time, std::make_pair(currX, currY));

		}
	}
}

void readQueries(const char* inFilename, const char* outFilename, FNR_tree<long>* tree)
{
	std::set<long>* resArray = new std::set<long>;
	std::ifstream infile(inFilename);
	if (!infile.is_open())
	{
		std::cout << "not open file: " << inFilename << std::endl;
	}
	std::ofstream outfile(outFilename);
	if (!outfile.is_open())
	{
		std::cout << "not open file: " << outFilename << std::endl;
	}
	std::string line;
	int cont = 1;

	std::chrono::microseconds duration(0);

	while (std::getline(infile, line)) 
	{
		std::istringstream iss(line);
		int x1, y1, x2, y2;
		double t1, t2;
		if (!(iss >> x1 >> y1 >> x2 >> y2 >> t1 >> t2)) break;

		std::chrono::high_resolution_clock::time_point start = std::chrono::high_resolution_clock::now();
		tree->search(x1, y1, x2, y2, t1, t2, resArray);
		std::chrono::high_resolution_clock::time_point end = std::chrono::high_resolution_clock::now();

		duration += std::chrono::duration_cast<std::chrono::microseconds>(end - start);

		outfile << "Test #" << cont++ << std::endl;
		for (auto it = resArray->begin(); it != resArray->end(); ++it) 
		{
			outfile << *it << " ";
		}
		outfile << std::endl << std::endl;
	}

	std::cout << "   > Queries time  \t= " << std::right << std::setw(10);
	std::cout << duration.count();
	std::cout << " microseconds" << std::endl;
	outfile.close();
	delete resArray;
}

int main(int argc, char* argv[])
{
	system("chcp 65001>nul");

	{
		if (argc != 6)
		{
			std::cout << "Usage: ./fnr-tree.exe [nodesFile] [edgesFile] [trajectoriesFile] [queriesFile] [outFile]" << std::endl;
			return 1;
		}

		const char* nodesFile = argv[1];
		const char* edgesFile = argv[2];
		const char* trajectoriesFile = argv[3];
		const char* queriesFile = argv[4];
		const char* outFile = argv[5];

		FNR_tree<long> kk;

		auto Nodes = new std::map<long, std::pair<int, int> >();
		auto start = std::chrono::high_resolution_clock::now();
		std::cout << "Start read nodes" << std::endl;
		readNodes(nodesFile, Nodes);
		std::cout << "Start read edges" << std::endl;
		readEdges(edgesFile, Nodes, &kk);

		//kk.print();

		auto start2 = std::chrono::high_resolution_clock::now();
		std::cout << "Start read trajectories" << std::endl;
		readTrajectories(trajectoriesFile, &kk);

		kk.print();

		auto end = std::chrono::high_resolution_clock::now();

		std::cout << "> FNR-Tree indicators:" << std::endl;
		std::cout << "   > MEMORY USAGE  \t= " << std::right << std::setw(10);
		std::cout << kk.size() << " Bytes" << std::endl;
		std::cout << "   > Building time \t= " << std::right << std::setw(10);
		std::cout << std::chrono::duration_cast<std::chrono::microseconds>(end - start).count();
		std::cout << " microseconds" << std::endl;

		std::cout << "   > Add traj. time \t= " << std::right << std::setw(10);
		std::cout << std::chrono::duration_cast<std::chrono::microseconds>(end - start2).count();
		std::cout << " microseconds" << std::endl;

		std::cout << "Start read queries" << std::endl;
		readQueries(queriesFile, outFile, &kk);

		delete Nodes;
	}


	_CrtDumpMemoryLeaks(); /*показывает утечки памяти, если они есть*/
	return 0;
}