| /dports/math/saga/saga-8.1.3/saga-gis/src/tools/grid/grid_calculus/ |
| H A D | kff_synth.cpp | 153 int mindegree = 0; in On_Execute() local
170 mindegree = Parameters ("MINDEGREE")->asInt (); in On_Execute()
182 mindegree, in On_Execute()
196 mindegree, in On_Execute()
|
| /dports/net/google-cloud-sdk-app-engine-go/platform/google_appengine/goroot-1.9/src/cmd/compile/internal/ssa/ |
| H A D | layout.go | 77 mindegree := f.NumBlocks()
83 if indegree[c.ID] < mindegree {
84 mindegree = indegree[c.ID]
|
| /dports/lang/go-devel/go-dragonfly-amd64-bootstrap/src/cmd/compile/internal/ssa/ |
| H A D | layout.go | 104 mindegree := f.NumBlocks()
110 if indegree[c.ID] < mindegree {
111 mindegree = indegree[c.ID]
|
| /dports/math/SCIP/scip-7.0.3/src/scip/ |
| H A D | struct_dcmp.h | 49 …int mindegree; /**< the minimum degree of the block decomposition graph… member
|
| H A D | dcmp.c | 79 (*decomp)->mindegree = 0; in SCIPdecompCreate()
345 return decomp->mindegree; in SCIPdecompGetBlockGraphMinDegree()
386 … decomp->nedges, decomp->narticulations, decomp->ncomponents, decomp->mindegree, decomp->maxdegree, in SCIPdecompPrintStats()
|
| H A D | scip_dcmp.c | 881 decomp->mindegree = 0; in buildBlockGraph()
1010 decomp->mindegree = decomp->maxdegree = nblocks - 1; in buildBlockGraph()
1099 decomp->mindegree = tempmin; in buildBlockGraph()
|
| /dports/math/saga/saga-8.1.3/saga-gis/src/tools/grid/grid_filter/geodesic_morph_rec/ |
| H A D | spezfunc.h | 87 int mindegree,
|
| H A D | spezfunc.c | 93 int mindegree, in read_coefficients() argument
112 for (l = mindegree; l <= maxdegree; l ++) in read_coefficients()
|
| /dports/editors/tweak/tweak-3.02/ |
| H A D | btree.h | 58 propmergefn_t propmerge, void *state, int mindegree);
|
| H A D | btree.c | 123 int mindegree; /* min number of subtrees */ member
232 return bt->mindegree; in bt_min_subtrees()
820 propmergefn_t propmerge, void *state, int mindegree) in bt_new() argument
825 ret->mindegree = mindegree; in bt_new()
826 ret->maxdegree = 2*mindegree; in bt_new()
886 bt->propmake, bt->propmerge, bt->userstate, bt->mindegree); in bt_clone()
1851 bt1->userstate, bt1->mindegree); in bt_split_internal()
2030 bt->propmake, bt->propmerge, bt->userstate, bt->mindegree); in bt_copy()
|
| /dports/math/vtk6/VTK-6.2.0/Imaging/Core/ |
| H A D | vtkImageBSplineInterpolator.cxx | 84 static int mindegree = 0; in SetSplineDegree() local
86 degree = ((degree > mindegree) ? degree : mindegree); in SetSplineDegree()
|
| /dports/math/py-sympy/sympy-1.9/sympy/categories/ |
| H A D | diagram_drawing.py | 1065 mindegree = len(adjlists[root])
1068 if current_degree < mindegree:
1070 mindegree = current_degree
|
| /dports/science/elmerfem/elmerfem-release-9.0/elmergrid/src/ |
| H A D | egparallel.c | 3225 int i,j,k,n,startn,mindegree,maxlevel,newroot,bw_bef,bw_aft; in RenumberCuthillMckee() local
3242 mindegree = degree[startn]; in RenumberCuthillMckee()
3244 if ( degree[i] < mindegree ) { in RenumberCuthillMckee()
3246 mindegree = degree[i]; in RenumberCuthillMckee()
3259 mindegree = degree[startn]; in RenumberCuthillMckee()
3264 if ( degree[i] < mindegree ) { in RenumberCuthillMckee()
3266 mindegree = degree[i]; in RenumberCuthillMckee()
|
| /dports/graphics/vcg/vcg.1.30/src/ |
| H A D | grammar.pgs | 425 "mindegree" { RETURN(LEXWORD_MINDEGREE); }
1098 | LEXWORD_MINDEGREE { $$ = mindegree(); }
|
| /dports/editors/neovim/neovim-0.6.1/runtime/syntax/ |
| H A D | maple.vim | 420 syn keyword mvPkg_networks addedge connectivity djspantree graphical mindegree shrink
|
| /dports/editors/vim/vim-8.2.3745/runtime/syntax/ |
| H A D | maple.vim | 420 syn keyword mvPkg_networks addedge connectivity djspantree graphical mindegree shrink
|