/dports/databases/postgis30/postgis-3.0.4/topology/test/regress/ |
H A D | st_addedgemodface.sql | 90 ORDER BY edge_id; 106 ORDER BY edge_id; 122 ORDER BY edge_id; 138 ORDER BY edge_id; 149 ORDER BY edge_id; 160 ORDER BY edge_id; 171 ORDER BY edge_id; 182 ORDER BY edge_id; 193 ORDER BY edge_id; 204 ORDER BY edge_id; [all …]
|
H A D | st_addedgenewfaces.sql | 90 ORDER BY edge_id; 106 ORDER BY edge_id; 122 ORDER BY edge_id; 138 ORDER BY edge_id; 149 ORDER BY edge_id; 160 ORDER BY edge_id; 171 ORDER BY edge_id; 182 ORDER BY edge_id; 193 ORDER BY edge_id; 204 ORDER BY edge_id; [all …]
|
H A D | addface.sql | 40 SELECT edge_id, left_face, right_face from tt.edge ORDER by edge_id; 47 SELECT edge_id, left_face, right_face from tt.edge ORDER by edge_id; 118 SELECT edge_id, left_face, right_face from t2.edge ORDER by edge_id; 153 SELECT edge_id, left_face, right_face from t3.edge ORDER by edge_id; 177 SELECT 'E'||edge_id, left_face, right_face from t4.edge ORDER by edge_id; 192 SELECT '#1302', 'E' || edge_id, 'L' || left_face, 'R' || right_face FROM tt.edge_data ORDER BY edge… 210 SELECT '#1383', 'E' || edge_id, 'L' || left_face, 'R' || right_face FROM tt.edge_data ORDER BY edge…
|
/dports/databases/postgis25/postgis-2.5.5/topology/test/regress/ |
H A D | st_addedgemodface.sql | 90 ORDER BY edge_id; 106 ORDER BY edge_id; 122 ORDER BY edge_id; 138 ORDER BY edge_id; 149 ORDER BY edge_id; 160 ORDER BY edge_id; 171 ORDER BY edge_id; 182 ORDER BY edge_id; 193 ORDER BY edge_id; 204 ORDER BY edge_id; [all …]
|
H A D | st_addedgenewfaces.sql | 90 ORDER BY edge_id; 106 ORDER BY edge_id; 122 ORDER BY edge_id; 138 ORDER BY edge_id; 149 ORDER BY edge_id; 160 ORDER BY edge_id; 171 ORDER BY edge_id; 182 ORDER BY edge_id; 193 ORDER BY edge_id; 204 ORDER BY edge_id; [all …]
|
H A D | addface.sql | 40 SELECT edge_id, left_face, right_face from tt.edge ORDER by edge_id; 47 SELECT edge_id, left_face, right_face from tt.edge ORDER by edge_id; 118 SELECT edge_id, left_face, right_face from t2.edge ORDER by edge_id; 153 SELECT edge_id, left_face, right_face from t3.edge ORDER by edge_id; 177 SELECT 'E'||edge_id, left_face, right_face from t4.edge ORDER by edge_id; 192 SELECT '#1302', 'E' || edge_id, 'L' || left_face, 'R' || right_face FROM tt.edge_data ORDER BY edge… 210 SELECT '#1383', 'E' || edge_id, 'L' || left_face, 'R' || right_face FROM tt.edge_data ORDER BY edge…
|
/dports/databases/postgis32/postgis-3.2.0/topology/test/regress/ |
H A D | st_addedgemodface.sql | 90 ORDER BY edge_id; 106 ORDER BY edge_id; 122 ORDER BY edge_id; 138 ORDER BY edge_id; 149 ORDER BY edge_id; 160 ORDER BY edge_id; 171 ORDER BY edge_id; 182 ORDER BY edge_id; 193 ORDER BY edge_id; 204 ORDER BY edge_id; [all …]
|
H A D | st_addedgenewfaces.sql | 90 ORDER BY edge_id; 106 ORDER BY edge_id; 122 ORDER BY edge_id; 138 ORDER BY edge_id; 149 ORDER BY edge_id; 160 ORDER BY edge_id; 171 ORDER BY edge_id; 182 ORDER BY edge_id; 193 ORDER BY edge_id; 204 ORDER BY edge_id; [all …]
|
H A D | validatetopology.sql | 61 UPDATE city_data.edge_data SET next_right_edge = -next_right_edge where edge_id = 19; 67 where edge_id in (3,25); 81 WHERE edge_id = 19; 92 UPDATE city_data.edge_data SET right_face = 3 WHERE edge_id IN (8, 17); 93 UPDATE city_data.edge_data SET left_face = 3 WHERE edge_id IN (11, 15); 115 WHERE edge_id = 25; 122 WHERE edge_id IN (4, 5); 129 WHERE edge_id = 26; 136 WHERE edge_id = 25; 143 WHERE edge_id = 26; [all …]
|
H A D | addface.sql | 40 SELECT edge_id, left_face, right_face from tt.edge ORDER by edge_id; 47 SELECT edge_id, left_face, right_face from tt.edge ORDER by edge_id; 118 SELECT edge_id, left_face, right_face from t2.edge ORDER by edge_id; 153 SELECT edge_id, left_face, right_face from t3.edge ORDER by edge_id; 177 SELECT 'E'||edge_id, left_face, right_face from t4.edge ORDER by edge_id; 192 SELECT '#1302', 'E' || edge_id, 'L' || left_face, 'R' || right_face FROM tt.edge_data ORDER BY edge… 210 SELECT '#1383', 'E' || edge_id, 'L' || left_face, 'R' || right_face FROM tt.edge_data ORDER BY edge…
|
/dports/databases/postgis31/postgis-3.1.4/topology/test/regress/ |
H A D | st_addedgemodface.sql | 90 ORDER BY edge_id; 106 ORDER BY edge_id; 122 ORDER BY edge_id; 138 ORDER BY edge_id; 149 ORDER BY edge_id; 160 ORDER BY edge_id; 171 ORDER BY edge_id; 182 ORDER BY edge_id; 193 ORDER BY edge_id; 204 ORDER BY edge_id; [all …]
|
H A D | st_addedgenewfaces.sql | 90 ORDER BY edge_id; 106 ORDER BY edge_id; 122 ORDER BY edge_id; 138 ORDER BY edge_id; 149 ORDER BY edge_id; 160 ORDER BY edge_id; 171 ORDER BY edge_id; 182 ORDER BY edge_id; 193 ORDER BY edge_id; 204 ORDER BY edge_id; [all …]
|
H A D | addface.sql | 40 SELECT edge_id, left_face, right_face from tt.edge ORDER by edge_id; 47 SELECT edge_id, left_face, right_face from tt.edge ORDER by edge_id; 118 SELECT edge_id, left_face, right_face from t2.edge ORDER by edge_id; 153 SELECT edge_id, left_face, right_face from t3.edge ORDER by edge_id; 177 SELECT 'E'||edge_id, left_face, right_face from t4.edge ORDER by edge_id; 192 SELECT '#1302', 'E' || edge_id, 'L' || left_face, 'R' || right_face FROM tt.edge_data ORDER BY edge… 210 SELECT '#1383', 'E' || edge_id, 'L' || left_face, 'R' || right_face FROM tt.edge_data ORDER BY edge…
|
/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/pygraph/classes/ |
H A D | directed_graph.py | 44 edge_id = self.next_edge_id 46 return edge_id 81 edge = {'id': edge_id, 87 self.edges[edge_id] = edge 92 return edge_id 98 return [self.get_edge(edge_id)['vertices'][1] for edge_id in node['edges']] 135 def get_edge(self, edge_id): argument 153 edge = self.get_edge(edge_id) 164 del self.edges[edge_id] 204 edge = self.get_edge(edge_id) [all …]
|
H A D | undirected_graph.py | 25 return edge_id 32 for a, b in [self.get_edge(edge_id)['vertices'] for edge_id in node['edges']]: 40 def delete_edge_by_id(self, edge_id): argument 42 edge = self.get_edge(edge_id) 50 from_node['edges'].remove(edge_id) 57 to_node['edges'].remove(edge_id) 60 del self.edges[edge_id] 64 def move_edge_target(self, edge_id, node_a): argument 67 edge = self.get_edge(edge_id) 90 return [edge_id for edge_id in node['edges'] \ [all …]
|
/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/tests/ |
H A D | test_merge_graphs.py | 54 for edge_id in original_node['edges']: 55 self.assertIn(edge_id, new_node['edges']) 57 for edge_id in original_graph.get_all_edge_ids(): 59 new_edge = main_graph.get_edge(edge_id) 75 … expected_edge_map = dict([(edge_id, edge_id) for edge_id in original_graph.get_all_edge_ids()]) 94 for edge_id in original_node['edges']: 95 self.assertIn(edge_id, new_node['edges']) 99 new_edge = main_graph.get_edge(edge_id) 141 for edge_id in original_node['edges']: 146 new_edge = main_graph.get_edge(edge_id) [all …]
|
/dports/www/osrm-backend/osrm-backend-5.26.0/include/extractor/ |
H A D | compressed_edge_container.hpp | 45 void AddUncompressedEdge(const EdgeID edge_id, 53 bool HasEntryForID(const EdgeID edge_id) const; 54 bool HasZippedEntryForForwardID(const EdgeID edge_id) const; 55 bool HasZippedEntryForReverseID(const EdgeID edge_id) const; 57 unsigned GetPositionForID(const EdgeID edge_id) const; 58 unsigned GetZippedPositionForForwardID(const EdgeID edge_id) const; 59 unsigned GetZippedPositionForReverseID(const EdgeID edge_id) const; 61 bool IsTrivial(const EdgeID edge_id) const; 62 NodeID GetFirstEdgeTargetID(const EdgeID edge_id) const; 63 NodeID GetLastEdgeTargetID(const EdgeID edge_id) const; [all …]
|
/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/pygraph/helpers/ |
H A D | functions.py | 44 edge = udg.get_edge(edge_id) 60 for edge_id in edges: 61 e = dg.get_edge(edge_id) 66 lookup[tpl] = edge_id 75 for edge_id in edges: 76 e = udg.get_edge(edge_id) 82 lookup[tpl_a] = edge_id 83 lookup[tpl_b] = edge_id 91 for edge_id in edge_list: 92 edge = graph.get_edge(edge_id) [all …]
|
/dports/www/osrm-backend/osrm-backend-5.26.0/src/extractor/ |
H A D | compressed_edge_container.cpp | 37 auto iter = m_edge_id_to_list_index_map.find(edge_id); in HasEntryForID() 43 auto iter = m_forward_edge_id_to_zipped_index_map.find(edge_id); in HasZippedEntryForForwardID() 49 auto iter = m_reverse_edge_id_to_zipped_index_map.find(edge_id); in HasZippedEntryForReverseID() 55 auto map_iterator = m_edge_id_to_list_index_map.find(edge_id); in GetPositionForID() 214 BOOST_ASSERT(SPECIAL_EDGEID != edge_id); in AddUncompressedEdge() 219 if (!HasEntryForID(edge_id)) in AddUncompressedEdge() 236 BOOST_ASSERT(edge_bucket_id == GetPositionForID(edge_id)); in AddUncompressedEdge() 369 const auto &bucket = GetBucketReference(edge_id); in IsTrivial() 375 const auto &bucket = GetBucketReference(edge_id); in GetFirstEdgeTargetID() 381 const auto &bucket = GetBucketReference(edge_id); in GetLastEdgeTargetID() [all …]
|
/dports/graphics/R-cran-s2/s2/src/s2/ |
H A D | s2builderutil_find_polygon_degeneracies.h | 41 uint32 edge_id : 31; member 44 PolygonDegeneracy() : edge_id(0), is_hole(false) {} in PolygonDegeneracy() 46 : edge_id(_edge_id), is_hole(_is_hole) { in PolygonDegeneracy() 49 return edge_id == y.edge_id && is_hole == y.is_hole; 52 return edge_id < y.edge_id || (edge_id == y.edge_id && is_hole < y.is_hole);
|
H A D | s2shapeutil_shape_edge_id.h | 32 int32 shape_id, edge_id; 33 ShapeEdgeId() : shape_id(-1), edge_id(-1) {} in ShapeEdgeId() 54 : shape_id(_shape_id), edge_id(_edge_id) { in ShapeEdgeId() 58 return shape_id == other.shape_id && edge_id == other.edge_id; 68 return edge_id < other.edge_id; 84 return os << id.shape_id << ":" << id.edge_id; 91 static_cast<uint32>(id.edge_id)); in operator()
|
/dports/graphics/s2/s2geometry-0.9.0/src/s2/ |
H A D | s2builderutil_find_polygon_degeneracies.h | 41 uint32 edge_id : 31; member 44 PolygonDegeneracy() : edge_id(0), is_hole(false) {} in PolygonDegeneracy() 46 : edge_id(_edge_id), is_hole(_is_hole) { in PolygonDegeneracy() 49 return edge_id == y.edge_id && is_hole == y.is_hole; 52 return edge_id < y.edge_id || (edge_id == y.edge_id && is_hole < y.is_hole);
|
/dports/graphics/py-s2/s2geometry-0.9.0/src/s2/ |
H A D | s2builderutil_find_polygon_degeneracies.h | 41 uint32 edge_id : 31; member 44 PolygonDegeneracy() : edge_id(0), is_hole(false) {} in PolygonDegeneracy() 46 : edge_id(_edge_id), is_hole(_is_hole) { in PolygonDegeneracy() 49 return edge_id == y.edge_id && is_hole == y.is_hole; 52 return edge_id < y.edge_id || (edge_id == y.edge_id && is_hole < y.is_hole);
|
/dports/games/abstreet/fast_paths-192ae1997f9857791826ac5ed16892b2f692920c/src/ |
H A D | path_calculator.rs | 105 for edge_id in begin..end { in calc_path() 141 for edge_id in begin..end { in calc_path() 172 for edge_id in begin..end { in is_stallable_fwd() 173 let adj = graph.edges_bwd[edge_id].adj_node; in is_stallable_fwd() 189 for edge_id in begin..end { in is_stallable_bwd() 190 let adj = graph.edges_fwd[edge_id].adj_node; in is_stallable_bwd() 230 if !graph.edges_fwd[edge_id].is_shortcut() { in unpack_fwd() 244 graph.edges_fwd[edge_id].replaced_in_edge, in unpack_fwd() 251 graph.edges_fwd[edge_id].replaced_in_edge, in unpack_fwd() 264 if !graph.edges_bwd[edge_id].is_shortcut() { in unpack_bwd() [all …]
|
/dports/science/code_saturne/code_saturne-7.1.0/src/alge/ |
H A D | cs_matrix_util.c | 283 for (edge_id = 0; edge_id < ms->n_edges; edge_id++) { in _diag_dom_native() 293 for (edge_id = 0; edge_id < ms->n_edges; edge_id++) { in _diag_dom_native() 339 for (edge_id = 0; edge_id < ms->n_edges; edge_id++) { in _b_diag_dom_native() 350 for (edge_id = 0; edge_id < ms->n_edges; edge_id++) { in _b_diag_dom_native() 399 for (edge_id = 0; edge_id < ms->n_edges; edge_id++) { in _bb_diag_dom_native() 413 for (edge_id = 0; edge_id < ms->n_edges; edge_id++) { in _bb_diag_dom_native() 718 for (edge_id = 0; edge_id < ms->n_edges; edge_id++) { in _pre_dump_native() 733 for (edge_id = 0; edge_id < ms->n_edges; edge_id++) { in _pre_dump_native() 808 for (edge_id = 0; edge_id < ms->n_edges; edge_id++) { in _b_pre_dump_native() 824 for (edge_id = 0; edge_id < ms->n_edges; edge_id++) { in _b_pre_dump_native() [all …]
|