Home
last modified time | relevance | path

Searched refs:replaced_out_edge (Results 1 – 4 of 4) sorted by relevance

/dports/games/abstreet/fast_paths-192ae1997f9857791826ac5ed16892b2f692920c/src/
H A Dfast_graph32.rs77 pub replaced_out_edge: u32, field
106 replaced_out_edge: usize_to_u32(edge.replaced_out_edge), in usize_to_u32_edge()
132 replaced_out_edge: u32_to_usize(edge.replaced_out_edge), in u32_to_usize_edge()
181 assert_eq!(g32.edges_fwd[0].replaced_out_edge, std::u32::MAX); in create()
187 assert_eq!(g32.edges_fwd[1].replaced_out_edge, std::u32::MAX); in create()
191 assert_eq!(g32.edges_bwd[0].replaced_out_edge, std::u32::MAX); in create()
H A Dfast_graph.rs96 pub replaced_out_edge: EdgeId, field
112 replaced_out_edge: replaced_edge2, in new()
118 (self.replaced_in_edge == INVALID_EDGE && self.replaced_out_edge == INVALID_EDGE) in is_shortcut()
120 && self.replaced_out_edge != INVALID_EDGE) in is_shortcut()
H A Dfast_graph_builder.rs199 self.fast_graph.edges_fwd[edge_id].replaced_out_edge = INVALID_EDGE; in finish_contraction()
202 self.fast_graph.edges_fwd[edge_id].replaced_out_edge = in finish_contraction()
213 self.fast_graph.edges_bwd[edge_id].replaced_out_edge = INVALID_EDGE; in finish_contraction()
217 self.fast_graph.edges_bwd[edge_id].replaced_out_edge = in finish_contraction()
H A Dpath_calculator.rs238 graph.edges_fwd[edge_id].replaced_out_edge, in unpack_fwd()
257 graph.edges_fwd[edge_id].replaced_out_edge, in unpack_fwd()
272 graph.edges_bwd[edge_id].replaced_out_edge, in unpack_bwd()
291 graph.edges_bwd[edge_id].replaced_out_edge, in unpack_bwd()