a-b-street/abstreet
1
1
Fork 0
mirror of https://github.com/a-b-street/abstreet.git synced 2024-11-28 03:35:51 +03:00
Code Issues Projects Releases Wiki Activity

Restore huge_seattle map, which was deleted without me noticing in da60de0a09, likely due to the elevation bug fixed in de20a74f3a28b3370319436d5655b5be6f13367d...

Browse Source
This commit is contained in:
Dustin Carlino 2021-04-06 10:32:07 -07:00
parent 3badd7dd09
commit 680fd07a83
2 changed files with 20 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
data/MANIFEST.json
View File

@ -1620,6 +1620,11 @@
"uncompressed_size_bytes": 107169124,
"compressed_size_bytes": 23225649
},
"data/input/us/seattle/popdat.bin": {
"checksum": "7ac4103b224714bf28e6441e12bed4b5",
"uncompressed_size_bytes": 445888310,
"compressed_size_bytes": 205056519
},
"data/input/us/seattle/raw_maps/arboretum.bin": {
"checksum": "880892d2312f8e662f2aeb77403c5699",
"uncompressed_size_bytes": 3460496,
@ -1635,6 +1640,11 @@
"uncompressed_size_bytes": 8475279,
"compressed_size_bytes": 2045833
},
"data/input/us/seattle/raw_maps/huge_seattle.bin": {
"checksum": "c6053485c6ddc4703424c934d53db9e2",
"uncompressed_size_bytes": 137824767,
"compressed_size_bytes": 32229687
},
"data/input/us/seattle/raw_maps/lakeslice.bin": {
"checksum": "0b4fd8d3d39d5bd0531837997aa46be0",
"uncompressed_size_bytes": 10352569,
@ -2910,6 +2920,11 @@
"uncompressed_size_bytes": 32048113,
"compressed_size_bytes": 11077460
},
"data/system/us/seattle/maps/huge_seattle.bin": {
"checksum": "bc004f231865ecd1b00e6a9489701ee0",
"uncompressed_size_bytes": 371891381,
"compressed_size_bytes": 133777908
},
"data/system/us/seattle/maps/lakeslice.bin": {
"checksum": "136f7fcb0511c8a9acce8d61f1b418a7",
"uncompressed_size_bytes": 26226614,

5
map_model/src/pathfind/vehicles.rs
View File

@ -64,6 +64,11 @@ impl VehiclePathfinder {
// All VehiclePathfinders have the same nodes (lanes), so if we're not the first being
// built, seed from the node ordering.
info!(
"Contraction hierarchy input graph for {:?} has {} nodes",
constraints,
abstutil::prettyprint_usize(input_graph.get_num_nodes())
);
let graph = if let Some(seed) = seed {
let node_ordering = seed.graph.get_node_ordering();
fast_paths::prepare_with_order(&input_graph, &node_ordering).unwrap()