| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| D | _slist_base.c | 40 const _Slist_node_base* __node) { in __previous() argument
41 while (__head && __head->_M_next != __node) in __previous()
74 _Sl_global<_Dummy>::__reverse(_Slist_node_base* __node) { in __reverse() argument
75 _Slist_node_base* __result = __node; in __reverse()
76 __node = __node->_M_next; in __reverse()
78 while(__node) { in __reverse()
79 _Slist_node_base* __next = __node->_M_next; in __reverse()
80 __node->_M_next = __result; in __reverse()
81 __result = __node; in __reverse()
82 __node = __next; in __reverse()
[all …]
|
| D | _slist_base.h | 56 static size_t _STLP_CALL size(_Slist_node_base* __node);
57 static _Slist_node_base* _STLP_CALL __reverse(_Slist_node_base* __node);
65 const _Slist_node_base* __node);
67 const _Slist_node_base* __node) { in __previous() argument
68 return _Sl_global<_Dummy>::__previous(__CONST_CAST(_Slist_node_base*, __head), __node); in __previous()
|
| D | _slist.h | 254 _Node* __node = this->_M_head.allocate(1);
256 _Copy_Construct(&__node->_M_data, __x);
257 __node->_M_next = 0;
259 _STLP_UNWIND(this->_M_head.deallocate(__node, 1))
260 return __node;
265 _Node* __node = this->_M_head.allocate(1);
267 _STLP_STD::_Construct(&__node->_M_data);
268 __node->_M_next = 0;
270 _STLP_UNWIND(this->_M_head.deallocate(__node, 1))
271 return __node;
[all …]
|
| D | _slist.c | 93 _Node_base* __node = this->_M_head._M_data._M_next; in _M_fill_assign() local
94 for ( ; __node != 0 && __n > 0 ; --__n) { in _M_fill_assign()
95 __STATIC_CAST(_Node*, __node)->_M_data = __val; in _M_fill_assign()
96 __prev = __node; in _M_fill_assign()
97 __node = __node->_M_next; in _M_fill_assign()
|
| D | _tree.c | 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) { in __black_count() argument
669 if (__node == 0) in __black_count()
672 int __bc = __node->_M_color == _S_rb_tree_black ? 1 : 0; in __black_count()
673 if (__node == __root) in __black_count()
676 return __bc + __black_count(__node->_M_parent, __root); in __black_count()
|
| D | _deque.c | 347 for (_Map_pointer __node = this->_M_start._M_node + 1; in clear() local
348 __node < this->_M_finish._M_node; in clear()
349 ++__node) { in clear()
350 _STLP_STD::_Destroy_Range(*__node, *__node + this->buffer_size()); in clear()
351 this->_M_map_size.deallocate(*__node, this->buffer_size()); in clear()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| D | forward_list | 298 >::type __node;
301 rebind<__node>
303 rebind<__node>::other
311 typedef typename __node::value_type value_type;
366 typedef __forward_list_node<value_type, void_pointer> __node;
370 rebind_alloc<__node>
372 rebind_alloc<__node>::other
556 typedef typename base::__node __node;
794 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
815 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
[all …]
|
| D | __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 …]
|
| D | 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;
1351 unique_ptr<__node, _Dp> __hold(__node_alloc_traits::allocate(__na, 1), _Dp(__na, 1));
1380 unique_ptr<__node, _Dp> __hold(__node_alloc_traits::allocate(__na, 1), _Dp(__na, 1));
1448 unique_ptr<__node, _Dp> __hold(__node_alloc_traits::allocate(__na, 1), _Dp(__na, 1));
1503 unique_ptr<__node, _Dp> __hold(__node_alloc_traits::allocate(__na, 1), _Dp(__na, 1));
1516 unique_ptr<__node, _Dp> __hold(__node_alloc_traits::allocate(__na, 1), _Dp(__na, 1));
1532 unique_ptr<__node, _Dp> __hold(__node_alloc_traits::allocate(__na, 1), _Dp(__na, 1));
[all …]
|
| D | regex | 1271 template <class _CharT> class __node;
1302 const __node<_CharT>* __node_;
1312 // __node
1315 class __node
1317 __node(const __node&);
1318 __node& operator=(const __node&);
1323 __node() {}
1325 virtual ~__node() {}
1337 : public __node<_CharT>
1359 : public __node<_CharT>
[all …]
|
| D | __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
1038 typedef unique_ptr<__node, _Dp> __node_holder;
|
| D | map | 1160 typedef typename __base::__node __node;
1167 typedef unique_ptr<__node, _Dp> __node_holder;
1890 typedef typename __base::__node __node;
1895 typedef unique_ptr<__node, _Dp> __node_holder;
|
| D | unordered_map | 748 typedef typename __table::__node __node;
750 typedef unique_ptr<__node, _Dp> __node_holder;
1485 typedef typename __table::__node __node;
1487 typedef unique_ptr<__node, _Dp> __node_holder;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ext/ |
| D | 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;
|