| /dports/audio/zrythm/zrythm-1.0.0-alpha.26.0.13/ext/zix/zix/ |
| H A D | trie.c | 94 zix_trie_node_size(n_edges_t num_children) in zix_trie_node_size() argument
97 zix_trie_pad(num_children) + in zix_trie_node_size()
138 return n->num_children == 0; in trie_is_leaf()
167 n = realloc_node(n, n->num_children + 1); in zix_trie_add_child()
169 const n_edges_t l = n->num_children; in zix_trie_add_child()
173 ++n->num_children; in zix_trie_add_child()
180 m->num_children = n->num_children + 1; in zix_trie_add_child()
218 c->num_children = 0; in trie_insert_tail()
226 c->num_children = 0; in trie_insert_tail()
243 assert(child_i <= n->num_children); in trie_insert_internal()
[all …]
|
| /dports/x11-toolkits/open-motif/motif-2.3.8/lib/Xm/ |
| H A D | DropSMgrI.c | 134 unsigned short num_children; in _XmDSIAddChild() local
149 childPosition = num_children; in _XmDSIAddChild()
176 unsigned short num_children; in _XmDSIRemoveChild() local
196 if (!num_children) in _XmDSIRemoveChild()
207 unsigned short num_children; in _XmDSIGetChildPosition() local
221 return(num_children); in _XmDSIGetChildPosition()
228 if (i == num_children) in _XmDSIGetChildPosition()
246 unsigned short num_children; in _XmDSIReplaceChild() local
258 for (i=0; i < num_children; i++) in _XmDSIReplaceChild()
281 unsigned short num_children; in _XmDSISwapChildren() local
[all …]
|
| /dports/devel/mspdebug/mspdebug-493f38b/util/ |
| H A D | btree.c | 94 if (i + 1 < p->num_children) in check_page()
188 op->num_children = halfsize; in split_page()
189 np->num_children = halfsize; in split_page()
217 p->num_children++; in insert_data()
250 p->num_children++; in insert_ptr()
284 p->num_children--; in delete_item()
311 assert (lower->num_children + higher->num_children < def->branches); in merge_pages()
326 lower->num_children += higher->num_children; in merge_pages()
487 path_up->num_children--; in btree_clear()
492 p->num_children = 0; in btree_clear()
[all …]
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 59 const size_type num_children = nd_it.num_children(); in find_by_order() local
60 if (num_children == 0) in find_by_order()
63 for (size_type i = 0; i < num_children; ++i) in find_by_order()
68 i = num_children; in find_by_order()
112 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
113 if (num_children == 0) in order_of_prefix()
127 size_type i = num_children - 1; in order_of_prefix()
155 const size_type num_children = nd_it.num_children(); in operator ()() local
157 for (size_type i = 0; i < num_children; ++i) in operator ()()
160 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/lang/gcc8/gcc-8.5.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 59 const size_type num_children = nd_it.num_children(); in find_by_order() local
60 if (num_children == 0) in find_by_order()
63 for (size_type i = 0; i < num_children; ++i) in find_by_order()
68 i = num_children; in find_by_order()
112 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
113 if (num_children == 0) in order_of_prefix()
127 size_type i = num_children - 1; in order_of_prefix()
155 const size_type num_children = nd_it.num_children(); in operator ()() local
157 for (size_type i = 0; i < num_children; ++i) in operator ()()
160 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/lang/gcc10/gcc-10.3.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 59 const size_type num_children = nd_it.num_children();
60 if (num_children == 0)
63 for (size_type i = 0; i < num_children; ++i)
68 i = num_children;
112 const size_type num_children = nd_it.num_children();
113 if (num_children == 0)
127 size_type i = num_children - 1;
155 const size_type num_children = nd_it.num_children();
157 for (size_type i = 0; i < num_children; ++i)
160 const size_type res = (num_children == 0) ? 1 : children_rank;
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 59 const size_type num_children = nd_it.num_children(); in find_by_order() local
60 if (num_children == 0) in find_by_order()
63 for (size_type i = 0; i < num_children; ++i) in find_by_order()
68 i = num_children; in find_by_order()
112 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
113 if (num_children == 0) in order_of_prefix()
127 size_type i = num_children - 1; in order_of_prefix()
155 const size_type num_children = nd_it.num_children(); in operator ()() local
157 for (size_type i = 0; i < num_children; ++i) in operator ()()
160 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/devel/avr-gcc/gcc-10.2.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 59 const size_type num_children = nd_it.num_children(); in find_by_order() local
60 if (num_children == 0) in find_by_order()
63 for (size_type i = 0; i < num_children; ++i) in find_by_order()
68 i = num_children; in find_by_order()
112 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
113 if (num_children == 0) in order_of_prefix()
127 size_type i = num_children - 1; in order_of_prefix()
155 const size_type num_children = nd_it.num_children(); in operator ()() local
157 for (size_type i = 0; i < num_children; ++i) in operator ()()
160 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/lang/gnat_util/gcc-6-20180516/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/lang/gcc9-devel/gcc-9-20211007/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/lang/gcc6-aux/gcc-6-20180516/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/lang/gcc10-devel/gcc-10-20211008/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 59 const size_type num_children = nd_it.num_children(); in find_by_order() local
60 if (num_children == 0) in find_by_order()
63 for (size_type i = 0; i < num_children; ++i) in find_by_order()
68 i = num_children; in find_by_order()
112 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
113 if (num_children == 0) in order_of_prefix()
127 size_type i = num_children - 1; in order_of_prefix()
155 const size_type num_children = nd_it.num_children(); in operator ()() local
157 for (size_type i = 0; i < num_children; ++i) in operator ()()
160 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/lang/gcc9-aux/bootstrap/include/c++/9.1.0/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/lang/gcc9/gcc-9.4.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 59 const size_type num_children = nd_it.num_children(); in find_by_order() local
60 if (num_children == 0) in find_by_order()
63 for (size_type i = 0; i < num_children; ++i) in find_by_order()
68 i = num_children; in find_by_order()
112 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
113 if (num_children == 0) in order_of_prefix()
127 size_type i = num_children - 1; in order_of_prefix()
155 const size_type num_children = nd_it.num_children(); in operator ()() local
157 for (size_type i = 0; i < num_children; ++i) in operator ()()
160 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/lang/gcc9-aux/gcc-9.1.0/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| /dports/lang/gcc6-aux/bootstrap/include/c++/5.1.0/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); in find_by_order() local
58 if (num_children == 0) in find_by_order()
61 for (size_type i = 0; i < num_children; ++i) in find_by_order()
66 i = num_children; in find_by_order()
110 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
111 if (num_children == 0) in order_of_prefix()
125 size_type i = num_children - 1; in order_of_prefix()
153 const size_type num_children = nd_it.num_children(); in operator ()() local
155 for (size_type i = 0; i < num_children; ++i) in operator ()()
158 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|