moved files
This commit is contained in:
DennisOSRM
parent
7295811965
commit
8b2be2639e
@ -1,89 +0,0 @@
|
|||||||
/*
|
|
||||||
open source routing machine
|
|
||||||
Copyright (C) Dennis Luxen, 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 BASE_DESCRIPTOR_H_
|
|
||||||
#define BASE_DESCRIPTOR_H_
|
|
||||||
|
|
||||||
#include <cassert>
|
|
||||||
#include <cmath>
|
|
||||||
#include <cstdio>
|
|
||||||
#include <string>
|
|
||||||
#include <vector>
|
|
||||||
|
|
||||||
#include "../typedefs.h"
|
|
||||||
#include "../DataStructures/ExtractorStructs.h"
|
|
||||||
#include "../DataStructures/HashTable.h"
|
|
||||||
#include "../Util/StringUtil.h"
|
|
||||||
|
|
||||||
#include "RawRouteData.h"
|
|
||||||
|
|
||||||
static double areaThresholds[19] = { 5000, 5000, 5000, 5000, 5000, 2500, 2000, 1500, 800, 400, 250, 150, 100, 75, 25, 20, 10, 5, 0 };
|
|
||||||
|
|
||||||
/* Get angle of line segment (A,C)->(C,B), atan2 magic, formerly cosine theorem*/
|
|
||||||
static double GetAngleBetweenTwoEdges(const _Coordinate& A, const _Coordinate& C, const _Coordinate& B) {
|
|
||||||
int v1x = A.lon - C.lon;
|
|
||||||
int v1y = A.lat - C.lat;
|
|
||||||
int v2x = B.lon - C.lon;
|
|
||||||
int v2y = B.lat - C.lat;
|
|
||||||
|
|
||||||
double angle = (atan2((double)v2y,v2x) - atan2((double)v1y,v1x) )*180/M_PI;
|
|
||||||
while(angle < 0)
|
|
||||||
angle += 360;
|
|
||||||
|
|
||||||
return angle;
|
|
||||||
}
|
|
||||||
|
|
||||||
struct _RouteSummary {
|
|
||||||
std::string lengthString;
|
|
||||||
std::string durationString;
|
|
||||||
std::string startName;
|
|
||||||
std::string destName;
|
|
||||||
_RouteSummary() : lengthString("0"), durationString("0"), startName("unknown street"), destName("unknown street") {}
|
|
||||||
void BuildDurationAndLengthStrings(double distance, unsigned time) {
|
|
||||||
//compute distance/duration for route summary
|
|
||||||
std::ostringstream s;
|
|
||||||
s << 10*(round(distance/10.));
|
|
||||||
lengthString = s.str();
|
|
||||||
int travelTime = time/10 + 1;
|
|
||||||
s.str("");
|
|
||||||
s << travelTime;
|
|
||||||
durationString = s.str();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
struct _DescriptorConfig {
|
|
||||||
_DescriptorConfig() : instructions(true), geometry(true), encodeGeometry(false), z(18) {}
|
|
||||||
bool instructions;
|
|
||||||
bool geometry;
|
|
||||||
bool encodeGeometry;
|
|
||||||
unsigned short z;
|
|
||||||
};
|
|
||||||
|
|
||||||
template<class SearchEngineT>
|
|
||||||
class BaseDescriptor {
|
|
||||||
public:
|
|
||||||
BaseDescriptor() { }
|
|
||||||
//Maybe someone can explain the pure virtual destructor thing to me (dennis)
|
|
||||||
virtual ~BaseDescriptor() { }
|
|
||||||
virtual void Run(http::Reply & reply, RawRouteData &rawRoute, PhantomNodes &phantomNodes, SearchEngineT &sEngine, unsigned distance) = 0;
|
|
||||||
virtual void SetConfig(const _DescriptorConfig & config) = 0;
|
|
||||||
};
|
|
||||||
|
|
||||||
#endif /* BASE_DESCRIPTOR_H_ */
|
|
||||||
@ -1,67 +0,0 @@
|
|||||||
/*
|
|
||||||
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 GPX_DESCRIPTOR_H_
|
|
||||||
#define GPX_DESCRIPTOR_H_
|
|
||||||
|
|
||||||
#include <boost/foreach.hpp>
|
|
||||||
#include "BaseDescriptor.h"
|
|
||||||
|
|
||||||
template<class SearchEngineT>
|
|
||||||
class GPXDescriptor : public BaseDescriptor<SearchEngineT>{
|
|
||||||
private:
|
|
||||||
_DescriptorConfig config;
|
|
||||||
_Coordinate current;
|
|
||||||
|
|
||||||
std::string tmp;
|
|
||||||
public:
|
|
||||||
void SetConfig(const _DescriptorConfig& c) { config = c; }
|
|
||||||
void Run(http::Reply & reply, RawRouteData &rawRoute, PhantomNodes &phantomNodes, SearchEngineT &sEngine, unsigned distance) {
|
|
||||||
reply.content += ("<?xml version=\"1.0\" encoding=\"UTF-8\"?>");
|
|
||||||
reply.content += "<gpx xmlns=\"http://www.topografix.com/GPX/1/1\" "
|
|
||||||
"xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" "
|
|
||||||
"xsi:schemaLocation=\"http://www.topografix.com/GPX/1/1 gpx.xsd"
|
|
||||||
"\">";
|
|
||||||
reply.content += "<rte>";
|
|
||||||
if(distance != UINT_MAX && rawRoute.routeSegments.size()) {
|
|
||||||
convertInternalLatLonToString(phantomNodes.startPhantom.location.lat, tmp);
|
|
||||||
reply.content += "<rtept lat=\"" + tmp + "\" ";
|
|
||||||
convertInternalLatLonToString(phantomNodes.startPhantom.location.lon, tmp);
|
|
||||||
reply.content += "lon=\"" + tmp + "\"></rtept>";
|
|
||||||
|
|
||||||
for(unsigned segmentIdx = 0; segmentIdx < rawRoute.routeSegments.size(); segmentIdx++) {
|
|
||||||
BOOST_FOREACH(_PathData pathData, rawRoute.routeSegments[segmentIdx]) {
|
|
||||||
sEngine.GetCoordinatesForNodeID(pathData.node, current);
|
|
||||||
|
|
||||||
convertInternalLatLonToString(current.lat, tmp);
|
|
||||||
reply.content += "<rtept lat=\"" + tmp + "\" ";
|
|
||||||
convertInternalLatLonToString(current.lon, tmp);
|
|
||||||
reply.content += "lon=\"" + tmp + "\"></rtept>";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
convertInternalLatLonToString(phantomNodes.targetPhantom.location.lat, tmp);
|
|
||||||
reply.content += "<rtept lat=\"" + tmp + "\" ";
|
|
||||||
convertInternalLatLonToString(phantomNodes.targetPhantom.location.lon, tmp);
|
|
||||||
reply.content += "lon=\"" + tmp + "\"></rtept>";
|
|
||||||
}
|
|
||||||
reply.content += "</rte></gpx>";
|
|
||||||
}
|
|
||||||
};
|
|
||||||
#endif /* GPX_DESCRIPTOR_H_ */
|
|
||||||
@ -1,154 +0,0 @@
|
|||||||
/*
|
|
||||||
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 JSON_DESCRIPTOR_H_
|
|
||||||
#define JSON_DESCRIPTOR_H_
|
|
||||||
|
|
||||||
#include <boost/foreach.hpp>
|
|
||||||
|
|
||||||
#include "BaseDescriptor.h"
|
|
||||||
#include "../DataStructures/DescriptionFactory.h"
|
|
||||||
#include "../DataStructures/SegmentInformation.h"
|
|
||||||
#include "../DataStructures/TurnInstructions.h"
|
|
||||||
#include "../Util/StringUtil.h"
|
|
||||||
|
|
||||||
template<class SearchEngineT>
|
|
||||||
class JSONDescriptor : public BaseDescriptor<SearchEngineT>{
|
|
||||||
private:
|
|
||||||
_DescriptorConfig config;
|
|
||||||
_RouteSummary summary;
|
|
||||||
DescriptionFactory descriptionFactory;
|
|
||||||
std::string tmp;
|
|
||||||
_Coordinate current;
|
|
||||||
|
|
||||||
public:
|
|
||||||
JSONDescriptor() {}
|
|
||||||
void SetConfig(const _DescriptorConfig & c) { config = c; }
|
|
||||||
|
|
||||||
void Run(http::Reply & reply, RawRouteData &rawRoute, PhantomNodes &phantomNodes, SearchEngineT &sEngine, unsigned durationOfTrip) {
|
|
||||||
WriteHeaderToOutput(reply.content);
|
|
||||||
//We do not need to do much, if there is no route ;-)
|
|
||||||
|
|
||||||
if(durationOfTrip != INT_MAX && rawRoute.routeSegments.size() > 0) {
|
|
||||||
summary.startName = sEngine.GetEscapedNameForNameID(phantomNodes.startPhantom.nodeBasedEdgeNameID);
|
|
||||||
descriptionFactory.SetStartSegment(phantomNodes.startPhantom);
|
|
||||||
summary.destName = sEngine.GetEscapedNameForNameID(phantomNodes.targetPhantom.nodeBasedEdgeNameID);
|
|
||||||
reply.content += "0,"
|
|
||||||
"\"status_message\": \"Found route between points\",";
|
|
||||||
for(unsigned segmentIdx = 0; segmentIdx < rawRoute.routeSegments.size(); segmentIdx++) {
|
|
||||||
const std::vector< _PathData > & path = rawRoute.routeSegments[segmentIdx];
|
|
||||||
BOOST_FOREACH(_PathData pathData, path) {
|
|
||||||
sEngine.GetCoordinatesForNodeID(pathData.node, current);
|
|
||||||
descriptionFactory.AppendSegment(current, pathData );
|
|
||||||
}
|
|
||||||
//TODO: Add via points
|
|
||||||
}
|
|
||||||
descriptionFactory.SetEndSegment(phantomNodes.targetPhantom);
|
|
||||||
} else {
|
|
||||||
//no route found
|
|
||||||
reply.content += "207,"
|
|
||||||
"\"status_message\": \"Cannot find route between points\",";
|
|
||||||
}
|
|
||||||
|
|
||||||
summary.BuildDurationAndLengthStrings(descriptionFactory.Run(), durationOfTrip);
|
|
||||||
|
|
||||||
reply.content += "\"route_summary\": {"
|
|
||||||
"\"total_distance\":";
|
|
||||||
reply.content += summary.lengthString;
|
|
||||||
reply.content += ","
|
|
||||||
"\"total_time\":";
|
|
||||||
reply.content += summary.durationString;
|
|
||||||
reply.content += ","
|
|
||||||
"\"start_point\":\"";
|
|
||||||
reply.content += summary.startName;
|
|
||||||
reply.content += "\","
|
|
||||||
"\"end_point\":\"";
|
|
||||||
reply.content += summary.destName;
|
|
||||||
reply.content += "\"";
|
|
||||||
reply.content += "},";
|
|
||||||
reply.content += "\"route_geometry\": ";
|
|
||||||
if(config.geometry) {
|
|
||||||
if(config.encodeGeometry)
|
|
||||||
descriptionFactory.AppendEncodedPolylineString(reply.content, config.encodeGeometry);
|
|
||||||
} else {
|
|
||||||
reply.content += "[]";
|
|
||||||
}
|
|
||||||
|
|
||||||
reply.content += ","
|
|
||||||
"\"route_instructions\": [";
|
|
||||||
if(config.instructions) {
|
|
||||||
unsigned prefixSumOfNecessarySegments = 0;
|
|
||||||
std::string tmpDist, tmpLength, tmp;
|
|
||||||
//Fetch data from Factory and generate a string from it.
|
|
||||||
BOOST_FOREACH(SegmentInformation segment, descriptionFactory.pathDescription) {
|
|
||||||
//["instruction","streetname",length,position,time,"length","earth_direction",azimuth]
|
|
||||||
if(0 != segment.turnInstruction) {
|
|
||||||
if(0 != prefixSumOfNecessarySegments)
|
|
||||||
reply.content += ",";
|
|
||||||
reply.content += "[\"";
|
|
||||||
reply.content += TurnInstructions.TurnStrings[segment.turnInstruction];
|
|
||||||
reply.content += "\",\"";
|
|
||||||
reply.content += sEngine.GetEscapedNameForNameID(segment.nameID);
|
|
||||||
reply.content += "\",";
|
|
||||||
intToString(segment.length, tmpDist);
|
|
||||||
reply.content += tmpDist;
|
|
||||||
reply.content += ",";
|
|
||||||
intToString(prefixSumOfNecessarySegments, tmpLength);
|
|
||||||
reply.content += tmpLength;
|
|
||||||
reply.content += ",";
|
|
||||||
intToString(segment.duration, tmp);
|
|
||||||
reply.content += ",\"";
|
|
||||||
reply.content += tmpLength;
|
|
||||||
//TODO: fix heading
|
|
||||||
reply.content += "\",\"NE\",22.5";
|
|
||||||
reply.content += "]";
|
|
||||||
}
|
|
||||||
if(segment.necessary)
|
|
||||||
++prefixSumOfNecessarySegments;
|
|
||||||
}
|
|
||||||
// descriptionFactory.AppendRouteInstructionString(reply.content);
|
|
||||||
|
|
||||||
}
|
|
||||||
reply.content += "],";
|
|
||||||
//list all viapoints so that the client may display it
|
|
||||||
reply.content += "\"via_points\":[";
|
|
||||||
for(unsigned segmentIdx = 1; (true == config.geometry) && (segmentIdx < rawRoute.segmentEndCoordinates.size()); segmentIdx++) {
|
|
||||||
if(segmentIdx > 1)
|
|
||||||
reply.content += ",";
|
|
||||||
reply.content += "[";
|
|
||||||
if(rawRoute.segmentEndCoordinates[segmentIdx].startPhantom.location.isSet())
|
|
||||||
convertInternalReversedCoordinateToString(rawRoute.segmentEndCoordinates[segmentIdx].startPhantom.location, tmp);
|
|
||||||
else
|
|
||||||
convertInternalReversedCoordinateToString(rawRoute.rawViaNodeCoordinates[segmentIdx], tmp);
|
|
||||||
reply.content += tmp;
|
|
||||||
reply.content += "]";
|
|
||||||
}
|
|
||||||
reply.content += "],"
|
|
||||||
"\"transactionId\": \"OSRM Routing Engine JSON Descriptor (v0.2)\"";
|
|
||||||
reply.content += "}";
|
|
||||||
}
|
|
||||||
|
|
||||||
void WriteHeaderToOutput(std::string & output) {
|
|
||||||
output += "{"
|
|
||||||
"\"version\": 0.3,"
|
|
||||||
"\"status\":";
|
|
||||||
}
|
|
||||||
};
|
|
||||||
#endif /* JSON_DESCRIPTOR_H_ */
|
|
||||||
Loading…
Reference in New Issue
Block a user