#include "osm.h" #include "LibxmlParser.h" #include "ExpatParser.h" #include #include #include #include #include #include using namespace std; bool osm_dataset::load(const char* filename,const std::string& parser) { if(parser=="libxml2") { cerr<<"osm::dataset::load"; xmlSAXHandler my_handler; cerr<<"memset"<to_string(); } for(int count=0; countto_string(); } return result; } bounds osm_dataset::get_bounds() { bounds b (-180,-90,180,90); for(int count=0; countlon > b.w) b.w=nodes[count]->lon; if(nodes[count]->lon < b.e) b.e=nodes[count]->lon; if(nodes[count]->lat > b.s) b.s=nodes[count]->lat; if(nodes[count]->lat < b.n) b.n=nodes[count]->lat; } return b; } osm_node *osm_dataset::next_node() { if(node_i!=nodes.end()) { return *(node_i++); } return NULL; } osm_way *osm_dataset::next_way() { if(way_i!=ways.end()) { return *(way_i++); } return NULL; } osm_item *osm_dataset::next_item() { osm_item *item=NULL; if(next_item_mode==Node) { item = next_node(); if(item==NULL) { next_item_mode=Way; rewind_ways(); item = next_way(); } } else { item = next_way(); } return item; } std::set osm_dataset::get_keys() { std::set keys; for(int count=0; count::iterator i= nodes[count]->keyvals.begin(); i!=nodes[count]->keyvals.end(); i++) { keys.insert(i->first); } } for(int count=0; count::iterator i= ways[count]->keyvals.begin(); i!=ways[count]->keyvals.end(); i++) { keys.insert(i->first); } } return keys; } std::string osm_item::to_string() { std::ostringstream strm; strm << "id=" << id << std::endl << "Keyvals: " << std::endl; for(std::map::iterator i=keyvals.begin(); i!=keyvals.end(); i++) { strm << "Key " << i->first << " Value " << i->second << std::endl; } return strm.str(); } std::string osm_node::to_string() { std::ostringstream strm; strm << "Node: "<< osm_item::to_string() << " Lat=" << lat <<" lon=" <id << " "; } } strm << std::endl; return strm.str(); } bounds osm_way::get_bounds() { bounds b (-180,-90,180,90); for(int count=0; countlon > b.w) b.w=nodes[count]->lon; if(nodes[count]->lon < b.e) b.e=nodes[count]->lon; if(nodes[count]->lat > b.s) b.s=nodes[count]->lat; if(nodes[count]->lat < b.n) b.n=nodes[count]->lat; } return b; }