/prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/ |
_deque.c | 347 for (_Map_pointer __node = this->_M_start._M_node + 1; 348 __node < this->_M_finish._M_node; 349 ++__node) { 350 _STLP_STD::_Destroy_Range(*__node, *__node + this->buffer_size()); 351 this->_M_map_size.deallocate(*__node, this->buffer_size());
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/include/ext/ |
hash_map | 513 typedef typename __table::__node __node; 515 typedef unique_ptr<__node, _Dp> __node_holder; 790 typedef typename __table::__node __node; 792 typedef unique_ptr<__node, _Dp> __node_holder; [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/ |
_deque.c | 347 for (_Map_pointer __node = this->_M_start._M_node + 1; 348 __node < this->_M_finish._M_node; 349 ++__node) { 350 _STLP_STD::_Destroy_Range(*__node, *__node + this->buffer_size()); 351 this->_M_map_size.deallocate(*__node, this->buffer_size());
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/include/ext/ |
hash_map | 494 typedef typename __table::__node __node; 496 typedef unique_ptr<__node, _Dp> __node_holder; 766 typedef typename __table::__node __node; 768 typedef unique_ptr<__node, _Dp> __node_holder; [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/ |
_deque.c | 347 for (_Map_pointer __node = this->_M_start._M_node + 1; 348 __node < this->_M_finish._M_node; 349 ++__node) { 350 _STLP_STD::_Destroy_Range(*__node, *__node + this->buffer_size()); 351 this->_M_map_size.deallocate(*__node, this->buffer_size());
|
/external/spirv-llvm/test/SPIRV/transcoding/ |
OpPhi_ArgumentsPlaceholders.ll | 78 !4 = !{!"kernel_arg_base_type", !"struct __Node*"}
|
/prebuilts/ndk/r10/sources/cxx-stl/llvm-libc++/libcxx/include/ |
__tree | 624 typedef typename pointer_traits<__node_pointer>::element_type __node; 625 typedef typename __node::base __node_base; 693 typedef typename pointer_traits<__node_pointer>::element_type __node; 694 typedef typename __node::base __node_base; 726 typedef typename remove_const<__node>::type __non_const_node; 795 typedef __tree_node<value_type, __void_pointer> __node; 799 rebind_alloc<__node> 801 rebind_alloc<__node>::other [all...] |
map | [all...] |
unordered_map | 748 typedef typename __table::__node __node; 750 typedef unique_ptr<__node, _Dp> __node_holder; [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/include/ |
__tree | 624 typedef typename pointer_traits<__node_pointer>::element_type __node; 625 typedef typename __node::base __node_base; 693 typedef typename pointer_traits<__node_pointer>::element_type __node; 694 typedef typename __node::base __node_base; 726 typedef typename remove_const<__node>::type __non_const_node; 795 typedef __tree_node<value_type, __void_pointer> __node; 799 rebind_alloc<__node> 801 rebind_alloc<__node>::other [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
forward_list.h | 348 _Node* __node = this->_M_get_node(); local 353 ::new ((void*)__node) _Node(); 354 _Alloc_traits::construct(__a, __node->_M_valptr(), 359 this->_M_put_node(__node); 362 return __node; [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
forward_list.h | 348 _Node* __node = this->_M_get_node(); local 353 ::new ((void*)__node) _Node(); 354 _Alloc_traits::construct(__a, __node->_M_valptr(), 359 this->_M_put_node(__node); 362 return __node; [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
forward_list.h | 348 _Node* __node = this->_M_get_node(); local 353 ::new ((void*)__node) _Node(); 354 _Alloc_traits::construct(__a, __node->_M_valptr(), 359 this->_M_put_node(__node); 362 return __node; [all...] |
/prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
forward_list.h | 350 _Node* __node = this->_M_get_node(); 355 ::new ((void*)__node) _Node; 356 _Alloc_traits::construct(__a, __node->_M_valptr(), 361 this->_M_put_node(__node); 364 return __node; [all...] |
hashtable_policy.h | 137 __node_type* __node = _M_nodes; local 139 __node->_M_nxt = nullptr; 141 __value_alloc_traits::destroy(__a, __node->_M_valptr()); 144 __value_alloc_traits::construct(__a, __node->_M_valptr(), 149 __node->~__node_type(); 151 __node, 1); 154 return __node; [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
forward_list.h | 350 _Node* __node = this->_M_get_node(); 355 ::new ((void*)__node) _Node; 356 _Alloc_traits::construct(__a, __node->_M_valptr(), 361 this->_M_put_node(__node); 364 return __node; [all...] |
hashtable_policy.h | 137 __node_type* __node = _M_nodes; local 139 __node->_M_nxt = nullptr; 141 __value_alloc_traits::destroy(__a, __node->_M_valptr()); 144 __value_alloc_traits::construct(__a, __node->_M_valptr(), 149 __node->~__node_type(); 151 __node, 1); 154 return __node; [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
forward_list.h | 350 _Node* __node = this->_M_get_node(); 355 ::new ((void*)__node) _Node; 356 _Alloc_traits::construct(__a, __node->_M_valptr(), 361 this->_M_put_node(__node); 364 return __node; [all...] |
hashtable_policy.h | 137 __node_type* __node = _M_nodes; local 139 __node->_M_nxt = nullptr; 141 __value_alloc_traits::destroy(__a, __node->_M_valptr()); 144 __value_alloc_traits::construct(__a, __node->_M_valptr(), 149 __node->~__node_type(); 151 __node, 1); 154 return __node; [all...] |
/external/libcxx/include/ |
map | [all...] |
unordered_map | 776 typedef typename __table::__node __node; 778 typedef unique_ptr<__node, _Dp> __node_holder; [all...] |
/prebuilts/clang/host/darwin-x86/clang-4053586/include/c++/v1/ |
map | [all...] |
unordered_map | 776 typedef typename __table::__node __node; 778 typedef unique_ptr<__node, _Dp> __node_holder; [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/include/c++/v1/ |
map | [all...] |
unordered_map | 776 typedef typename __table::__node __node; 778 typedef unique_ptr<__node, _Dp> __node_holder; [all...] |