| /dports/games/minetest/minetest-5.4.1/src/util/ |
| H A D | areastore.cpp | 39 (AST_SMALLER_EQ_AS((amine), (b)->minedge) \
78 writeV3S16(os, a.minedge); in serialize()
101 a.minedge = readV3S16(is); in deserialize()
154 v3s16 minedge(mpos.X * r, mpos.Y * r, mpos.Z * r); in cacheMiss() local
156 minedge.X + r - 1, in cacheMiss()
157 minedge.Y + r - 1, in cacheMiss()
158 minedge.Z + r - 1); in cacheMiss()
160 as->getAreasInArea(dest, minedge, maxedge, true); in cacheMiss()
239 AST_CONTAINS_AREA(minedge, maxedge, area)) { in getAreasInArea()
250 const double p_low[] = {(double)minedge.X, in get_spatial_region()
[all …]
|
| H A D | areastore.h | 43 id(area_id), minedge(mine), maxedge(maxe) in id()
45 sortBoxVerticies(minedge, maxedge); in id()
49 v3s16 minedge, maxedge; member
84 v3s16 minedge, v3s16 maxedge, bool accept_overlap) = 0;
137 v3s16 minedge, v3s16 maxedge, bool accept_overlap);
157 v3s16 minedge, v3s16 maxedge, bool accept_overlap);
|
| /dports/math/parmetis/parmetis-4.0.3/metis/libmetis/ |
| H A D | checkgraph.c | 36 idx_t minedge, maxedge, minewgt, maxewgt; in CheckGraph() local
50 minedge = maxedge = adjncy[0]; in CheckGraph()
57 minedge = (k < minedge) ? k : minedge; in CheckGraph()
|
| /dports/math/py-PyMetis/PyMetis-2020.1/src/metis/libmetis/ |
| H A D | checkgraph.c | 36 idx_t minedge, maxedge, minewgt, maxewgt; in CheckGraph() local
50 minedge = maxedge = adjncy[0]; in CheckGraph()
57 minedge = (k < minedge) ? k : minedge; in CheckGraph()
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/metis/libmetis/ |
| H A D | checkgraph.c | 36 idx_t minedge, maxedge, minewgt, maxewgt; in CheckGraph() local
50 minedge = maxedge = adjncy[0]; in CheckGraph()
57 minedge = (k < minedge) ? k : minedge; in CheckGraph()
|
| /dports/math/libmesh/libmesh-1.6.2/contrib/metis/libmetis/ |
| H A D | checkgraph.c | 36 idx_t minedge, maxedge, minewgt, maxewgt; in CheckGraph() local
50 minedge = maxedge = adjncy[0]; in CheckGraph()
57 minedge = (k < minedge) ? k : minedge; in CheckGraph()
|
| /dports/science/octopus/octopus-10.5/external_libs/metis-5.1/libmetis/ |
| H A D | checkgraph.c | 36 idx_t minedge, maxedge, minewgt, maxewgt; in CheckGraph() local
50 minedge = maxedge = adjncy[0]; in CheckGraph()
57 minedge = (k < minedge) ? k : minedge; in CheckGraph()
|
| /dports/math/metis/metis-5.1.0/libmetis/ |
| H A D | checkgraph.c | 36 idx_t minedge, maxedge, minewgt, maxewgt; in CheckGraph() local
50 minedge = maxedge = adjncy[0]; in CheckGraph()
57 minedge = (k < minedge) ? k : minedge; in CheckGraph()
|
| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | pstep-mrca.c | 420 int minedge; /* minimum edge set */ in minimumedgeinfo_orig() local
424 minedge = 0; in minimumedgeinfo_orig()
431 minedge = i; in minimumedgeinfo_orig()
444 minedge = i; in minimumedgeinfo_orig()
448 *out_minedge=minedge; in minimumedgeinfo_orig()
471 int minedge; /* insertion edge of minimum penalty */ in onepstep() local
509 minimumedgeinfo_orig(*edge, *edgeofleaf, nextedge, nextleaf, &minedge, &mininfo); in onepstep()
512 addnextleaf_orig(minedge, *edge, *edgeofleaf, Maxspc, Maxbrnch, &nextedge, &nextleaf); in onepstep()
|
| H A D | pstep-recursive.c | 420 int minedge; /* minimum edge set */ in minimumedgeinfo_orig() local
424 minedge = 0; in minimumedgeinfo_orig()
431 minedge = i; in minimumedgeinfo_orig()
444 minedge = i; in minimumedgeinfo_orig()
448 *out_minedge=minedge; in minimumedgeinfo_orig()
471 int minedge; /* insertion edge of minimum penalty */ in onepstep() local
509 minimumedgeinfo_orig(*edge, *edgeofleaf, nextedge, nextleaf, &minedge, &mininfo); in onepstep()
512 addnextleaf_orig(minedge, *edge, *edgeofleaf, Maxspc, Maxbrnch, &nextedge, &nextleaf); in onepstep()
|
| H A D | pstep-trueID.c | 430 int minedge; /* minimum edge set */ in minimumedgeinfo_orig() local
434 minedge = 0; in minimumedgeinfo_orig()
441 minedge = i; in minimumedgeinfo_orig()
454 minedge = i; in minimumedgeinfo_orig()
458 *out_minedge=minedge; in minimumedgeinfo_orig()
482 int minedge; /* insertion edge of minimum penalty */ in onepstep() local
521 minimumedgeinfo_orig(*edge, *edgeofleaf, nextedge, nextleaf, &minedge, &mininfo); in onepstep()
524 addnextleaf_orig(minedge, *edge, *edgeofleaf, Maxspc, Maxbrnch, &nextedge, &nextleaf); in onepstep()
|
| H A D | pstep-deglob.c | 414 int minedge; /* minimum edge set */ in minimumedgeinfo_orig() local
418 minedge = 0; in minimumedgeinfo_orig()
425 minedge = i; in minimumedgeinfo_orig()
438 minedge = i; in minimumedgeinfo_orig()
442 *out_minedge=minedge; in minimumedgeinfo_orig()
|
| H A D | pstep-split.c | 558 int minedge; /* minimum edge set */ in minimumedgeinfo_split() local
562 minedge = 0; in minimumedgeinfo_split()
569 minedge = i; in minimumedgeinfo_split()
582 minedge = i; in minimumedgeinfo_split()
586 *out_minedge=minedge; in minimumedgeinfo_split()
610 int minedge; /* insertion edge of minimum penalty */ in onepstep_split() local
649 minimumedgeinfo_split(*edge, *edgeofleaf, nextedge, nextleaf, &minedge, &mininfo); in onepstep_split()
652 addnextleaf_split(minedge, *edge, *edgeofleaf, Maxspc, Maxbrnch, &nextedge, &nextleaf); in onepstep_split()
|
| H A D | pstep.c | 120 int minedge = 0; /* minimum edge (old search) */ in minimumedgeinfo() local
165 minedge = i; in minimumedgeinfo()
168 minedge = minedges[0]; in minimumedgeinfo()
171 *out_minedge=minedge; in minimumedgeinfo()
607 int minedge; /* insertion edge of minimum penalty */ in onepstep_orig() local
654 …minimumedgeinfo(tmpedge, tmpedgeofleaf, nextedge, nextleaf, minedges, &howmany, &minedge, &mininfo… in onepstep_orig()
657 …addnextleaf_orig(minedge, tmpedge, tmpedgeofleaf, tmprootleaf, Maxspc, Maxbrnch, &nextedge, &nextl… in onepstep_orig()
|
| H A D | pstep-orig.c | 349 minedge = 0; in minimumedgeinfo()
356 minedge = i; in minimumedgeinfo()
369 minedge = i; in minimumedgeinfo()
|
| H A D | pstep-orig.h | 44 EXTERN int minedge; /* edge with minimum edgeinfo */ variable
|
| H A D | pstep-mrca.h | 137 int *minedge, /* minimum edge set */
|
| H A D | pstep-recursive.h | 137 int *minedge, /* minimum edge set */
|
| H A D | pstep-trueID.h | 137 int *minedge, /* minimum edge set */
|
| H A D | pstep-deglob.h | 155 int *minedge, /* minimum edge set */
|
| H A D | pstep-split.h | 163 int *minedge, /* minimum edge set */
|
| H A D | mrca.c | 763 int minedge; /* insertion edge of minimum penalty */ in onepstep_mrca() local
854 &minedges, &howmany, &mininfo, &minedge); in onepstep_mrca()
870 minedges, &howmany, &mininfo, &minedge); in onepstep_mrca()
873 …addnextleaf_mrca(minedge, tmpedge, tmpedgeofleaf, tmprootleaf, Maxspc, Maxbrnch, &nextedge, &nextl… in onepstep_mrca()
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/tree/ |
| H A D | branchings.py | 485 minedge = None
493 minedge = edge_key
496 self.minedge_circuit.append(minedge)
593 minedge = self.minedge_circuit[self.level]
594 if minedge is None:
598 edges.remove(minedge)
|
| /dports/games/minetest/minetest-5.4.1/src/script/lua_api/ |
| H A D | l_areastore.cpp | 50 push_v3s16(L, a->minedge); in push_area()
152 v3s16 minedge = check_v3s16(L, 2); in l_get_areas_in_area() local
164 ast->getAreasInArea(&res, minedge, maxedge, accept_overlap); in l_get_areas_in_area()
|
| /dports/cad/magic/magic-8.3.245/doc/latexfiles/ |
| H A D | tutwrl1.tex | 94 \ii {\bfseries area} {\itshape types minarea minedge why}
99 {\itshape Minarea} is the minimum area that a region must have, while {\itshape minedge}
105 interaction between cells. Specifying {\itshape minedge} reduces this
230 \ii {\bfseries cifarea} {\itshape layer minarea minedge why}
233 {\itshape Layer} is again a single cif layer. {\itshape minedge} is expressed in
|