Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

make rtree query do O(1) allocations only

Browse Source
This commit is contained in:
Dennis Luxen 2013-11-22 18:58:58 +01:00
parent 0e33f638e6
commit 349df0dc94
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
DataStructures/StaticRTree.h
View File

@ -761,6 +761,7 @@ public:
"Root element in NN Search has min dist != 0." "Root element in NN Search has min dist != 0."
); );
LeafNode current_leaf_node;
while(!traversal_queue.empty()) { while(!traversal_queue.empty()) {
const QueryCandidate current_query_node = traversal_queue.top(); traversal_queue.pop(); const QueryCandidate current_query_node = traversal_queue.top(); traversal_queue.pop();
@ -770,7 +771,6 @@ public:
if( !prune_downward && !prune_upward ) { //downward pruning if( !prune_downward && !prune_upward ) { //downward pruning
TreeNode & current_tree_node = m_search_tree[current_query_node.node_id]; TreeNode & current_tree_node = m_search_tree[current_query_node.node_id];
if (current_tree_node.child_is_on_disk) { if (current_tree_node.child_is_on_disk) {
LeafNode current_leaf_node;
LoadLeafFromDisk(current_tree_node.children[0], current_leaf_node); LoadLeafFromDisk(current_tree_node.children[0], current_leaf_node);
// ++io_count; // ++io_count;
for(uint32_t i = 0; i < current_leaf_node.object_count; ++i) { for(uint32_t i = 0; i < current_leaf_node.object_count; ++i) {