Implements way parsing through LUA scripting engine, implements issue #1
This commit is contained in:
parent
87df312a9d
commit
e43d27e86d
@ -31,6 +31,14 @@ public:
|
|||||||
virtual bool RegisterCallbacks(bool (*nodeCallbackPointer)(NodeT), bool (*restrictionCallbackPointer)(RestrictionT), bool (*wayCallbackPointer)(WayT)) = 0;
|
virtual bool RegisterCallbacks(bool (*nodeCallbackPointer)(NodeT), bool (*restrictionCallbackPointer)(RestrictionT), bool (*wayCallbackPointer)(WayT)) = 0;
|
||||||
virtual void RegisterLUAState(lua_State *myLuaState) = 0;
|
virtual void RegisterLUAState(lua_State *myLuaState) = 0;
|
||||||
virtual bool Parse() = 0;
|
virtual bool Parse() = 0;
|
||||||
|
|
||||||
|
void report_errors(lua_State *L, int status) {
|
||||||
|
if ( status!=0 ) {
|
||||||
|
std::cerr << "-- " << lua_tostring(L, -1) << std::endl;
|
||||||
|
lua_pop(L, 1); // remove error message
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
};
|
};
|
||||||
|
|
||||||
#endif /* BASEPARSER_H_ */
|
#endif /* BASEPARSER_H_ */
|
||||||
|
@ -20,7 +20,7 @@
|
|||||||
|
|
||||||
#include "ExtractionContainers.h"
|
#include "ExtractionContainers.h"
|
||||||
|
|
||||||
void ExtractionContainers::PrepareData(const Settings & settings, const std::string & outputFileName, const std::string restrictionsFileName, const unsigned amountOfRAM) {
|
void ExtractionContainers::PrepareData(const std::string & outputFileName, const std::string restrictionsFileName, const unsigned amountOfRAM) {
|
||||||
try {
|
try {
|
||||||
unsigned usedNodeCounter = 0;
|
unsigned usedNodeCounter = 0;
|
||||||
unsigned usedEdgeCounter = 0;
|
unsigned usedEdgeCounter = 0;
|
||||||
@ -157,8 +157,6 @@ void ExtractionContainers::PrepareData(const Settings & settings, const std::str
|
|||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
if(*usedNodeIDsIT == nodesIT->id) {
|
if(*usedNodeIDsIT == nodesIT->id) {
|
||||||
if(!settings.obeyBollards && nodesIT->bollard)
|
|
||||||
nodesIT->bollard = false;
|
|
||||||
fout.write((char*)&(*nodesIT), sizeof(_Node));
|
fout.write((char*)&(*nodesIT), sizeof(_Node));
|
||||||
++usedNodeCounter;
|
++usedNodeCounter;
|
||||||
++usedNodeIDsIT;
|
++usedNodeIDsIT;
|
||||||
|
@ -46,7 +46,7 @@ public:
|
|||||||
wayStartEndVector.clear();
|
wayStartEndVector.clear();
|
||||||
}
|
}
|
||||||
|
|
||||||
void PrepareData(const Settings & settings, const std::string & outputFileName, const std::string restrictionsFileName, const unsigned amountOfRAM);
|
void PrepareData( const std::string & outputFileName, const std::string restrictionsFileName, const unsigned amountOfRAM);
|
||||||
|
|
||||||
STXXLNodeIDVector usedNodeIDs;
|
STXXLNodeIDVector usedNodeIDs;
|
||||||
STXXLNodeVector allNodes;
|
STXXLNodeVector allNodes;
|
||||||
|
64
Extractor/ExtractionHelperFunctions.h
Normal file
64
Extractor/ExtractionHelperFunctions.h
Normal file
@ -0,0 +1,64 @@
|
|||||||
|
/*
|
||||||
|
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 EXTRACTIONHELPERFUNCTIONS_H_
|
||||||
|
#define EXTRACTIONHELPERFUNCTIONS_H_
|
||||||
|
|
||||||
|
#include <climits>
|
||||||
|
|
||||||
|
inline bool durationIsValid(const std::string &s) {
|
||||||
|
boost::regex e ("((\\d|\\d\\d):)*(\\d|\\d\\d)",boost::regex_constants::icase|boost::regex_constants::perl);
|
||||||
|
|
||||||
|
std::vector< std::string > result;
|
||||||
|
boost::algorithm::split_regex( result, s, boost::regex( ":" ) ) ;
|
||||||
|
bool matched = regex_match(s, e);
|
||||||
|
return matched;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline unsigned parseDuration(const std::string &s) {
|
||||||
|
int hours = 0;
|
||||||
|
int minutes = 0;
|
||||||
|
boost::regex e ("((\\d|\\d\\d):)*(\\d|\\d\\d)",boost::regex_constants::icase|boost::regex_constants::perl);
|
||||||
|
|
||||||
|
std::vector< std::string > result;
|
||||||
|
boost::algorithm::split_regex( result, s, boost::regex( ":" ) ) ;
|
||||||
|
bool matched = regex_match(s, e);
|
||||||
|
if(matched) {
|
||||||
|
hours = (result.size()== 2) ? atoi(result[0].c_str()) : 0;
|
||||||
|
minutes = (result.size()== 2) ? atoi(result[1].c_str()) : atoi(result[0].c_str());
|
||||||
|
return 600*(hours*60+minutes);
|
||||||
|
}
|
||||||
|
return UINT_MAX;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
inline int parseMaxspeed(std::string input) { //call-by-value on purpose.
|
||||||
|
boost::algorithm::to_lower(input);
|
||||||
|
int n = atoi(input.c_str());
|
||||||
|
if (input.find("mph") != std::string::npos || input.find("mp/h") != std::string::npos) {
|
||||||
|
n = (n*1609)/1000;
|
||||||
|
}
|
||||||
|
return n;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
#endif /* EXTRACTIONHELPERFUNCTIONS_H_ */
|
@ -40,40 +40,17 @@ or see http://www.gnu.org/licenses/agpl.txt.
|
|||||||
|
|
||||||
|
|
||||||
#include "ExtractorCallbacks.h"
|
#include "ExtractorCallbacks.h"
|
||||||
|
#include "ExtractionHelperFunctions.h"
|
||||||
bool ExtractorCallbacks::checkForValidTiming(const std::string &s, DurationContainer & duration) {
|
|
||||||
boost::regex e ("((\\d|\\d\\d):)*(\\d|\\d\\d)",boost::regex_constants::icase|boost::regex_constants::perl);
|
|
||||||
|
|
||||||
std::vector< std::string > result;
|
|
||||||
boost::algorithm::split_regex( result, s, boost::regex( ":" ) ) ;
|
|
||||||
bool matched = regex_match(s, e);
|
|
||||||
if(matched) {
|
|
||||||
duration.hours = (result.size()== 2) ? atoi(result[0].c_str()) : 0;
|
|
||||||
duration.minutes = (result.size()== 2) ? atoi(result[1].c_str()) : atoi(result[0].c_str());
|
|
||||||
}
|
|
||||||
return matched;
|
|
||||||
}
|
|
||||||
|
|
||||||
inline int ExtractorCallbacks::parseMaxspeed(std::string input) const { //call-by-value on purpose.
|
|
||||||
boost::algorithm::to_lower(input);
|
|
||||||
int n = atoi(input.c_str());
|
|
||||||
if (input.find("mph") != std::string::npos || input.find("mp/h") != std::string::npos) {
|
|
||||||
n = (n*1609)/1000;
|
|
||||||
}
|
|
||||||
return n;
|
|
||||||
}
|
|
||||||
|
|
||||||
ExtractorCallbacks::ExtractorCallbacks() {externalMemory = NULL; stringMap = NULL; }
|
ExtractorCallbacks::ExtractorCallbacks() {externalMemory = NULL; stringMap = NULL; }
|
||||||
ExtractorCallbacks::ExtractorCallbacks(ExtractionContainers * ext, Settings set, StringMap * strMap) {
|
ExtractorCallbacks::ExtractorCallbacks(ExtractionContainers * ext, StringMap * strMap) {
|
||||||
externalMemory = ext;
|
externalMemory = ext;
|
||||||
settings = set;
|
|
||||||
stringMap = strMap;
|
stringMap = strMap;
|
||||||
}
|
}
|
||||||
|
|
||||||
ExtractorCallbacks::~ExtractorCallbacks() {
|
ExtractorCallbacks::~ExtractorCallbacks() {
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
/** warning: caller needs to take care of synchronization! */
|
/** warning: caller needs to take care of synchronization! */
|
||||||
bool ExtractorCallbacks::nodeFunction(_Node &n) {
|
bool ExtractorCallbacks::nodeFunction(_Node &n) {
|
||||||
externalMemory->allNodes.push_back(n);
|
externalMemory->allNodes.push_back(n);
|
||||||
@ -87,146 +64,9 @@ bool ExtractorCallbacks::restrictionFunction(_RawRestrictionContainer &r) {
|
|||||||
|
|
||||||
/** warning: caller needs to take care of synchronization! */
|
/** warning: caller needs to take care of synchronization! */
|
||||||
bool ExtractorCallbacks::wayFunction(_Way &w) {
|
bool ExtractorCallbacks::wayFunction(_Way &w) {
|
||||||
|
/*** Store name of way and split it into edge segments ***/
|
||||||
|
|
||||||
//Get the properties of the way.
|
if ( w.speed > 0 ) { //Only true if the way is specified by the speed profile
|
||||||
std::string highway( w.keyVals.Find("highway") );
|
|
||||||
std::string name( w.keyVals.Find("name") );
|
|
||||||
std::string ref( w.keyVals.Find("ref"));
|
|
||||||
std::string junction( w.keyVals.Find("junction") );
|
|
||||||
std::string route( w.keyVals.Find("route") );
|
|
||||||
int maxspeed( parseMaxspeed(w.keyVals.Find("maxspeed")) );
|
|
||||||
std::string man_made( w.keyVals.Find("man_made") );
|
|
||||||
std::string barrier( w.keyVals.Find("barrier") );
|
|
||||||
std::string oneway( w.keyVals.Find("oneway"));
|
|
||||||
std::string cycleway( w.keyVals.Find("cycleway"));
|
|
||||||
std::string duration ( w.keyVals.Find("duration"));
|
|
||||||
std::string service (w.keyVals.Find("service"));
|
|
||||||
std::string area(w.keyVals.Find("area"));
|
|
||||||
|
|
||||||
if("yes" == area && settings.ignoreAreas)
|
|
||||||
return true;
|
|
||||||
|
|
||||||
//Save the name of the way if it has one, ref has precedence over name tag.
|
|
||||||
if ( 0 < ref.length() )
|
|
||||||
w.name = ref;
|
|
||||||
else
|
|
||||||
if ( 0 < name.length() )
|
|
||||||
w.name = name;
|
|
||||||
|
|
||||||
if(junction == "roundabout") {
|
|
||||||
w.roundabout = true;
|
|
||||||
}
|
|
||||||
|
|
||||||
//Is the route tag listed as usable way in the profile?
|
|
||||||
if(settings[route] > 0 || settings[man_made] > 0) {
|
|
||||||
w.useful = true;
|
|
||||||
DurationContainer dc;
|
|
||||||
if(checkForValidTiming(duration, dc)){
|
|
||||||
w.speed = (600*(dc.hours*60+dc.minutes))/std::max((unsigned)(w.path.size()-1),1u);
|
|
||||||
w.isDurationSet = true;
|
|
||||||
} else {
|
|
||||||
w.speed = settings[route];
|
|
||||||
}
|
|
||||||
w.direction = _Way::bidirectional;
|
|
||||||
if(0 < settings[route])
|
|
||||||
highway = route;
|
|
||||||
else if (0 < settings[man_made]) {
|
|
||||||
highway = man_made;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//determine the access value
|
|
||||||
std::string access;
|
|
||||||
std::string onewayClass;
|
|
||||||
std::string accessTag;
|
|
||||||
BOOST_FOREACH(std::string & s, settings.accessTags) {
|
|
||||||
access = std::string(w.keyVals.Find(s));
|
|
||||||
if(0 < access.size()) {
|
|
||||||
accessTag = s;
|
|
||||||
onewayClass = std::string(w.keyVals.Find("oneway:"+access));
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if(0 < access.size()) {
|
|
||||||
// handle ways with default access = no
|
|
||||||
if(settings.accessForbiddenDefault.find(access) != settings.accessForbiddenDefault.end()) {
|
|
||||||
access = std::string("no");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//Is the highway tag listed as usable way?
|
|
||||||
if(0 < settings[highway] || "yes" == access || "designated" == access) {
|
|
||||||
if(!w.isDurationSet) {
|
|
||||||
if(0 < settings[highway]) {
|
|
||||||
if(0 < maxspeed)
|
|
||||||
if(settings.takeMinimumOfSpeeds)
|
|
||||||
w.speed = std::min(settings[highway], maxspeed);
|
|
||||||
else
|
|
||||||
w.speed = maxspeed;
|
|
||||||
else
|
|
||||||
w.speed = settings[highway];
|
|
||||||
} else {
|
|
||||||
if(0 < maxspeed)
|
|
||||||
if(settings.takeMinimumOfSpeeds)
|
|
||||||
w.speed = std::min(settings.defaultSpeed, maxspeed);
|
|
||||||
else w.speed = maxspeed;
|
|
||||||
else
|
|
||||||
w.speed = settings.defaultSpeed;
|
|
||||||
highway = "default";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
w.useful = true;
|
|
||||||
|
|
||||||
//Okay, do we have access to that way?
|
|
||||||
if(0 < access.size()) { //fastest way to check for non-empty string
|
|
||||||
//If access is forbidden, we don't want to route there.
|
|
||||||
if(settings.accessForbiddenKeys.find(access) != settings.accessForbiddenKeys.end()) {
|
|
||||||
w.access = false;
|
|
||||||
}
|
|
||||||
if(settings.accessRestrictionKeys.find(access) != settings.accessRestrictionKeys.end()) {
|
|
||||||
w.isAccessRestricted = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if(0 < service.size()) {
|
|
||||||
if(settings.accessRestrictedService.find(service) != settings.accessRestrictedService.end()) {
|
|
||||||
w.isAccessRestricted = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if("no" == access) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
if( settings.obeyOneways ) {
|
|
||||||
if( onewayClass == "yes" || onewayClass == "1" || onewayClass == "true" ) {
|
|
||||||
w.direction = _Way::oneway;
|
|
||||||
} else if( onewayClass == "no" || onewayClass == "0" || onewayClass == "false" ) {
|
|
||||||
w.direction = _Way::bidirectional;
|
|
||||||
} else if( onewayClass == "-1" ) {
|
|
||||||
w.direction = _Way::opposite;
|
|
||||||
} else if( oneway == "no" || oneway == "0" || oneway == "false" ) {
|
|
||||||
w.direction = _Way::bidirectional;
|
|
||||||
} else if( accessTag == "bicycle" && (cycleway == "opposite" || cycleway == "opposite_track" || cycleway == "opposite_lane") ) {
|
|
||||||
w.direction = _Way::bidirectional;
|
|
||||||
} else if( oneway == "-1") {
|
|
||||||
w.direction = _Way::opposite;
|
|
||||||
} else if( oneway == "yes" || oneway == "1" || oneway == "true" || junction == "roundabout" || highway == "motorway_link" || highway == "motorway" ) {
|
|
||||||
w.direction = _Way::oneway;
|
|
||||||
} else {
|
|
||||||
w.direction = _Way::bidirectional;
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
w.direction = _Way::bidirectional;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if ( w.useful && w.access && (1 < w.path.size()) ) { //Only true if the way is specified by the speed profile
|
|
||||||
w.type = settings.GetHighwayTypeID(highway);
|
|
||||||
if(0 > w.type) {
|
|
||||||
ERR("Resolved highway " << highway << " to " << w.type);
|
|
||||||
}
|
|
||||||
|
|
||||||
//Get the unique identifier for the street name
|
//Get the unique identifier for the street name
|
||||||
const StringMap::const_iterator strit = stringMap->find(w.name);
|
const StringMap::const_iterator strit = stringMap->find(w.name);
|
||||||
@ -252,7 +92,7 @@ bool ExtractorCallbacks::wayFunction(_Way &w) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
for(vector< NodeID >::size_type n = 0; n < w.path.size()-1; ++n) {
|
for(vector< NodeID >::size_type n = 0; n < w.path.size()-1; ++n) {
|
||||||
externalMemory->allEdges.push_back(_Edge(w.path[n], w.path[n+1], w.type, w.direction, w.speed, w.nameID, w.roundabout, highway == settings.excludeFromGrid || "pier" == highway, w.isDurationSet, w.isAccessRestricted));
|
externalMemory->allEdges.push_back(_Edge(w.path[n], w.path[n+1], w.type, w.direction, w.speed, w.nameID, w.roundabout, w.ignoreInGrid, w.isDurationSet, w.isAccessRestricted));
|
||||||
externalMemory->usedNodeIDs.push_back(w.path[n]);
|
externalMemory->usedNodeIDs.push_back(w.path[n]);
|
||||||
}
|
}
|
||||||
externalMemory->usedNodeIDs.push_back(w.path.back());
|
externalMemory->usedNodeIDs.push_back(w.path.back());
|
||||||
@ -262,7 +102,3 @@ bool ExtractorCallbacks::wayFunction(_Way &w) {
|
|||||||
}
|
}
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
@ -33,20 +33,12 @@ or see http://www.gnu.org/licenses/agpl.txt.
|
|||||||
|
|
||||||
class ExtractorCallbacks{
|
class ExtractorCallbacks{
|
||||||
private:
|
private:
|
||||||
Settings settings;
|
|
||||||
StringMap * stringMap;
|
StringMap * stringMap;
|
||||||
ExtractionContainers * externalMemory;
|
ExtractionContainers * externalMemory;
|
||||||
|
|
||||||
struct DurationContainer {
|
|
||||||
int hours;
|
|
||||||
int minutes;
|
|
||||||
};
|
|
||||||
|
|
||||||
bool checkForValidTiming(const std::string &s, DurationContainer & duration);
|
|
||||||
inline int parseMaxspeed(std::string input) const;
|
|
||||||
ExtractorCallbacks();
|
ExtractorCallbacks();
|
||||||
public:
|
public:
|
||||||
explicit ExtractorCallbacks(ExtractionContainers * ext, Settings set, StringMap * strMap);
|
explicit ExtractorCallbacks(ExtractionContainers * ext, StringMap * strMap);
|
||||||
|
|
||||||
~ExtractorCallbacks();
|
~ExtractorCallbacks();
|
||||||
|
|
||||||
|
@ -23,7 +23,12 @@ or see http://www.gnu.org/licenses/agpl.txt.
|
|||||||
|
|
||||||
#include <climits>
|
#include <climits>
|
||||||
#include <string>
|
#include <string>
|
||||||
|
|
||||||
|
#include <boost/algorithm/string.hpp>
|
||||||
|
#include <boost/algorithm/string/regex.hpp>
|
||||||
|
#include <boost/regex.hpp>
|
||||||
#include <boost/unordered_map.hpp>
|
#include <boost/unordered_map.hpp>
|
||||||
|
|
||||||
#include "../DataStructures/Coordinate.h"
|
#include "../DataStructures/Coordinate.h"
|
||||||
#include "../DataStructures/HashTable.h"
|
#include "../DataStructures/HashTable.h"
|
||||||
#include "../DataStructures/ImportNode.h"
|
#include "../DataStructures/ImportNode.h"
|
||||||
@ -41,11 +46,12 @@ struct _Way {
|
|||||||
direction = _Way::notSure;
|
direction = _Way::notSure;
|
||||||
speed = -1;
|
speed = -1;
|
||||||
type = -1;
|
type = -1;
|
||||||
useful = false;
|
// useful = false;
|
||||||
access = true;
|
access = true;
|
||||||
roundabout = false;
|
roundabout = false;
|
||||||
isDurationSet = false;
|
isDurationSet = false;
|
||||||
isAccessRestricted = false;
|
isAccessRestricted = false;
|
||||||
|
ignoreInGrid = false;
|
||||||
}
|
}
|
||||||
|
|
||||||
enum {
|
enum {
|
||||||
@ -56,11 +62,12 @@ struct _Way {
|
|||||||
std::string name;
|
std::string name;
|
||||||
double speed;
|
double speed;
|
||||||
short type;
|
short type;
|
||||||
bool useful;
|
// bool useful;
|
||||||
bool access;
|
bool access;
|
||||||
bool roundabout;
|
bool roundabout;
|
||||||
bool isDurationSet;
|
bool isDurationSet;
|
||||||
bool isAccessRestricted;
|
bool isAccessRestricted;
|
||||||
|
bool ignoreInGrid;
|
||||||
std::vector< NodeID > path;
|
std::vector< NodeID > path;
|
||||||
HashTable<std::string, std::string> keyVals;
|
HashTable<std::string, std::string> keyVals;
|
||||||
};
|
};
|
||||||
@ -133,41 +140,6 @@ struct CmpWayByID : public std::binary_function<_WayIDStartAndEndEdge, _WayIDSta
|
|||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
struct Settings {
|
|
||||||
Settings() : obeyBollards(true), obeyOneways(true), useRestrictions(true), ignoreAreas(false), defaultSpeed(30), takeMinimumOfSpeeds(false), excludeFromGrid("ferry") {}
|
|
||||||
StringToIntPairMap speedProfile;
|
|
||||||
int operator[](const std::string & param) const {
|
|
||||||
if(speedProfile.find(param) == speedProfile.end())
|
|
||||||
return 0;
|
|
||||||
else
|
|
||||||
return speedProfile.at(param).first;
|
|
||||||
}
|
|
||||||
int GetHighwayTypeID(const std::string & param) const {
|
|
||||||
if(param == excludeFromGrid) {
|
|
||||||
return SHRT_MAX;
|
|
||||||
}
|
|
||||||
assert(param != "ferry");
|
|
||||||
if(speedProfile.find(param) == speedProfile.end()) {
|
|
||||||
ERR("There is a bug with highway \"" << param << "\"");
|
|
||||||
return -1;
|
|
||||||
} else {
|
|
||||||
return speedProfile.at(param).second;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
bool obeyBollards;
|
|
||||||
bool obeyOneways;
|
|
||||||
bool useRestrictions;
|
|
||||||
bool ignoreAreas;
|
|
||||||
std::vector<std::string> accessTags;
|
|
||||||
int defaultSpeed;
|
|
||||||
bool takeMinimumOfSpeeds;
|
|
||||||
std::string excludeFromGrid;
|
|
||||||
boost::unordered_map<std::string, bool> accessRestrictedService;
|
|
||||||
boost::unordered_map<std::string, bool> accessRestrictionKeys;
|
|
||||||
boost::unordered_map<std::string, bool> accessForbiddenKeys;
|
|
||||||
boost::unordered_map<std::string, bool> accessForbiddenDefault;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct Cmp : public std::binary_function<NodeID, NodeID, bool> {
|
struct Cmp : public std::binary_function<NodeID, NodeID, bool> {
|
||||||
typedef NodeID value_type;
|
typedef NodeID value_type;
|
||||||
bool operator () (const NodeID & a, const NodeID & b) const {
|
bool operator () (const NodeID & a, const NodeID & b) const {
|
||||||
|
@ -30,4 +30,6 @@ void LUA_print(T number) {
|
|||||||
std::cout << "[LUA] " << number << std::endl;
|
std::cout << "[LUA] " << number << std::endl;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
#endif /* LUAUTIL_H_ */
|
#endif /* LUAUTIL_H_ */
|
||||||
|
@ -234,6 +234,7 @@ private:
|
|||||||
denseTagIndex += 2;
|
denseTagIndex += 2;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/** Pass the unpacked node to the LUA call back **/
|
||||||
int ret = -1;
|
int ret = -1;
|
||||||
try {
|
try {
|
||||||
ret = luabind::call_function<int>(
|
ret = luabind::call_function<int>(
|
||||||
@ -249,23 +250,16 @@ private:
|
|||||||
report_errors(Ler, -1);
|
report_errors(Ler, -1);
|
||||||
}
|
}
|
||||||
catch (...) {
|
catch (...) {
|
||||||
cerr<<"Unknown error!"<<endl;
|
ERR("Unknown error occurred during PBF dense node parsing!");
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
void report_errors(lua_State *L, int status)
|
|
||||||
{
|
|
||||||
if ( status!=0 ) {
|
|
||||||
std::cerr << "-- " << lua_tostring(L, -1) << std::endl;
|
|
||||||
lua_pop(L, 1); // remove error message
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void parseNode(_ThreadData * threadData) {
|
void parseNode(_ThreadData * threadData) {
|
||||||
_Node n;
|
ERR("Parsing of simple nodes not supported. PBF should use dense nodes");
|
||||||
if(!(*nodeCallback)(n))
|
// _Node n;
|
||||||
std::cerr << "[PBFParser] simple node not parsed" << std::endl;
|
// if(!(*nodeCallback)(n))
|
||||||
|
// std::cerr << "[PBFParser] simple node not parsed" << std::endl;
|
||||||
}
|
}
|
||||||
|
|
||||||
void parseRelation(_ThreadData * threadData) {
|
void parseRelation(_ThreadData * threadData) {
|
||||||
@ -360,8 +354,25 @@ private:
|
|||||||
w.keyVals.Add(key, val);
|
w.keyVals.Add(key, val);
|
||||||
}
|
}
|
||||||
|
|
||||||
if(!(*wayCallback)(w)) {
|
/** Pass the unpacked way to the LUA call back **/
|
||||||
std::cerr << "[PBFParser] way not parsed" << std::endl;
|
int ret = -1;
|
||||||
|
try {
|
||||||
|
ret = luabind::call_function<int>(
|
||||||
|
myLuaState,
|
||||||
|
"way_function",
|
||||||
|
boost::ref(w),
|
||||||
|
w.path.size()
|
||||||
|
);
|
||||||
|
if(!(*wayCallback)(w)) {
|
||||||
|
std::cerr << "[PBFParser] way not parsed" << std::endl;
|
||||||
|
}
|
||||||
|
} catch (const luabind::error &er) {
|
||||||
|
cerr << er.what() << endl;
|
||||||
|
lua_State* Ler=er.state();
|
||||||
|
report_errors(Ler, -1);
|
||||||
|
}
|
||||||
|
catch (...) {
|
||||||
|
cerr<<"Unknown error!"<<endl;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -21,6 +21,7 @@ or see http://www.gnu.org/licenses/agpl.txt.
|
|||||||
#ifndef XMLPARSER_H_
|
#ifndef XMLPARSER_H_
|
||||||
#define XMLPARSER_H_
|
#define XMLPARSER_H_
|
||||||
|
|
||||||
|
#include <boost/ref.hpp>
|
||||||
#include <libxml/xmlreader.h>
|
#include <libxml/xmlreader.h>
|
||||||
|
|
||||||
#include "../typedefs.h"
|
#include "../typedefs.h"
|
||||||
@ -65,15 +66,49 @@ public:
|
|||||||
|
|
||||||
if ( xmlStrEqual( currentName, ( const xmlChar* ) "node" ) == 1 ) {
|
if ( xmlStrEqual( currentName, ( const xmlChar* ) "node" ) == 1 ) {
|
||||||
_Node n = _ReadXMLNode( );
|
_Node n = _ReadXMLNode( );
|
||||||
if(!(*nodeCallback)(n))
|
/** Pass the unpacked node to the LUA call back **/
|
||||||
std::cerr << "[XMLParser] node not parsed" << std::endl;
|
int ret = -1;
|
||||||
|
try {
|
||||||
|
ret = luabind::call_function<int>(
|
||||||
|
myLuaState,
|
||||||
|
"node_function",
|
||||||
|
boost::ref(n)
|
||||||
|
);
|
||||||
|
if(!(*nodeCallback)(n))
|
||||||
|
std::cerr << "[XMLParser] dense node not parsed" << std::endl;
|
||||||
|
} catch (const luabind::error &er) {
|
||||||
|
cerr << er.what() << endl;
|
||||||
|
lua_State* Ler=er.state();
|
||||||
|
report_errors(Ler, -1);
|
||||||
|
}
|
||||||
|
catch (...) {
|
||||||
|
ERR("Unknown error occurred during PBF dense node parsing!");
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if ( xmlStrEqual( currentName, ( const xmlChar* ) "way" ) == 1 ) {
|
if ( xmlStrEqual( currentName, ( const xmlChar* ) "way" ) == 1 ) {
|
||||||
string name;
|
string name;
|
||||||
_Way way = _ReadXMLWay( );
|
_Way way = _ReadXMLWay( );
|
||||||
if(!(*wayCallback)(way)) {
|
|
||||||
std::cerr << "[XMLParser] way not parsed" << std::endl;
|
/** Pass the unpacked way to the LUA call back **/
|
||||||
|
int ret = -1;
|
||||||
|
try {
|
||||||
|
ret = luabind::call_function<int>(
|
||||||
|
myLuaState,
|
||||||
|
"way_function",
|
||||||
|
boost::ref(way),
|
||||||
|
way.path.size()
|
||||||
|
);
|
||||||
|
if(!(*wayCallback)(way)) {
|
||||||
|
std::cerr << "[PBFParser] way not parsed" << std::endl;
|
||||||
|
}
|
||||||
|
} catch (const luabind::error &er) {
|
||||||
|
cerr << er.what() << endl;
|
||||||
|
lua_State* Ler=er.state();
|
||||||
|
report_errors(Ler, -1);
|
||||||
|
}
|
||||||
|
catch (...) {
|
||||||
|
cerr<<"Unknown error!"<<endl;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if ( xmlStrEqual( currentName, ( const xmlChar* ) "relation" ) == 1 ) {
|
if ( xmlStrEqual( currentName, ( const xmlChar* ) "relation" ) == 1 ) {
|
||||||
@ -157,12 +192,6 @@ private:
|
|||||||
|
|
||||||
_Way _ReadXMLWay( ) {
|
_Way _ReadXMLWay( ) {
|
||||||
_Way way;
|
_Way way;
|
||||||
way.direction = _Way::notSure;
|
|
||||||
way.speed = -1;
|
|
||||||
way.type = -1;
|
|
||||||
way.useful = false;
|
|
||||||
way.access = true;
|
|
||||||
// cout << "new way" << endl;
|
|
||||||
if ( xmlTextReaderIsEmptyElement( inputReader ) != 1 ) {
|
if ( xmlTextReaderIsEmptyElement( inputReader ) != 1 ) {
|
||||||
const int depth = xmlTextReaderDepth( inputReader );
|
const int depth = xmlTextReaderDepth( inputReader );
|
||||||
while ( xmlTextReaderRead( inputReader ) == 1 ) {
|
while ( xmlTextReaderRead( inputReader ) == 1 ) {
|
||||||
|
125
extractor.cpp
125
extractor.cpp
@ -51,6 +51,8 @@ extern "C" {
|
|||||||
#include "typedefs.h"
|
#include "typedefs.h"
|
||||||
#include "DataStructures/InputReaderFactory.h"
|
#include "DataStructures/InputReaderFactory.h"
|
||||||
#include "Extractor/ExtractorCallbacks.h"
|
#include "Extractor/ExtractorCallbacks.h"
|
||||||
|
#include "Extractor/ExtractionContainers.h"
|
||||||
|
#include "Extractor/ExtractionHelperFunctions.h"
|
||||||
#include "Extractor/ExtractorStructs.h"
|
#include "Extractor/ExtractorStructs.h"
|
||||||
#include "Extractor/LuaUtil.h"
|
#include "Extractor/LuaUtil.h"
|
||||||
#include "Extractor/PBFParser.h"
|
#include "Extractor/PBFParser.h"
|
||||||
@ -60,8 +62,6 @@ extern "C" {
|
|||||||
#include "Util/MachineInfo.h"
|
#include "Util/MachineInfo.h"
|
||||||
#include "Util/StringUtil.h"
|
#include "Util/StringUtil.h"
|
||||||
|
|
||||||
#include "Extractor/ExtractionContainers.h"
|
|
||||||
|
|
||||||
using namespace std;
|
using namespace std;
|
||||||
|
|
||||||
typedef BaseConfiguration ExtractorConfiguration;
|
typedef BaseConfiguration ExtractorConfiguration;
|
||||||
@ -111,91 +111,6 @@ int main (int argc, char *argv[]) {
|
|||||||
restrictionsFileName.append(".osrm.restrictions");
|
restrictionsFileName.append(".osrm.restrictions");
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
std::string adressFileName(outputFileName);
|
|
||||||
Settings settings;
|
|
||||||
|
|
||||||
boost::property_tree::ptree pt;
|
|
||||||
try {
|
|
||||||
INFO("Loading speed profiles");
|
|
||||||
boost::property_tree::ini_parser::read_ini("speedprofile.ini", pt);
|
|
||||||
INFO("Found the following speed profiles: ");
|
|
||||||
int profileCounter(0);
|
|
||||||
BOOST_FOREACH(boost::property_tree::ptree::value_type &v, pt.get_child("")) {
|
|
||||||
std::string name = v.first;
|
|
||||||
cout << " [" << profileCounter << "]" << name << endl;
|
|
||||||
++profileCounter;
|
|
||||||
}
|
|
||||||
std::string usedSpeedProfile(pt.get_child("").begin()->first);
|
|
||||||
INFO("Using profile \"" << usedSpeedProfile << "\"")
|
|
||||||
BOOST_FOREACH(boost::property_tree::ptree::value_type &v, pt.get_child(usedSpeedProfile)) {
|
|
||||||
std::string name = v.first;
|
|
||||||
std::string value = v.second.get<std::string>("");
|
|
||||||
DEBUG("inserting " << name << "=" << value);
|
|
||||||
if(name == "obeyOneways") {
|
|
||||||
if(value == "no")
|
|
||||||
settings.obeyOneways = false;
|
|
||||||
} else if(name == "obeyBollards") {
|
|
||||||
if(value == "no") {
|
|
||||||
settings.obeyBollards = false;
|
|
||||||
}
|
|
||||||
} else if(name == "useRestrictions") {
|
|
||||||
if(value == "no")
|
|
||||||
settings.useRestrictions = false;
|
|
||||||
} else if(name == "accessTags") {
|
|
||||||
std::vector<std::string> tokens;
|
|
||||||
stringSplit(value, ',', tokens);
|
|
||||||
settings.accessTags = tokens;
|
|
||||||
} else if(name == "excludeFromGrid") {
|
|
||||||
settings.excludeFromGrid = value;
|
|
||||||
} else if(name == "defaultSpeed") {
|
|
||||||
settings.defaultSpeed = atoi(value.c_str());
|
|
||||||
settings.speedProfile["default"] = std::make_pair(settings.defaultSpeed, settings.speedProfile.size() );
|
|
||||||
} else if( name == "takeMinimumOfSpeeds") {
|
|
||||||
settings.takeMinimumOfSpeeds = ("yes" == value);
|
|
||||||
} else if( name == "ignoreAreas") {
|
|
||||||
settings.ignoreAreas = ("yes" == value);
|
|
||||||
} else if( name == "accessRestrictedService") {
|
|
||||||
//split value at commas
|
|
||||||
std::vector<std::string> tokens;
|
|
||||||
stringSplit(value, ',', tokens);
|
|
||||||
//put each value into map
|
|
||||||
BOOST_FOREACH(std::string & s, tokens) {
|
|
||||||
INFO("adding " << s << " to accessRestrictedService");
|
|
||||||
settings.accessRestrictedService.insert(std::make_pair(s, true));
|
|
||||||
}
|
|
||||||
} else if( name == "accessRestrictionKeys") {
|
|
||||||
//split value at commas
|
|
||||||
std::vector<std::string> tokens;
|
|
||||||
stringSplit(value, ',', tokens);
|
|
||||||
//put each value into map
|
|
||||||
BOOST_FOREACH(std::string & s, tokens) {
|
|
||||||
INFO("adding " << s << " to accessRestrictionKeys");
|
|
||||||
settings.accessRestrictionKeys.insert(std::make_pair(s, true));
|
|
||||||
}
|
|
||||||
} else if( name == "accessForbiddenKeys") {
|
|
||||||
//split value at commas
|
|
||||||
std::vector<std::string> tokens;
|
|
||||||
stringSplit(value, ',', tokens);
|
|
||||||
//put each value into map
|
|
||||||
BOOST_FOREACH(std::string & s, tokens) {
|
|
||||||
INFO("adding " << s << " to accessForbiddenKeys");
|
|
||||||
settings.accessForbiddenKeys.insert(std::make_pair(s, true));
|
|
||||||
}
|
|
||||||
} else if( name == "accessForbiddenDefault") {
|
|
||||||
//split value at commas
|
|
||||||
std::vector<std::string> tokens;
|
|
||||||
stringSplit(value, ',', tokens);
|
|
||||||
//put each value into map
|
|
||||||
BOOST_FOREACH(std::string & s, tokens) {
|
|
||||||
INFO("adding " << s << " to accessForbiddenDefault");
|
|
||||||
settings.accessForbiddenDefault.insert(std::make_pair(s, true));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
settings.speedProfile[name] = std::make_pair(std::atoi(value.c_str()), settings.speedProfile.size() );
|
|
||||||
}
|
|
||||||
} catch(std::exception& e) {
|
|
||||||
ERR("caught: " << e.what() );
|
|
||||||
}
|
|
||||||
|
|
||||||
/*** Setup Scripting Environment ***/
|
/*** Setup Scripting Environment ***/
|
||||||
|
|
||||||
@ -207,7 +122,10 @@ int main (int argc, char *argv[]) {
|
|||||||
|
|
||||||
// Add our function to the state's global scope
|
// Add our function to the state's global scope
|
||||||
luabind::module(myLuaState) [
|
luabind::module(myLuaState) [
|
||||||
luabind::def("print", LUA_print<std::string>)
|
luabind::def("print", LUA_print<std::string>),
|
||||||
|
luabind::def("parseMaxspeed", parseMaxspeed),
|
||||||
|
luabind::def("durationIsValid", durationIsValid),
|
||||||
|
luabind::def("parseDuration", parseDuration)
|
||||||
];
|
];
|
||||||
|
|
||||||
if(0 != luaL_dostring(
|
if(0 != luaL_dostring(
|
||||||
@ -233,13 +151,35 @@ int main (int argc, char *argv[]) {
|
|||||||
.def_readwrite("traffic_light", &ImportNode::trafficLight)
|
.def_readwrite("traffic_light", &ImportNode::trafficLight)
|
||||||
.def_readwrite("tags", &ImportNode::keyVals)
|
.def_readwrite("tags", &ImportNode::keyVals)
|
||||||
];
|
];
|
||||||
|
|
||||||
|
luabind::module(myLuaState) [
|
||||||
|
luabind::class_<_Way>("Way")
|
||||||
|
.def(luabind::constructor<>())
|
||||||
|
.def_readwrite("name", &_Way::name)
|
||||||
|
.def_readwrite("speed", &_Way::speed)
|
||||||
|
.def_readwrite("type", &_Way::type)
|
||||||
|
.def_readwrite("access", &_Way::access)
|
||||||
|
.def_readwrite("roundabout", &_Way::roundabout)
|
||||||
|
.def_readwrite("is_duration_set", &_Way::isDurationSet)
|
||||||
|
.def_readwrite("is_access_restricted", &_Way::isAccessRestricted)
|
||||||
|
.def_readwrite("ignore_in_grid", &_Way::ignoreInGrid)
|
||||||
|
.def_readwrite("tags", &_Way::keyVals)
|
||||||
|
.def_readwrite("direction", &_Way::direction)
|
||||||
|
.enum_("constants")
|
||||||
|
[
|
||||||
|
luabind::value("notSure", 0),
|
||||||
|
luabind::value("oneway", 1),
|
||||||
|
luabind::value("bidirectional", 2),
|
||||||
|
luabind::value("opposite", 3)
|
||||||
|
]
|
||||||
|
];
|
||||||
// Now call our function in a lua script
|
// Now call our function in a lua script
|
||||||
if(0 != luaL_dofile(myLuaState, "profile.lua")) {
|
if(0 != luaL_dofile(myLuaState, "profile.lua")) {
|
||||||
ERR(lua_tostring(myLuaState,-1)<< " occured in scripting block");
|
ERR(lua_tostring(myLuaState,-1)<< " occured in scripting block");
|
||||||
}
|
}
|
||||||
|
|
||||||
//open string library;
|
//open utility libraries string library;
|
||||||
luaopen_string(myLuaState);
|
luaL_openlibs(myLuaState);
|
||||||
|
|
||||||
/*** End of Scripting Environment Setup; ***/
|
/*** End of Scripting Environment Setup; ***/
|
||||||
|
|
||||||
@ -260,7 +200,7 @@ int main (int argc, char *argv[]) {
|
|||||||
ExtractionContainers externalMemory;
|
ExtractionContainers externalMemory;
|
||||||
|
|
||||||
stringMap[""] = 0;
|
stringMap[""] = 0;
|
||||||
extractCallBacks = new ExtractorCallbacks(&externalMemory, settings, &stringMap);
|
extractCallBacks = new ExtractorCallbacks(&externalMemory, &stringMap);
|
||||||
BaseParser<_Node, _RawRestrictionContainer, _Way> * parser;
|
BaseParser<_Node, _RawRestrictionContainer, _Way> * parser;
|
||||||
if(isPBF) {
|
if(isPBF) {
|
||||||
parser = new PBFParser(argv[1]);
|
parser = new PBFParser(argv[1]);
|
||||||
@ -274,7 +214,7 @@ int main (int argc, char *argv[]) {
|
|||||||
INFO("Parser not initialized!");
|
INFO("Parser not initialized!");
|
||||||
parser->Parse();
|
parser->Parse();
|
||||||
|
|
||||||
externalMemory.PrepareData(settings, outputFileName, restrictionsFileName, amountOfRAM);
|
externalMemory.PrepareData(outputFileName, restrictionsFileName, amountOfRAM);
|
||||||
|
|
||||||
stringMap.clear();
|
stringMap.clear();
|
||||||
delete parser;
|
delete parser;
|
||||||
@ -289,7 +229,6 @@ bool nodeFunction(_Node n) {
|
|||||||
extractCallBacks->nodeFunction(n);
|
extractCallBacks->nodeFunction(n);
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool restrictionFunction(_RawRestrictionContainer r) {
|
bool restrictionFunction(_RawRestrictionContainer r) {
|
||||||
extractCallBacks->restrictionFunction(r);
|
extractCallBacks->restrictionFunction(r);
|
||||||
++globalRestrictionCounter;
|
++globalRestrictionCounter;
|
||||||
|
155
profile.lua
155
profile.lua
@ -1,27 +1,168 @@
|
|||||||
|
-- Begin of globals
|
||||||
|
|
||||||
bollards_whitelist = { [""] = true, ["cattle_grid"] = true, ["border_control"] = true, ["toll_booth"] = true, ["no"] = true}
|
bollards_whitelist = { [""] = true, ["cattle_grid"] = true, ["border_control"] = true, ["toll_booth"] = true, ["no"] = true}
|
||||||
access_whitelist = { ["yes"] = true, ["motorcar"] = true, ["permissive"] = true }
|
access_tag_whitelist = { ["yes"] = true, ["motorcar"] = true, ["motor_vehicle"] = true, ["vehicle"] = true, ["permissive"] = true, ["designated"] = true }
|
||||||
access_blacklist = { ["no"] = true, ["private"] = true, ["agricultural"] = true, ["forestery"] = true }
|
access_tag_blacklist = { ["no"] = true, ["private"] = true, ["agricultural"] = true, ["forestery"] = true }
|
||||||
|
access_tag_restricted = { ["destination"] = true, ["delivery"] = true }
|
||||||
|
service_tag_restricted = { ["parking_aisle"] = true }
|
||||||
|
ignore_in_grid = { ["ferry"] = true, ["pier"] = true }
|
||||||
|
|
||||||
|
speed_profile = {
|
||||||
|
["motorway"] = 90,
|
||||||
|
["motorway_link"] = 75,
|
||||||
|
["trunk"] = 85,
|
||||||
|
["trunk_link"] = 70,
|
||||||
|
["primary"] = 65,
|
||||||
|
["primary_link"] = 60,
|
||||||
|
["secondary"] = 55,
|
||||||
|
["secondary_link"] = 50,
|
||||||
|
["tertiary"] = 40,
|
||||||
|
["tertiary_link"] = 30,
|
||||||
|
["unclassified"] = 25,
|
||||||
|
["residential"] = 25,
|
||||||
|
["living_street"] = 10,
|
||||||
|
["service"] = 15,
|
||||||
|
-- ["track"] = 5,
|
||||||
|
["ferry"] = 5,
|
||||||
|
["pier"] = 5,
|
||||||
|
["default"] = 50
|
||||||
|
}
|
||||||
|
|
||||||
|
take_minimum_of_speeds = true
|
||||||
|
obey_oneway = true
|
||||||
|
|
||||||
|
-- End of globals
|
||||||
|
|
||||||
function node_function (node)
|
function node_function (node)
|
||||||
local barrier = node.tags:Find("barrier")
|
local barrier = node.tags:Find ("barrier")
|
||||||
local access = node.tags:Find("access")
|
local access = node.tags:Find ("access")
|
||||||
local traffic_signal = node.tags:Find("highway")
|
local traffic_signal = node.tags:Find("highway")
|
||||||
|
|
||||||
if traffic_signal == "traffic_signals" then
|
if traffic_signal == "traffic_signals" then
|
||||||
node.traffic_light = true;
|
node.traffic_light = true;
|
||||||
end
|
end
|
||||||
|
|
||||||
if access_blacklist[barrier] then
|
if access_tag_blacklist[barrier] then
|
||||||
node.bollard = true;
|
node.bollard = true;
|
||||||
end
|
end
|
||||||
|
|
||||||
if not bollards_whitelist[barrier] then
|
if not bollards_whitelist[barrier] and not access_tag_whitelist[barrier] then
|
||||||
node.bollard = true;
|
node.bollard = true;
|
||||||
end
|
end
|
||||||
return 1
|
return 1
|
||||||
end
|
end
|
||||||
|
|
||||||
function way_function (way)
|
function way_function (way, numberOfNodesInWay)
|
||||||
|
|
||||||
|
-- A way must have two nodes or more
|
||||||
|
if(numberOfNodesInWay < 2) then
|
||||||
|
return 0;
|
||||||
|
end
|
||||||
|
|
||||||
|
-- First, get the properties of each way that we come across
|
||||||
|
local highway = way.tags:Find("highway")
|
||||||
|
local name = way.tags:Find("name")
|
||||||
|
local ref = way.tags:Find("ref")
|
||||||
|
local junction = way.tags:Find("junction")
|
||||||
|
local route = way.tags:Find("route")
|
||||||
|
local maxspeed = parseMaxspeed(way.tags:Find ( "maxspeed") )
|
||||||
|
local man_made = way.tags:Find("man_made")
|
||||||
|
local barrier = way.tags:Find("barrier")
|
||||||
|
local oneway = way.tags:Find("oneway")
|
||||||
|
local cycleway = way.tags:Find("cycleway")
|
||||||
|
local duration = way.tags:Find("duration")
|
||||||
|
local service = way.tags:Find("service")
|
||||||
|
local area = way.tags:Find("area")
|
||||||
|
local access = way.tags:Find("access")
|
||||||
|
|
||||||
|
-- Second parse the way according to these properties
|
||||||
|
|
||||||
|
if("yes" == area) then
|
||||||
|
return 0
|
||||||
|
end
|
||||||
|
|
||||||
|
-- Check if we are allowed to access the way
|
||||||
|
if access_tag_blacklist[access] ~=nil and access_tag_blacklist[access] then
|
||||||
|
return 0;
|
||||||
|
end
|
||||||
|
|
||||||
|
if "" ~= ref then
|
||||||
|
way.name = ref
|
||||||
|
elseif "" ~= name then
|
||||||
|
way.name = name
|
||||||
|
end
|
||||||
|
|
||||||
|
if "roundabout" == junction then
|
||||||
|
way.roundabout = true;
|
||||||
|
end
|
||||||
|
|
||||||
|
-- Handling ferries and piers
|
||||||
|
|
||||||
|
if (speed_profile[route] ~= nil and speed_profile[route] > 0) or
|
||||||
|
(speed_profile[man_made] ~= nil and speed_profile[man_made] > 0)
|
||||||
|
then
|
||||||
|
if durationIsValid(duration) then
|
||||||
|
way.speed = parseDuration / math.max(1, numberOfSegments-1);
|
||||||
|
way.is_duration_set = true;
|
||||||
|
end
|
||||||
|
way.direction = Way.bidirectional;
|
||||||
|
if speed_profile[route] ~= nil then
|
||||||
|
highway = route;
|
||||||
|
elseif speed_profile[man_made] ~= nil then
|
||||||
|
highway = man_made;
|
||||||
|
end
|
||||||
|
if not way.is_duration_set then
|
||||||
|
way.speed = speed_profile[highway]
|
||||||
|
end
|
||||||
|
|
||||||
|
end
|
||||||
|
|
||||||
|
-- Set the avg speed on the way if it is accessible by road class
|
||||||
|
if (speed_profile[highway] ~= nil and way.speed == -1 ) then
|
||||||
|
if (0 < maxspeed and not take_minimum_of_speeds) or (maxspeed == 0) then
|
||||||
|
maxspeed = math.huge
|
||||||
|
end
|
||||||
|
way.speed = math.min(speed_profile[highway], maxspeed)
|
||||||
|
end
|
||||||
|
|
||||||
|
-- Set the avg speed on ways that are marked accessible
|
||||||
|
if access_tag_whitelist[access] and way.speed == -1 then
|
||||||
|
if (0 < maxspeed and not take_minimum_of_speeds) or maxspeed == 0 then
|
||||||
|
maxspeed = math.huge
|
||||||
|
end
|
||||||
|
way.speed = math.min(speed_profile["default"], maxspeed)
|
||||||
|
end
|
||||||
|
|
||||||
|
-- Set access restriction flag if access is allowed under certain restrictions only
|
||||||
|
if access ~= "" and access_tag_restricted[access] then
|
||||||
|
way.is_access_restricted = true
|
||||||
|
end
|
||||||
|
|
||||||
|
-- Set access restriction flag if service is allowed under certain restrictions only
|
||||||
|
if service ~= "" and service_tag_restricted[service] then
|
||||||
|
way.is_access_restricted = true
|
||||||
|
end
|
||||||
|
|
||||||
|
-- Set direction according to tags on way
|
||||||
|
if obey_oneway then
|
||||||
|
if oneway == "no" or oneway == "0" or oneway == "false" then
|
||||||
|
way.direction = Way.bidirectional
|
||||||
|
elseif oneway == "-1" then
|
||||||
|
way.direction = Way.opposite
|
||||||
|
elseif oneway == "yes" or oneway == "1" or oneway == "true" or junction == "roundabout" or highway == "motorway_link" or highway == "motorway" then
|
||||||
|
way.direction = Way.oneway
|
||||||
|
else
|
||||||
|
way.direction = Way.bidirectional
|
||||||
|
end
|
||||||
|
else
|
||||||
|
way.direction = Way.bidirectional
|
||||||
|
end
|
||||||
|
|
||||||
|
-- Override general direction settings of there is a specific one for our mode of travel
|
||||||
|
|
||||||
|
if ignore_in_grid[highway] ~= nil and ignore_in_grid[highway] then
|
||||||
|
way.ignore_in_grid = true
|
||||||
|
end
|
||||||
|
way.type = 1
|
||||||
return 1
|
return 1
|
||||||
end
|
end
|
||||||
|
Loading…
Reference in New Issue
Block a user