Home
last modified time | relevance | path

Searched +refs:n +refs:iter (Results 1 – 25 of 58538) sorted by relevance

12345678910>>...2342

/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/libjava/gnu/java/text/
H A DSentenceBreakIterator.java80 char n = iter.next(); in next() local
93 n = iter.next(); in next()
96 n = iter.next(); in next()
108 n = iter.next(); in next()
115 n = iter.next(); in next()
124 n = iter.next(); in next()
152 char n = iter.previous(); in previous_internal() local
168 n = iter.previous(); in previous_internal()
177 n = iter.previous(); in previous_internal()
181 n = iter.previous(); in previous_internal()
[all …]
H A DLineBreakIterator.java64 iter = (CharacterIterator) other.iter.clone(); in LineBreakIterator()
100 char n = iter.next(); in next() local
102 if (n == CharacterIterator.DONE in next()
115 n = iter.next(); in next()
121 int nt = Character.getType(n); in next()
124 && ! isNb (n)) in next()
129 if (isIdeo (n)) in next()
163 char n = iter.previous(); in previous() local
168 int nt = Character.getType(n); in previous()
178 n = iter.previous(); in previous()
[all …]
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/libjava/gnu/java/text/
H A DSentenceBreakIterator.java80 char n = iter.next(); in next() local
93 n = iter.next(); in next()
96 n = iter.next(); in next()
108 n = iter.next(); in next()
115 n = iter.next(); in next()
124 n = iter.next(); in next()
152 char n = iter.previous(); in previous_internal() local
168 n = iter.previous(); in previous_internal()
177 n = iter.previous(); in previous_internal()
181 n = iter.previous(); in previous_internal()
[all …]
/dports/www/grafana8/grafana-8.3.6/vendor/gonum.org/v1/gonum/graph/iterator/
H A Dnodes.go83 return n.iter.Len()
91 return n.iter.Next()
97 return n.iter.Node()
111 n.iter.Reset()
118 n.iter.nodes[i] = u
144 return n.iter.Len()
172 n.iter.Reset()
179 n.iter.nodes[i] = n.nodes[id]
234 n.iter.Reset()
296 n.iter.Reset()
[all …]
H A Dnodes_map.go15 iter *mapIter member
40 ok := n.iter.next()
43 n.curr = n.iter.node()
58 n.iter.it = nil
69 for n.iter.next() {
70 nodes = append(nodes, n.iter.node())
148 ok := n.iter.next()
151 n.curr = n.nodes[n.iter.id()]
166 n.iter.it = nil
177 for n.iter.next() {
[all …]
/dports/lang/gcc6-aux/gcc-6-20180516/libjava/classpath/gnu/java/text/
H A DSentenceBreakIterator.java78 char n = iter.next(); in next() local
91 n = iter.next(); in next()
94 n = iter.next(); in next()
106 n = iter.next(); in next()
113 n = iter.next(); in next()
122 n = iter.next(); in next()
150 char n = iter.previous(); in previous_internal() local
166 n = iter.previous(); in previous_internal()
175 n = iter.previous(); in previous_internal()
206 n = iter.previous(); in previous_internal()
[all …]
/dports/lang/gcc48/gcc-4.8.5/libjava/classpath/gnu/java/text/
H A DSentenceBreakIterator.java78 char n = iter.next(); in next() local
91 n = iter.next(); in next()
94 n = iter.next(); in next()
106 n = iter.next(); in next()
113 n = iter.next(); in next()
122 n = iter.next(); in next()
150 char n = iter.previous(); in previous_internal() local
166 n = iter.previous(); in previous_internal()
175 n = iter.previous(); in previous_internal()
206 n = iter.previous(); in previous_internal()
[all …]
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libjava/classpath/gnu/java/text/
H A DSentenceBreakIterator.java78 char n = iter.next(); in next() local
91 n = iter.next(); in next()
94 n = iter.next(); in next()
106 n = iter.next(); in next()
113 n = iter.next(); in next()
122 n = iter.next(); in next()
150 char n = iter.previous(); in previous_internal() local
166 n = iter.previous(); in previous_internal()
175 n = iter.previous(); in previous_internal()
206 n = iter.previous(); in previous_internal()
[all …]
/dports/lang/gnat_util/gcc-6-20180516/libjava/classpath/gnu/java/text/
H A DSentenceBreakIterator.java78 char n = iter.next(); in next() local
91 n = iter.next(); in next()
94 n = iter.next(); in next()
106 n = iter.next(); in next()
113 n = iter.next(); in next()
122 n = iter.next(); in next()
150 char n = iter.previous(); in previous_internal() local
166 n = iter.previous(); in previous_internal()
175 n = iter.previous(); in previous_internal()
206 n = iter.previous(); in previous_internal()
[all …]
/dports/devel/mingw32-gcc/gcc-4.8.1/libjava/classpath/gnu/java/text/
H A DSentenceBreakIterator.java78 char n = iter.next(); in next() local
91 n = iter.next(); in next()
94 n = iter.next(); in next()
106 n = iter.next(); in next()
113 n = iter.next(); in next()
122 n = iter.next(); in next()
150 char n = iter.previous(); in previous_internal() local
166 n = iter.previous(); in previous_internal()
175 n = iter.previous(); in previous_internal()
206 n = iter.previous(); in previous_internal()
[all …]
/dports/java/sablevm-classpath/sablevm-classpath-1.13/gnu/java/text/
H A DSentenceBreakIterator.java78 char n = iter.next(); in next() local
91 n = iter.next(); in next()
94 n = iter.next(); in next()
106 n = iter.next(); in next()
113 n = iter.next(); in next()
122 n = iter.next(); in next()
150 char n = iter.previous(); in previous_internal() local
166 n = iter.previous(); in previous_internal()
175 n = iter.previous(); in previous_internal()
179 n = iter.previous(); in previous_internal()
[all …]
/dports/misc/openvdb/openvdb-9.0.0/openvdb/openvdb/unittest/
H A DTestLeafManager.cc47 for (FloatTree::LeafCIter iter=tree.cbeginLeaf(); iter; ++iter, ++n) { in TEST_F() local
48 EXPECT_TRUE(r.leaf(n) == *iter); in TEST_F()
49 EXPECT_TRUE(r.getBuffer(n,0) == iter->buffer()); in TEST_F()
72 for (FloatTree::LeafCIter iter=tree.cbeginLeaf(); iter; ++iter, ++n) { in TEST_F() local
73 EXPECT_TRUE(r.leaf(n) == *iter); in TEST_F()
74 EXPECT_TRUE(r.getBuffer(n,0) == iter->buffer()); in TEST_F()
128 for (FloatTree::LeafCIter iter = tree.cbeginLeaf(); iter; ++iter, ++n) { in TEST_F() local
129 EXPECT_TRUE(r.leaf(n) == *iter); in TEST_F()
132 EXPECT_TRUE(r.getBuffer(n, bufIdx) == iter->buffer()); in TEST_F()
233 for (CoordBBox::Iterator<true> iter(bbox1); iter; ++iter) { in TEST_F() local
[all …]
/dports/sysutils/dunst/dunst-1.6.1/src/
H A Dqueues.c209 iter = iter->next) { in queues_stack_duplicate()
220 iter->data = n; in queues_stack_duplicate()
248 iter = iter->next) { in queues_stack_by_tag()
276 iter = iter->next) { in queues_notification_replace_id()
303 iter = iter->next) { in queues_notification_close_id()
304 struct notification *n = iter->data; in queues_notification_close_id() local
377 struct notification *n = iter->data; in queues_update() local
422 struct notification *n = iter->data; in queues_update() local
484 iter = iter->next) { in queues_get_next_datachange()
485 struct notification *n = iter->data; in queues_get_next_datachange() local
[all …]
/dports/www/firefox/firefox-99.0/js/xpconnect/src/
H A DXPCMaps.cpp60 return n; in SizeOfIncludingThis()
67 n += iter.get().value()->SizeOfIncludingThis(mallocSizeOf); in SizeOfWrappedJS()
69 return n; in SizeOfWrappedJS()
83 n += mallocSizeOf(iter.get().value()); in SizeOfIncludingThis()
85 return n; in SizeOfIncludingThis()
99 n += iter.get().value()->SizeOfIncludingThis(mallocSizeOf); in SizeOfIncludingThis()
101 return n; in SizeOfIncludingThis()
114 return n; in ShallowSizeOfIncludingThis()
128 n += mallocSizeOf(iter.get().value()); in SizeOfIncludingThis()
130 return n; in SizeOfIncludingThis()
[all …]
/dports/math/arb/arb-2.21.1/bernoulli/
H A Drev_next.c27 ulong n; in bernoulli_rev_next() local
33 n = iter->n; in bernoulli_rev_next()
36 if (n < BERNOULLI_REV_MIN) in bernoulli_rev_next()
39 if (n != 0) in bernoulli_rev_next()
40 iter->n -= 2; in bernoulli_rev_next()
75 if (n % 4 == 0) in bernoulli_rev_next()
87 if (n > 0) in bernoulli_rev_next()
90 arb_div_ui(iter->prefactor, iter->prefactor, n, wp); in bernoulli_rev_next()
91 arb_div_ui(iter->prefactor, iter->prefactor, n - 1, wp); in bernoulli_rev_next()
103 if (n % 64 == 0 && n > BERNOULLI_REV_MIN) in bernoulli_rev_next()
[all …]
/dports/security/libecc/libecc-0.14.0/testsuite/bitset/
H A DbitsetTestIterator.cc10 for (typename libecc::bitset<n>::const_iterator iter = x.begin(); iter != x.end(); ++iter) in testIteratorLevel2() local
18 for (typename libecc::bitset<n>::const_iterator iter = x.begin(); iter != x.end(); ++iter) in testIteratorLevel2() local
23 CPPUNIT_ASSERT( *iter == x.end()[cnt - n] ); in testIteratorLevel2()
31 for (typename libecc::bitset<n>::const_iterator iter = x.begin(); iter != x.end(); ++iter) in testIteratorLevel2() local
36 CPPUNIT_ASSERT( *iter == x.end()[cnt - n] ); in testIteratorLevel2()
37 typename libecc::bitset<n>::const_iterator iter1, iter2(iter); in testIteratorLevel2()
80 …for (typename libecc::bitset<n>::const_reverse_iterator iter = x.rbegin(); iter != x.rend(); ++ite… in testIteratorLevel2() local
88 …for (typename libecc::bitset<n>::const_reverse_iterator iter = x.rbegin(); iter != x.rend(); ++ite… in testIteratorLevel2() local
93 CPPUNIT_ASSERT( *iter == x.rend()[cnt - n] ); in testIteratorLevel2()
101 …for (typename libecc::bitset<n>::const_reverse_iterator iter = x.rbegin(); iter != x.rend(); ++ite… in testIteratorLevel2() local
[all …]
/dports/multimedia/mencoder/mplayer-export-2021-12-29/
H A Dplaytree.c282 int n = 0; in play_tree_add_file() local
295 for(n = 0 ; pt->files[n] != NULL ; n++) in play_tree_add_file()
321 for(n=0 ; pt->files[n] != NULL ; n++) { in play_tree_remove_file()
323 f = n; in play_tree_remove_file()
352 int n = 0; in play_tree_set_param() local
360 for ( ; pt->params[n].name != NULL ; n++ ) { } in play_tree_set_param()
384 for(n = 0 ; pt->params[n].name != NULL ; n++) { in play_tree_unset_param()
447 int n; in play_tree_iter_push_params() local
465 for(n = 0; pt->params[n].name != NULL ; n++) { in play_tree_iter_push_params()
467 if((e = m_config_set_option(iter->config,pt->params[n].name,pt->params[n].value)) < 0) { in play_tree_iter_push_params()
[all …]
/dports/multimedia/mplayer/mplayer-export-2021-12-29/
H A Dplaytree.c282 int n = 0; in play_tree_add_file() local
295 for(n = 0 ; pt->files[n] != NULL ; n++) in play_tree_add_file()
321 for(n=0 ; pt->files[n] != NULL ; n++) { in play_tree_remove_file()
323 f = n; in play_tree_remove_file()
352 int n = 0; in play_tree_set_param() local
360 for ( ; pt->params[n].name != NULL ; n++ ) { } in play_tree_set_param()
384 for(n = 0 ; pt->params[n].name != NULL ; n++) { in play_tree_unset_param()
447 int n; in play_tree_iter_push_params() local
465 for(n = 0; pt->params[n].name != NULL ; n++) { in play_tree_iter_push_params()
467 if((e = m_config_set_option(iter->config,pt->params[n].name,pt->params[n].value)) < 0) { in play_tree_iter_push_params()
[all …]
/dports/math/gap/gap-4.11.0/pkg/utils-0.69/lib/
H A Dnumber.gi51 elif -3 < n and n < 2 then n := 2;
52 elif n mod 2 = 0 then n := n+1;
56 if n mod 6 = 1 then n := n+4;
57 else n := n+2;
129 if iter!.n = 0 then sieve[1] := 1; fi;
132 if p > iter!.n then pos := 2 * p;
154 p := iter!.n + iter!.primepos[iter!.index];
159 iter!.n := iter!.n + iter!.chunksize;
161 iter!.maxdiv := RootInt(iter!.n + iter!.chunksize);
163 Add(iter!.offset,[q,(q-iter!.n) mod q]);
[all …]
/dports/math/p5-Math-Prime-Util-GMP/Math-Prime-Util-GMP-0.52/
H A Dprime_iterator.c370 && (n >= iter->segment_start) in prime_iterator_setprime()
371 && (n <= iter->segment_start + 30*iter->segment_bytes - 1) ) { in prime_iterator_setprime()
372 iter->p = n; in prime_iterator_setprime()
385 iter->p = n; in prime_iterator_setprime()
395 iter->p = n; in prime_iterator_setprime()
403 UV n = iter->p; in prime_iterator_next() local
427 iter->p = n; in prime_iterator_next()
437 n = next_prime_in_segment(sieve, seg_beg, iter->segment_bytes, iter->p); in prime_iterator_next()
439 iter->p = n; in prime_iterator_next()
461 iter->p = n; in prime_iterator_next()
[all …]
/dports/lang/rust/rustc-1.58.1-src/library/core/tests/iter/adapters/
H A Dzip.rs28 .map(|n| { in test_zip_nth_side_effects()
30 n * 10 in test_zip_nth_side_effects()
32 .zip([2, 3, 4, 5, 6, 7, 8].iter().cloned().map(|n| { in test_zip_nth_side_effects()
34 n * 1000 in test_zip_nth_side_effects()
50 .map(|n| { in test_zip_next_back_side_effects()
52 n * 10 in test_zip_next_back_side_effects()
54 .zip([2, 3, 4, 5, 6, 7, 8].iter().cloned().map(|n| { in test_zip_next_back_side_effects()
76 .map(|n| { in test_zip_nth_back_side_effects()
80 .zip([2, 3, 4, 5, 6, 7, 8].iter().cloned().map(|n| { in test_zip_nth_back_side_effects()
101 .zip([2, 3, 4].iter().cloned().map(|n| { in test_zip_next_back_side_effects_exhausted()
[all …]
/dports/lang/ghc/ghc-8.10.7/rts/sm/
H A DMBlock.c214 p = getReusableMBlocks(n); in getCommittedMBlocks()
216 p = getFreshMBlocks(n); in getCommittedMBlocks()
538 for (i = 0; i < n; i++) { in getCommittedMBlocks()
547 osFreeMBlocks(p, n); in decommitMBlocks()
550 for (i = 0; i < n; i++) { in decommitMBlocks()
576 getMBlocks(uint32_t n) in getMBlocks() argument
584 mblocks_allocated += n; in getMBlocks()
612 mblocks_allocated -= n; in freeMBlocks()
614 decommitMBlocks(addr, n); in freeMBlocks()
642 uint32_t n; in freeAllMBlocks() local
[all …]
/dports/devel/radare2/radare2-5.1.1/shlr/sdb/src/
H A Dls.c24 for (it = iter; it && it->data; it = it->n) { in ls_insertion_sort_iter()
79 while (fast && fast->n && fast->n->n) { in _sdb_list_split()
80 fast = fast->n->n; in _sdb_list_split()
108 while (iter && iter->n) { in ls_merge_sort()
109 iter = iter->n; in ls_merge_sort()
160 list->head = iter->n; in ls_split_iter()
166 iter->p->n = iter->n; in ls_split_iter()
168 if (iter->n) { in ls_split_iter()
169 iter->n->p = iter->p; in ls_split_iter()
341 list->head = iter->n; in ls_pop_head()
[all …]
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/connect/
H A Dncbi_local.c70 size_t n; in s_AddService() local
79 data->a_cand = n; in s_AddService()
101 int n; in s_LoadSingleService() local
105 for (n = 0; n <= 100; ++n) { in s_LoadSingleService()
228 size_t i, n; in s_GetNextInfo() local
246 for (n = 0; n < iter->n_skip; n++) { in s_GetNextInfo()
247 const SSERV_Info* skip = iter->skip[n]; in s_GetNextInfo()
265 n = 0; in s_GetNextInfo()
273 if (n < iter->n_skip) { in s_GetNextInfo()
293 n = LB_Select(iter, data, s_GetCandidate, 1.0); in s_GetNextInfo()
[all …]
/dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/src/connect/
H A Dncbi_local.c70 size_t n; in s_AddService() local
79 data->a_cand = n; in s_AddService()
101 int n; in s_LoadSingleService() local
105 for (n = 0; n <= 100; ++n) { in s_LoadSingleService()
228 size_t i, n; in s_GetNextInfo() local
246 for (n = 0; n < iter->n_skip; n++) { in s_GetNextInfo()
247 const SSERV_Info* skip = iter->skip[n]; in s_GetNextInfo()
265 n = 0; in s_GetNextInfo()
273 if (n < iter->n_skip) { in s_GetNextInfo()
293 n = LB_Select(iter, data, s_GetCandidate, 1.0); in s_GetNextInfo()
[all …]

12345678910>>...2342