Re-exports§
pub use nodeid_position::NodeIdPosition;pub use crate::get_two_muts::get_two_muts;
Modules§
- btreemapsplitkey
- This is a BTreeMap<i64, V>, but it stores it in several levels of BTreeMap, by splitting the i64 key. Goal: Reduce memory usage of struct, by storing less of the key. End result: ~5% memory reduction of total programme. Not very impressive.
- dij
- fileio
- formatting
- get_
two_ muts - graph
- haversine
- inter_
store - Store the intermediate nodes
- kosaraju
- Kosaraju Algorithm to find Strongly Connected Components https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm
- nodeid_
position - nodeid_
wayids - A struct for storing which wayid(s) a nodeid is in. Most nodes are in only 1 way. This struct uses much less memory by taking advantage of that. A small amount of nodes are in exactly 2 nodes (This saves about 10% space)
- sorted_
slice_ store - tagfilter
- taggrouper
- utils
- way_
group - way_
id_ rel_ tags