/*
    open source routing machine
    Copyright (C) Dennis Luxen, others 2010

This program is free software; you can redistribute it and/or modify
it under the terms of the GNU AFFERO General Public License as published by
the Free Software Foundation; either version 3 of the License, or
any later version.

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.

You should have received a copy of the GNU Affero General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
or see http://www.gnu.org/licenses/agpl.txt.
 */

#ifndef ROUTEPLUGIN_H_
#define ROUTEPLUGIN_H_

#include <fstream>
#include <sstream>
#include <string>
#include <vector>

#include "BasePlugin.h"
#include "../DataStructures/StaticGraph.h"
#include "../DataStructures/SearchEngine.h"

#include "../Util/GraphLoader.h"
#include "../Util/StrIngUtil.h"

typedef ContractionCleanup::Edge::EdgeData EdgeData;
typedef StaticGraph<EdgeData>::InputEdge InputEdge;

template <class DescriptorT>
class RoutePlugin : public BasePlugin {
public:
    RoutePlugin(std::string hsgrPath, std::string ramIndexPath, std::string fileIndexPath, std::string nodesPath, std::string namesPath) {
        //Init nearest neighbor data structure
        nodeHelpDesk = new NodeInformationHelpDesk(ramIndexPath.c_str(), fileIndexPath.c_str());
        ifstream nodesInStream(nodesPath.c_str(), ios::binary);
        ifstream hsgrInStream(hsgrPath.c_str(), ios::binary);
        nodeHelpDesk->initNNGrid(nodesInStream);

        //Deserialize road network graph
        std::vector< InputEdge> * edgeList = new std::vector< InputEdge>();
        readHSGRFromStream(hsgrInStream, edgeList);
        hsgrInStream.close();
        graph = new StaticGraph<EdgeData>(nodeHelpDesk->getNumberOfNodes()-1, *edgeList);
        delete edgeList;

        //deserialize street name list
        ifstream namesInStream(namesPath.c_str(), ios::binary);
        unsigned size = 0;
        namesInStream.read((char *)&size, sizeof(unsigned));
        names = new std::vector<std::string>();

        for(unsigned i = 0; i < size; i++) {
            unsigned sizeOfString = 0;
            namesInStream.read((char *)&sizeOfString, sizeof(unsigned));
            char * buf = new char[1024];
            namesInStream.read(buf, sizeOfString);
            std::string currentStreetName(buf);
            names->push_back(currentStreetName);
            delete[] buf;
        }

        //init complete search engine
        sEngine = new SearchEngine<EdgeData, StaticGraph<EdgeData> >(graph, nodeHelpDesk, names);
        descriptor = new DescriptorT();
    }
    ~RoutePlugin() {
        delete names;
        delete sEngine;
        delete graph;
        delete nodeHelpDesk;
        delete descriptor;
    }
    std::string GetDescriptor() { return std::string("route"); }
    std::string GetVersionString() { return std::string("0.3 (DL)"); }
    void HandleRequest(std::vector<std::string> parameters, http::Reply& reply) {
        //check number of parameters
        if(parameters.size() != 4) {
            reply = http::Reply::stockReply(http::Reply::badRequest);
            return;
        }

        int lat1 = static_cast<int>(100000.*atof(parameters[0].c_str()));
        int lon1 = static_cast<int>(100000.*atof(parameters[1].c_str()));
        int lat2 = static_cast<int>(100000.*atof(parameters[2].c_str()));
        int lon2 = static_cast<int>(100000.*atof(parameters[3].c_str()));

        if(lat1>90*100000 || lat1 <-90*100000 || lon1>180*100000 || lon1 <-180*100000) {
            reply = http::Reply::stockReply(http::Reply::badRequest);
            return;
        }

        if(lat2>90*100000 || lat2 <-90*100000 || lon2>180*100000 || lon2 <-180*100000) {
            reply = http::Reply::stockReply(http::Reply::badRequest);
            return;
        }

        _Coordinate startCoord(lat1, lon1);
        _Coordinate targetCoord(lat2, lon2);

        vector< _PathData > * path = new vector< _PathData >();
        PhantomNodes * phantomNodes = new PhantomNodes();
        sEngine->FindRoutingStarts(startCoord, targetCoord, phantomNodes);
        unsigned int distance = sEngine->ComputeRoute(phantomNodes, path, startCoord, targetCoord);
        reply.status = http::Reply::ok;
        descriptor->Run(reply, path, phantomNodes, sEngine, distance);

        delete path;
        delete phantomNodes;
        return;
    }
private:
    NodeInformationHelpDesk * nodeHelpDesk;
    SearchEngine<EdgeData, StaticGraph<EdgeData> > * sEngine;
    std::vector<std::string> * names;
    StaticGraph<EdgeData> * graph;
    DescriptorT * descriptor;
};


#endif /* ROUTEPLUGIN_H_ */