| /dports/math/cgal/CGAL-5.3/include/CGAL/OTR_2/ |
| H A D | Reconstruction_triangulation_2.h | 180 return edge.first->vertex(edge.second); in opposite_vertex()
259 edge = twin_edge(edge); in CGAL_For_all()
267 return edge.first->ghost(edge.second); in is_ghost()
271 return edge.first->plan(edge.second); in get_plan()
275 edge.first->plan(edge.second) = simplex; in set_plan()
279 return edge.first->mass(edge.second); in get_mass()
283 edge.first->mass(edge.second) = mass; in set_mass()
287 return edge.first->cost(edge.second); in get_cost()
427 edge = next_edge(edge); in compute_cost_around_vertex()
432 edge = next_edge(edge); in compute_cost_around_vertex()
[all …]
|
| /dports/math/ogdf/OGDF/include/ogdf/planarity/ |
| H A D | PlanRepExpansion.h | 146 edge originalEdge(edge e) const { return m_eOrig[e]; } in originalEdge()
179 List<edge> &setOrigs(edge e, edge &eOrig, nodeSplit &ns);
242 edge split(edge e) override;
244 void unsplit(edge eIn, edge eOut) override;
253 edge eOrig,
258 edge eSrc,
259 edge eTgt);
274 edge eOrig,
294 edge eOrig,
388 edge enlargeSplit(node v, edge e);
[all …]
|
| /dports/cad/openroad/OpenROAD-2.0/src/sta/search/ |
| H A D | SearchPred.cc | 50 SearchPred0::searchThru(Edge *edge) in searchThru() argument
56 || edge->isDisabledCond() in searchThru()
63 || (edge->isBidirectInstPath() in searchThru()
65 || (edge->isBidirectNetPath() in searchThru()
89 && !edge->isDisabledLoop(); in searchThru()
166 if (pred.searchThru(edge)) in isClkEnd()
175 searchThru(const Edge *edge, in searchThru() argument
183 && searchThru(edge->from(graph), from_rf, edge, edge->to(graph), to_rf); in searchThru()
189 const Edge *edge, in searchThru() argument
247 && pred->searchThru(edge)) in hasFanin()
[all …]
|
| /dports/sysutils/kubectl/kubernetes-1.22.2/third_party/forked/gonum/graph/simple/ |
| H A D | edgeholder.go | 26 for _, edge := range e.edges {
28 visitor(edge.To().ID(), edge)
30 visitor(edge.From().ID(), edge)
36 for i, edge := range e.edges {
52 for i, edge := range e.edges {
86 return edge, true
90 return edge, true
105 visitor(neighbor, edge)
113 e[neighbor] = edge
117 edge, ok := e[neighbor]
[all …]
|
| /dports/databases/postgis30/postgis-3.0.4/topology/test/regress/ |
| H A D | legacy_invalid_expected | 3 edge crosses node|1|23
5 edge not simple|28|
6 invalid edge|33|
7 edge crosses edge|2|28
8 edge crosses edge|2|29
9 edge crosses edge|2|32
10 edge crosses edge|9|27
11 edge crosses edge|10|27
12 edge crosses edge|19|27
13 edge crosses edge|20|27
[all …]
|
| /dports/databases/postgis31/postgis-3.1.4/topology/test/regress/ |
| H A D | legacy_invalid_expected | 3 edge crosses node|1|23
5 edge not simple|28|
6 invalid edge|33|
7 edge crosses edge|2|28
8 edge crosses edge|2|29
9 edge crosses edge|2|32
10 edge crosses edge|9|27
11 edge crosses edge|10|27
12 edge crosses edge|19|27
13 edge crosses edge|20|27
[all …]
|
| /dports/math/graphthing/graphthing-1.3.2/src/ |
| H A D | heawood.gt | 19 edge "0" -- "1"
20 edge "1" -- "2"
21 edge "2" -- "3"
22 edge "3" -- "4"
23 edge "4" -- "5"
24 edge "5" -- "6"
25 edge "6" -- "7"
26 edge "7" -- "8"
27 edge "8" -- "9"
33 edge "0" -- "5"
[all …]
|
| /dports/math/spot/spot-2.10.2/doc/org/ |
| H A D | tut21.org | 269 edge(0 -> 1)
272 edge(0 -> 2)
275 edge(0 -> 3)
278 edge(0 -> 4)
281 edge(0 -> 5)
284 edge(0 -> 6)
288 edge(1 -> 1)
292 edge(2 -> 2)
295 edge(2 -> 2)
298 edge(2 -> 2)
[all …]
|
| /dports/math/py-spot/spot-2.10.2/doc/org/ |
| H A D | tut21.org | 269 edge(0 -> 1)
272 edge(0 -> 2)
275 edge(0 -> 3)
278 edge(0 -> 4)
281 edge(0 -> 5)
284 edge(0 -> 6)
288 edge(1 -> 1)
292 edge(2 -> 2)
295 edge(2 -> 2)
298 edge(2 -> 2)
[all …]
|
| /dports/lang/spidermonkey60/firefox-60.9.0/gfx/skia/skia/src/core/ |
| H A D | SkEdgeBuilder.cpp | 45 last->fLastY = edge->fLastY; in CombineVertical()
114 return !edge->fDX && !edge->fCurveCount; in vertical_line()
119 return !edge->fDX && !edge->fCurveCount; in vertical_line()
140 fList.push(edge); in addLine()
158 fList.push(edge); in addLine()
176 fList.push(edge); in addQuad()
183 fList.push(edge); in addQuad()
198 if (edge->setCubic(pts)) { in addCubic()
199 fList.push(edge); in addCubic()
206 fList.push(edge); in addCubic()
[all …]
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/jfr/leakprofiler/chains/ |
| H A D | edgeUtils.cpp | 38 return (const Edge*)edge.pointee()->mark().to_pointer() == &edge; in is_leak_edge()
42 assert(!edge.is_root(), "invariant"); in field_offset()
55 assert(!edge.is_root() || !EdgeUtils::is_array_element(edge), "invariant"); in field_type()
60 assert(!edge.is_root(), "invariant"); in field_name_symbol()
62 const int offset = field_offset(edge); in field_name_symbol()
95 assert(!edge.is_root(), "invariant"); in is_array_element()
102 assert(!edge.is_root(), "invariant"); in array_offset()
115 return is_array_element(edge) ? array_offset(edge) : 0; in array_index()
119 if (is_array_element(edge)) { in array_size()
129 const Edge* current = &edge; in root()
[all …]
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/jfr/leakprofiler/chains/ |
| H A D | edgeUtils.cpp | 38 return (const Edge*)edge.pointee()->mark() == &edge; in is_leak_edge()
42 assert(!edge.is_root(), "invariant"); in field_offset()
56 assert(!edge.is_root() || !EdgeUtils::is_array_element(edge), "invariant"); in field_type()
61 assert(!edge.is_root(), "invariant"); in field_name_symbol()
63 const int offset = field_offset(edge); in field_name_symbol()
96 assert(!edge.is_root(), "invariant"); in is_array_element()
103 assert(!edge.is_root(), "invariant"); in array_offset()
117 return is_array_element(edge) ? array_offset(edge) : 0; in array_index()
121 if (is_array_element(edge)) { in array_size()
131 const Edge* current = &edge; in root()
[all …]
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/jfr/leakprofiler/chains/ |
| H A D | edgeUtils.cpp | 38 return (const Edge*)edge.pointee()->mark() == &edge; in is_leak_edge()
42 assert(!edge.is_root(), "invariant"); in field_offset()
56 assert(!edge.is_root() || !EdgeUtils::is_array_element(edge), "invariant"); in field_type()
61 assert(!edge.is_root(), "invariant"); in field_name_symbol()
63 const int offset = field_offset(edge); in field_name_symbol()
96 assert(!edge.is_root(), "invariant"); in is_array_element()
103 assert(!edge.is_root(), "invariant"); in array_offset()
117 return is_array_element(edge) ? array_offset(edge) : 0; in array_index()
121 if (is_array_element(edge)) { in array_size()
131 const Edge* current = &edge; in root()
[all …]
|
| /dports/science/chrono/chrono-7.0.1/src/chrono_thirdparty/HACDv2/ |
| H A D | dgPolyhedra.cpp | 211 edge = edge->m_twin->m_next;
635 edge = edge->m_twin->m_next;
1640 edge = edge->m_twin->m_next;
1945 edge->m_twin->m_twin = edge; in EndFace()
1967 edge->m_twin->m_twin = edge; in EndFace()
2027 edge = edge->m_next; in FaceNormal()
2032 for (edge = edge->m_next; edge != face; edge = edge->m_next) { in FaceNormal()
3213 edge = edge->m_next; in MarkAdjacentCoplanarFaces()
3527 edge = edge->m_next; in Triangulate()
3591 edge->m_next = edge->m_twin; in RemoveColinearVertices()
[all …]
|
| /dports/x11-wm/sawfish/sawfish_1.13.0/themes/microGUI/ |
| H A D | theme.jl | 112 (left-edge . -6)
113 (top-edge . -19)
122 (top-edge . -19)
123 (left-edge . 19)
129 (top-edge . -19)
130 (left-edge . 0)
136 (top-edge . -19)
141 (top-edge . -19)
149 (top-edge . 8)
162 (top-edge . 0)
[all …]
|
| /dports/databases/postgis25/postgis-2.5.5/topology/test/regress/ |
| H A D | legacy_invalid_expected | 4 edge crosses node|1|23
6 edge not simple|28|
7 invalid edge|33|
8 edge crosses edge|2|28
9 edge crosses edge|2|29
10 edge crosses edge|2|32
11 edge crosses edge|9|27
12 edge crosses edge|10|27
13 edge crosses edge|19|27
14 edge crosses edge|20|27
[all …]
|
| /dports/devel/cflow2vcg/cflow2vcg-0.5/test/ |
| H A D | rsst.vcg | 7 edge: { sourcename: "1" targetname: "2" class: 2 }
9 edge: { sourcename: "1" targetname: "3" class: 1 }
11 edge: { sourcename: "3" targetname: "4" class: 2 }
13 edge: { sourcename: "3" targetname: "5" class: 2 }
17 edge: { sourcename: "7" targetname: "8" class: 1 }
19 edge: { sourcename: "7" targetname: "9" class: 2 }
21 edge: { sourcename: "7" targetname: "10" class: 1 }
23 edge: { sourcename: "10" targetname: "11" class: 2 }
25 edge: { sourcename: "10" targetname: "12" class: 2 }
27 edge: { sourcename: "10" targetname: "13" class: 1 }
[all …]
|
| /dports/cad/magic/magic-8.3.245/plow/ |
| H A D | PlowJogs.c | 104 Edge edge; local
126 edge.e_x = edge.e_newx = area->r_xtop;
130 edge.e_flags = 0;
131 for (edge.e_pNum = PL_TECHDEPBASE; edge.e_pNum < DBNumPlanes; edge.e_pNum++)
171 Edge *edge; in plowProcessJog()
222 Edge *edge; in plowJogPropagateLeft()
227 edge->e_newx = edge->e_x;
228 if (edge->e_ltype == TT_SPACE && edge->e_rtype != TT_SPACE)
274 jogEdge = edge;
322 newedge = *edge;
[all …]
|
| /dports/games/pioneers/pioneers-15.6/common/ |
| H A D | map_query.c | 67 return edge->nodes[0] == node || edge->nodes[1] == node; in is_edge_adjacent_to_node()
345 return edge->owner < 0 && is_edge_on_land(edge) in can_road_be_setup()
366 return edge->owner < 0 && is_edge_on_sea(edge) in can_ship_be_setup()
387 return edge->owner < 0 && !is_edge_on_land(edge) in can_bridge_be_setup()
406 return edge->owner < 0 && is_road_valid(edge, owner); in can_road_be_built()
424 return edge->owner < 0 && is_ship_valid(edge, owner); in can_ship_be_built()
447 if (edge && edge->owner == owner && edge != not in can_ship_be_moved_node()
845 return edge != NULL && edge->owner < 0; in map_road_vacant()
854 return edge != NULL && edge->owner < 0; in map_ship_vacant()
863 return edge != NULL && edge->owner < 0; in map_bridge_vacant()
[all …]
|
| /dports/net/mpich/mpich-3.4.3/modules/hwloc/netloc/ |
| H A D | edge.c | 26 netloc_edge_t *edge = NULL; in netloc_edge_construct() local
29 if( NULL == edge ) { in netloc_edge_construct()
33 edge->id = cur_uid; in netloc_edge_construct()
36 edge->dest = NULL; in netloc_edge_construct()
37 edge->node = NULL; in netloc_edge_construct()
41 edge->total_gbits = 0; in netloc_edge_construct()
47 edge->userdata = NULL; in netloc_edge_construct()
49 return edge; in netloc_edge_construct()
61 utarray_free(edge->partitions); in netloc_edge_destruct()
68 utarray_free(edge->subnode_edges); in netloc_edge_destruct()
[all …]
|
| /dports/net/mpich/mpich-3.4.3/src/pm/hydra2/libhydra/topo/hwloc/hwloc/netloc/ |
| H A D | edge.c | 26 netloc_edge_t *edge = NULL; in netloc_edge_construct() local
29 if( NULL == edge ) { in netloc_edge_construct()
33 edge->id = cur_uid; in netloc_edge_construct()
36 edge->dest = NULL; in netloc_edge_construct()
37 edge->node = NULL; in netloc_edge_construct()
41 edge->total_gbits = 0; in netloc_edge_construct()
47 edge->userdata = NULL; in netloc_edge_construct()
49 return edge; in netloc_edge_construct()
61 utarray_free(edge->partitions); in netloc_edge_destruct()
68 utarray_free(edge->subnode_edges); in netloc_edge_destruct()
[all …]
|
| /dports/net/mpich/mpich-3.4.3/src/pm/hydra/tools/topo/hwloc/hwloc/netloc/ |
| H A D | edge.c | 26 netloc_edge_t *edge = NULL; in netloc_edge_construct() local
29 if( NULL == edge ) { in netloc_edge_construct()
33 edge->id = cur_uid; in netloc_edge_construct()
36 edge->dest = NULL; in netloc_edge_construct()
37 edge->node = NULL; in netloc_edge_construct()
41 edge->total_gbits = 0; in netloc_edge_construct()
47 edge->userdata = NULL; in netloc_edge_construct()
49 return edge; in netloc_edge_construct()
61 utarray_free(edge->partitions); in netloc_edge_destruct()
68 utarray_free(edge->subnode_edges); in netloc_edge_destruct()
[all …]
|
| /dports/devel/hwloc2/hwloc-2.5.0/netloc/ |
| H A D | edge.c | 26 netloc_edge_t *edge = NULL; in netloc_edge_construct() local
29 if( NULL == edge ) { in netloc_edge_construct()
33 edge->id = cur_uid; in netloc_edge_construct()
36 edge->dest = NULL; in netloc_edge_construct()
37 edge->node = NULL; in netloc_edge_construct()
41 edge->total_gbits = 0; in netloc_edge_construct()
47 edge->userdata = NULL; in netloc_edge_construct()
49 return edge; in netloc_edge_construct()
61 utarray_free(edge->partitions); in netloc_edge_destruct()
68 utarray_free(edge->subnode_edges); in netloc_edge_destruct()
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/plot-lib/plot/private/common/ |
| H A D | marching-cubes.rkt | 58 (list (list (edge-1-2 d d1 d2) (edge-1-5 d d1 d5) (edge-1-4 d d1 d4))))
71 (list (list (edge-1-5 d d1 d5) (edge-2-6 d d2 d6) (edge-3-7 d d3 d7)
93 (list (list (edge-1-2 d d1 d2) (edge-1-5 d d1 d5) (edge-1-4 d d1 d4))
101 (list (list (edge-1-2 d d1 d2) (edge-1-5 d d1 d5) (edge-1-4 d d1 d4))
102 (list (edge-6-7 d d6 d7) (edge-3-7 d d3 d7) (edge-7-8 d d7 d8))))
180 (list (list (edge-1-5 d d1 d5) (edge-1-2 d d1 d2) (edge-1-4 d d1 d4))
181 (list (edge-2-3 d d2 d3) (edge-3-7 d d3 d7) (edge-3-4 d d3 d4))
182 (list (edge-5-6 d d5 d6) (edge-2-6 d d2 d6) (edge-6-7 d d6 d7))
183 (list (edge-7-8 d d7 d8) (edge-5-8 d d5 d8) (edge-4-8 d d4 d8)))
245 (list (list (edge-1-5 d d1 d5) (edge-5-6 d d5 d6) (edge-6-7 d d6 d7)
[all …]
|
| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | pstep.c | 55 if (edge[ed].downright == NULL && edge[ed].downleft == NULL) { in writeOTU()
350 edge[nextedge].up = edge[dockedge].up; in addnextleaf_orig()
351 edge[nextedge].downleft = &edge[dockedge]; in addnextleaf_orig()
352 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf_orig()
353 edge[dockedge].up = &edge[nextedge]; in addnextleaf_orig()
357 if ( ((edge[nextedge].up)->downleft) == &edge[dockedge] ) in addnextleaf_orig()
358 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf_orig()
360 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf_orig()
364 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf_orig()
414 (edge[nextedge].edgemap)[i] = (edge[dockedge].edgemap)[i]; in updateedgemap_orig()
[all …]
|