Matt Corallo 1171bc1913 Pre-calculate heap element scores (retaining RouteGraphNode size) ... `RouteGraphNode` currently recalculates scores in its `Ord` implementation, wasting time while sorting the main Dijkstra's heap. Further, some time ago, when implementing the `htlc_maximum_msat` amount reduction while walking the graph, we added `PathBuildingHop::was_processed`, looking up the source node in `dist` each time we pop'ed an element off of the binary heap. As a result, we now have a reference to our `PathBuildingHop` when processing a best-node's channels, leading to several fields in `RouteGraphNode` being entirely redundant. Here we drop those fields, but add a pre-calculated score field, as well as force a suboptimal `RouteGraphNode` layout, retaining its existing 64 byte size. Without the suboptimal layout, performance is very mixed, but with it performance is mostly improved, by around 10% in most tests.		2023-12-08 20:45:06 +00:00
..
src	Pre-calculate heap element scores (retaining RouteGraphNode size)	2023-12-08 20:45:06 +00:00
Cargo.toml	Bump rust-bitcoin to v0.30.2	2023-11-22 15:58:01 -08:00