f90ce77da4
Each name is represented as an integer range in a vector of chars. Instead of storing the absolute offset inside this array, we can store only the offset to the previous entry (the string size). By doing this we reduce the number of bytes need to store an offset from 4 to 1 bytes (if we set a maximum string length of 255). This is however slower, since the absolute offset must be computed on each querry by summing up all previous lengths. To limit the performance inpact we only do this for blocks of a certain size (16).
423 lines
18 KiB
C++
423 lines
18 KiB
C++
/*
|
|
|
|
Copyright (c) 2013, Project OSRM, Dennis Luxen, others
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without modification,
|
|
are permitted provided that the following conditions are met:
|
|
|
|
Redistributions of source code must retain the above copyright notice, this list
|
|
of conditions and the following disclaimer.
|
|
Redistributions in binary form must reproduce the above copyright notice, this
|
|
list of conditions and the following disclaimer in the documentation and/or
|
|
other materials provided with the distribution.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
|
|
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
#include "ExtractionContainers.h"
|
|
#include "ExtractionWay.h"
|
|
#include "../Util/OSRMException.h"
|
|
#include "../Util/SimpleLogger.h"
|
|
#include "../Util/TimingUtil.h"
|
|
|
|
#include <boost/assert.hpp>
|
|
#include <boost/filesystem.hpp>
|
|
#include <boost/filesystem/fstream.hpp>
|
|
|
|
#include <stxxl/sort>
|
|
|
|
#include <chrono>
|
|
#include <limits>
|
|
|
|
ExtractionContainers::ExtractionContainers()
|
|
{
|
|
// Check if stxxl can be instantiated
|
|
stxxl::vector<unsigned> dummy_vector;
|
|
name_list.push_back("");
|
|
}
|
|
|
|
ExtractionContainers::~ExtractionContainers()
|
|
{
|
|
used_node_id_list.clear();
|
|
all_nodes_list.clear();
|
|
all_edges_list.clear();
|
|
name_list.clear();
|
|
restrictions_list.clear();
|
|
way_start_end_id_list.clear();
|
|
}
|
|
|
|
void ExtractionContainers::PrepareData(const std::string &output_file_name,
|
|
const std::string &restrictions_file_name)
|
|
{
|
|
try
|
|
{
|
|
unsigned number_of_used_nodes = 0;
|
|
unsigned number_of_used_edges = 0;
|
|
std::cout << "[extractor] Sorting used nodes ... " << std::flush;
|
|
TIMER_START(sorting_used_nodes);
|
|
stxxl::sort(used_node_id_list.begin(), used_node_id_list.end(), Cmp(), stxxl_memory);
|
|
TIMER_STOP(sorting_used_nodes);
|
|
std::cout << "ok, after " << TIMER_SEC(sorting_used_nodes) << "s" << std::endl;
|
|
|
|
std::cout << "[extractor] Erasing duplicate nodes ... " << std::flush;
|
|
TIMER_START(erasing_dups);
|
|
auto new_end = std::unique(used_node_id_list.begin(), used_node_id_list.end());
|
|
used_node_id_list.resize(new_end - used_node_id_list.begin());
|
|
TIMER_STOP(erasing_dups);
|
|
std::cout << "ok, after " << TIMER_SEC(erasing_dups) << "s" << std::endl;
|
|
|
|
|
|
std::cout << "[extractor] Sorting all nodes ... " << std::flush;
|
|
TIMER_START(sorting_nodes);
|
|
stxxl::sort(all_nodes_list.begin(), all_nodes_list.end(), CmpNodeByID(), stxxl_memory);
|
|
TIMER_STOP(sorting_nodes);
|
|
std::cout << "ok, after " << TIMER_SEC(sorting_nodes) << "s" << std::endl;
|
|
|
|
|
|
std::cout << "[extractor] Sorting used ways ... " << std::flush;
|
|
TIMER_START(sort_ways);
|
|
stxxl::sort(
|
|
way_start_end_id_list.begin(), way_start_end_id_list.end(), CmpWayByID(), stxxl_memory);
|
|
TIMER_STOP(sort_ways);
|
|
std::cout << "ok, after " << TIMER_SEC(sort_ways) << "s" << std::endl;
|
|
|
|
std::cout << "[extractor] Sorting restrictions. by from... " << std::flush;
|
|
TIMER_START(sort_restrictions);
|
|
stxxl::sort(restrictions_list.begin(),
|
|
restrictions_list.end(),
|
|
CmpRestrictionContainerByFrom(),
|
|
stxxl_memory);
|
|
TIMER_STOP(sort_restrictions);
|
|
std::cout << "ok, after " << TIMER_SEC(sort_restrictions) << "s" << std::endl;
|
|
|
|
std::cout << "[extractor] Fixing restriction starts ... " << std::flush;
|
|
TIMER_START(fix_restriction_starts);
|
|
auto restrictions_iterator = restrictions_list.begin();
|
|
auto way_start_and_end_iterator = way_start_end_id_list.begin();
|
|
|
|
while (way_start_and_end_iterator != way_start_end_id_list.end() &&
|
|
restrictions_iterator != restrictions_list.end())
|
|
{
|
|
if (way_start_and_end_iterator->wayID < restrictions_iterator->fromWay)
|
|
{
|
|
++way_start_and_end_iterator;
|
|
continue;
|
|
}
|
|
|
|
if (way_start_and_end_iterator->wayID > restrictions_iterator->fromWay)
|
|
{
|
|
++restrictions_iterator;
|
|
continue;
|
|
}
|
|
|
|
BOOST_ASSERT(way_start_and_end_iterator->wayID == restrictions_iterator->fromWay);
|
|
const NodeID via_node_id = restrictions_iterator->restriction.viaNode;
|
|
|
|
if (way_start_and_end_iterator->firstStart == via_node_id)
|
|
{
|
|
restrictions_iterator->restriction.fromNode =
|
|
way_start_and_end_iterator->firstTarget;
|
|
}
|
|
else if (way_start_and_end_iterator->firstTarget == via_node_id)
|
|
{
|
|
restrictions_iterator->restriction.fromNode =
|
|
way_start_and_end_iterator->firstStart;
|
|
}
|
|
else if (way_start_and_end_iterator->lastStart == via_node_id)
|
|
{
|
|
restrictions_iterator->restriction.fromNode =
|
|
way_start_and_end_iterator->lastTarget;
|
|
}
|
|
else if (way_start_and_end_iterator->lastTarget == via_node_id)
|
|
{
|
|
restrictions_iterator->restriction.fromNode = way_start_and_end_iterator->lastStart;
|
|
}
|
|
++restrictions_iterator;
|
|
}
|
|
|
|
TIMER_STOP(fix_restriction_starts);
|
|
std::cout << "ok, after " << TIMER_SEC(fix_restriction_starts) << "s" << std::endl;
|
|
|
|
std::cout << "[extractor] Sorting restrictions. by to ... " << std::flush;
|
|
TIMER_START(sort_restrictions_to);
|
|
stxxl::sort(restrictions_list.begin(),
|
|
restrictions_list.end(),
|
|
CmpRestrictionContainerByTo(),
|
|
stxxl_memory);
|
|
TIMER_STOP(sort_restrictions_to);
|
|
std::cout << "ok, after " << TIMER_SEC(sort_restrictions_to) << "s" << std::endl;
|
|
|
|
unsigned number_of_useable_restrictions = 0;
|
|
std::cout << "[extractor] Fixing restriction ends ... " << std::flush;
|
|
TIMER_START(fix_restriction_ends);
|
|
restrictions_iterator = restrictions_list.begin();
|
|
way_start_and_end_iterator = way_start_end_id_list.begin();
|
|
while (way_start_and_end_iterator != way_start_end_id_list.end() &&
|
|
restrictions_iterator != restrictions_list.end())
|
|
{
|
|
if (way_start_and_end_iterator->wayID < restrictions_iterator->toWay)
|
|
{
|
|
++way_start_and_end_iterator;
|
|
continue;
|
|
}
|
|
if (way_start_and_end_iterator->wayID > restrictions_iterator->toWay)
|
|
{
|
|
++restrictions_iterator;
|
|
continue;
|
|
}
|
|
NodeID via_node_id = restrictions_iterator->restriction.viaNode;
|
|
if (way_start_and_end_iterator->lastStart == via_node_id)
|
|
{
|
|
restrictions_iterator->restriction.toNode = way_start_and_end_iterator->lastTarget;
|
|
}
|
|
else if (way_start_and_end_iterator->lastTarget == via_node_id)
|
|
{
|
|
restrictions_iterator->restriction.toNode = way_start_and_end_iterator->lastStart;
|
|
}
|
|
else if (way_start_and_end_iterator->firstStart == via_node_id)
|
|
{
|
|
restrictions_iterator->restriction.toNode = way_start_and_end_iterator->firstTarget;
|
|
}
|
|
else if (way_start_and_end_iterator->firstTarget == via_node_id)
|
|
{
|
|
restrictions_iterator->restriction.toNode = way_start_and_end_iterator->firstStart;
|
|
}
|
|
|
|
if (std::numeric_limits<unsigned>::max() != restrictions_iterator->restriction.fromNode &&
|
|
std::numeric_limits<unsigned>::max() != restrictions_iterator->restriction.toNode)
|
|
{
|
|
++number_of_useable_restrictions;
|
|
}
|
|
++restrictions_iterator;
|
|
}
|
|
TIMER_STOP(fix_restriction_ends);
|
|
std::cout << "ok, after " << TIMER_SEC(fix_restriction_ends) << "s" << std::endl;
|
|
|
|
SimpleLogger().Write() << "usable restrictions: " << number_of_useable_restrictions;
|
|
// serialize restrictions
|
|
std::ofstream restrictions_out_stream;
|
|
restrictions_out_stream.open(restrictions_file_name.c_str(), std::ios::binary);
|
|
restrictions_out_stream.write((char *)&fingerprint, sizeof(FingerPrint));
|
|
restrictions_out_stream.write((char *)&number_of_useable_restrictions, sizeof(unsigned));
|
|
|
|
for(const auto & restriction_container : restrictions_list)
|
|
{
|
|
if (std::numeric_limits<unsigned>::max() != restriction_container.restriction.fromNode &&
|
|
std::numeric_limits<unsigned>::max() != restriction_container.restriction.toNode)
|
|
{
|
|
restrictions_out_stream.write((char *)&(restriction_container.restriction),
|
|
sizeof(TurnRestriction));
|
|
}
|
|
}
|
|
restrictions_out_stream.close();
|
|
|
|
std::ofstream file_out_stream;
|
|
file_out_stream.open(output_file_name.c_str(), std::ios::binary);
|
|
file_out_stream.write((char *)&fingerprint, sizeof(FingerPrint));
|
|
file_out_stream.write((char *)&number_of_used_nodes, sizeof(unsigned));
|
|
std::cout << "[extractor] Confirming/Writing used nodes ... " << std::flush;
|
|
TIMER_START(write_nodes);
|
|
// identify all used nodes by a merging step of two sorted lists
|
|
auto node_iterator = all_nodes_list.begin();
|
|
auto node_id_iterator = used_node_id_list.begin();
|
|
while (node_id_iterator != used_node_id_list.end() && node_iterator != all_nodes_list.end())
|
|
{
|
|
if (*node_id_iterator < node_iterator->node_id)
|
|
{
|
|
++node_id_iterator;
|
|
continue;
|
|
}
|
|
if (*node_id_iterator > node_iterator->node_id)
|
|
{
|
|
++node_iterator;
|
|
continue;
|
|
}
|
|
BOOST_ASSERT(*node_id_iterator == node_iterator->node_id);
|
|
|
|
file_out_stream.write((char *)&(*node_iterator), sizeof(ExternalMemoryNode));
|
|
|
|
++number_of_used_nodes;
|
|
++node_id_iterator;
|
|
++node_iterator;
|
|
}
|
|
|
|
TIMER_STOP(write_nodes);
|
|
std::cout << "ok, after " << TIMER_SEC(write_nodes) << "s" << std::endl;
|
|
|
|
std::cout << "[extractor] setting number of nodes ... " << std::flush;
|
|
std::ios::pos_type previous_file_position = file_out_stream.tellp();
|
|
file_out_stream.seekp(std::ios::beg + sizeof(FingerPrint));
|
|
file_out_stream.write((char *)&number_of_used_nodes, sizeof(unsigned));
|
|
file_out_stream.seekp(previous_file_position);
|
|
|
|
std::cout << "ok" << std::endl;
|
|
|
|
// Sort edges by start.
|
|
std::cout << "[extractor] Sorting edges by start ... " << std::flush;
|
|
TIMER_START(sort_edges_by_start);
|
|
stxxl::sort(all_edges_list.begin(), all_edges_list.end(), CmpEdgeByStartID(), stxxl_memory);
|
|
TIMER_STOP(sort_edges_by_start);
|
|
std::cout << "ok, after " << TIMER_SEC(sort_edges_by_start) << "s" << std::endl;
|
|
|
|
|
|
std::cout << "[extractor] Setting start coords ... " << std::flush;
|
|
TIMER_START(set_start_coords);
|
|
file_out_stream.write((char *)&number_of_used_edges, sizeof(unsigned));
|
|
// Traverse list of edges and nodes in parallel and set start coord
|
|
node_iterator = all_nodes_list.begin();
|
|
auto edge_iterator = all_edges_list.begin();
|
|
while (edge_iterator != all_edges_list.end() && node_iterator != all_nodes_list.end())
|
|
{
|
|
if (edge_iterator->start < node_iterator->node_id)
|
|
{
|
|
++edge_iterator;
|
|
continue;
|
|
}
|
|
if (edge_iterator->start > node_iterator->node_id)
|
|
{
|
|
node_iterator++;
|
|
continue;
|
|
}
|
|
|
|
BOOST_ASSERT(edge_iterator->start == node_iterator->node_id);
|
|
edge_iterator->source_coordinate.lat = node_iterator->lat;
|
|
edge_iterator->source_coordinate.lon = node_iterator->lon;
|
|
++edge_iterator;
|
|
}
|
|
TIMER_STOP(set_start_coords);
|
|
std::cout << "ok, after " << TIMER_SEC(set_start_coords) << "s" << std::endl;
|
|
|
|
// Sort Edges by target
|
|
std::cout << "[extractor] Sorting edges by target ... " << std::flush;
|
|
TIMER_START(sort_edges_by_target);
|
|
stxxl::sort(all_edges_list.begin(), all_edges_list.end(), CmpEdgeByTargetID(), stxxl_memory);
|
|
TIMER_STOP(sort_edges_by_target);
|
|
std::cout << "ok, after " << TIMER_SEC(sort_edges_by_target) << "s" << std::endl;
|
|
|
|
std::cout << "[extractor] Setting target coords ... " << std::flush;
|
|
TIMER_START(set_target_coords);
|
|
// Traverse list of edges and nodes in parallel and set target coord
|
|
node_iterator = all_nodes_list.begin();
|
|
edge_iterator = all_edges_list.begin();
|
|
|
|
while (edge_iterator != all_edges_list.end() && node_iterator != all_nodes_list.end())
|
|
{
|
|
if (edge_iterator->target < node_iterator->node_id)
|
|
{
|
|
++edge_iterator;
|
|
continue;
|
|
}
|
|
if (edge_iterator->target > node_iterator->node_id)
|
|
{
|
|
++node_iterator;
|
|
continue;
|
|
}
|
|
BOOST_ASSERT(edge_iterator->target == node_iterator->node_id);
|
|
if (edge_iterator->source_coordinate.lat != std::numeric_limits<int>::min() &&
|
|
edge_iterator->source_coordinate.lon != std::numeric_limits<int>::min())
|
|
{
|
|
BOOST_ASSERT(edge_iterator->speed != -1);
|
|
BOOST_ASSERT(edge_iterator->type >= 0);
|
|
edge_iterator->target_coordinate.lat = node_iterator->lat;
|
|
edge_iterator->target_coordinate.lon = node_iterator->lon;
|
|
|
|
const double distance = FixedPointCoordinate::ApproximateEuclideanDistance(
|
|
edge_iterator->source_coordinate.lat,
|
|
edge_iterator->source_coordinate.lon,
|
|
node_iterator->lat,
|
|
node_iterator->lon);
|
|
|
|
const double weight = (distance * 10.) / (edge_iterator->speed / 3.6);
|
|
int integer_weight = std::max(
|
|
1,
|
|
(int)std::floor(
|
|
(edge_iterator->is_duration_set ? edge_iterator->speed : weight) + .5));
|
|
int integer_distance = std::max(1, (int)distance);
|
|
short zero = 0;
|
|
short one = 1;
|
|
|
|
file_out_stream.write((char *)&edge_iterator->start, sizeof(unsigned));
|
|
file_out_stream.write((char *)&edge_iterator->target, sizeof(unsigned));
|
|
file_out_stream.write((char *)&integer_distance, sizeof(int));
|
|
switch (edge_iterator->direction)
|
|
{
|
|
case ExtractionWay::notSure:
|
|
file_out_stream.write((char *)&zero, sizeof(short));
|
|
break;
|
|
case ExtractionWay::oneway:
|
|
file_out_stream.write((char *)&one, sizeof(short));
|
|
break;
|
|
case ExtractionWay::bidirectional:
|
|
file_out_stream.write((char *)&zero, sizeof(short));
|
|
break;
|
|
case ExtractionWay::opposite:
|
|
file_out_stream.write((char *)&one, sizeof(short));
|
|
break;
|
|
default:
|
|
throw OSRMException("edge has broken direction");
|
|
}
|
|
|
|
file_out_stream.write((char *)&integer_weight, sizeof(int));
|
|
file_out_stream.write((char *)&edge_iterator->type, sizeof(short));
|
|
file_out_stream.write((char *)&edge_iterator->name_id, sizeof(unsigned));
|
|
file_out_stream.write((char *)&edge_iterator->is_roundabout, sizeof(bool));
|
|
file_out_stream.write((char *)&edge_iterator->is_in_tiny_cc, sizeof(bool));
|
|
file_out_stream.write((char *)&edge_iterator->is_access_restricted, sizeof(bool));
|
|
file_out_stream.write((char *)&edge_iterator->is_contra_flow, sizeof(bool));
|
|
file_out_stream.write((char *)&edge_iterator->is_split, sizeof(bool));
|
|
++number_of_used_edges;
|
|
}
|
|
++edge_iterator;
|
|
}
|
|
TIMER_STOP(set_target_coords);
|
|
std::cout << "ok, after " << TIMER_SEC(set_target_coords) << "s" << std::endl;
|
|
|
|
std::cout << "[extractor] setting number of edges ... " << std::flush;
|
|
|
|
file_out_stream.seekp(previous_file_position);
|
|
file_out_stream.write((char *)&number_of_used_edges, sizeof(unsigned));
|
|
file_out_stream.close();
|
|
std::cout << "ok" << std::endl;
|
|
|
|
std::cout << "[extractor] writing street name index ... " << std::flush;
|
|
TIMER_START(write_name_index);
|
|
std::string name_file_streamName = (output_file_name + ".names");
|
|
boost::filesystem::ofstream name_file_stream(name_file_streamName, std::ios::binary);
|
|
|
|
std::vector<unsigned> name_lengths;
|
|
for (const std::string &temp_string : name_list)
|
|
{
|
|
name_lengths.push_back(temp_string.length());
|
|
}
|
|
|
|
RangeTable<> table(name_lengths);
|
|
name_file_stream << table;
|
|
|
|
// write all chars consecutively
|
|
for (const std::string &temp_string : name_list)
|
|
{
|
|
const unsigned string_length = std::min(temp_string.length(), 255lu);
|
|
name_file_stream.write(temp_string.c_str(), string_length);
|
|
}
|
|
|
|
name_file_stream.close();
|
|
TIMER_STOP(write_name_index);
|
|
std::cout << "ok, after " << TIMER_SEC(write_name_index) << "s" << std::endl;
|
|
|
|
SimpleLogger().Write() << "Processed " << number_of_used_nodes << " nodes and "
|
|
<< number_of_used_edges << " edges";
|
|
}
|
|
catch (const std::exception &e) { std::cerr << "Caught Execption:" << e.what() << std::endl; }
|
|
}
|