| /dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/constraints/ |
| H A D | ExtensionalSupportSTR.java | 96 public int[] nexts; field in ExtensionalSupportSTR
256 first = nexts[current]; in remove()
258 nexts[previous] = nexts[current]; in remove()
259 if (nexts[current] == -1) in remove()
265 nexts[current] = -1; in remove()
284 first = nexts[current]; in storeResidue()
286 nexts[previous] = nexts[current]; in storeResidue()
287 if (nexts[current] == -1) in storeResidue()
436 nexts[j] = j + 1; in consistency()
437 nexts[nexts.length - 1] = -1; in consistency()
[all …]
|
| /dports/net/jose/jose-11/lib/ |
| H A D | io.c | 44 jose_io_t *nexts[]; member
256 if (!i->nexts[j]) in plex_feed()
259 s = i->nexts[j]->feed(i->nexts[j], in, len); in plex_feed()
262 jose_io_auto(&i->nexts[j]); in plex_feed()
280 if (!i->nexts[j]) in plex_done()
283 s = i->nexts[j]->done(i->nexts[j]); in plex_done()
286 jose_io_auto(&i->nexts[j]); in plex_done()
301 jose_io_decref(i->nexts[j]); in plex_free()
314 while (nexts && nexts[nnexts]) in jose_io_multiplex()
328 for (size_t j = 0; nexts && j < nnexts; j++) in jose_io_multiplex()
[all …]
|
| /dports/games/libretro-paralleln64/parallel-n64-6e26fbb/mupen64plus-video-angrylion/n64video/rdp/ |
| H A D | tcoord.c | 416 nexts = (s + dsinc) >> 16; in tclod_2cycle()
422 state[wid].tcdiv_ptr(nexts, nextt, nextsw, &nexts, &nextt); in tclod_2cycle()
472 int nexts, nextt, nextsw; in tclod_2cycle_next() local
524 state[wid].tcdiv_ptr(nexts, nextt, nextsw, &nexts, &nextt); in tclod_2cycle_next()
567 nexts = (s + dsinc) >> 16; in tclod_2cycle_notexel1()
573 state[wid].tcdiv_ptr(nexts, nextt, nextsw, &nexts, &nextt); in tclod_2cycle_notexel1()
736 state[wid].tcdiv_ptr(nexts, nextt, nextsw, &nexts, &nextt); in tclod_1cycle_current_simple()
805 nexts >>= 16; in tclod_1cycle_next()
868 state[wid].tcdiv_ptr(nexts, nextt, nextsw, &nexts, &nextt); in tclod_1cycle_next()
911 nexts = (s + dsinc) >> 16; in tclod_copy()
[all …]
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/test/jdk/java/util/concurrent/tck/ |
| H A D | SubmissionPublisherTest.java | 70 volatile int nexts; field in SubmissionPublisherTest.TestSubscriber
87 ++nexts; in onNext()
121 while (nexts < n) { in awaitNext()
282 assertEquals(0, s.nexts); in testSubscribe1()
311 assertEquals(0, s.nexts); in testSubscribe2()
329 assertEquals(0, s.nexts); in testSubscribe3()
347 assertEquals(0, s.nexts); in testSubscribe4()
352 assertEquals(0, s.nexts); in testSubscribe4()
366 assertEquals(0, s.nexts); in testSubscribe5()
815 assertEquals(n, s1.nexts + s2.nexts); in testRecoveredHandledDroppedOffer()
[all …]
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/jdk/java/util/concurrent/tck/ |
| H A D | SubmissionPublisherTest.java | 70 volatile int nexts; field in SubmissionPublisherTest.TestSubscriber
87 ++nexts; in onNext()
121 while (nexts < n) { in awaitNext()
282 assertEquals(0, s.nexts); in testSubscribe1()
311 assertEquals(0, s.nexts); in testSubscribe2()
329 assertEquals(0, s.nexts); in testSubscribe3()
347 assertEquals(0, s.nexts); in testSubscribe4()
352 assertEquals(0, s.nexts); in testSubscribe4()
366 assertEquals(0, s.nexts); in testSubscribe5()
815 assertEquals(n, s1.nexts + s2.nexts); in testRecoveredHandledDroppedOffer()
[all …]
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/test/jdk/java/util/concurrent/tck/ |
| H A D | SubmissionPublisherTest.java | 70 volatile int nexts; field in SubmissionPublisherTest.TestSubscriber
87 ++nexts; in onNext()
121 while (nexts < n) { in awaitNext()
282 assertEquals(0, s.nexts); in testSubscribe1()
311 assertEquals(0, s.nexts); in testSubscribe2()
329 assertEquals(0, s.nexts); in testSubscribe3()
347 assertEquals(0, s.nexts); in testSubscribe4()
352 assertEquals(0, s.nexts); in testSubscribe4()
366 assertEquals(0, s.nexts); in testSubscribe5()
815 assertEquals(n, s1.nexts + s2.nexts); in testRecoveredHandledDroppedOffer()
[all …]
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/test/jdk/java/util/concurrent/tck/ |
| H A D | SubmissionPublisherTest.java | 70 volatile int nexts; field in SubmissionPublisherTest.TestSubscriber
87 ++nexts; in onNext()
121 while (nexts < n) { in awaitNext()
282 assertEquals(0, s.nexts); in testSubscribe1()
311 assertEquals(0, s.nexts); in testSubscribe2()
329 assertEquals(0, s.nexts); in testSubscribe3()
347 assertEquals(0, s.nexts); in testSubscribe4()
352 assertEquals(0, s.nexts); in testSubscribe4()
366 assertEquals(0, s.nexts); in testSubscribe5()
815 assertEquals(n, s1.nexts + s2.nexts); in testRecoveredHandledDroppedOffer()
[all …]
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/jdk/java/util/concurrent/tck/ |
| H A D | SubmissionPublisherTest.java | 70 volatile int nexts; field in SubmissionPublisherTest.TestSubscriber
87 ++nexts; in onNext()
121 while (nexts < n) { in awaitNext()
282 assertEquals(0, s.nexts); in testSubscribe1()
311 assertEquals(0, s.nexts); in testSubscribe2()
329 assertEquals(0, s.nexts); in testSubscribe3()
347 assertEquals(0, s.nexts); in testSubscribe4()
352 assertEquals(0, s.nexts); in testSubscribe4()
366 assertEquals(0, s.nexts); in testSubscribe5()
815 assertEquals(n, s1.nexts + s2.nexts); in testRecoveredHandledDroppedOffer()
[all …]
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/jdk/java/util/concurrent/tck/ |
| H A D | SubmissionPublisherTest.java | 70 volatile int nexts; field in SubmissionPublisherTest.TestSubscriber
87 ++nexts; in onNext()
121 while (nexts < n) { in awaitNext()
282 assertEquals(0, s.nexts); in testSubscribe1()
311 assertEquals(0, s.nexts); in testSubscribe2()
329 assertEquals(0, s.nexts); in testSubscribe3()
347 assertEquals(0, s.nexts); in testSubscribe4()
352 assertEquals(0, s.nexts); in testSubscribe4()
366 assertEquals(0, s.nexts); in testSubscribe5()
815 assertEquals(n, s1.nexts + s2.nexts); in testRecoveredHandledDroppedOffer()
[all …]
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/jdk/java/util/concurrent/tck/ |
| H A D | SubmissionPublisherTest.java | 70 volatile int nexts; field in SubmissionPublisherTest.TestSubscriber
87 ++nexts; in onNext()
121 while (nexts < n) { in awaitNext()
282 assertEquals(0, s.nexts); in testSubscribe1()
311 assertEquals(0, s.nexts); in testSubscribe2()
329 assertEquals(0, s.nexts); in testSubscribe3()
347 assertEquals(0, s.nexts); in testSubscribe4()
352 assertEquals(0, s.nexts); in testSubscribe4()
366 assertEquals(0, s.nexts); in testSubscribe5()
815 assertEquals(n, s1.nexts + s2.nexts); in testRecoveredHandledDroppedOffer()
[all …]
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/jdk/java/util/concurrent/tck/ |
| H A D | SubmissionPublisherTest.java | 70 volatile int nexts; field in SubmissionPublisherTest.TestSubscriber
87 ++nexts; in onNext()
121 while (nexts < n) { in awaitNext()
282 assertEquals(0, s.nexts); in testSubscribe1()
311 assertEquals(0, s.nexts); in testSubscribe2()
329 assertEquals(0, s.nexts); in testSubscribe3()
347 assertEquals(0, s.nexts); in testSubscribe4()
352 assertEquals(0, s.nexts); in testSubscribe4()
366 assertEquals(0, s.nexts); in testSubscribe5()
815 assertEquals(n, s1.nexts + s2.nexts); in testRecoveredHandledDroppedOffer()
[all …]
|
| /dports/devel/libzookeeper/apache-zookeeper-3.7.0/zookeeper-contrib/zookeeper-contrib-loggraph/src/main/java/org/apache/zookeeper/graph/ |
| H A D | MergedLogSource.java | 48 private LogEntry[] nexts = null; field in MergedLogSource.MergedLogSourceIterator
61 nexts = new LogEntry[iters.size()]; in MergedLogSourceIterator()
64 nexts[i] = sources[i].next(); in MergedLogSourceIterator()
82 for (LogEntry n : nexts) { in hasNext()
90 for (int i = 0; i < nexts.length; i++) { in next()
91 if (nexts[i] != null) { in next()
94 } else if (nexts[i].getTimestamp() < nexts[min].getTimestamp()) { in next()
102 LogEntry e = nexts[min]; in next()
103 nexts[min] = sources[min].next(); in next()
|
| /dports/games/lgeneral/lgeneral-1.3.2/src/ |
| H A D | campaign.c | 62 if ( entry->nexts ) list_delete( entry->nexts ); in camp_delete_entry()
78 if ( entry->nexts && entry->nexts->count > 0 ) in camp_verify_tree()
80 list_reset( entry->nexts ); in camp_verify_tree()
81 while ( (next = list_next(entry->nexts)) ) in camp_verify_tree()
197 list_add( centry->nexts, strdup( str ) ); in camp_load()
314 if (camp_cur_scen->nexts) { in camp_get_result_list()
316 list_reset( camp_cur_scen->nexts ); in camp_get_result_list()
317 while ( ( str = list_next( camp_cur_scen->nexts ) ) ) { in camp_get_result_list()
370 if (!camp_cur_scen->nexts) return 0; in camp_set_next()
371 list_reset( camp_cur_scen->nexts ); in camp_set_next()
[all …]
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/ |
| H A D | graph_constraints.cc | 97 nexts_(nexts), in NoCycle()
100 starts_(nexts.size(), -1), in NoCycle()
101 ends_(nexts.size(), -1), in NoCycle()
102 marked_(nexts.size(), false), in NoCycle()
372 nexts_(nexts), in Circuit()
680 nexts_(nexts), in BasePathCumul()
684 supports_(nexts.size()) { in BasePathCumul()
890 nexts_(nexts), in DelayedPathCumul()
901 supports_(nexts.size()), in DelayedPathCumul()
1624 std::vector<IntVar*> nexts, in MakePathPrecedenceConstraint() argument
[all …]
|
| /dports/www/moodle310/moodle/backup/util/loggers/ |
| H A D | base_logger.class.php | 132 $nexts = $obj->get_nexts();
133 if (array_key_exists($this->calculate_checksum(), $nexts) || $obj == $this) {
140 $nexts = array();
142 $nexts[$this->next->calculate_checksum()] = $this->next->calculate_checksum();
143 $nexts = array_merge($nexts, $this->next->get_nexts());
145 return $nexts;
|
| /dports/www/moodle311/moodle/backup/util/loggers/ |
| H A D | base_logger.class.php | 132 $nexts = $obj->get_nexts();
133 if (array_key_exists($this->calculate_checksum(), $nexts) || $obj == $this) {
140 $nexts = array();
142 $nexts[$this->next->calculate_checksum()] = $this->next->calculate_checksum();
143 $nexts = array_merge($nexts, $this->next->get_nexts());
145 return $nexts;
|
| /dports/www/moodle39/moodle/backup/util/loggers/ |
| H A D | base_logger.class.php | 132 $nexts = $obj->get_nexts();
133 if (array_key_exists($this->calculate_checksum(), $nexts) || $obj == $this) {
140 $nexts = array();
142 $nexts[$this->next->calculate_checksum()] = $this->next->calculate_checksum();
143 $nexts = array_merge($nexts, $this->next->get_nexts());
145 return $nexts;
|
| /dports/chinese/libime/libime-1.0.9/src/libime/core/ |
| H A D | segmentgraph.h | 48 SegmentGraphNodeConstRange nexts() const { in nexts() function
49 const auto &nexts = childs(); in nexts() local
51 boost::make_transform_iterator(nexts.begin(), in nexts()
53 boost::make_transform_iterator(nexts.end(), in nexts()
89 const auto &nexts = childs(); in mutableNexts() local
93 boost::make_transform_iterator(nexts.end(), in mutableNexts()
161 pNode = &pNode->nexts().front(); in distanceToEnd()
174 node = &node->nexts().front(); in isList()
183 if (n.nexts().empty() && n != end()) { in checkGraph()
219 auto nexts = start.nexts(); in dfsHelper() local
[all …]
|
| /dports/net/spread4/spread-src-4.2.0/stdutil/src/ |
| H A D | stdskl.c | 162 next = curr->nexts[lvl]; in stdskl_low_find_right()
186 curr = curr->nexts[0]; in stdskl_low_find_right()
192 curr = curr->nexts[0]; in stdskl_low_find_right()
271 node->nexts[0] = next; in stdskl_low_link_right()
283 node->nexts[lvl] = next; in stdskl_low_link_right()
300 prev->nexts[0] = node; in stdskl_low_link_left()
312 prev->nexts[lvl] = node; in stdskl_low_link_left()
411 new_end->nexts[lvl] = l->end_node->nexts[lvl]; in stdskl_low_insert()
506 next = next->nexts[0]; in stdskl_low_erase()
531 prev->nexts[lvl] = next; in stdskl_low_erase()
[all …]
|
| /dports/science/jstrack/jstrack/extlib/tcllib1.19/grammar_fa/ |
| H A D | fa.tcl | 366 foreach nexts $jump($sym) {
367 $self !Transinv $s $sym $nexts
706 set nexts [lindex $args 1]
707 $self StateCheck $nexts
714 $self Next $s $sym $nexts
730 set nexts [lindex $args 1]
731 $self StateCheck $nexts
732 $self !Next $s $sym $nexts
1004 method Next {s sym nexts} {
1059 set nexts [lindex $args 0]
[all …]
|
| /dports/devel/tcllib/tcllib-1.20/modules/grammar_fa/ |
| H A D | fa.tcl | 366 foreach nexts $jump($sym) {
367 $self !Transinv $s $sym $nexts
706 set nexts [lindex $args 1]
707 $self StateCheck $nexts
714 $self Next $s $sym $nexts
730 set nexts [lindex $args 1]
731 $self StateCheck $nexts
732 $self !Next $s $sym $nexts
1004 method Next {s sym nexts} {
1059 set nexts [lindex $args 0]
[all …]
|
| /dports/devel/tcllibc/tcllib-1.20/modules/grammar_fa/ |
| H A D | fa.tcl | 366 foreach nexts $jump($sym) {
367 $self !Transinv $s $sym $nexts
706 set nexts [lindex $args 1]
707 $self StateCheck $nexts
714 $self Next $s $sym $nexts
730 set nexts [lindex $args 1]
731 $self StateCheck $nexts
732 $self !Next $s $sym $nexts
1004 method Next {s sym nexts} {
1059 set nexts [lindex $args 0]
[all …]
|
| /dports/databases/freetds-devel/freetds-dev.1.3.7/src/tds/unittests/ |
| H A D | log_elision.c | 78 int nexts[THREADS]; in main() local
90 nexts[i] = i; in main()
129 assert(num == nexts[idx]); in main()
130 nexts[idx] += 3; in main()
137 assert(nexts[i] == i + LOOP * 3); in main()
|
| /dports/databases/freetds/freetds-1.3.4/src/tds/unittests/ |
| H A D | log_elision.c | 78 int nexts[THREADS]; in main() local
90 nexts[i] = i; in main()
129 assert(num == nexts[idx]); in main()
130 nexts[idx] += 3; in main()
137 assert(nexts[i] == i + LOOP * 3); in main()
|
| /dports/devel/bpython/bpython-0.22.1/bpython/curtsiesfrontend/ |
| H A D | preprocess.py | 24 prevs, lines, nexts = tee(lines, 3)
26 nexts = chain(islice(nexts, 1, None), ("",))
28 for p_line, line, n_line in zip(prevs, lines, nexts):
|