/dports/devel/py-BTrees/BTrees-4.9.2/ |
H A D | bootstrap.py | 173 best = [] variable 179 best = [dist] variable
|
/dports/devel/py-persistent/persistent-4.7.0/ |
H A D | bootstrap.py | 173 best = [] variable 179 best = [dist] variable
|
/dports/mail/dbmail/dbmail-3.2.5/jenkins/ |
H A D | bootstrap.py | 132 best = [] variable 138 best = [dist] variable
|
/dports/math/gfan/gfan0.6.2/src/ |
H A D | dimension.cpp | 27 … &ones, ExponentType &zeros, int nOnes, int nZeros, vector<ExponentType> vectors, int &best, int n) in rek64() 86 int best=0; in krullDimensionOfMonomialIdeal64() local 135 …or &ones, IntegerVector &zeros, int nOnes, int nZeros, IntegerVectorList const &vectors, int &best) in rek() 230 int best=0; in krullDimensionOfMonomialIdeal() local
|
/dports/math/gfanlib/gfan0.6.2/src/ |
H A D | dimension.cpp | 27 … &ones, ExponentType &zeros, int nOnes, int nZeros, vector<ExponentType> vectors, int &best, int n) in rek64() 86 int best=0; in krullDimensionOfMonomialIdeal64() local 135 …or &ones, IntegerVector &zeros, int nOnes, int nZeros, IntegerVectorList const &vectors, int &best) in rek() 230 int best=0; in krullDimensionOfMonomialIdeal() local
|
/dports/games/ufoai/ufoai-2.5-source/src/tools/radiant/radiant/brush/ |
H A D | SelectableComponents.h | 59 void testSelect (SelectionTest& test, SelectionIntersection& best) in testSelect() 91 void testSelect (SelectionTest& test, SelectionIntersection& best) in testSelect()
|
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
H A D | tracer.c | 120 edge best = NULL; in find_best_successor() local 138 edge best = NULL; in find_best_predecessor() local 328 edge e, best = NULL; in layout_superblocks() local
|
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
H A D | tracer.c | 120 edge best = NULL; in find_best_successor() local 138 edge best = NULL; in find_best_predecessor() local 328 edge e, best = NULL; in layout_superblocks() local
|
/dports/audio/ardour6/Ardour-6.8.0/libs/pbd/ |
H A D | mountpoint.cc | 53 char best[PATH_MAX+1]; in mountpoint() local 129 char best[PATH_MAX+1]; in mountpoint() local
|
/dports/games/tesseract-data/tesseract/src/game/ |
H A D | scoreboard.cpp | 46 void getbestplayers(vector<gameent *> &best) in getbestplayers() 57 void getbestteams(vector<int> &best) in getbestteams()
|
/dports/games/tesseract/tesseract/src/game/ |
H A D | scoreboard.cpp | 46 void getbestplayers(vector<gameent *> &best) in getbestplayers() 57 void getbestteams(vector<int> &best) in getbestteams()
|
/dports/math/py-mip/mip-1.13.0/examples/ |
H A D | tsp-mipstart.py | 103 sl, cur_cost, best = seq.copy(), cost, cost variable 110 seq, best = sl.copy(), cur_cost variable
|
/dports/math/gecode/gecode-0916a1a/gecode/search/par/ |
H A D | pbs.hh | 97 static const bool best = false; member in Gecode::Search::Par::CollectAll 121 static const bool best = true; member in Gecode::Search::Par::CollectBest
|
/dports/games/hexxagon/hexxagon-1.0.2/src/libhexx/ |
H A D | move.cpp | 61 int best = -SCR_INFINITY; in alphaBeta() local 88 int best = -SCR_INFINITY; in scoreMoves() local
|
/dports/biology/bbmap/bbmap/current/assemble/ |
H A D | TadpoleWrapper.java | 103 int best=0; in process() local 179 …static int expandLeft(ArrayList<Record> list, int best, ArrayList<String> argList, String contigsN… in expandLeft() 205 …static int expandRight(ArrayList<Record> list, int best, ArrayList<String> argList, String contigs… in expandRight() 230 …static int bisect(ArrayList<Record> list, int best, ArrayList<String> argList, String contigsName,… in bisect()
|
/dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/ |
H A D | tracer.c | 121 edge best = NULL; in find_best_successor() local 140 edge best = NULL; in find_best_predecessor() local 331 edge e, best = NULL; in layout_superblocks() local
|
/dports/games/edge/Edge-1.35-source/lib_win32/libvorbis-1.1.2/vq/ |
H A D | latticepare.c | 86 int best=0; in bestm() local 107 int best=bestm(b,vec); in closest() local 126 int best=bestm(b,ppt); in _heuristic() local 494 int best=_best(b,pointlist+i*dim,1); in main() local 540 int best=_best(b,pointlist+i*dim,1); in main() local
|
/dports/print/py-psautohint/psautohint-2.0.0/libpsautohint/src/ |
H A D | pick.c | 51 HintVal *prev, *bestPrev, *best; in PickVVals() local 151 HintVal *best, *vList; in FndBstVal() local 194 HintVal *best, *nonghst, *ghst = NULL; in FindBestValForSeg() local 268 HintVal *vlist, *hintList, *rejectList, *bestPrev, *prev, *best, *nxt; in PickHVals() local 386 HintVal* best; in FindBestValForSegs() local
|
/dports/math/vampire/vampire-4.5.1/Kernel/ |
H A D | LiteralByMatchability.hpp | 76 LiteralByMatchability best{(*c)[0]}; in find_least_matchable_in() local 89 LiteralByMatchability best{(*c)[0]}; in find_two_least_matchable_in() local
|
/dports/net/haproxy/haproxy-2.4.10/src/ |
H A D | http_rules.c | 118 const char *best = action_suggest(args[0], &http_req_keywords.list, NULL); in parse_http_req_cond() local 197 const char *best = action_suggest(args[0], &http_res_keywords.list, NULL); in parse_http_res_cond() local 267 const char *best = action_suggest(args[0], &http_after_res_keywords.list, NULL); in parse_http_after_res_cond() local
|
/dports/emulators/qemu/qemu-6.2.0/meson/test cases/unit/16 prebuilt static/libdir/ |
H A D | meson.build | 2 stlib = cc.find_library('best', dirs : meson.current_source_dir()) build
|
/dports/emulators/qemu60/qemu-6.0.0/meson/test cases/unit/16 prebuilt static/libdir/ |
H A D | meson.build | 2 stlib = cc.find_library('best', dirs : meson.current_source_dir()) build
|
/dports/devel/meson/meson-0.60.3/test cases/unit/16 prebuilt static/libdir/ |
H A D | meson.build | 2 stlib = cc.find_library('best', dirs : meson.current_source_dir()) build
|
/dports/graphics/R-cran-s2/s2/src/s2/ |
H A D | s2contains_vertex_query.cc | 30 std::pair<S2Point, int> best(reference_dir, 0); in ContainsSign() local
|
/dports/emulators/qemu5/qemu-5.2.0/meson/test cases/unit/16 prebuilt static/libdir/ |
H A D | meson.build | 2 stlib = cc.find_library('best', dirs : meson.current_source_dir()) build
|