| /dports/games/gnugo/gnugo-3.8/engine/ |
| H A D | cache.c | 167 node = &entry->deepest; in tt_get()
205 Hashnode *deepest; in tt_update() local
224 deepest = &entry->deepest; in tt_update()
228 if (hashdata_is_equal(hashval, deepest->key) in tt_update()
232 deepest->data = data; in tt_update()
243 > hn_get_remaining_depth(deepest->data)) { in tt_update()
246 temp = *deepest; in tt_update()
247 *deepest = *newest; in tt_update()
254 *newest = *deepest; in tt_update()
255 deepest->key = hashval; in tt_update()
[all …]
|
| /dports/math/py-brial/BRiAl-1.2.10/cudd/ |
| H A D | cuddCompose.c | 566 int deepest; in Cudd_addVectorCompose() local
576 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_addVectorCompose()
577 i = dd->invperm[deepest]; in Cudd_addVectorCompose()
625 int deepest; in Cudd_addGeneralVectorCompose() local
635 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_addGeneralVectorCompose()
636 i = dd->invperm[deepest]; in Cudd_addGeneralVectorCompose()
644 vectorOff,deepest); in Cudd_addGeneralVectorCompose()
794 int deepest; in Cudd_bddVectorCompose() local
804 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_bddVectorCompose()
805 i = dd->invperm[deepest]; in Cudd_bddVectorCompose()
[all …]
|
| /dports/math/cudd/cudd-3.0.0/cudd/ |
| H A D | cuddCompose.c | 533 int deepest; in Cudd_addVectorCompose() local
543 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_addVectorCompose()
544 i = dd->invperm[deepest]; in Cudd_addVectorCompose()
596 int deepest; in Cudd_addGeneralVectorCompose() local
606 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_addGeneralVectorCompose()
607 i = dd->invperm[deepest]; in Cudd_addGeneralVectorCompose()
615 vectorOff,deepest); in Cudd_addGeneralVectorCompose()
771 int deepest; in Cudd_bddVectorCompose() local
781 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_bddVectorCompose()
782 i = dd->invperm[deepest]; in Cudd_bddVectorCompose()
[all …]
|
| /dports/math/brial/BRiAl-1.2.10/cudd/ |
| H A D | cuddCompose.c | 566 int deepest; in Cudd_addVectorCompose() local
576 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_addVectorCompose()
577 i = dd->invperm[deepest]; in Cudd_addVectorCompose()
625 int deepest; in Cudd_addGeneralVectorCompose() local
635 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_addGeneralVectorCompose()
636 i = dd->invperm[deepest]; in Cudd_addGeneralVectorCompose()
644 vectorOff,deepest); in Cudd_addGeneralVectorCompose()
794 int deepest; in Cudd_bddVectorCompose() local
804 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_bddVectorCompose()
805 i = dd->invperm[deepest]; in Cudd_bddVectorCompose()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/cudd/ |
| H A D | cuddCompose.c | 570 int deepest; in Cudd_addVectorCompose() local
580 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_addVectorCompose()
581 i = dd->invperm[deepest]; in Cudd_addVectorCompose()
629 int deepest; in Cudd_addGeneralVectorCompose() local
639 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_addGeneralVectorCompose()
640 i = dd->invperm[deepest]; in Cudd_addGeneralVectorCompose()
798 int deepest; in Cudd_bddVectorCompose() local
808 for (deepest = dd->size - 1; deepest >= 0; deepest--) { in Cudd_bddVectorCompose()
809 i = dd->invperm[deepest]; in Cudd_bddVectorCompose()
1319 if (cuddI(dd,f->index) > deepest) { in cuddAddVectorComposeRecur()
[all …]
|
| /dports/lang/perl5.30/perl-5.30.3/cpan/File-Path/t/ |
| H A D | Path.t | 760 my ($least_deep, $next_deepest, $deepest) =
763 @created = File::Path::make_path($deepest, { mode => 0711 });
768 File::Path::remove_tree($deepest, $opts);
769 ok(! -d $deepest, "directory '$deepest' removed, as expected");
824 my ($least_deep, $next_deepest, $deepest) =
845 my ($least_deep, $next_deepest, $deepest) =
860 my ($least_deep, $next_deepest, $deepest) =
876 my ($least_deep, $next_deepest, $deepest) =
897 my ($least_deep, $next_deepest, $deepest) =
912 my ($least_deep, $next_deepest, $deepest) =
[all …]
|
| /dports/lang/perl5.34/perl-5.34.0/cpan/File-Path/t/ |
| H A D | Path.t | 760 my ($least_deep, $next_deepest, $deepest) =
763 @created = File::Path::make_path($deepest, { mode => 0711 });
768 File::Path::remove_tree($deepest, $opts);
769 ok(! -d $deepest, "directory '$deepest' removed, as expected");
824 my ($least_deep, $next_deepest, $deepest) =
845 my ($least_deep, $next_deepest, $deepest) =
871 my ($least_deep, $next_deepest, $deepest) =
887 my ($least_deep, $next_deepest, $deepest) =
908 my ($least_deep, $next_deepest, $deepest) =
934 my ($least_deep, $next_deepest, $deepest) =
[all …]
|
| /dports/lang/perl5.32/perl-5.32.1/cpan/File-Path/t/ |
| H A D | Path.t | 760 my ($least_deep, $next_deepest, $deepest) =
763 @created = File::Path::make_path($deepest, { mode => 0711 });
768 File::Path::remove_tree($deepest, $opts);
769 ok(! -d $deepest, "directory '$deepest' removed, as expected");
824 my ($least_deep, $next_deepest, $deepest) =
845 my ($least_deep, $next_deepest, $deepest) =
860 my ($least_deep, $next_deepest, $deepest) =
876 my ($least_deep, $next_deepest, $deepest) =
897 my ($least_deep, $next_deepest, $deepest) =
912 my ($least_deep, $next_deepest, $deepest) =
[all …]
|
| /dports/devel/p5-File-Path/File-Path-2.18/t/ |
| H A D | Path.t | 760 my ($least_deep, $next_deepest, $deepest) =
763 @created = File::Path::make_path($deepest, { mode => 0711 });
768 File::Path::remove_tree($deepest, $opts);
769 ok(! -d $deepest, "directory '$deepest' removed, as expected");
824 my ($least_deep, $next_deepest, $deepest) =
845 my ($least_deep, $next_deepest, $deepest) =
871 my ($least_deep, $next_deepest, $deepest) =
887 my ($least_deep, $next_deepest, $deepest) =
908 my ($least_deep, $next_deepest, $deepest) =
934 my ($least_deep, $next_deepest, $deepest) =
[all …]
|
| /dports/lang/perl5-devel/perl5-5.35.4-102-ge43d289c7c/cpan/File-Path/t/ |
| H A D | Path.t | 760 my ($least_deep, $next_deepest, $deepest) =
763 @created = File::Path::make_path($deepest, { mode => 0711 });
768 File::Path::remove_tree($deepest, $opts);
769 ok(! -d $deepest, "directory '$deepest' removed, as expected");
824 my ($least_deep, $next_deepest, $deepest) =
845 my ($least_deep, $next_deepest, $deepest) =
871 my ($least_deep, $next_deepest, $deepest) =
887 my ($least_deep, $next_deepest, $deepest) =
908 my ($least_deep, $next_deepest, $deepest) =
934 my ($least_deep, $next_deepest, $deepest) =
[all …]
|
| /dports/devel/universal-ctags/ctags-p5.9.20211128.0/main/ |
| H A D | rbtree.c | 339 struct rb_node *deepest; in rb_augment_erase_begin() local
342 deepest = rb_parent(node); in rb_augment_erase_begin()
344 deepest = node->rb_left; in rb_augment_erase_begin()
346 deepest = node->rb_right; in rb_augment_erase_begin()
348 deepest = rb_next(node); in rb_augment_erase_begin()
349 if (deepest->rb_right) in rb_augment_erase_begin()
350 deepest = deepest->rb_right; in rb_augment_erase_begin()
351 else if (rb_parent(deepest) != node) in rb_augment_erase_begin()
352 deepest = rb_parent(deepest); in rb_augment_erase_begin()
355 return deepest; in rb_augment_erase_begin()
|
| /dports/devel/geany/geany-1.38/ctags/main/ |
| H A D | rbtree.c | 339 struct rb_node *deepest; in rb_augment_erase_begin() local
342 deepest = rb_parent(node); in rb_augment_erase_begin()
344 deepest = node->rb_left; in rb_augment_erase_begin()
346 deepest = node->rb_right; in rb_augment_erase_begin()
348 deepest = rb_next(node); in rb_augment_erase_begin()
349 if (deepest->rb_right) in rb_augment_erase_begin()
350 deepest = deepest->rb_right; in rb_augment_erase_begin()
351 else if (rb_parent(deepest) != node) in rb_augment_erase_begin()
352 deepest = rb_parent(deepest); in rb_augment_erase_begin()
355 return deepest; in rb_augment_erase_begin()
|
| /dports/devel/ChipmunkPhysics/Chipmunk-7.0.1/demo/ |
| H A D | Sticky.c | 48 cpFloat deepest = INFINITY; in StickyPreSolve() local
56 deepest = cpfmin(deepest, contacts.points[i].distance);// + 2.0f*STICK_SENSOR_THICKNESS); in StickyPreSolve()
64 if(!cpArbiterGetUserData(arb) && deepest <= 0.0f){ in StickyPreSolve()
85 return (deepest <= 0.0f); in StickyPreSolve()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/boct/ |
| H A D | boct_bit_tree.cxx | 58 int boct_bit_tree::traverse(const vgl_point_3d<double> p, int deepest, bool full) { in traverse() argument
60 deepest = std::max(deepest - 1, num_levels_ - 1); in traverse()
76 while ((curr_bit || full) && (depth < deepest)) { in traverse()
99 int deepest) { in traverse_to_level() argument
101 deepest = std::min(deepest - 1, num_levels_ - 1); in traverse_to_level()
117 while (curr_bit && depth < deepest) { in traverse_to_level()
|
| /dports/devel/arcanist/arcanist-b2e715f/src/workingcopy/ |
| H A D | ArcanistWorkingCopy.php | 41 $deepest = last($candidates);
44 if (get_class($candidate) != get_class($deepest)) {
50 return $deepest->selectFromNestedWorkingCopies($candidates);
|
| /dports/devel/arcanist-lib/arcanist-b2e715f/src/workingcopy/ |
| H A D | ArcanistWorkingCopy.php | 41 $deepest = last($candidates);
44 if (get_class($candidate) != get_class($deepest)) {
50 return $deepest->selectFromNestedWorkingCopies($candidates);
|
| /dports/games/aisleriot/aisleriot-3.22.19/games/ |
| H A D | gay-gordons.scm | 78 (define (find-deepest holes deepest)
79 (if (= (car holes) deepest)
81 (+ 1 (find-deepest (cdr holes) deepest))))
89 (deepest (apply max holes))
93 (if (<= total (* deepest 2)) ; Catch the case where we are forced to
95 (find-deepest holes deepest)
|
| /dports/textproc/libstree/libstree-0.4.2/src/ |
| H A D | lst_algorithms.c | 212 int deepest; member
298 if (data->deepest <= data->max_depth) in alg_find_deepest()
300 if (depth >= data->deepest) in alg_find_deepest()
304 if (depth > data->deepest) in alg_find_deepest()
306 data->deepest = depth; in alg_find_deepest()
353 data.num_deepest, data.deepest)); in alg_longest_substring()
|
| /dports/java/springframework31/spring-framework-3.1.4.RELEASE/projects/org.springframework.transaction/src/main/java/org/springframework/transaction/interceptor/ |
| H A D | RuleBasedTransactionAttribute.java | 134 int deepest = Integer.MAX_VALUE; in rollbackOn() local
139 if (depth >= 0 && depth < deepest) { in rollbackOn()
140 deepest = depth; in rollbackOn()
|
| /dports/net-im/openfire/Openfire-4.7.1/starter/src/main/java/org/jivesoftware/openfire/launcher/ |
| H A D | GraphicUtils.java | 258 public static Component getFocusableComponentOrChild(Component c, boolean deepest) { in getFocusableComponentOrChild() argument
263 if (deepest == false) { // first one is a good one in getFocusableComponentOrChild()
275 Component focused = getFocusableComponentOrChild(child, deepest); in getFocusableComponentOrChild()
282 if (deepest == true) { in getFocusableComponentOrChild()
319 public static Component focusComponentOrChild(Component c, boolean deepest) { in focusComponentOrChild() argument
320 final Component focusable = getFocusableComponentOrChild(c, deepest); in focusComponentOrChild()
|
| /dports/games/nethack34/nethack-3.4.3/src/ |
| H A D | botl.c | 151 int deepest = deepest_lev_reached(FALSE); in botl_score() local
156 return ugold + u.urexp + (long)(50 * (deepest - 1)) in botl_score()
161 return umoney + u.urexp + (long)(50 * (deepest - 1)) in botl_score()
163 + (long)(deepest > 30 ? 10000 : in botl_score()
164 deepest > 20 ? 1000*(deepest - 20) : 0); in botl_score()
|
| /dports/games/nethack34-nox11/nethack-3.4.3/src/ |
| H A D | botl.c | 151 int deepest = deepest_lev_reached(FALSE); in botl_score() local
156 return ugold + u.urexp + (long)(50 * (deepest - 1)) in botl_score()
161 return umoney + u.urexp + (long)(50 * (deepest - 1)) in botl_score()
163 + (long)(deepest > 30 ? 10000 : in botl_score()
164 deepest > 20 ? 1000*(deepest - 20) : 0); in botl_score()
|
| /dports/devel/nuitka/Nuitka-0.6.17/nuitka/tree/ |
| H A D | ReformulationWithStatements.py | 114 deepest = body
116 while deepest.getVisitableNodes():
117 deepest = deepest.getVisitableNodes()[-1]
120 body_lineno = deepest.getCompatibleSourceReference().getLineNumber()
122 body_lineno = deepest.getSourceReference().getLineNumber()
|
| /dports/games/vultures-eye/vulture-2.3.67/nethack/src/ |
| H A D | botl.c | 151 int deepest = deepest_lev_reached(FALSE); in botl_score() local
156 return ugold + u.urexp + (long)(50 * (deepest - 1)) in botl_score()
161 return umoney + u.urexp + (long)(50 * (deepest - 1)) in botl_score()
163 + (long)(deepest > 30 ? 10000 : in botl_score()
164 deepest > 20 ? 1000*(deepest - 20) : 0); in botl_score()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/block/ |
| H A D | bfq-wf2q.c | 547 struct rb_node *deepest; in bfq_find_deepest() local
550 deepest = rb_parent(node); in bfq_find_deepest()
552 deepest = node->rb_left; in bfq_find_deepest()
554 deepest = node->rb_right; in bfq_find_deepest()
556 deepest = rb_next(node); in bfq_find_deepest()
557 if (deepest->rb_right) in bfq_find_deepest()
558 deepest = deepest->rb_right; in bfq_find_deepest()
559 else if (rb_parent(deepest) != node) in bfq_find_deepest()
560 deepest = rb_parent(deepest); in bfq_find_deepest()
563 return deepest; in bfq_find_deepest()
|