Removing last remaining 'using namespace std' statement
This commit is contained in:
parent
943c15927a
commit
8fc8a4e303
@ -33,12 +33,12 @@ or see http://www.gnu.org/licenses/agpl.txt.
|
|||||||
|
|
||||||
typedef
|
typedef
|
||||||
boost::archive::iterators::base64_from_binary<
|
boost::archive::iterators::base64_from_binary<
|
||||||
boost::archive::iterators::transform_width<string::const_iterator, 6, 8>
|
boost::archive::iterators::transform_width<std::string::const_iterator, 6, 8>
|
||||||
> base64_t;
|
> base64_t;
|
||||||
|
|
||||||
typedef
|
typedef
|
||||||
boost::archive::iterators::transform_width<
|
boost::archive::iterators::transform_width<
|
||||||
boost::archive::iterators::binary_from_base64<string::const_iterator>, 8, 6
|
boost::archive::iterators::binary_from_base64<std::string::const_iterator>, 8, 6
|
||||||
> binary_t;
|
> binary_t;
|
||||||
|
|
||||||
template<class ToEncodeT>
|
template<class ToEncodeT>
|
||||||
@ -54,7 +54,7 @@ static void EncodeObjectToBase64(const ToEncodeT & object, std::string& encoded)
|
|||||||
template<class ToEncodeT>
|
template<class ToEncodeT>
|
||||||
static void DecodeObjectFromBase64(ToEncodeT & object, const std::string& _encoded) {
|
static void DecodeObjectFromBase64(ToEncodeT & object, const std::string& _encoded) {
|
||||||
try {
|
try {
|
||||||
string encoded(_encoded);
|
std::string encoded(_encoded);
|
||||||
//replace "-" with "+" and "_" with "/"
|
//replace "-" with "+" and "_" with "/"
|
||||||
replaceAll(encoded, "-", "+");
|
replaceAll(encoded, "-", "+");
|
||||||
replaceAll(encoded, "_", "/");
|
replaceAll(encoded, "_", "/");
|
||||||
|
@ -43,21 +43,21 @@ int readFromBz2Stream( void* pointer, char* buffer, int len ) {
|
|||||||
return read;
|
return read;
|
||||||
} else if(BZ_STREAM_END == context->error) {
|
} else if(BZ_STREAM_END == context->error) {
|
||||||
BZ2_bzReadGetUnused(&context->error, context->bz2, &unusedTmpVoid, &context->nUnused);
|
BZ2_bzReadGetUnused(&context->error, context->bz2, &unusedTmpVoid, &context->nUnused);
|
||||||
if(BZ_OK != context->error) { cerr << "Could not BZ2_bzReadGetUnused" << endl; exit(-1);};
|
if(BZ_OK != context->error) {std::cerr << "Could not BZ2_bzReadGetUnused" <<std::endl; exit(-1);};
|
||||||
unusedTmp = (char*)unusedTmpVoid;
|
unusedTmp = (char*)unusedTmpVoid;
|
||||||
for(int i=0;i<context->nUnused;i++) {
|
for(int i=0;i<context->nUnused;i++) {
|
||||||
context->unused[i] = unusedTmp[i];
|
context->unused[i] = unusedTmp[i];
|
||||||
}
|
}
|
||||||
BZ2_bzReadClose(&context->error, context->bz2);
|
BZ2_bzReadClose(&context->error, context->bz2);
|
||||||
if(BZ_OK != context->error) { cerr << "Could not BZ2_bzReadClose" << endl; exit(-1);};
|
if(BZ_OK != context->error) {std::cerr << "Could not BZ2_bzReadClose" <<std::endl; exit(-1);};
|
||||||
context->error = BZ_STREAM_END; // set to the stream end for next call to this function
|
context->error = BZ_STREAM_END; // set to the stream end for next call to this function
|
||||||
if(0 == context->nUnused && feof(context->file)) {
|
if(0 == context->nUnused && feof(context->file)) {
|
||||||
return read;
|
return read;
|
||||||
} else {
|
} else {
|
||||||
context->bz2 = BZ2_bzReadOpen(&context->error, context->file, 0, 0, context->unused, context->nUnused);
|
context->bz2 = BZ2_bzReadOpen(&context->error, context->file, 0, 0, context->unused, context->nUnused);
|
||||||
if(NULL == context->bz2){ cerr << "Could not open file" << endl; exit(-1);};
|
if(NULL == context->bz2){std::cerr << "Could not open file" <<std::endl; exit(-1);};
|
||||||
}
|
}
|
||||||
} else { cerr << "Could not read bz2 file" << endl; exit(-1); }
|
} else { std::cerr << "Could not read bz2 file" << std::endl; exit(-1); }
|
||||||
}
|
}
|
||||||
return read;
|
return read;
|
||||||
}
|
}
|
||||||
@ -74,7 +74,7 @@ xmlTextReaderPtr inputReaderFactory( const char* name )
|
|||||||
{
|
{
|
||||||
std::string inputName(name);
|
std::string inputName(name);
|
||||||
|
|
||||||
if(inputName.find(".osm.bz2")!=string::npos)
|
if(inputName.find(".osm.bz2")!=std::string::npos)
|
||||||
{
|
{
|
||||||
BZ2Context* context = new BZ2Context();
|
BZ2Context* context = new BZ2Context();
|
||||||
context->error = false;
|
context->error = false;
|
||||||
|
@ -48,10 +48,10 @@ template<class EdgeData, class GraphT>
|
|||||||
struct SearchEngineData {
|
struct SearchEngineData {
|
||||||
typedef SearchEngineHeapPtr HeapPtr;
|
typedef SearchEngineHeapPtr HeapPtr;
|
||||||
typedef GraphT Graph;
|
typedef GraphT Graph;
|
||||||
SearchEngineData(GraphT * g, NodeInformationHelpDesk * nh, std::vector<string> & n) :graph(g), nodeHelpDesk(nh), names(n) {}
|
SearchEngineData(GraphT * g, NodeInformationHelpDesk * nh, std::vector<std::string> & n) :graph(g), nodeHelpDesk(nh), names(n) {}
|
||||||
const GraphT * graph;
|
const GraphT * graph;
|
||||||
NodeInformationHelpDesk * nodeHelpDesk;
|
NodeInformationHelpDesk * nodeHelpDesk;
|
||||||
std::vector<string> & names;
|
std::vector<std::string> & names;
|
||||||
static HeapPtr forwardHeap;
|
static HeapPtr forwardHeap;
|
||||||
static HeapPtr backwardHeap;
|
static HeapPtr backwardHeap;
|
||||||
static HeapPtr forwardHeap2;
|
static HeapPtr forwardHeap2;
|
||||||
@ -113,7 +113,7 @@ public:
|
|||||||
ShortestPathRouting<SearchEngineDataT> shortestPath;
|
ShortestPathRouting<SearchEngineDataT> shortestPath;
|
||||||
AlternativeRouting<SearchEngineDataT> alternativePaths;
|
AlternativeRouting<SearchEngineDataT> alternativePaths;
|
||||||
|
|
||||||
SearchEngine(GraphT * g, NodeInformationHelpDesk * nh, std::vector<string> & n) :
|
SearchEngine(GraphT * g, NodeInformationHelpDesk * nh, std::vector<std::string> & n) :
|
||||||
_queryData(g, nh, n),
|
_queryData(g, nh, n),
|
||||||
shortestPath(_queryData),
|
shortestPath(_queryData),
|
||||||
alternativePaths(_queryData)
|
alternativePaths(_queryData)
|
||||||
|
@ -92,7 +92,7 @@ bool ExtractorCallbacks::wayFunction(_Way &w) {
|
|||||||
std::reverse( w.path.begin(), w.path.end() );
|
std::reverse( w.path.begin(), w.path.end() );
|
||||||
}
|
}
|
||||||
|
|
||||||
for(vector< NodeID >::size_type n = 0; n < w.path.size()-1; ++n) {
|
for(std::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, w.ignoreInGrid, 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]);
|
||||||
}
|
}
|
||||||
|
@ -110,7 +110,7 @@ struct _Edge {
|
|||||||
return _Edge(0,0);
|
return _Edge(0,0);
|
||||||
}
|
}
|
||||||
static _Edge max_value() {
|
static _Edge max_value() {
|
||||||
return _Edge((numeric_limits<unsigned>::max)(), (numeric_limits<unsigned>::max)());
|
return _Edge((std::numeric_limits<unsigned>::max)(), (std::numeric_limits<unsigned>::max)());
|
||||||
}
|
}
|
||||||
|
|
||||||
};
|
};
|
||||||
@ -125,10 +125,10 @@ struct _WayIDStartAndEndEdge {
|
|||||||
_WayIDStartAndEndEdge(unsigned w, NodeID fs, NodeID ft, NodeID ls, NodeID lt) : wayID(w), firstStart(fs), firstTarget(ft), lastStart(ls), lastTarget(lt) {}
|
_WayIDStartAndEndEdge(unsigned w, NodeID fs, NodeID ft, NodeID ls, NodeID lt) : wayID(w), firstStart(fs), firstTarget(ft), lastStart(ls), lastTarget(lt) {}
|
||||||
|
|
||||||
static _WayIDStartAndEndEdge min_value() {
|
static _WayIDStartAndEndEdge min_value() {
|
||||||
return _WayIDStartAndEndEdge((numeric_limits<unsigned>::min)(), (numeric_limits<unsigned>::min)(), (numeric_limits<unsigned>::min)(), (numeric_limits<unsigned>::min)(), (numeric_limits<unsigned>::min)());
|
return _WayIDStartAndEndEdge((std::numeric_limits<unsigned>::min)(), (std::numeric_limits<unsigned>::min)(), (std::numeric_limits<unsigned>::min)(), (std::numeric_limits<unsigned>::min)(), (std::numeric_limits<unsigned>::min)());
|
||||||
}
|
}
|
||||||
static _WayIDStartAndEndEdge max_value() {
|
static _WayIDStartAndEndEdge max_value() {
|
||||||
return _WayIDStartAndEndEdge((numeric_limits<unsigned>::max)(), (numeric_limits<unsigned>::max)(), (numeric_limits<unsigned>::max)(), (numeric_limits<unsigned>::max)(), (numeric_limits<unsigned>::max)());
|
return _WayIDStartAndEndEdge((std::numeric_limits<unsigned>::max)(), (std::numeric_limits<unsigned>::max)(), (std::numeric_limits<unsigned>::max)(), (std::numeric_limits<unsigned>::max)(), (std::numeric_limits<unsigned>::max)());
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
@ -202,7 +202,7 @@ struct CmpEdgeByTargetID : public std::binary_function<_Edge, _Edge, bool>
|
|||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
inline string GetRandomString() {
|
inline std::string GetRandomString() {
|
||||||
char s[128];
|
char s[128];
|
||||||
static const char alphanum[] =
|
static const char alphanum[] =
|
||||||
"0123456789"
|
"0123456789"
|
||||||
@ -213,7 +213,7 @@ inline string GetRandomString() {
|
|||||||
s[i] = alphanum[rand() % (sizeof(alphanum) - 1)];
|
s[i] = alphanum[rand() % (sizeof(alphanum) - 1)];
|
||||||
}
|
}
|
||||||
s[127] = 0;
|
s[127] = 0;
|
||||||
return string(s);
|
return std::string(s);
|
||||||
}
|
}
|
||||||
|
|
||||||
#endif /* EXTRACTORSTRUCTS_H_ */
|
#endif /* EXTRACTORSTRUCTS_H_ */
|
||||||
|
@ -75,7 +75,7 @@ public:
|
|||||||
if(!externalMemory->nodeFunction(n))
|
if(!externalMemory->nodeFunction(n))
|
||||||
std::cerr << "[XMLParser] dense node not parsed" << std::endl;
|
std::cerr << "[XMLParser] dense node not parsed" << std::endl;
|
||||||
} catch (const luabind::error &er) {
|
} catch (const luabind::error &er) {
|
||||||
cerr << er.what() << endl;
|
std::cerr << er.what() << std::endl;
|
||||||
lua_State* Ler=er.state();
|
lua_State* Ler=er.state();
|
||||||
report_errors(Ler, -1);
|
report_errors(Ler, -1);
|
||||||
} catch (std::exception & e) {
|
} catch (std::exception & e) {
|
||||||
@ -86,7 +86,6 @@ public:
|
|||||||
}
|
}
|
||||||
|
|
||||||
if ( xmlStrEqual( currentName, ( const xmlChar* ) "way" ) == 1 ) {
|
if ( xmlStrEqual( currentName, ( const xmlChar* ) "way" ) == 1 ) {
|
||||||
string name;
|
|
||||||
_Way way = _ReadXMLWay( );
|
_Way way = _ReadXMLWay( );
|
||||||
|
|
||||||
/** Pass the unpacked way to the LUA call back **/
|
/** Pass the unpacked way to the LUA call back **/
|
||||||
@ -101,7 +100,7 @@ public:
|
|||||||
std::cerr << "[PBFParser] way not parsed" << std::endl;
|
std::cerr << "[PBFParser] way not parsed" << std::endl;
|
||||||
}
|
}
|
||||||
} catch (const luabind::error &er) {
|
} catch (const luabind::error &er) {
|
||||||
cerr << er.what() << endl;
|
std::cerr << er.what() << std::endl;
|
||||||
lua_State* Ler=er.state();
|
lua_State* Ler=er.state();
|
||||||
report_errors(Ler, -1);
|
report_errors(Ler, -1);
|
||||||
} catch (std::exception & e) {
|
} catch (std::exception & e) {
|
||||||
|
@ -67,12 +67,12 @@ int main (int argc, char *argv[]) {
|
|||||||
isPBF = true;
|
isPBF = true;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if(pos!=string::npos) {
|
if(pos!=std::string::npos) {
|
||||||
outputFileName.replace(pos, 8, ".osrm");
|
outputFileName.replace(pos, 8, ".osrm");
|
||||||
restrictionsFileName.replace(pos, 8, ".osrm.restrictions");
|
restrictionsFileName.replace(pos, 8, ".osrm.restrictions");
|
||||||
} else {
|
} else {
|
||||||
pos=outputFileName.find(".osm");
|
pos=outputFileName.find(".osm");
|
||||||
if(pos!=string::npos) {
|
if(pos!=std::string::npos) {
|
||||||
outputFileName.replace(pos, 5, ".osrm");
|
outputFileName.replace(pos, 5, ".osrm");
|
||||||
restrictionsFileName.replace(pos, 5, ".osrm.restrictions");
|
restrictionsFileName.replace(pos, 5, ".osrm.restrictions");
|
||||||
} else {
|
} else {
|
||||||
|
@ -35,13 +35,6 @@ or see http://www.gnu.org/licenses/agpl.txt.
|
|||||||
|
|
||||||
#include <iostream>
|
#include <iostream>
|
||||||
|
|
||||||
using namespace std;
|
|
||||||
|
|
||||||
#ifdef STXXL_VERBOSE_LEVEL
|
|
||||||
#undef STXXL_VERBOSE_LEVEL
|
|
||||||
#endif
|
|
||||||
#define STXXL_VERBOSE_LEVEL -100
|
|
||||||
|
|
||||||
#define INFO(x) do {std::cout << "[info " << __FILE__ << ":" << __LINE__ << "] " << x << std::endl;} while(0);
|
#define INFO(x) do {std::cout << "[info " << __FILE__ << ":" << __LINE__ << "] " << x << std::endl;} while(0);
|
||||||
#define ERR(x) do {std::cerr << "[error " << __FILE__ << ":" << __LINE__ << "] " << x << std::endl; std::exit(-1);} while(0);
|
#define ERR(x) do {std::cerr << "[error " << __FILE__ << ":" << __LINE__ << "] " << x << std::endl; std::exit(-1);} while(0);
|
||||||
#define WARN(x) do {std::cerr << "[warn " << __FILE__ << ":" << __LINE__ << "] " << x << std::endl;} while(0);
|
#define WARN(x) do {std::cerr << "[warn " << __FILE__ << ":" << __LINE__ << "] " << x << std::endl;} while(0);
|
||||||
|
Loading…
Reference in New Issue
Block a user