/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/trie_policy/ |
order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); local 58 if (num_children == 0) 61 for (size_type i = 0; i < num_children; ++i) 66 i = num_children; 110 const size_type num_children = nd_it.num_children(); local 111 if (num_children == 0) 125 size_type i = num_children - 1; 153 const size_type num_children = nd_it.num_children() local [all...] |
trie_policy_base.hpp | 159 if (nd_it.num_children() == 0) 170 const size_type num_children = nd_it.num_children(); local 172 if (num_children == 0) 175 return rightmost_it(nd_it.get_child(num_children - 1));
|
prefix_search_node_update_imp.hpp | 117 const size_type num_children = nd_it.num_children(); local 120 for (size_type i = 0; i < num_children; ++i)
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/trie_policy/ |
order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); local 58 if (num_children == 0) 61 for (size_type i = 0; i < num_children; ++i) 66 i = num_children; 110 const size_type num_children = nd_it.num_children(); local 111 if (num_children == 0) 125 size_type i = num_children - 1; 153 const size_type num_children = nd_it.num_children() local [all...] |
trie_policy_base.hpp | 159 if (nd_it.num_children() == 0) 170 const size_type num_children = nd_it.num_children(); local 172 if (num_children == 0) 175 return rightmost_it(nd_it.get_child(num_children - 1));
|
prefix_search_node_update_imp.hpp | 117 const size_type num_children = nd_it.num_children(); local 120 for (size_type i = 0; i < num_children; ++i)
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/trie_policy/ |
order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); local 58 if (num_children == 0) 61 for (size_type i = 0; i < num_children; ++i) 66 i = num_children; 110 const size_type num_children = nd_it.num_children(); local 111 if (num_children == 0) 125 size_type i = num_children - 1; 153 const size_type num_children = nd_it.num_children() local [all...] |
trie_policy_base.hpp | 159 if (nd_it.num_children() == 0) 170 const size_type num_children = nd_it.num_children(); local 172 if (num_children == 0) 175 return rightmost_it(nd_it.get_child(num_children - 1));
|
prefix_search_node_update_imp.hpp | 117 const size_type num_children = nd_it.num_children(); local 120 for (size_type i = 0; i < num_children; ++i)
|
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/trie_policy/ |
order_statistics_imp.hpp | 57 const size_type num_children = nd_it.num_children(); local 58 if (num_children == 0) 61 for (size_type i = 0; i < num_children; ++i) 66 i = num_children; 110 const size_type num_children = nd_it.num_children(); local 111 if (num_children == 0) 125 size_type i = num_children - 1; 153 const size_type num_children = nd_it.num_children() local [all...] |
trie_policy_base.hpp | 159 if (nd_it.num_children() == 0) 170 const size_type num_children = nd_it.num_children(); local 172 if (num_children == 0) 175 return rightmost_it(nd_it.get_child(num_children - 1));
|
prefix_search_node_update_imp.hpp | 117 const size_type num_children = nd_it.num_children(); local 120 for (size_type i = 0; i < num_children; ++i)
|
/cts/tests/tests/widget/src/android/widget/cts/ |
ExpandableListSimple.java | 26 private static final int[] NUM_CHILDREN = {4, 3, 2, 1, 0}; 30 params.setNumChildren(NUM_CHILDREN).setItemScreenSizeFactor(0.14);
|
/external/llvm/utils/ |
lldbDataFormatters.py | 28 def num_children(self): member in class:SmallVectorSynthProvider 43 if index >= self.num_children(): 69 def num_children(self): member in class:ArrayRefSynthProvider 79 if index < 0 or index >= self.num_children():
|
/external/webrtc/webrtc/modules/desktop_capture/ |
window_capturer_x11.cc | 173 unsigned int num_children; local 175 &children, &num_children); 182 for (unsigned int i = 0; i < num_children; ++i) { 185 GetApplicationWindow(children[num_children - 1 - i]); 228 unsigned int num_children; local 234 display(), selected_window_, &root, &parent, &children, &num_children); 344 unsigned int num_children; local 346 &num_children)) { 352 for (unsigned int i = 0; i < num_children; ++i) {
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pat_trie_/ |
trace_fn_imps.hpp | 84 const size_type num_children = std::distance(p_internal->begin(), local 87 for (size_type child_i = 0; child_i < num_children; ++child_i) 90 std::advance(child_it, num_children - child_i - 1);
|
split_fn_imps.hpp | 197 size_type num_children, branch_bag& r_bag) 205 const size_type total_num_children = start + num_children; 233 while (num_inserted++ < num_children)
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pat_trie_/ |
trace_fn_imps.hpp | 84 const size_type num_children = std::distance(p_internal->begin(), local 87 for (size_type child_i = 0; child_i < num_children; ++child_i) 90 std::advance(child_it, num_children - child_i - 1);
|
split_fn_imps.hpp | 197 size_type num_children, branch_bag& r_bag) 205 const size_type total_num_children = start + num_children; 233 while (num_inserted++ < num_children)
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/pat_trie_/ |
trace_fn_imps.hpp | 84 const size_type num_children = std::distance(p_internal->begin(), local 87 for (size_type child_i = 0; child_i < num_children; ++child_i) 90 std::advance(child_it, num_children - child_i - 1);
|
split_fn_imps.hpp | 197 size_type num_children, branch_bag& r_bag) 205 const size_type total_num_children = start + num_children; 233 while (num_inserted++ < num_children)
|
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/pat_trie_/ |
trace_fn_imps.hpp | 84 const size_type num_children = std::distance(p_internal->begin(), local 87 for (size_type child_i = 0; child_i < num_children; ++child_i) 90 std::advance(child_it, num_children - child_i - 1);
|
split_fn_imps.hpp | 197 size_type num_children, branch_bag& r_bag) 205 const size_type total_num_children = start + num_children; 233 while (num_inserted++ < num_children)
|
/external/vboot_reference/futility/ |
cmd_dump_fmap.c | 164 int num_children; member in struct:node_s 219 sort_nodes(p->num_children, p->child); 220 for (i = 0; i < p->num_children; i++) { 224 if (i < p->num_children - 1 228 if (i == p->num_children - 1 && p->child[i]->start != p->start) 274 if (p->num_children && !p->child) { 276 (struct node_s **)calloc(p->num_children, 283 for (i = 0; i < p->num_children; i++) 378 all_nodes[i].parent->num_children++;
|
/external/webrtc/webrtc/base/ |
x11windowpicker.cc | 229 unsigned int num_children; local 236 &num_children); 606 unsigned int num_children; local 609 &num_children); 614 for (unsigned int i = 0; i < num_children; ++i) { 619 Window app_window = children[num_children - 1 - i]; 621 Window app_window = GetApplicationWindow(children[num_children - 1 - i]); 674 unsigned int num_children; local 696 &num_children)) { 701 for (unsigned int i = 0; i < num_children; ++i) [all...] |