| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | pstep-deglob.c | 91 *nextedge = 3; in inittree_orig()
132 int nextedge; in addnextleaf_orig() local
162 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf_orig()
167 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf_orig()
169 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf_orig()
173 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf_orig()
246 (edge[nextedge].edgemap)[nextedge] = 0; in addnextleaf_orig()
247 (edge[nextedge].edgemap)[nextedge+1] = 5; /* down right */ in addnextleaf_orig()
250 (edge[nextedge+1].edgemap)[nextedge] = 1; /* up */ in addnextleaf_orig()
251 (edge[nextedge+1].edgemap)[nextedge+1] = 0; in addnextleaf_orig()
[all …]
|
| H A D | pstep-orig.c | 66 nextedge = 3; in inittree()
102 if (dockedge >= nextedge) { in addnextleaf()
126 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf()
131 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf()
133 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf()
137 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf()
210 (edge[nextedge].edgemap)[nextedge] = 0; in addnextleaf()
211 (edge[nextedge].edgemap)[nextedge+1] = 5; /* down right */ in addnextleaf()
214 (edge[nextedge+1].edgemap)[nextedge] = 1; /* up */ in addnextleaf()
215 (edge[nextedge+1].edgemap)[nextedge+1] = 0; in addnextleaf()
[all …]
|
| H A D | pstep-mrca.c | 94 *nextedge = 3; in inittree_orig()
136 int nextedge; in addnextleaf_orig() local
166 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf_orig()
171 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf_orig()
173 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf_orig()
177 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf_orig()
249 (edge[nextedge].edgemap)[nextedge] = 0; in addnextleaf_orig()
250 (edge[nextedge].edgemap)[nextedge+1] = 5; /* down right */ in addnextleaf_orig()
253 (edge[nextedge+1].edgemap)[nextedge] = 1; /* up */ in addnextleaf_orig()
254 (edge[nextedge+1].edgemap)[nextedge+1] = 0; in addnextleaf_orig()
[all …]
|
| H A D | pstep-recursive.c | 94 *nextedge = 3; in inittree_orig()
136 int nextedge; in addnextleaf_orig() local
166 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf_orig()
171 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf_orig()
173 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf_orig()
177 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf_orig()
249 (edge[nextedge].edgemap)[nextedge] = 0; in addnextleaf_orig()
250 (edge[nextedge].edgemap)[nextedge+1] = 5; /* down right */ in addnextleaf_orig()
253 (edge[nextedge+1].edgemap)[nextedge] = 1; /* up */ in addnextleaf_orig()
254 (edge[nextedge+1].edgemap)[nextedge+1] = 0; in addnextleaf_orig()
[all …]
|
| H A D | pstep-trueID.c | 98 *nextedge = 3; in inittree_orig()
140 int nextedge; in addnextleaf_orig() local
170 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf_orig()
175 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf_orig()
177 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf_orig()
181 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf_orig()
253 (edge[nextedge].edgemap)[nextedge] = 0; in addnextleaf_orig()
254 (edge[nextedge].edgemap)[nextedge+1] = 5; /* down right */ in addnextleaf_orig()
257 (edge[nextedge+1].edgemap)[nextedge] = 1; /* up */ in addnextleaf_orig()
258 (edge[nextedge+1].edgemap)[nextedge+1] = 0; in addnextleaf_orig()
[all …]
|
| H A D | pstep.c | 266 *nextedge = 3; in inittree_orig()
322 int nextedge; in addnextleaf_orig() local
325 nextedge=*in_nextedge; in addnextleaf_orig()
352 edge[nextedge].downright = &edge[nextedge+1]; 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()
374 nextedge = nextedge + 2; in addnextleaf_orig()
376 *in_nextedge=nextedge; in addnextleaf_orig()
493 (edge[nextedge].edgemap)[nextedge] = NOWHERE; /* to itself */ in updateedgemap_orig()
[all …]
|
| H A D | pstep-split.c | 124 *nextedge = 3; in inittree_split()
268 int nextedge; in addnextleaf_split() local
298 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf_split()
303 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf_split()
305 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf_split()
309 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf_split()
382 (edge[nextedge].edgemap)[nextedge] = 0; in addnextleaf_split()
383 (edge[nextedge].edgemap)[nextedge+1] = 5; /* down right */ in addnextleaf_split()
386 (edge[nextedge+1].edgemap)[nextedge] = 1; /* up */ in addnextleaf_split()
387 (edge[nextedge+1].edgemap)[nextedge+1] = 0; in addnextleaf_split()
[all …]
|
| H A D | split.c | 59 *nextedge = 3; in inittree_split()
157 for (m = 0; m < (nextedge); m++) { in check_split()
328 int nextedge; in addnextleaf_split() local
331 nextedge=*in_nextedge; in addnextleaf_split()
334 if (dockedge >= nextedge) { in addnextleaf_split()
359 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf_split()
363 if (edge[nextedge].up != NULL) { in addnextleaf_split()
365 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf_split()
367 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf_split()
371 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf_split()
[all …]
|
| H A D | recur.c | 59 *nextedge = 3; in inittree_recur()
218 for (m = 0; m < (nextedge); m++) {
391 int nextedge; in addnextleaf_recur() local
394 nextedge=*in_nextedge; in addnextleaf_recur()
397 if (dockedge >= nextedge) { in addnextleaf_recur()
422 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf_recur()
426 if (edge[nextedge].up != NULL) { in addnextleaf_recur()
428 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf_recur()
430 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf_recur()
434 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf_recur()
[all …]
|
| H A D | mrca.c | 65 *nextedge = 3; in inittree_mrca()
397 int nextedge; in addnextleaf_mrca() local
400 nextedge=*in_nextedge; in addnextleaf_mrca()
403 if (dockedge >= nextedge) { in addnextleaf_mrca()
428 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf_mrca()
432 if (edge[nextedge].up != NULL) { in addnextleaf_mrca()
434 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf_mrca()
436 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf_mrca()
440 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf_mrca()
695 for (i = 0; i < nextedge; i++) {
[all …]
|
| H A D | recur-old.c | 60 *nextedge = 3; in inittree_recur()
163 for (m = 0; m < (nextedge); m++) {
334 int nextedge; in addnextleaf_recur() local
337 nextedge=*in_nextedge; in addnextleaf_recur()
340 if (dockedge >= nextedge) { in addnextleaf_recur()
366 edge[nextedge].downright = &edge[nextedge+1]; in addnextleaf_recur()
370 if (edge[nextedge].up != NULL) { in addnextleaf_recur()
372 (edge[nextedge].up)->downleft = &edge[nextedge]; in addnextleaf_recur()
374 (edge[nextedge].up)->downright = &edge[nextedge]; in addnextleaf_recur()
378 edge[nextedge+1].up = &edge[nextedge]; in addnextleaf_recur()
[all …]
|
| H A D | pstep-mrca.h | 85 int *nextedge, /* out: next free edge index (=3) */
94 int *nextedge, /* next free edge idx */
107 int nextedge, /* next free edge idx */
116 int nextedge, /* next free edge idx */
122 int nextedge); /* next free edge idx */
135 int nextedge, /* next free edge idx */
|
| H A D | pstep-recursive.h | 85 int *nextedge, /* out: next free edge index (=3) */
94 int *nextedge, /* next free edge idx */
107 int nextedge, /* next free edge idx */
116 int nextedge, /* next free edge idx */
122 int nextedge); /* next free edge idx */
135 int nextedge, /* next free edge idx */
|
| H A D | pstep-trueID.h | 85 int *nextedge, /* out: next free edge index (=3) */
94 int *nextedge, /* next free edge idx */
107 int nextedge, /* next free edge idx */
116 int nextedge, /* next free edge idx */
122 int nextedge); /* next free edge idx */
135 int nextedge, /* next free edge idx */
|
| H A D | pstep-deglob.h | 103 int *nextedge, /* out: next free edge index (=3) */
112 int *nextedge, /* next free edge idx */
125 int nextedge, /* next free edge idx */
134 int nextedge, /* next free edge idx */
140 int nextedge); /* next free edge idx */
153 int nextedge, /* next free edge idx */
|
| H A D | pstep.h | 238 int nextedge, /* next free edge idx */
246 int nextedge, /* next free edge idx */
252 int nextedge); /* next free edge idx */
259 int nextedge, /* next free edge idx */
276 int *nextedge, /* out: next free edge index (=3) */
283 int nextedge); /* next free edge idx */
329 int *nextedge, /* out: next free edge index (=3) */
337 int nextedge); /* next free edge idx */
|
| H A D | pstep-split.h | 111 int *nextedge, /* out: next free edge index (=3) */
120 int *nextedge, /* next free edge idx */
133 int nextedge, /* next free edge idx */
142 int nextedge, /* next free edge idx */
148 int nextedge); /* next free edge idx */
161 int nextedge, /* next free edge idx */
|
| /dports/biology/viennarna/ViennaRNA-2.4.18/src/RNAforester/src/wmatch/ |
| H A D | glib.c | 16 edge1->nextedge = g[n].adj_vector; in AddEdge()
17 if (edge1->nextedge != NULL) in AddEdge()
18 edge1->nextedge->prevedge = edge1; in AddEdge()
26 edge2->nextedge = g[m].adj_vector; in AddEdge()
27 if (edge2->nextedge != NULL) in AddEdge()
38 edge = edge->nextedge; in FindEdge()
54 if (edge->nextedge != NULL) in RemoveEdge()
57 else if (edge->nextedge == NULL) in RemoveEdge()
61 (edge->prevedge)->nextedge = edge->nextedge; in RemoveEdge()
65 if (other->nextedge != NULL) in RemoveEdge()
[all …]
|
| H A D | unpairs.c | 82 nextedge = OPPEDGE (LINK[newbase]); in UNLINK()
94 } while (LINK[nextbase] == nextedge); in UNLINK()
96 LASTEDGE[1] = nextedge; in UNLINK()
98 nextedge = OPPEDGE (e); in UNLINK()
99 if (LINK[nextbase] == nextedge) { in UNLINK()
103 LASTEDGE[2] = nextedge; in UNLINK()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/Master/ |
| H A D | small_graph.c | 40 edge_data *nextedge; in make_small_graph() local
58 for (v=0, nextedge=g->edges; v < p->vertnum; v++){ in make_small_graph()
103 nextedge->v0 = w; in make_small_graph()
104 nextedge->v1 = v; in make_small_graph()
106 nextedge->v0 = v; in make_small_graph()
107 nextedge->v1 = w; in make_small_graph()
109 (nextedge++)->cost = closenodes[pos].cost; in make_small_graph()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Master/ |
| H A D | small_graph.c | 40 edge_data *nextedge; in make_small_graph() local
58 for (v=0, nextedge=g->edges; v < p->vertnum; v++){ in make_small_graph()
103 nextedge->v0 = w; in make_small_graph()
104 nextedge->v1 = v; in make_small_graph()
106 nextedge->v0 = v; in make_small_graph()
107 nextedge->v1 = w; in make_small_graph()
109 (nextedge++)->cost = closenodes[pos].cost; in make_small_graph()
|
| /dports/graphics/geos/geos-3.9.1/src/operation/linemerge/ |
| H A D | LineMergeDirectedEdge.cpp | 59 …LineMergeDirectedEdge* nextedge = dynamic_cast<LineMergeDirectedEdge*>(getToNode()->getOutEdges()-… in getNext() local
60 assert(nextedge); in getNext()
62 return nextedge; in getNext()
|
| /dports/cad/electric/electric-7.00/src/db/ |
| H A D | dbmerge.c | 1256 db_mrg_assign_edge(nextedge,p2,nextedge->ed_end); in db_mrg_insert2()
1266 db_mrg_assign_edge(nextedge,p1,nextedge->ed_end); in db_mrg_insert2()
1274 nextedge = nextedge->nextpoly; in db_mrg_insert2()
1275 db_mrg_assign_edge(nextedge,p2,nextedge->ed_end); in db_mrg_insert2()
1374 nextedge = nextedge->nextpoly; in db_mrg_insert3()
1389 nextedge = nextedge->nextpoly; in db_mrg_insert3()
1493 nextedge = nextedge->nextpoly; in db_mrg_insert4()
1500 db_mrg_assign_edge(nextedge,p0,nextedge->ed_end); in db_mrg_insert4()
1508 db_mrg_assign_edge(nextedge,p0,nextedge->ed_end); in db_mrg_insert4()
1612 nextedge = nextedge->nextpoly; in db_mrg_housekeeper()
[all …]
|
| /dports/databases/grass7/grass-7.8.6/raster/r.terraflow/ |
| H A D | filldepr.cpp | 127 boundaryType* nextedge; in inmemory_fill_depression() local
135 ae = boundaryStr->read_item(&nextedge); in inmemory_fill_depression()
137 u = nextedge->getLabel1(); in inmemory_fill_depression()
138 v = nextedge->getLabel2(); in inmemory_fill_depression()
139 h = nextedge->getElevation(); in inmemory_fill_depression()
|
| /dports/textproc/retext/retext-7.2.2/ReText/ |
| H A D | tablemode.py | 146 nextedge = None
152 if edge != -1 and (nextedge is None or edge < nextedge):
153 nextedge = edge
156 return nextedge, _getEdgeIndex(nextedgerow.text, nextedge) if nextedge else None
|