/dports/databases/postgis30/postgis-3.0.4/topology/test/regress/ |
H A D | st_remedgenewface_expected | 15 RN(25)/edges|-|25|-25|25|1|1 19 RN(4)/edges|-|4|-5|4|0|0 20 RN(4)/edges|+|5|-5|5|0|0 21 RN(4)/edges|-|5|-4|5|0|0 29 RN(26)/edges|+|1|1|-1|10|0 30 RN(26)/edges|-|1|1|-1|1|0 36 RN(9)/edges|+|6|7|-21|0|11 37 RN(9)/edges|-|6|7|-21|0|3 38 RN(9)/edges|-|9|19|-22|3|6 40 RN(9)/edges|-|12|20|22|6|0 [all …]
|
H A D | st_remedgemodface_expected | 15 RM(25)/edges|-|25|-25|25|1|1 19 RM(4)/edges|-|4|-5|4|0|0 20 RM(4)/edges|+|5|-5|5|0|0 21 RM(4)/edges|-|5|-4|5|0|0 28 RM(9)/edges|+|6|7|-21|0|6 29 RM(9)/edges|-|6|7|-21|0|3 30 RM(9)/edges|-|9|19|-22|3|6 33 RM(9)/edges|+|20|19|13|6|7 34 RM(9)/edges|-|20|-9|13|6|7 36 RM(9)/edges|-|21|6|9|0|3 [all …]
|
/dports/databases/postgis25/postgis-2.5.5/topology/test/regress/ |
H A D | st_remedgenewface_expected | 17 RN(25)/edges|-|25|-25|25|1|1 21 RN(4)/edges|-|4|-5|4|0|0 22 RN(4)/edges|+|5|-5|5|0|0 23 RN(4)/edges|-|5|-4|5|0|0 31 RN(26)/edges|+|1|1|-1|10|0 32 RN(26)/edges|-|1|1|-1|1|0 38 RN(9)/edges|+|6|7|-21|0|11 39 RN(9)/edges|-|6|7|-21|0|3 40 RN(9)/edges|-|9|19|-22|3|6 42 RN(9)/edges|-|12|20|22|6|0 [all …]
|
H A D | st_remedgemodface_expected | 17 RM(25)/edges|-|25|-25|25|1|1 21 RM(4)/edges|-|4|-5|4|0|0 22 RM(4)/edges|+|5|-5|5|0|0 23 RM(4)/edges|-|5|-4|5|0|0 30 RM(9)/edges|+|6|7|-21|0|6 31 RM(9)/edges|-|6|7|-21|0|3 32 RM(9)/edges|-|9|19|-22|3|6 35 RM(9)/edges|+|20|19|13|6|7 36 RM(9)/edges|-|20|-9|13|6|7 38 RM(9)/edges|-|21|6|9|0|3 [all …]
|
/dports/databases/postgis32/postgis-3.2.0/topology/test/regress/ |
H A D | st_remedgenewface_expected | 11 RN(25)/edges|-|25|-25|25|1|1 15 RN(4)/edges|-|4|-5|4|0|0 16 RN(4)/edges|+|5|-5|5|0|0 17 RN(4)/edges|-|5|-4|5|0|0 25 RN(26)/edges|+|1|1|-1|10|0 26 RN(26)/edges|-|1|1|-1|1|0 32 RN(9)/edges|+|6|7|-21|0|11 33 RN(9)/edges|-|6|7|-21|0|3 34 RN(9)/edges|-|9|19|-22|3|6 36 RN(9)/edges|-|12|20|22|6|0 [all …]
|
H A D | st_remedgemodface_expected | 11 RM(25)/edges|-|25|-25|25|1|1 15 RM(4)/edges|-|4|-5|4|0|0 16 RM(4)/edges|+|5|-5|5|0|0 17 RM(4)/edges|-|5|-4|5|0|0 24 RM(9)/edges|+|6|7|-21|0|6 25 RM(9)/edges|-|6|7|-21|0|3 26 RM(9)/edges|-|9|19|-22|3|6 29 RM(9)/edges|+|20|19|13|6|7 30 RM(9)/edges|-|20|-9|13|6|7 32 RM(9)/edges|-|21|6|9|0|3 [all …]
|
/dports/databases/postgis31/postgis-3.1.4/topology/test/regress/ |
H A D | st_remedgenewface_expected | 15 RN(25)/edges|-|25|-25|25|1|1 19 RN(4)/edges|-|4|-5|4|0|0 20 RN(4)/edges|+|5|-5|5|0|0 21 RN(4)/edges|-|5|-4|5|0|0 29 RN(26)/edges|+|1|1|-1|10|0 30 RN(26)/edges|-|1|1|-1|1|0 36 RN(9)/edges|+|6|7|-21|0|11 37 RN(9)/edges|-|6|7|-21|0|3 38 RN(9)/edges|-|9|19|-22|3|6 40 RN(9)/edges|-|12|20|22|6|0 [all …]
|
H A D | st_remedgemodface_expected | 15 RM(25)/edges|-|25|-25|25|1|1 19 RM(4)/edges|-|4|-5|4|0|0 20 RM(4)/edges|+|5|-5|5|0|0 21 RM(4)/edges|-|5|-4|5|0|0 28 RM(9)/edges|+|6|7|-21|0|6 29 RM(9)/edges|-|6|7|-21|0|3 30 RM(9)/edges|-|9|19|-22|3|6 33 RM(9)/edges|+|20|19|13|6|7 34 RM(9)/edges|-|20|-9|13|6|7 36 RM(9)/edges|-|21|6|9|0|3 [all …]
|
/dports/devel/R-cran-rgexf/rgexf/R/ |
H A D | math.R | 44 edges0 <- cbind(edges, id = 1:nrow(edges)) 46 edges <- switch.edges(edges) 52 edges <- cbind(edges, id = 1:nrow(edges)) 53 edges <- edges[order(edges[,1], edges[,2]), ] 58 (edges[-1, 1] != edges[-nrow(edges), 1]) | 59 (edges[-1, 2] != edges[-nrow(edges), 2]) 68 c(TRUE, (edges[-1, 1] == edges[-nrow(edges), 1]) & 69 (edges[-1, 2] == edges[-nrow(edges), 2]) 73 edges[, "counts"] <- edges[, "counts"] - c(1, edges[-nrow(edges), "counts"]) + 1 74 edges <- edges[order(edges[, "id"]), , drop = FALSE] [all …]
|
/dports/math/p5-Set-IntSpan/Set-IntSpan-1.19/ |
H A D | IntSpan.pm | 219 $set->{edges } = \@edges; 368 $set->{edges} = [ @edges ]; 380 my $edges = $set->{edges}; 403 my @edges = @{$set->{edges}}; 510 $a->{edges } = $s->{edges }; 573 $a->{edges } = $s->{edges }; 1032 my $edges = $set->{edges}; 1033 my @edges = @$edges; 1263 my $edges = $set->{edges}; 1311 my $edges = $set->{edges}; [all …]
|
/dports/games/supertuxkart/SuperTuxKart-1.2-src/lib/irrlicht/source/Irrlicht/ |
H A D | CTriangleBBSelector.cpp | 39 Triangles[0].set( edges[3], edges[0], edges[2]); in getTriangles() 40 Triangles[1].set( edges[3], edges[1], edges[0]); in getTriangles() 42 Triangles[2].set( edges[3], edges[2], edges[7]); in getTriangles() 43 Triangles[3].set( edges[7], edges[2], edges[6]); in getTriangles() 45 Triangles[4].set( edges[7], edges[6], edges[4]); in getTriangles() 46 Triangles[5].set( edges[5], edges[7], edges[4]); in getTriangles() 48 Triangles[6].set( edges[5], edges[4], edges[0]); in getTriangles() 49 Triangles[7].set( edges[5], edges[0], edges[1]); in getTriangles() 51 Triangles[8].set( edges[1], edges[3], edges[7]); in getTriangles() 52 Triangles[9].set( edges[1], edges[7], edges[5]); in getTriangles() [all …]
|
/dports/x11-toolkits/irrlicht/irrlicht-1.8.5/source/Irrlicht/ |
H A D | CTriangleBBSelector.cpp | 39 Triangles[0].set( edges[3], edges[0], edges[2]); in getTriangles() 40 Triangles[1].set( edges[3], edges[1], edges[0]); in getTriangles() 42 Triangles[2].set( edges[3], edges[2], edges[7]); in getTriangles() 43 Triangles[3].set( edges[7], edges[2], edges[6]); in getTriangles() 45 Triangles[4].set( edges[7], edges[6], edges[4]); in getTriangles() 46 Triangles[5].set( edges[5], edges[7], edges[4]); in getTriangles() 48 Triangles[6].set( edges[5], edges[4], edges[0]); in getTriangles() 49 Triangles[7].set( edges[5], edges[0], edges[1]); in getTriangles() 51 Triangles[8].set( edges[1], edges[3], edges[7]); in getTriangles() 52 Triangles[9].set( edges[1], edges[7], edges[5]); in getTriangles() [all …]
|
/dports/devel/boost-docs/boost_1_72_0/libs/graph/test/ |
H A D | dominator_tree_test.cpp | 21 vector<edge> edges; member 41 testSet[0].edges.push_back(edge(0, 1)); in test_main() 42 testSet[0].edges.push_back(edge(0, 2)); in test_main() 43 testSet[0].edges.push_back(edge(0, 3)); in test_main() 44 testSet[0].edges.push_back(edge(1, 4)); in test_main() 45 testSet[0].edges.push_back(edge(2, 1)); in test_main() 46 testSet[0].edges.push_back(edge(2, 4)); in test_main() 47 testSet[0].edges.push_back(edge(2, 5)); in test_main() 48 testSet[0].edges.push_back(edge(3, 6)); in test_main() 49 testSet[0].edges.push_back(edge(3, 7)); in test_main() [all …]
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/ |
H A D | dominator_tree_test.cpp | 21 vector<edge> edges; member 41 testSet[0].edges.push_back(edge(0, 1)); in test_main() 42 testSet[0].edges.push_back(edge(0, 2)); in test_main() 43 testSet[0].edges.push_back(edge(0, 3)); in test_main() 44 testSet[0].edges.push_back(edge(1, 4)); in test_main() 45 testSet[0].edges.push_back(edge(2, 1)); in test_main() 46 testSet[0].edges.push_back(edge(2, 4)); in test_main() 47 testSet[0].edges.push_back(edge(2, 5)); in test_main() 48 testSet[0].edges.push_back(edge(3, 6)); in test_main() 49 testSet[0].edges.push_back(edge(3, 7)); in test_main() [all …]
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/ |
H A D | dominator_tree_test.cpp | 21 vector<edge> edges; member 41 testSet[0].edges.push_back(edge(0, 1)); in test_main() 42 testSet[0].edges.push_back(edge(0, 2)); in test_main() 43 testSet[0].edges.push_back(edge(0, 3)); in test_main() 44 testSet[0].edges.push_back(edge(1, 4)); in test_main() 45 testSet[0].edges.push_back(edge(2, 1)); in test_main() 46 testSet[0].edges.push_back(edge(2, 4)); in test_main() 47 testSet[0].edges.push_back(edge(2, 5)); in test_main() 48 testSet[0].edges.push_back(edge(3, 6)); in test_main() 49 testSet[0].edges.push_back(edge(3, 7)); in test_main() [all …]
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/ |
H A D | dominator_tree_test.cpp | 21 vector<edge> edges; member 41 testSet[0].edges.push_back(edge(0, 1)); in test_main() 42 testSet[0].edges.push_back(edge(0, 2)); in test_main() 43 testSet[0].edges.push_back(edge(0, 3)); in test_main() 44 testSet[0].edges.push_back(edge(1, 4)); in test_main() 45 testSet[0].edges.push_back(edge(2, 1)); in test_main() 46 testSet[0].edges.push_back(edge(2, 4)); in test_main() 47 testSet[0].edges.push_back(edge(2, 5)); in test_main() 48 testSet[0].edges.push_back(edge(3, 6)); in test_main() 49 testSet[0].edges.push_back(edge(3, 7)); in test_main() [all …]
|
/dports/databases/percona57-server/boost_1_59_0/libs/graph/test/ |
H A D | dominator_tree_test.cpp | 21 vector<edge> edges; member 41 testSet[0].edges.push_back(edge(0, 1)); in test_main() 42 testSet[0].edges.push_back(edge(0, 2)); in test_main() 43 testSet[0].edges.push_back(edge(0, 3)); in test_main() 44 testSet[0].edges.push_back(edge(1, 4)); in test_main() 45 testSet[0].edges.push_back(edge(2, 1)); in test_main() 46 testSet[0].edges.push_back(edge(2, 4)); in test_main() 47 testSet[0].edges.push_back(edge(2, 5)); in test_main() 48 testSet[0].edges.push_back(edge(3, 6)); in test_main() 49 testSet[0].edges.push_back(edge(3, 7)); in test_main() [all …]
|
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/ |
H A D | dominator_tree_test.cpp | 21 vector<edge> edges; member 41 testSet[0].edges.push_back(edge(0, 1)); in test_main() 42 testSet[0].edges.push_back(edge(0, 2)); in test_main() 43 testSet[0].edges.push_back(edge(0, 3)); in test_main() 44 testSet[0].edges.push_back(edge(1, 4)); in test_main() 45 testSet[0].edges.push_back(edge(2, 1)); in test_main() 46 testSet[0].edges.push_back(edge(2, 4)); in test_main() 47 testSet[0].edges.push_back(edge(2, 5)); in test_main() 48 testSet[0].edges.push_back(edge(3, 6)); in test_main() 49 testSet[0].edges.push_back(edge(3, 7)); in test_main() [all …]
|
/dports/databases/percona57-client/boost_1_59_0/libs/graph/test/ |
H A D | dominator_tree_test.cpp | 21 vector<edge> edges; member 41 testSet[0].edges.push_back(edge(0, 1)); in test_main() 42 testSet[0].edges.push_back(edge(0, 2)); in test_main() 43 testSet[0].edges.push_back(edge(0, 3)); in test_main() 44 testSet[0].edges.push_back(edge(1, 4)); in test_main() 45 testSet[0].edges.push_back(edge(2, 1)); in test_main() 46 testSet[0].edges.push_back(edge(2, 4)); in test_main() 47 testSet[0].edges.push_back(edge(2, 5)); in test_main() 48 testSet[0].edges.push_back(edge(3, 6)); in test_main() 49 testSet[0].edges.push_back(edge(3, 7)); in test_main() [all …]
|
/dports/devel/boost-libs/boost_1_72_0/libs/graph/test/ |
H A D | dominator_tree_test.cpp | 21 vector<edge> edges; member 41 testSet[0].edges.push_back(edge(0, 1)); in test_main() 42 testSet[0].edges.push_back(edge(0, 2)); in test_main() 43 testSet[0].edges.push_back(edge(0, 3)); in test_main() 44 testSet[0].edges.push_back(edge(1, 4)); in test_main() 45 testSet[0].edges.push_back(edge(2, 1)); in test_main() 46 testSet[0].edges.push_back(edge(2, 4)); in test_main() 47 testSet[0].edges.push_back(edge(2, 5)); in test_main() 48 testSet[0].edges.push_back(edge(3, 6)); in test_main() 49 testSet[0].edges.push_back(edge(3, 7)); in test_main() [all …]
|
/dports/devel/hyperscan/boost_1_75_0/libs/graph/test/ |
H A D | dominator_tree_test.cpp | 21 vector< edge > edges; member 39 testSet[0].edges.push_back(edge(0, 1)); in main() 40 testSet[0].edges.push_back(edge(0, 2)); in main() 41 testSet[0].edges.push_back(edge(0, 3)); in main() 42 testSet[0].edges.push_back(edge(1, 4)); in main() 43 testSet[0].edges.push_back(edge(2, 1)); in main() 44 testSet[0].edges.push_back(edge(2, 4)); in main() 45 testSet[0].edges.push_back(edge(2, 5)); in main() 46 testSet[0].edges.push_back(edge(3, 6)); in main() 47 testSet[0].edges.push_back(edge(3, 7)); in main() [all …]
|
/dports/science/PETSc/petsc-3.14.1/src/dm/impls/plex/tests/output/ |
H A D | ex12_14.out | 1585 [0] 1: 3 edges 1589 [0] 2: 4 edges 1594 [0] 3: 3 edges 1598 [0] 4: 6 edges 1605 [0] 6: 3 edges 1609 [0] 7: 5 edges 1616 [1] 0: 5 edges 1622 [1] 2: 4 edges 1627 [1] 3: 3 edges 1631 [1] 4: 6 edges [all …]
|
H A D | ex12_5.out | 1585 [0] 1: 2 edges 1588 [0] 2: 4 edges 1593 [0] 3: 2 edges 1596 [0] 4: 6 edges 1603 [0] 6: 4 edges 1608 [0] 7: 7 edges 1617 [1] 0: 4 edges 1622 [1] 2: 4 edges 1627 [1] 3: 2 edges 1630 [1] 4: 6 edges [all …]
|
/dports/games/dhewm3/dhewm3-1.5.1/neo/idlib/geometry/ |
H A D | TraceModel.cpp | 246 edges[ 1].v[0] = 4; edges[ 1].v[1] = 0; in InitOctahedron() 247 edges[ 2].v[0] = 0; edges[ 2].v[1] = 2; in InitOctahedron() 248 edges[ 3].v[0] = 2; edges[ 3].v[1] = 4; in InitOctahedron() 249 edges[ 4].v[0] = 2; edges[ 4].v[1] = 1; in InitOctahedron() 250 edges[ 5].v[0] = 1; edges[ 5].v[1] = 4; in InitOctahedron() 251 edges[ 6].v[0] = 1; edges[ 6].v[1] = 3; in InitOctahedron() 252 edges[ 7].v[0] = 3; edges[ 7].v[1] = 4; in InitOctahedron() 253 edges[ 8].v[0] = 3; edges[ 8].v[1] = 0; in InitOctahedron() 254 edges[ 9].v[0] = 5; edges[ 9].v[1] = 2; in InitOctahedron() 255 edges[10].v[0] = 0; edges[10].v[1] = 5; in InitOctahedron() [all …]
|
/dports/databases/postgis30/postgis-3.0.4/deps/wagyu/include/mapbox/geometry/wagyu/ |
H A D | local_minimum_util.hpp | 57 std::rotate(edges.begin(), edge, edges.end()); in start_list_on_local_maximum() 67 std::swap(bnd.edges, edges); in create_bound_towards_minimum() 102 std::swap(edges, bnd.edges); in create_bound_towards_minimum() 105 std::move(edges.begin(), next_edge, std::back_inserter(bnd.edges)); in create_bound_towards_minimum() 106 edges.erase(edges.begin(), next_edge); in create_bound_towards_minimum() 108 std::reverse(bnd.edges.begin(), bnd.edges.end()); in create_bound_towards_minimum() 116 std::swap(bnd.edges, edges); in create_bound_towards_maximum() 145 std::swap(bnd.edges, edges); in create_bound_towards_maximum() 149 edges.erase(edges.begin(), next_edge); in create_bound_towards_maximum() 193 left_bound.edges.erase(left_bound.edges.begin(), edge_itr); in move_horizontals_on_left_to_right() [all …]
|