| /dports/graphics/graphviz/graphviz-2.44.1/lib/edgepaint/ |
| H A D | furtherest_point.c | 94 candidates2 = MALLOC(sizeof(qt)*ncandidates2_max); in furtherest_point()
139 candidates2 = REALLOC(candidates2, sizeof(QuadTree)*ncandidates2_max); in furtherest_point()
141 candidates2[ncandidates2++] = qt->qts[ii]; in furtherest_point()
156 candidates = candidates2; in furtherest_point()
157 candidates2 = ctmp; in furtherest_point()
170 FREE(candidates2); in furtherest_point()
271 candidates2 = REALLOC(candidates2, sizeof(QuadTree)*ncandidates2_max); in furtherest_point_in_list()
273 candidates2[ncandidates2++] = qt->qts[ii]; in furtherest_point_in_list()
288 candidates = candidates2; in furtherest_point_in_list()
289 candidates2 = ctmp; in furtherest_point_in_list()
[all …]
|
| /dports/www/orangehrm/orangehrm-4.9/symfony/lib/vendor/bjeavons/zxcvbn-php/src/Matchers/ |
| H A D | DateMatch.php | 200 $candidates2 = array();
204 $candidates2[] = array(
213 $candidates2[] = array(
220 $candidates2[] = array(
229 $candidates2[] = array(
240 foreach ($candidates2 as $candidate) {
|
| /dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-index-various/src/main/java/de/lmu/ifi/dbs/elki/index/vafile/ |
| H A D | PartialVAFile.java | 597 LinkedList<PartialVACandidate> candidates2 = null; in getKNNForObject() local
602 candidates2 = candidates1; in getKNNForObject()
607 …while(candidates2 == null || (getIOCosts(candidates2.size(), currentSubspaceDims) >= getIOCosts(da… in getKNNForObject()
608 if(candidates2 != null && LOG.isDebuggingFine()) { in getKNNForObject()
609 …filterStep + ": refining costs " + getIOCosts(candidates2.size(), currentSubspaceDims) + " (" + ca… in getKNNForObject()
611 if(candidates2 != null) { in getKNNForObject()
612 candidates1 = candidates2; in getKNNForObject()
614 candidates2 = new LinkedList<>(); in getKNNForObject()
625 candidates2.add(va); in getKNNForObject()
631 LOG.fine("candidate set after filter " + filterStep + ": " + candidates2.size()); in getKNNForObject()
[all …]
|
| /dports/math/dune-grid-glue/dune-grid-glue-17bd9898df80a52e2c316fc053119d190c149a2e/dune/grid-glue/merging/ |
| H A D | standardmerge.hh | 203 std::stack<unsigned>& candidates2,
476 std::stack<unsigned int> candidates2; in buildAdvancingFront() local
491 …generateSeed(seeds, isHandled2, candidates2, grid1Coords, grid1_element_types, grid2Coords, grid2_… in buildAdvancingFront()
501 while (!candidates2.empty()) { in buildAdvancingFront()
504 unsigned int currentCandidate2 = candidates2.top(); in buildAdvancingFront()
508 candidates2.pop(); in buildAdvancingFront()
562 bool seedFound = !candidates2.empty(); in buildAdvancingFront()
574 candidates2.push(neighbor); in buildAdvancingFront()
636 candidates2.push(neighbor); in buildAdvancingFront()
647 if (!seedFound && candidates2.empty()) { in buildAdvancingFront()
[all …]
|
| /dports/japanese/uim-mozc/mozc-2.23.2815.102.01/src/unix/ibus/ |
| H A D | gtk_candidate_window_handler_test.cc | 270 Candidates *candidates2 = output2.mutable_candidates(); in TEST() local
272 Candidate *candidate2 = candidates2->add_candidate(); in TEST()
|
| /dports/japanese/mozc-server/mozc-2.23.2815.102.01/src/unix/ibus/ |
| H A D | gtk_candidate_window_handler_test.cc | 270 Candidates *candidates2 = output2.mutable_candidates(); in TEST() local
272 Candidate *candidate2 = candidates2->add_candidate(); in TEST()
|
| /dports/japanese/mozc-tool/mozc-2.23.2815.102.01/src/unix/ibus/ |
| H A D | gtk_candidate_window_handler_test.cc | 270 Candidates *candidates2 = output2.mutable_candidates(); in TEST() local
272 Candidate *candidate2 = candidates2->add_candidate(); in TEST()
|
| /dports/japanese/mozc-el/mozc-2.23.2815.102.01/src/unix/ibus/ |
| H A D | gtk_candidate_window_handler_test.cc | 270 Candidates *candidates2 = output2.mutable_candidates(); in TEST() local
272 Candidate *candidate2 = candidates2->add_candidate(); in TEST()
|
| /dports/japanese/fcitx-mozc/mozc-2.23.2815.102.01/src/unix/ibus/ |
| H A D | gtk_candidate_window_handler_test.cc | 270 Candidates *candidates2 = output2.mutable_candidates(); in TEST() local
272 Candidate *candidate2 = candidates2->add_candidate(); in TEST()
|
| /dports/japanese/ibus-mozc/mozc-2.23.2815.102.01/src/unix/ibus/ |
| H A D | gtk_candidate_window_handler_test.cc | 270 Candidates *candidates2 = output2.mutable_candidates(); in TEST() local
272 Candidate *candidate2 = candidates2->add_candidate(); in TEST()
|
| /dports/math/gfan/gfan0.6.2/src/ |
| H A D | traverser_resultantfanspecialization.cpp | 201 IntegerVectorList candidates2=inter.generatorsOfLinealitySpace(); in nonTrivialVectorInSpecializedResultant() local
202 …for(IntegerVectorList::const_iterator i=candidates2.begin();i!=candidates2.end();i++)candidates.pu… in nonTrivialVectorInSpecializedResultant()
|
| /dports/math/gfanlib/gfan0.6.2/src/ |
| H A D | traverser_resultantfanspecialization.cpp | 201 IntegerVectorList candidates2=inter.generatorsOfLinealitySpace(); in nonTrivialVectorInSpecializedResultant() local
202 …for(IntegerVectorList::const_iterator i=candidates2.begin();i!=candidates2.end();i++)candidates.pu… in nonTrivialVectorInSpecializedResultant()
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/ |
| H A D | tree-ssa-reassoc.c | 1255 sbitmap candidates, candidates2; in undistribute_ops_list() local
1366 candidates2 = sbitmap_alloc (length); in undistribute_ops_list()
1375 bitmap_clear (candidates2); in undistribute_ops_list()
1398 bitmap_set_bit (candidates2, i); in undistribute_ops_list()
1409 int first = bitmap_first_set_bit (candidates2); in undistribute_ops_list()
1419 EXECUTE_IF_SET_IN_BITMAP (candidates2, first+1, i, sbi0) in undistribute_ops_list()
1463 sbitmap_free (candidates2); in undistribute_ops_list()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
| H A D | tree-ssa-reassoc.c | 1256 sbitmap candidates, candidates2; in undistribute_ops_list() local
1367 candidates2 = sbitmap_alloc (length); in undistribute_ops_list()
1376 bitmap_clear (candidates2); in undistribute_ops_list()
1399 bitmap_set_bit (candidates2, i); in undistribute_ops_list()
1410 int first = bitmap_first_set_bit (candidates2); in undistribute_ops_list()
1420 EXECUTE_IF_SET_IN_BITMAP (candidates2, first+1, i, sbi0) in undistribute_ops_list()
1464 sbitmap_free (candidates2); in undistribute_ops_list()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
| H A D | tree-ssa-reassoc.c | 1403 sbitmap candidates, candidates2; in undistribute_ops_list() local
1514 candidates2 = sbitmap_alloc (length); in undistribute_ops_list()
1523 bitmap_clear (candidates2); in undistribute_ops_list()
1546 bitmap_set_bit (candidates2, i); in undistribute_ops_list()
1557 int first = bitmap_first_set_bit (candidates2); in undistribute_ops_list()
1567 EXECUTE_IF_SET_IN_BITMAP (candidates2, first+1, i, sbi0) in undistribute_ops_list()
1611 sbitmap_free (candidates2); in undistribute_ops_list()
|
| /dports/lang/racket/racket-8.3/share/pkgs/games/parcheesi/ |
| H A D | best-players.rkt | 720 (define candidates2 (time (search problem-board2 'green (list 2 2 5 5))))
721 ;(dump-out-candidates candidates2)
722 (printf "~s candidates\n" (length candidates2)))
|
| /dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
| H A D | tree-ssa-reassoc.c | 1431 sbitmap candidates, candidates2; in undistribute_ops_list() local
1542 candidates2 = sbitmap_alloc (length); in undistribute_ops_list()
1551 bitmap_clear (candidates2); in undistribute_ops_list()
1574 bitmap_set_bit (candidates2, i); in undistribute_ops_list()
1585 int first = bitmap_first_set_bit (candidates2); in undistribute_ops_list()
1595 EXECUTE_IF_SET_IN_BITMAP (candidates2, first+1, i, sbi0) in undistribute_ops_list()
1639 sbitmap_free (candidates2); in undistribute_ops_list()
|
| /dports/lang/gnat_util/gcc-6-20180516/gcc/ |
| H A D | tree-ssa-reassoc.c | 1431 sbitmap candidates, candidates2; in undistribute_ops_list() local
1542 candidates2 = sbitmap_alloc (length); in undistribute_ops_list()
1551 bitmap_clear (candidates2); in undistribute_ops_list()
1574 bitmap_set_bit (candidates2, i); in undistribute_ops_list()
1585 int first = bitmap_first_set_bit (candidates2); in undistribute_ops_list()
1595 EXECUTE_IF_SET_IN_BITMAP (candidates2, first+1, i, sbi0) in undistribute_ops_list()
1639 sbitmap_free (candidates2); in undistribute_ops_list()
|
| /dports/science/py-pymatgen/pymatgen-2022.0.15/pymatgen/analysis/ |
| H A D | molecule_matcher.py | 417 candidates2 = list(symm)
418 for c2 in candidates2:
|
| /dports/lang/gcc8/gcc-8.5.0/gcc/ |
| H A D | tree-ssa-reassoc.c | 1675 auto_sbitmap candidates2 (length); in undistribute_ops_list()
1684 bitmap_clear (candidates2); in undistribute_ops_list()
1707 bitmap_set_bit (candidates2, i); in undistribute_ops_list()
1718 int first = bitmap_first_set_bit (candidates2); in undistribute_ops_list()
1728 EXECUTE_IF_SET_IN_BITMAP (candidates2, first+1, i, sbi0) in undistribute_ops_list()
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.compiler/share/classes/com/sun/tools/javac/code/ |
| H A D | Types.java | 3143 List<MethodSymbol> candidates2 = List.nil();
3147 } else if (!candidates2.contains(s)) {
3148 candidates2 = candidates2.prepend((MethodSymbol)s);
3151 candidates = prune(candidates2);
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-ssa-reassoc.c | 1675 auto_sbitmap candidates2 (length); in undistribute_ops_list()
1684 bitmap_clear (candidates2); in undistribute_ops_list()
1707 bitmap_set_bit (candidates2, i); in undistribute_ops_list()
1718 int first = bitmap_first_set_bit (candidates2); in undistribute_ops_list()
1728 EXECUTE_IF_SET_IN_BITMAP (candidates2, first+1, i, sbi0) in undistribute_ops_list()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.compiler/share/classes/com/sun/tools/javac/code/ |
| H A D | Types.java | 3142 List<MethodSymbol> candidates2 = List.nil();
3146 } else if (!candidates2.contains(s)) {
3147 candidates2 = candidates2.prepend((MethodSymbol)s);
3150 candidates = prune(candidates2);
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-ssa-reassoc.c | 1675 auto_sbitmap candidates2 (length); in undistribute_ops_list()
1684 bitmap_clear (candidates2); in undistribute_ops_list()
1707 bitmap_set_bit (candidates2, i); in undistribute_ops_list()
1718 int first = bitmap_first_set_bit (candidates2); in undistribute_ops_list()
1728 EXECUTE_IF_SET_IN_BITMAP (candidates2, first+1, i, sbi0) in undistribute_ops_list()
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-ssa-reassoc.c | 1675 auto_sbitmap candidates2 (length); in undistribute_ops_list()
1684 bitmap_clear (candidates2); in undistribute_ops_list()
1707 bitmap_set_bit (candidates2, i); in undistribute_ops_list()
1718 int first = bitmap_first_set_bit (candidates2); in undistribute_ops_list()
1728 EXECUTE_IF_SET_IN_BITMAP (candidates2, first+1, i, sbi0) in undistribute_ops_list()
|