Searched defs:_M_node (Results 1 - 8 of 8) sorted by relevance
/ndk/tests/device/test-stlport_shared-exception/jni/ |
H A D | alias2.cpp | 9 int* _M_node; member in struct:_Deque_iterator 11 _Deque_iterator() : _M_cur(0), _M_node(0) {} 14 _M_node(__x._M_node) {} 33 printf ("bb %x %x\n", this, *_M_start._M_node); 42 _M_start._M_node = &yy;
|
/ndk/tests/device/test-stlport_static-exception/jni/ |
H A D | alias2.cpp | 9 int* _M_node; member in struct:_Deque_iterator 11 _Deque_iterator() : _M_cur(0), _M_node(0) {} 14 _M_node(__x._M_node) {} 33 printf ("bb %x %x\n", this, *_M_start._M_node); 42 _M_start._M_node = &yy;
|
/ndk/sources/cxx-stl/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 | _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 | _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 | _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 | _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...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
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...] |
Completed in 448 milliseconds