| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| forward_list.tcc | 367 _Node_base* __node = &this->_M_impl._M_head;
368 while (__node->_M_next && __list._M_impl._M_head._M_next)
373 (__node->_M_next)->_M_valptr()))
374 __node->_M_transfer_after(&__list._M_impl._M_head,
376 __node = __node->_M_next;
380 __node->_M_next = __list._M_impl._M_head._M_next;
|
| deque.tcc | 804 for (_Map_pointer __node = __first._M_node + 1;
805 __node < __last._M_node; ++__node)
806 std::_Destroy(*__node, *__node + _S_buffer_size(),
926 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
927 __node < __last._M_node; ++__node)
928 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| forward_list.tcc | 367 _Node_base* __node = &this->_M_impl._M_head;
368 while (__node->_M_next && __list._M_impl._M_head._M_next)
373 (__node->_M_next)->_M_valptr()))
374 __node->_M_transfer_after(&__list._M_impl._M_head,
376 __node = __node->_M_next;
380 __node->_M_next = __list._M_impl._M_head._M_next;
|
| deque.tcc | 804 for (_Map_pointer __node = __first._M_node + 1;
805 __node < __last._M_node; ++__node)
806 std::_Destroy(*__node, *__node + _S_buffer_size(),
926 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
927 __node < __last._M_node; ++__node)
928 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| forward_list.tcc | 367 _Node_base* __node = &this->_M_impl._M_head;
368 while (__node->_M_next && __list._M_impl._M_head._M_next)
373 (__node->_M_next)->_M_valptr()))
374 __node->_M_transfer_after(&__list._M_impl._M_head,
376 __node = __node->_M_next;
380 __node->_M_next = __list._M_impl._M_head._M_next;
|
| deque.tcc | 825 for (_Map_pointer __node = __first._M_node + 1;
826 __node < __last._M_node; ++__node)
827 std::_Destroy(*__node, *__node + _S_buffer_size(),
947 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
948 __node < __last._M_node; ++__node)
949 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| __hash_table | 202 __hash_iterator(__node_pointer __node, const void* __c) _NOEXCEPT
203 : __node_(__node)
209 __hash_iterator(__node_pointer __node) _NOEXCEPT
210 : __node_(__node)
230 >::type __node;
234 typedef typename __node::value_type value_type;
246 rebind<__node>
248 rebind<__node>::other
349 __hash_const_iterator(__node_pointer __node, const void* __c) _NOEXCEPT
350 : __node_(__node)
[all...] |
| list | 518 typedef __list_node<value_type, __void_pointer> __node;
521 rebind_alloc<__node>
523 rebind_alloc<__node>::other
814 typedef typename base::__node __node;
[all...] |
| regex | [all...] |
| __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/ndk/current/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| __hash_table | 202 __hash_iterator(__node_pointer __node, const void* __c) _NOEXCEPT
203 : __node_(__node)
209 __hash_iterator(__node_pointer __node) _NOEXCEPT
210 : __node_(__node)
230 >::type __node;
234 typedef typename __node::value_type value_type;
246 rebind<__node>
248 rebind<__node>::other
349 __hash_const_iterator(__node_pointer __node, const void* __c) _NOEXCEPT
350 : __node_(__node)
[all...] |
| list | 518 typedef __list_node<value_type, __void_pointer> __node;
521 rebind_alloc<__node>
523 rebind_alloc<__node>::other
814 typedef typename base::__node __node;
[all...] |
| regex | [all...] |
| /external/libcxx/include/ |
| __hash_table | 199 __hash_iterator(__node_pointer __node, const void* __c) _NOEXCEPT
200 : __node_(__node)
206 __hash_iterator(__node_pointer __node) _NOEXCEPT
207 : __node_(__node)
227 >::type __node;
231 typedef typename __node::value_type value_type;
243 rebind<__node>
245 rebind<__node>::other
346 __hash_const_iterator(__node_pointer __node, const void* __c) _NOEXCEPT
347 : __node_(__node)
[all...] |
| list | 516 typedef __list_node<value_type, __void_pointer> __node;
517 typedef typename __rebind_alloc_helper<__alloc_traits, __node>::type __node_allocator;
784 typedef typename base::__node __node;
[all...] |
| regex | [all...] |
| __tree | 624 typedef typename pointer_traits<__node_pointer>::element_type __node;
655 __tree_next(static_cast<typename __node::base::pointer>(__ptr_)));
665 __tree_prev(static_cast<typename __node::base::pointer>(__ptr_)));
695 typedef typename pointer_traits<__node_pointer>::element_type __node;
720 typedef typename remove_const<__node>::type __non_const_node;
743 rebind<typename __node::base>
745 rebind<typename __node::base>::other
762 rebind<typename __node::base>
764 rebind<typename __node::base>::other
811 typedef __tree_node<value_type, __void_pointer> __node;
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| deque.tcc | 804 for (_Map_pointer __node = __first._M_node + 1;
805 __node < __last._M_node; ++__node)
806 std::_Destroy(*__node, *__node + _S_buffer_size(),
926 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
927 __node < __last._M_node; ++__node)
928 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) {
669 if (__node == 0)
672 int __bc = __node->_M_color == _S_rb_tree_black ? 1 : 0;
673 if (__node == __root)
676 return __bc + __black_count(__node->_M_parent, __root);
|
| _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/current/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) {
669 if (__node == 0)
672 int __bc = __node->_M_color == _S_rb_tree_black ? 1 : 0;
673 if (__node == __root)
676 return __bc + __black_count(__node->_M_parent, __root);
|
| _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/libcxx/include/ext/ |
| hash_map | 506 typedef typename __table::__node __node;
508 typedef unique_ptr<__node, _Dp> __node_holder;
777 typedef typename __table::__node __node;
779 typedef unique_ptr<__node, _Dp> __node_holder;
[all...] |
| /ndk/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/current/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...] |
