| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| forward_list.tcc | 435 typename _Node_base::_Pointer __node = &this->_M_impl._M_head;
436 while (__node->_M_next && __list._M_impl._M_head._M_next)
441 (__node->_M_next)->_M_value))
442 __node->_M_transfer_after(&__list._M_impl._M_head,
444 __node = __node->_M_next;
448 __node->_M_next = __list._M_impl._M_head._M_next;
|
| deque.tcc | 726 for (_Map_pointer __node = __first._M_node + 1;
727 __node < __last._M_node; ++__node)
728 std::_Destroy(*__node, *__node + _S_buffer_size(),
848 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
849 __node < __last._M_node; ++__node)
850 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| forward_list.tcc | 359 _Node_base* __node = &this->_M_impl._M_head;
360 while (__node->_M_next && __list._M_impl._M_head._M_next)
365 (__node->_M_next)->_M_value))
366 __node->_M_transfer_after(&__list._M_impl._M_head,
368 __node = __node->_M_next;
372 __node->_M_next = __list._M_impl._M_head._M_next;
|
| deque.tcc | 784 for (_Map_pointer __node = __first._M_node + 1;
785 __node < __last._M_node; ++__node)
786 std::_Destroy(*__node, *__node + _S_buffer_size(),
906 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
907 __node < __last._M_node; ++__node)
908 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| forward_list.tcc | 360 _Node_base* __node = &this->_M_impl._M_head;
361 while (__node->_M_next && __list._M_impl._M_head._M_next)
366 (__node->_M_next)->_M_value))
367 __node->_M_transfer_after(&__list._M_impl._M_head,
369 __node = __node->_M_next;
373 __node->_M_next = __list._M_impl._M_head._M_next;
|
| deque.tcc | 802 for (_Map_pointer __node = __first._M_node + 1;
803 __node < __last._M_node; ++__node)
804 std::_Destroy(*__node, *__node + _S_buffer_size(),
924 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
925 __node < __last._M_node; ++__node)
926 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| forward_list.tcc | 359 _Node_base* __node = &this->_M_impl._M_head;
360 while (__node->_M_next && __list._M_impl._M_head._M_next)
365 (__node->_M_next)->_M_value))
366 __node->_M_transfer_after(&__list._M_impl._M_head,
368 __node = __node->_M_next;
372 __node->_M_next = __list._M_impl._M_head._M_next;
|
| deque.tcc | 784 for (_Map_pointer __node = __first._M_node + 1;
785 __node < __last._M_node; ++__node)
786 std::_Destroy(*__node, *__node + _S_buffer_size(),
906 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
907 __node < __last._M_node; ++__node)
908 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| forward_list.tcc | 360 _Node_base* __node = &this->_M_impl._M_head;
361 while (__node->_M_next && __list._M_impl._M_head._M_next)
366 (__node->_M_next)->_M_value))
367 __node->_M_transfer_after(&__list._M_impl._M_head,
369 __node = __node->_M_next;
373 __node->_M_next = __list._M_impl._M_head._M_next;
|
| deque.tcc | 802 for (_Map_pointer __node = __first._M_node + 1;
803 __node < __last._M_node; ++__node)
804 std::_Destroy(*__node, *__node + _S_buffer_size(),
924 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
925 __node < __last._M_node; ++__node)
926 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/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 | 800 for (_Map_pointer __node = __first._M_node + 1;
801 __node < __last._M_node; ++__node)
802 std::_Destroy(*__node, *__node + _S_buffer_size(),
922 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
923 __node < __last._M_node; ++__node)
924 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /external/openssh/openbsd-compat/ |
| sys-tree.h | 207 struct type __node, *__left, *__right, *__tmp; \
210 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
211 __left = __right = &__node; \
236 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
244 struct type __node, *__left, *__right, *__tmp; \
246 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
247 __left = __right = &__node; \
272 SPLAY_ASSEMBLE(head, &__node, __left, __right, field);
[all...] |
| /external/qemu/ |
| sys-tree.h | 216 SYS_TREE_STRUCT type __node, *__left, *__right, *__tmp; \
219 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
220 __left = __right = &__node; \
245 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
253 SYS_TREE_STRUCT type __node, *__left, *__right, *__tmp; \
255 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
256 __left = __right = &__node; \
281 SPLAY_ASSEMBLE(head, &__node, __left, __right, field);
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| deque.tcc | 726 for (_Map_pointer __node = __first._M_node + 1;
727 __node < __last._M_node; ++__node)
728 std::_Destroy(*__node, *__node + _S_buffer_size(),
848 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
849 __node < __last._M_node; ++__node)
850 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| deque.tcc | 726 for (_Map_pointer __node = __first._M_node + 1;
727 __node < __last._M_node; ++__node)
728 std::_Destroy(*__node, *__node + _S_buffer_size(),
848 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
849 __node < __last._M_node; ++__node)
850 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| deque.tcc | 726 for (_Map_pointer __node = __first._M_node + 1;
727 __node < __last._M_node; ++__node)
728 std::_Destroy(*__node, *__node + _S_buffer_size(),
848 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
849 __node < __last._M_node; ++__node)
850 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| deque.tcc | 726 for (_Map_pointer __node = __first._M_node + 1;
727 __node < __last._M_node; ++__node)
728 std::_Destroy(*__node, *__node + _S_buffer_size(),
848 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
849 __node < __last._M_node; ++__node)
850 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| deque.tcc | 784 for (_Map_pointer __node = __first._M_node + 1;
785 __node < __last._M_node; ++__node)
786 std::_Destroy(*__node, *__node + _S_buffer_size(),
906 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
907 __node < __last._M_node; ++__node)
908 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| deque.tcc | 784 for (_Map_pointer __node = __first._M_node + 1;
785 __node < __last._M_node; ++__node)
786 std::_Destroy(*__node, *__node + _S_buffer_size(),
906 for (typename _Self::_Map_pointer __node = __first._M_node + 1;
907 __node < __last._M_node; ++__node)
908 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| __hash_table | 139 __hash_iterator(__node_pointer __node) _NOEXCEPT
140 : __node_(__node)
159 >::type __node;
163 typedef typename __node::value_type value_type;
175 rebind<__node>
177 rebind<__node>::other
217 __hash_const_iterator(__node_pointer __node) _NOEXCEPT
218 : __node_(__node)
285 __hash_local_iterator(__node_pointer __node, size_t __bucket,
287 : __node_(__node),
[all...] |
| list | 519 typedef __list_node<value_type, __void_pointer> __node;
522 rebind_alloc<__node>
524 rebind_alloc<__node>::other
815 typedef typename base::__node __node;
[all...] |
| regex | [all...] |
| /external/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);
|
| /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);
|
