| /dports/editors/helix/helix-0.5.0/cargo-crates/ropey-1.3.1/src/tree/ |
| H A D | node.rs | 98 let info = children.info()[child_i]; in edit_chunk_at_char()
222 children.remove(child_i); in remove_char_range()
232 if child_i < children.len() in remove_char_range()
236 if child_i == 0 { in remove_char_range()
237 children.merge_distribute(child_i, child_i + 1); in remove_char_range()
239 children.merge_distribute(child_i - 1, child_i); in remove_char_range()
730 child_i - 1 in fix_crlf_seam()
733 child_i in fix_crlf_seam()
917 did_stuff |= children.merge_distribute(child_i, child_i + 1); in fix_tree_seam()
926 if child_i == 0 { in fix_tree_seam()
[all …]
|
| /dports/editors/kak-lsp/kak-lsp-11.1.0/cargo-crates/ropey-1.3.1/src/tree/ |
| H A D | node.rs | 98 let info = children.info()[child_i]; in edit_chunk_at_char()
222 children.remove(child_i); in remove_char_range()
232 if child_i < children.len() in remove_char_range()
236 if child_i == 0 { in remove_char_range()
237 children.merge_distribute(child_i, child_i + 1); in remove_char_range()
239 children.merge_distribute(child_i - 1, child_i); in remove_char_range()
730 child_i - 1 in fix_crlf_seam()
733 child_i in fix_crlf_seam()
917 did_stuff |= children.merge_distribute(child_i, child_i + 1); in fix_tree_seam()
926 if child_i == 0 { in fix_tree_seam()
[all …]
|
| /dports/net/rpki-client/rpki-client-portable-7.6/openbsd/src/lib/libc/stdlib/ |
| H A D | heapsort.c | 72 for (par_i = initval; (child_i = par_i * 2) <= nmemb; \
73 par_i = child_i) { \
74 child = base + child_i * size; \
77 ++child_i; \
104 for (par_i = 1; (child_i = par_i * 2) <= nmemb; par_i = child_i) { \
105 child = base + child_i * size; \
108 ++child_i; \
114 child_i = par_i; \
115 par_i = child_i / 2; \
116 child = base + child_i * size; \
[all …]
|
| /dports/devel/agar/agar-1.5.0/math/ |
| H A D | m_heapsort.c | 78 for (par_i = initval; (child_i = par_i * 2) <= nmemb; \
79 par_i = child_i) { \
80 child = base + child_i * size; \
83 ++child_i; \
110 for (par_i = 1; (child_i = par_i * 2) <= nmemb; par_i = child_i) { \
111 child = base + child_i * size; \
114 ++child_i; \
120 child_i = par_i; \
121 par_i = child_i / 2; \
122 child = base + child_i * size; \
[all …]
|
| /dports/news/tin/tin-2.4.5/src/ |
| H A D | heapsort.c | 79 for (par_i = initval; (child_i = par_i * 2) <= nmemb; \
80 par_i = child_i) { \
81 child = abase + child_i * size; \
84 ++child_i; \
111 for (par_i = 1; (child_i = par_i * 2) <= nmemb; par_i = child_i) { \
112 child = abase + child_i * size; \
115 ++child_i; \
121 child_i = par_i; \
122 par_i = child_i / 2; \
123 child = abase + child_i * size; \
[all …]
|
| /dports/chinese/tin/tin-2.4.5/src/ |
| H A D | heapsort.c | 79 for (par_i = initval; (child_i = par_i * 2) <= nmemb; \
80 par_i = child_i) { \
81 child = abase + child_i * size; \
84 ++child_i; \
111 for (par_i = 1; (child_i = par_i * 2) <= nmemb; par_i = child_i) { \
112 child = abase + child_i * size; \
115 ++child_i; \
121 child_i = par_i; \
122 par_i = child_i / 2; \
123 child = abase + child_i * size; \
[all …]
|
| /dports/misc/rump/buildrump.sh-b914579/src/common/lib/libc/stdlib/ |
| H A D | heapsort.c | 109 for (par_i = initval; (child_i = par_i * 2) <= nmemb; \
110 par_i = child_i) { \
111 child = base + child_i * size; \
114 ++child_i; \
141 for (par_i = 1; (child_i = par_i * 2) <= nmemb; par_i = child_i) { \
142 child = base + child_i * size; \
145 ++child_i; \
151 child_i = par_i; \
152 par_i = child_i / 2; \
153 child = base + child_i * size; \
[all …]
|
| /dports/devel/systemc/systemc-2.3.4_pub_rev_20190614/src/sysc/kernel/ |
| H A D | sc_method_process.cpp | 156 for ( int child_i = 0; child_i < child_n; child_i++ ) in disable_process() local
158 sc_process_b* child_p = dynamic_cast<sc_process_b*>(children[child_i]); in disable_process()
215 for ( int child_i = 0; child_i < child_n; child_i++ ) in enable_process() local
217 sc_process_b* child_p = dynamic_cast<sc_process_b*>(children[child_i]); in enable_process()
260 for ( int child_i = 0; child_i < child_n; child_i++ ) in kill_process() local
262 sc_process_b* child_p = dynamic_cast<sc_process_b*>(children[child_i]); in kill_process()
400 for ( int child_i = 0; child_i < child_n; child_i++ ) in suspend_process() local
402 sc_process_b* child_p = dynamic_cast<sc_process_b*>(children[child_i]); in suspend_process()
463 for ( int child_i = 0; child_i < child_n; child_i++ ) in resume_process() local
465 sc_process_b* child_p = dynamic_cast<sc_process_b*>(children[child_i]); in resume_process()
[all …]
|
| H A D | sc_thread_process.cpp | 181 for ( int child_i = 0; child_i < child_n; child_i++ ) in disable_process() local
183 sc_process_b* child_p = dynamic_cast<sc_process_b*>(children[child_i]); in disable_process()
240 for ( int child_i = 0; child_i < child_n; child_i++ ) in enable_process() local
242 sc_process_b* child_p = dynamic_cast<sc_process_b*>(children[child_i]); in enable_process()
286 for ( int child_i = 0; child_i < child_n; child_i++ ) in kill_process() local
288 sc_process_b* child_p = dynamic_cast<sc_process_b*>(children[child_i]); in kill_process()
360 for ( int child_i = 0; child_i < child_n; child_i++ ) in resume_process() local
362 sc_process_b* child_p = dynamic_cast<sc_process_b*>(children[child_i]); in resume_process()
524 for ( int child_i = 0; child_i < child_n; child_i++ ) in suspend_process() local
526 sc_process_b* child_p = dynamic_cast<sc_process_b*>(children[child_i]); in suspend_process()
[all …]
|
| /dports/misc/thrill/thrill-12c5b59bca66df93b66628b3829027bd0f110dd9/thrill/common/ |
| H A D | binary_heap.hpp | 143 Iterator child_i = first + child; in sift_down() local
145 if ((child + 1) < len && comp(*child_i, *(child_i + 1))) { in sift_down()
147 ++child_i, ++child; in sift_down()
151 if (comp(*child_i, *start)) in sift_down()
158 *start = std::move(*child_i); in sift_down()
159 start = child_i; in sift_down()
166 child_i = first + child; in sift_down()
168 if ((child + 1) < len && comp(*child_i, *(child_i + 1))) { in sift_down()
170 ++child_i, ++child; in sift_down()
173 } while (!comp(*child_i, top)); in sift_down()
|
| /dports/devel/pecl-swoole/swoole-4.8.5/src/core/ |
| H A D | heap.cc | 48 uint32_t child_i = left(i); in maxchild() local
49 if (child_i >= num) { in maxchild()
52 HeapNode *child_node = nodes[child_i]; in maxchild()
53 if ((child_i + 1) < num && compare(child_node->priority, nodes[child_i + 1]->priority)) { in maxchild()
54 child_i++; in maxchild()
56 return child_i; in maxchild()
74 uint32_t child_i; in percolate_down() local
77 while ((child_i = maxchild(i)) && compare(moving_node->priority, nodes[child_i]->priority)) { in percolate_down()
78 nodes[i] = nodes[child_i]; in percolate_down()
80 i = child_i; in percolate_down()
|
| /dports/x11-toolkits/open-motif/motif-2.3.8/lib/Xm/ |
| H A D | RCLayout.c | 945 for (; kg [child_i].kid != NULL; child_i++) in LayoutColumn()
1019 for (child_i=0; kg [child_i].kid != NULL; child_i++) in LayoutColumn()
1066 for (; kg [child_i].kid != NULL; child_i++) in LayoutVerticalTight()
1077 (child_i)) in LayoutVerticalTight()
1104 if (kg[child_i].kid && XtIsWidget(kg[child_i].kid)) in LayoutVerticalTight()
1131 for (child_i=0; kg [child_i].kid != NULL; child_i++) in LayoutVerticalTight()
1169 for (; kg [child_i].kid != NULL; child_i++) { in LayoutHorizontaltight()
1215 if (kg[child_i].kid && XtIsWidget (kg[child_i].kid)) in LayoutHorizontaltight()
1244 if (kg[child_i].kid && XtIsWidget (kg[child_i].kid)) { in LayoutHorizontaltight()
1303 for (child_i = 0; kg[child_i].kid != NULL; child_i++) in LayoutHorizontaltight()
[all …]
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 183 size_type child_i = 0; in recursive_copy_node() local
193 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
194 child_i++; in recursive_copy_node()
201 while (child_i-- > 0) in recursive_copy_node()
202 clear_imp(a_p_children[child_i]); in recursive_copy_node()
208 --child_i; in recursive_copy_node()
209 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
211 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
212 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
213 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/lang/gcc8/gcc-8.5.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 181 size_type child_i = 0; in recursive_copy_node() local
191 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
192 child_i++; in recursive_copy_node()
199 while (child_i-- > 0) in recursive_copy_node()
200 clear_imp(a_p_children[child_i]); in recursive_copy_node()
206 --child_i; in recursive_copy_node()
207 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
209 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
210 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
211 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/lang/gcc48/gcc-4.8.5/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 181 size_type child_i = 0; in recursive_copy_node() local
191 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
192 child_i++; in recursive_copy_node()
199 while (child_i-- > 0) in recursive_copy_node()
200 clear_imp(a_p_children[child_i]); in recursive_copy_node()
206 --child_i; in recursive_copy_node()
207 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
209 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
210 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
211 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/lang/gcc6-aux/bootstrap/include/c++/5.1.0/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 181 size_type child_i = 0; in recursive_copy_node() local
191 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
192 child_i++; in recursive_copy_node()
199 while (child_i-- > 0) in recursive_copy_node()
200 clear_imp(a_p_children[child_i]); in recursive_copy_node()
206 --child_i; in recursive_copy_node()
207 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
209 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
210 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
211 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 181 size_type child_i = 0; in recursive_copy_node() local
191 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
192 child_i++; in recursive_copy_node()
199 while (child_i-- > 0) in recursive_copy_node()
200 clear_imp(a_p_children[child_i]); in recursive_copy_node()
206 --child_i; in recursive_copy_node()
207 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
209 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
210 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
211 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 183 size_type child_i = 0; in recursive_copy_node() local
193 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
194 child_i++; in recursive_copy_node()
201 while (child_i-- > 0) in recursive_copy_node()
202 clear_imp(a_p_children[child_i]); in recursive_copy_node()
208 --child_i; in recursive_copy_node()
209 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
211 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
212 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
213 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/lang/gcc10/gcc-10.3.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 183 size_type child_i = 0; in recursive_copy_node() local
193 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
194 child_i++; in recursive_copy_node()
201 while (child_i-- > 0) in recursive_copy_node()
202 clear_imp(a_p_children[child_i]); in recursive_copy_node()
208 --child_i; in recursive_copy_node()
209 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
211 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
212 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
213 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 183 size_type child_i = 0; in recursive_copy_node() local
193 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
194 child_i++; in recursive_copy_node()
201 while (child_i-- > 0) in recursive_copy_node()
202 clear_imp(a_p_children[child_i]); in recursive_copy_node()
208 --child_i; in recursive_copy_node()
209 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
211 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
212 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
213 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 181 size_type child_i = 0; in recursive_copy_node() local
191 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
192 child_i++; in recursive_copy_node()
199 while (child_i-- > 0) in recursive_copy_node()
200 clear_imp(a_p_children[child_i]); in recursive_copy_node()
206 --child_i; in recursive_copy_node()
207 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
209 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
210 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
211 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/devel/avr-gcc/gcc-10.2.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 183 size_type child_i = 0; in recursive_copy_node() local
193 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
194 child_i++; in recursive_copy_node()
201 while (child_i-- > 0) in recursive_copy_node()
202 clear_imp(a_p_children[child_i]); in recursive_copy_node()
208 --child_i; in recursive_copy_node()
209 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
211 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
212 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
213 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/lang/gnat_util/gcc-6-20180516/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 181 size_type child_i = 0; in recursive_copy_node() local
191 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
192 child_i++; in recursive_copy_node()
199 while (child_i-- > 0) in recursive_copy_node()
200 clear_imp(a_p_children[child_i]); in recursive_copy_node()
206 --child_i; in recursive_copy_node()
207 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
209 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
210 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
211 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 181 size_type child_i = 0; in recursive_copy_node() local
191 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
192 child_i++; in recursive_copy_node()
199 while (child_i-- > 0) in recursive_copy_node()
200 clear_imp(a_p_children[child_i]); in recursive_copy_node()
206 --child_i; in recursive_copy_node()
207 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
209 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
210 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
211 while (child_i-- > 0); in recursive_copy_node()
|
| /dports/lang/gcc9-devel/gcc-9-20211007/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | constructors_destructor_fn_imps.hpp | 181 size_type child_i = 0; in recursive_copy_node() local
191 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
192 child_i++; in recursive_copy_node()
199 while (child_i-- > 0) in recursive_copy_node()
200 clear_imp(a_p_children[child_i]); in recursive_copy_node()
206 --child_i; in recursive_copy_node()
207 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
209 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
210 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
211 while (child_i-- > 0); in recursive_copy_node()
|