Home
last modified time | relevance | path

Searched refs:graph_walker (Results 1 – 16 of 16) sorted by relevance

/dports/www/osrm-backend/osrm-backend-5.26.0/src/extractor/intersection/
H A Dmergable_road_detector.cpp208 NodeBasedGraphWalker graph_walker(node_based_graph, in IsNarrowTriangle() local
215 graph_walker.TraverseRoad(intersection_node, lhs.eid, left_accumulator, selector); in IsNarrowTriangle()
222 graph_walker.TraverseRoad( in IsNarrowTriangle()
237 graph_walker.TraverseRoad(intersection_node, rhs.eid, right_accumulator, selector); in IsNarrowTriangle()
241 graph_walker.TraverseRoad( in IsNarrowTriangle()
293 graph_walker.TraverseRoad(node_based_graph.GetTarget(left_accumulator.via_edge_id), in IsNarrowTriangle()
307 NodeBasedGraphWalker graph_walker(node_based_graph, in IsCircularShape() local
322 graph_walker.TraverseRoad(intersection_node, edge_id, accumulator, selector); in IsCircularShape()
379 NodeBasedGraphWalker graph_walker(node_based_graph, in HaveSameDirection() local
394 graph_walker.TraverseRoad(intersection_node, edge_id, accumulator, selector); in HaveSameDirection()
/dports/net/google-cloud-sdk/google-cloud-sdk/lib/third_party/dulwich/
H A Dclient.py407 def fetch_pack(self, path, determine_wants, graph_walker, pack_data, argument
578 def _handle_upload_pack_head(self, proto, capabilities, graph_walker, argument
600 for sha in graph_walker.shallow:
612 have = next(graph_walker)
619 graph_walker.ack(parts[1])
628 have = next(graph_walker)
632 def _handle_upload_pack_tail(self, proto, capabilities, graph_walker, argument
647 graph_walker.ack(parts[1])
797 def fetch_pack(self, path, determine_wants, graph_walker, pack_data, argument
840 proto, negotiated_capabilities, graph_walker, pack_data,
[all …]
H A Drepo.py345 def fetch_pack_data(self, determine_wants, graph_walker, progress, argument
362 objects = self.fetch_objects(determine_wants, graph_walker, progress,
366 def fetch_objects(self, determine_wants, graph_walker, progress, argument
404 shallows = getattr(graph_walker, 'shallow', frozenset())
405 unshallows = getattr(graph_walker, 'unshallow', frozenset())
420 haves = self.object_store.find_common_revisions(graph_walker)
H A Dserver.py166 def fetch_objects(self, determine_wants, graph_walker, progress, argument
347 graph_walker = _ProtocolGraphWalker(
351 graph_walker.determine_wants, graph_walker, self.progress,
372 if not graph_walker.handle_done(
/dports/devel/dulwich/dulwich-0.19.16/dulwich/
H A Dclient.py434 def fetch_pack(self, path, determine_wants, graph_walker, pack_data, argument
622 def _handle_upload_pack_head(self, proto, capabilities, graph_walker, argument
648 for sha in graph_walker.shallow:
661 have = next(graph_walker)
668 graph_walker.ack(parts[1])
677 have = next(graph_walker)
681 def _handle_upload_pack_tail(self, proto, capabilities, graph_walker, argument
700 graph_walker.ack(parts[1])
859 def fetch_pack(self, path, determine_wants, graph_walker, pack_data, argument
905 proto, negotiated_capabilities, graph_walker, pack_data,
[all …]
H A Drepo.py378 def fetch_pack_data(self, determine_wants, graph_walker, progress, argument
396 objects = self.fetch_objects(determine_wants, graph_walker, progress,
400 def fetch_objects(self, determine_wants, graph_walker, progress, argument
439 shallows = getattr(graph_walker, 'shallow', frozenset())
440 unshallows = getattr(graph_walker, 'unshallow', frozenset())
455 haves = self.object_store.find_common_revisions(graph_walker)
H A Dserver.py170 def fetch_objects(self, determine_wants, graph_walker, progress, argument
353 graph_walker = _ProtocolGraphWalker(
357 graph_walker.determine_wants, graph_walker, self.progress,
378 if not graph_walker.handle_done(
/dports/devel/brz/breezy-3.2.0/breezy/git/
H A Dserver.py86 def fetch_objects(self, determine_wants, graph_walker, progress, argument
91 have = self.object_store.find_common_revisions(graph_walker)
94 shallows = getattr(graph_walker, 'shallow', frozenset())
H A Dremote.py450 def fetch_pack(self, determine_wants, graph_walker, pack_data, argument
459 self._client_path, determine_wants, graph_walker, pack_data,
943 def fetch_pack(self, determine_wants, graph_walker, pack_data, argument
946 determine_wants, graph_walker, pack_data, progress)
951 def fetch_objects(self, determine_wants, graph_walker, resolve_ext_ref, argument
956 self.fetch_pack(determine_wants, graph_walker,
H A Drepository.py559 def fetch_objects(self, determine_wants, graph_walker, resolve_ext_ref, argument
561 return self._git.fetch_objects(determine_wants, graph_walker, progress,
H A Dinterrepo.py578 graph_walker = ObjectStoreGraphWalker(
585 wants_recorder, graph_walker, store.get_raw)
/dports/www/osrm-backend/osrm-backend-5.26.0/src/guidance/
H A Dsliproad_handler.cpp262 (void)graph_walker.TraverseRoad(intersection_node_id, // start node in operator ()()
704 (void)graph_walker.TraverseRoad(start, onto, accumulator, selector); in nextIntersectionIsTooFarAway()
H A Dintersection_handler.cpp61 street_name_suffix_table(street_name_suffix_table), graph_walker(node_based_graph, in IntersectionHandler()
/dports/www/osrm-backend/osrm-backend-5.26.0/include/guidance/
H A Dintersection_handler.hpp65 graph_walker; // for skipping traffic signal, distances etc. member in osrm::guidance::IntersectionHandler
/dports/devel/dulwich/dulwich-0.19.16/dulwich/tests/
H A Dtest_client.py806 s.path, lambda heads: [], graph_walker=walker, pack_data=out.write)
831 graph_walker=walker, pack_data=out.write)
/dports/lang/swi-pl/swipl-8.2.3/packages/semweb/
H A Drdf_db.c2570 typedef struct graph_walker struct
2576 } graph_walker; typedef
2580 init_graph_walker(graph_walker *gw, rdf_db *db, atom_t name) in init_graph_walker()
2589 next_graph(graph_walker *gw) in next_graph()
2613 { graph_walker gw; in existing_graph()