/external/stlport/stlport/stl/pointers/ |
H A D | _slist.h | 128 : _M_impl(_BaseConstIte(__first._M_node), _BaseConstIte(__last._M_node), 181 _M_impl.assign(_BaseConstIte(__first._M_node), 182 _BaseConstIte(__last._M_node)); 186 iterator before_begin() { return iterator(_M_impl.before_begin()._M_node); } 187 const_iterator before_begin() const { return const_iterator(const_cast<_Node_base*>(_M_impl.before_begin()._M_node)); } 189 iterator begin() { return iterator(_M_impl.begin()._M_node); } 190 const_iterator begin() const { return const_iterator(const_cast<_Node_base*>(_M_impl.begin()._M_node));} 192 iterator end() { return iterator(_M_impl.end()._M_node); } 193 const_iterator end() const { return iterator(_M_impl.end()._M_node); } [all...] |
H A D | _list.h | 140 : _M_impl(_BaseConstIte(__first._M_node), _BaseConstIte(__last._M_node), 152 iterator begin() { return iterator(_M_impl.begin()._M_node); } 153 const_iterator begin() const { return const_iterator(_M_impl.begin()._M_node); } 155 iterator end() { return iterator(_M_impl.end()._M_node); } 156 const_iterator end() const { return const_iterator(_M_impl.end()._M_node); } 184 { return iterator(_M_impl.insert(_BaseIte(__pos._M_node), 185 cast_traits::to_storage_type_cref(__x))._M_node); } 193 { _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); } 199 _M_impl.insert(_BaseIte(__pos._M_node), [all...] |
H A D | _deque.h | 46 tmp._M_node = cast_traits::to_value_type_pptr(__ite._M_node); 54 tmp._M_node = cast_traits::to_storage_type_pptr(__ite._M_node); 63 tmp._M_node = cast_traits::to_value_type_pptr(__ite._M_node); 72 tmp._M_node = cast_traits::to_storage_type_pptr(__ite._M_node);
|
H A D | _set.h | 118 { return iterator(__ite._Owner(), __ite._M_iterator._M_node); } 120 { return base_iterator(__ite._Owner(), __ite._M_iterator._M_node); } 123 { return iterator(__ite._M_node); } 125 { return base_iterator(__ite._M_node); } 365 { return iterator(__ite._Owner(), __ite._M_iterator._M_node); } 367 { return base_iterator(__ite._Owner(), __ite._M_iterator._M_node); } 370 { return iterator(__ite._M_node); } 372 { return base_iterator(__ite._M_node); }
|
/external/stlport/stlport/stl/ |
H A D | _tree.c | 278 _Rb_global<_Dummy>::_M_decrement(_Rb_tree_node_base* _M_node) { argument 279 if (_M_node->_M_color == _S_rb_tree_red && _M_node->_M_parent->_M_parent == _M_node) 280 _M_node = _M_node->_M_right; 281 else if (_M_node->_M_left != 0) { 282 _M_node = _Rb_tree_node_base::_S_maximum(_M_node->_M_left); 285 _Base_ptr __y = _M_node 296 _M_increment(_Rb_tree_node_base* _M_node) argument [all...] |
H A D | _list.h | 87 _List_node_base* _M_node; member in struct:_List_iterator_base 89 _List_iterator_base(_List_node_base* __x) : _M_node(__x) {} 91 void _M_incr() { _M_node = _M_node->_M_next; } 92 void _M_decr() { _M_node = _M_node->_M_prev; } 116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} 118 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; } 141 return this->_M_node == __y._M_node; 216 _AllocProxy _M_node; member in class:_List_base [all...] |
H A D | _deque.c | 42 _M_destroy_nodes(_M_start._M_node, this->_M_finish._M_node + 1); 132 _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node)) 140 _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node+1, __new_finish._M_node+1)) 161 _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node)) 169 _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1, 170 __new_finish._M_node [all...] |
H A D | _list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next); 72 __cur != &(_M_node._M_data)) { 76 this->_M_node.deallocate(__tmp, 1); 78 _M_node._M_data._M_next = &_M_node._M_data; 79 _M_node._M_data._M_prev = &_M_node._M_data; 180 _List_global_inst::_Transfer(__first1._M_node, __first2._M_node, (++__next)._M_node); [all...] |
H A D | _slist.c | 138 while (__ite._M_node->_M_next) { 139 if (__pred(*__ite, __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) 153 while (__ite._M_node->_M_next && !__x.empty()) { 154 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) { 155 _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()), 167 while (__i1._M_node->_M_next && __i2._M_node) { 168 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) { 169 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data), 184 if (!__that.begin()._M_node || !__tha [all...] |
H A D | _slist.h | 70 _Slist_node_base *_M_node; member in struct:_Slist_iterator_base 72 _Slist_iterator_base(_Slist_node_base *__x) : _M_node(__x) {} 75 _M_node = _M_node->_M_next; 100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} 102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; } 117 return this->_M_node == __y._M_node; 120 return this->_M_node != __y._M_node; [all...] |
H A D | _deque.h | 104 _Map_pointer _M_node; member in struct:_Deque_iterator_base 108 _M_last(*__y + _S_buffer_size()), _M_node(__y) {} 110 _Deque_iterator_base() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {} 116 _M_last(__other._M_last), _M_node(__other._M_node) {} 120 return difference_type(_S_buffer_size()) * (_M_node - __x._M_node - 1) + 126 _M_set_node(_M_node + 1); 133 _M_set_node(_M_node - 1); 148 _M_set_node(_M_node [all...] |
H A D | _tree.h | 140 _Base_ptr _M_node; member in struct:_Rb_tree_base_iterator 141 _Rb_tree_base_iterator() : _M_node(0) {} 142 _Rb_tree_base_iterator(_Base_ptr __x) : _M_node(__x) {} 168 _Rb_tree_iterator(const iterator& __it) : _Rb_tree_base_iterator(__it._M_node) {} 171 return __STATIC_CAST(_Link_type, _M_node)->_M_value_field; 177 _M_node = _Rb_global_inst::_M_increment(_M_node); 187 _M_node = _Rb_global_inst::_M_decrement(_M_node); 197 return _M_node [all...] |
H A D | _hashtable.c | 168 _BucketType *__pos_node = __pos._M_node; 190 _M_elems.insert_after(__pos, __obj)._M_node); 280 fill(_M_buckets.begin() + __prev_b, _M_buckets.begin() + __n + 1, __cur._M_node); 312 _M_elems.erase_after(__prev)._M_node); 357 fill(_M_buckets.begin() + __f_bucket, _M_buckets.begin() + __l_bucket + 1, __cur._M_node); 471 fill(__tmp.begin() + __prev_bucket, __tmp.begin() + __new_bucket + 1, __cur._M_node); 521 if (*__src_b == __src._M_node) { 522 *__dst_b = __dst._M_node;
|
/external/stlport/stlport/stl/debug/ |
H A D | _debug.c | 126 _L_type* __prev = __CONST_CAST(_L_type*, &__base->_M_node); 150 _L_type* __prev = __CONST_CAST(_L_type*, &__base->_M_node); 178 _L_type* __src_prev = &__base->_M_node; 180 _L_type* __dst_prev = __CONST_CAST(_L_type*, &__dst->_M_node); 223 _L_type* __prev = &__base->_M_node; 225 _L_type* __dst_prev = __CONST_CAST(_L_type*, &__dst->_M_node); 454 __l->_M_node._M_next =0; 463 if (__l->_M_node._M_owner) { 464 for (__owned_link* __pos = (__owned_link*)__l->_M_node._M_next; 477 _STLP_ASSERT(__l->_M_node [all...] |
H A D | _debug.h | 343 _M_node._M_owner = __REINTERPRET_CAST(__owned_list*,__o); 344 _M_node._M_next = 0; 350 _M_node._Invalidate(); 352 const void* _Owner() const { return (const void*)_M_node._M_owner; } 353 void* _Owner() { return (void*)_M_node._M_owner; } 354 bool _Valid() const { return _M_node._M_owner != 0; } 355 void _Invalidate() { _M_node._M_owner = 0; } 357 __owned_link* _First() { return _M_node._Next(); } 360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; } 368 mutable __owned_link _M_node; member in class:__owned_list [all...] |