/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
_list.h | 89 _List_iterator_base(_List_node_base* __x) : _M_node(__x) {} 113 explicit _List_iterator(_List_node_base* __x) : _List_iterator_base(__x) {} 116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} 242 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x, 281 _Node_base* _M_create_node(const_reference __x = value_type()) { 283 _Node_base* _M_create_node(const_reference __x) { 287 _Copy_Construct(&__p->_M_data, __x); 508 void push_front(const_reference __x) { insert(begin(), __x); } local 509 void push_back (const_reference __x) { insert(end(), __x); } local [all...] |
_slist.h | 72 _Slist_iterator_base(_Slist_node_base *__x) : _M_node(__x) {} 97 explicit _Slist_iterator(_Slist_node_base *__x) : _Slist_iterator_base(__x) {} 100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} 209 void _Slist_merge(slist<_Tp, _Alloc>& __that, slist<_Tp, _Alloc>& __x, 250 _Node* _M_create_node(const value_type& __x = _Tp()) { 252 _Node* _M_create_node(const value_type& __x) { 256 _Copy_Construct(&__node->_M_data, __x); 574 __n, __x); local 651 _M_insert_after_fill(_STLP_PRIV _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node), __n, __x); local [all...] |
_tree.h | 93 static _Base_ptr _STLP_CALL _S_minimum(_Base_ptr __x) { 94 while (__x->_M_left != 0) __x = __x->_M_left; 95 return __x; 98 static _Base_ptr _STLP_CALL _S_maximum(_Base_ptr __x) { 99 while (__x->_M_right != 0) __x = __x->_M_right; 100 return __x; 493 _Base_ptr __x = _Rb_global_inst::_Rebalance_for_erase(__pos._M_node, local 550 _Base_ptr __x = _M_root(); \/\/ Current node. local 569 _Base_ptr __x = _M_root(); \/* Current node. *\/ local 583 _Base_ptr __x = _M_root(); \/* Current node. *\/ local [all...] |
_vector.h | 144 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type& /*_Movable*/, 146 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __true_type& /*_Movable*/, 149 if (_M_is_inside(__x)) { 150 value_type __x_copy = __x; 154 _M_insert_overflow_aux(__pos, __x, __false_type(), __fill_len, __atend); 157 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __false_type& /*_TrivialCopy*/, 162 _M_insert_overflow_aux(__pos, __x, _Movable(), __fill_len, __atend); 164 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __true_type& /*_TrivialCopy*/, 246 vector(const _Self& __x) 247 : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__x.size(), __x.get_allocator()) 643 insert(end(), __new_size - size(), __x); local [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
forward_list.h | 66 swap(_Fwd_list_node_base& __x, _Fwd_list_node_base& __y) 67 { std::swap(__x._M_next, __y._M_next); } 150 operator==(const _Self& __x) const 151 { return _M_node == __x._M_node; } 154 operator!=(const _Self& __x) const 155 { return _M_node != __x._M_node; } 221 operator==(const _Self& __x) const 222 { return _M_node == __x._M_node; } 225 operator!=(const _Self& __x) const 226 { return _M_node != __x._M_node; 1206 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
stl_bvector.h | 72 _Bit_reference(_Bit_type * __x, _Bit_type __y) 73 : _M_p(__x), _M_mask(__y) { } 81 operator=(bool __x) 83 if (__x) 91 operator=(const _Bit_reference& __x) 92 { return *this = bool(__x); } 95 operator==(const _Bit_reference& __x) const 96 { return bool(*this) == bool(__x); } 99 operator<(const _Bit_reference& __x) const 100 { return !bool(*this) && bool(__x); } 367 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local 742 _M_insert_aux(end(), __x); local 824 insert(end(), __new_size - size(), __x); local 921 insert(end(), __n - size(), __x); local [all...] |
stl_list.h | 77 swap(_List_node_base& __x, _List_node_base& __y); 128 _List_iterator(_List_node_base* __x) 129 : _M_node(__x) { } 171 operator==(const _Self& __x) const 172 { return _M_node == __x._M_node; } 175 operator!=(const _Self& __x) const 176 { return _M_node != __x._M_node; } 204 _List_const_iterator(const _List_node_base* __x) 205 : _M_node(__x) { } 207 _List_const_iterator(const iterator& __x) 879 { this->_M_insert(begin(), __x); } local 920 { this->_M_insert(end(), __x); } local 1376 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
forward_list.h | 160 operator==(const _Self& __x) const 161 { return _M_node == __x._M_node; } 164 operator!=(const _Self& __x) const 165 { return _M_node != __x._M_node; } 232 operator==(const _Self& __x) const 233 { return _M_node == __x._M_node; } 236 operator!=(const _Self& __x) const 237 { return _M_node != __x._M_node; } 256 operator==(const _Fwd_list_iterator<_Tp>& __x, 258 { return __x._M_node == __y._M_node; 1206 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
stl_list.h | 82 swap(_List_node_base& __x, _List_node_base& __y) throw (); 139 _List_iterator(__detail::_List_node_base* __x) 140 : _M_node(__x) { } 182 operator==(const _Self& __x) const 183 { return _M_node == __x._M_node; } 186 operator!=(const _Self& __x) const 187 { return _M_node != __x._M_node; } 215 _List_const_iterator(const __detail::_List_node_base* __x) 216 : _M_node(__x) { } 218 _List_const_iterator(const iterator& __x) 947 { this->_M_insert(begin(), __x); } local 988 { this->_M_insert(end(), __x); } local 1447 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
stl_list.h | 84 swap(_List_node_base& __x, _List_node_base& __y) _GLIBCXX_USE_NOEXCEPT; 141 _List_iterator(__detail::_List_node_base* __x) 142 : _M_node(__x) { } 184 operator==(const _Self& __x) const 185 { return _M_node == __x._M_node; } 188 operator!=(const _Self& __x) const 189 { return _M_node != __x._M_node; } 217 _List_const_iterator(const __detail::_List_node_base* __x) 218 : _M_node(__x) { } 220 _List_const_iterator(const iterator& __x) 956 { this->_M_insert(begin(), __x); } local 997 { this->_M_insert(end(), __x); } local 1457 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
stl_tree.h | 101 _S_minimum(_Base_ptr __x) 103 while (__x->_M_left != 0) __x = __x->_M_left; 104 return __x; 108 _S_minimum(_Const_Base_ptr __x) 110 while (__x->_M_left != 0) __x = __x->_M_left; 111 return __x; 1026 _Link_type __x = _M_begin(); local 1162 _Link_type __x = _M_begin(); local 1193 _Const_Link_type __x = _M_begin(); local 1279 _Link_type __x = _M_begin(); local 1316 _Link_type __x = _M_begin(); local 1591 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node); local [all...] |
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
_list.h | 89 _List_iterator_base(_List_node_base* __x) : _M_node(__x) {} 113 explicit _List_iterator(_List_node_base* __x) : _List_iterator_base(__x) {} 116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} 242 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x, 281 _Node_base* _M_create_node(const_reference __x = value_type()) { 283 _Node_base* _M_create_node(const_reference __x) { 287 _Copy_Construct(&__p->_M_data, __x); 508 void push_front(const_reference __x) { insert(begin(), __x); } local 509 void push_back (const_reference __x) { insert(end(), __x); } local [all...] |
_slist.h | 72 _Slist_iterator_base(_Slist_node_base *__x) : _M_node(__x) {} 97 explicit _Slist_iterator(_Slist_node_base *__x) : _Slist_iterator_base(__x) {} 100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} 209 void _Slist_merge(slist<_Tp, _Alloc>& __that, slist<_Tp, _Alloc>& __x, 250 _Node* _M_create_node(const value_type& __x = _Tp()) { 252 _Node* _M_create_node(const value_type& __x) { 256 _Copy_Construct(&__node->_M_data, __x); 574 __n, __x); local 651 _M_insert_after_fill(_STLP_PRIV _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node), __n, __x); local [all...] |
_tree.h | 93 static _Base_ptr _STLP_CALL _S_minimum(_Base_ptr __x) { 94 while (__x->_M_left != 0) __x = __x->_M_left; 95 return __x; 98 static _Base_ptr _STLP_CALL _S_maximum(_Base_ptr __x) { 99 while (__x->_M_right != 0) __x = __x->_M_right; 100 return __x; 493 _Base_ptr __x = _Rb_global_inst::_Rebalance_for_erase(__pos._M_node, local 550 _Base_ptr __x = _M_root(); \/\/ Current node. local 569 _Base_ptr __x = _M_root(); \/* Current node. *\/ local 583 _Base_ptr __x = _M_root(); \/* Current node. *\/ local [all...] |
_vector.h | 144 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type& /*_Movable*/, 146 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __true_type& /*_Movable*/, 149 if (_M_is_inside(__x)) { 150 value_type __x_copy = __x; 154 _M_insert_overflow_aux(__pos, __x, __false_type(), __fill_len, __atend); 157 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __false_type& /*_TrivialCopy*/, 162 _M_insert_overflow_aux(__pos, __x, _Movable(), __fill_len, __atend); 164 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __true_type& /*_TrivialCopy*/, 246 vector(const _Self& __x) 247 : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__x.size(), __x.get_allocator()) 643 insert(end(), __new_size - size(), __x); local [all...] |
/prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
_list.h | 89 _List_iterator_base(_List_node_base* __x) : _M_node(__x) {} 113 explicit _List_iterator(_List_node_base* __x) : _List_iterator_base(__x) {} 116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} 242 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x, 281 _Node_base* _M_create_node(const_reference __x = value_type()) { 283 _Node_base* _M_create_node(const_reference __x) { 287 _Copy_Construct(&__p->_M_data, __x); 508 void push_front(const_reference __x) { insert(begin(), __x); } local 509 void push_back (const_reference __x) { insert(end(), __x); } local [all...] |
_slist.h | 72 _Slist_iterator_base(_Slist_node_base *__x) : _M_node(__x) {} 97 explicit _Slist_iterator(_Slist_node_base *__x) : _Slist_iterator_base(__x) {} 100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} 209 void _Slist_merge(slist<_Tp, _Alloc>& __that, slist<_Tp, _Alloc>& __x, 250 _Node* _M_create_node(const value_type& __x = _Tp()) { 252 _Node* _M_create_node(const value_type& __x) { 256 _Copy_Construct(&__node->_M_data, __x); 574 __n, __x); local 651 _M_insert_after_fill(_STLP_PRIV _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node), __n, __x); local [all...] |
_tree.h | 93 static _Base_ptr _STLP_CALL _S_minimum(_Base_ptr __x) { 94 while (__x->_M_left != 0) __x = __x->_M_left; 95 return __x; 98 static _Base_ptr _STLP_CALL _S_maximum(_Base_ptr __x) { 99 while (__x->_M_right != 0) __x = __x->_M_right; 100 return __x; 493 _Base_ptr __x = _Rb_global_inst::_Rebalance_for_erase(__pos._M_node, local 550 _Base_ptr __x = _M_root(); \/\/ Current node. local 569 _Base_ptr __x = _M_root(); \/* Current node. *\/ local 583 _Base_ptr __x = _M_root(); \/* Current node. *\/ local [all...] |
_vector.h | 144 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type& /*_Movable*/, 146 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __true_type& /*_Movable*/, 149 if (_M_is_inside(__x)) { 150 value_type __x_copy = __x; 154 _M_insert_overflow_aux(__pos, __x, __false_type(), __fill_len, __atend); 157 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __false_type& /*_TrivialCopy*/, 162 _M_insert_overflow_aux(__pos, __x, _Movable(), __fill_len, __atend); 164 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __true_type& /*_TrivialCopy*/, 246 vector(const _Self& __x) 247 : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__x.size(), __x.get_allocator()) 643 insert(end(), __new_size - size(), __x); local [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
forward_list.h | 160 operator==(const _Self& __x) const 161 { return _M_node == __x._M_node; } 164 operator!=(const _Self& __x) const 165 { return _M_node != __x._M_node; } 232 operator==(const _Self& __x) const 233 { return _M_node == __x._M_node; } 236 operator!=(const _Self& __x) const 237 { return _M_node != __x._M_node; } 256 operator==(const _Fwd_list_iterator<_Tp>& __x, 258 { return __x._M_node == __y._M_node; 1206 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
stl_list.h | 82 swap(_List_node_base& __x, _List_node_base& __y) throw (); 139 _List_iterator(__detail::_List_node_base* __x) 140 : _M_node(__x) { } 182 operator==(const _Self& __x) const 183 { return _M_node == __x._M_node; } 186 operator!=(const _Self& __x) const 187 { return _M_node != __x._M_node; } 215 _List_const_iterator(const __detail::_List_node_base* __x) 216 : _M_node(__x) { } 218 _List_const_iterator(const iterator& __x) 947 { this->_M_insert(begin(), __x); } local 988 { this->_M_insert(end(), __x); } local 1447 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
stl_list.h | 84 swap(_List_node_base& __x, _List_node_base& __y) _GLIBCXX_USE_NOEXCEPT; 141 _List_iterator(__detail::_List_node_base* __x) 142 : _M_node(__x) { } 184 operator==(const _Self& __x) const 185 { return _M_node == __x._M_node; } 188 operator!=(const _Self& __x) const 189 { return _M_node != __x._M_node; } 217 _List_const_iterator(const __detail::_List_node_base* __x) 218 : _M_node(__x) { } 220 _List_const_iterator(const iterator& __x) 956 { this->_M_insert(begin(), __x); } local 997 { this->_M_insert(end(), __x); } local 1457 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
stl_tree.h | 101 _S_minimum(_Base_ptr __x) 103 while (__x->_M_left != 0) __x = __x->_M_left; 104 return __x; 108 _S_minimum(_Const_Base_ptr __x) 110 while (__x->_M_left != 0) __x = __x->_M_left; 111 return __x; 1026 _Link_type __x = _M_begin(); local 1162 _Link_type __x = _M_begin(); local 1193 _Const_Link_type __x = _M_begin(); local 1279 _Link_type __x = _M_begin(); local 1316 _Link_type __x = _M_begin(); local 1591 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node); local [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
stl_list.h | 83 swap(_List_node_base& __x, _List_node_base& __y) _GLIBCXX_USE_NOEXCEPT; 140 _List_iterator(__detail::_List_node_base* __x) 141 : _M_node(__x) { } 183 operator==(const _Self& __x) const 184 { return _M_node == __x._M_node; } 187 operator!=(const _Self& __x) const 188 { return _M_node != __x._M_node; } 216 _List_const_iterator(const __detail::_List_node_base* __x) 217 : _M_node(__x) { } 219 _List_const_iterator(const iterator& __x) 975 { this->_M_insert(begin(), __x); } local 1016 { this->_M_insert(end(), __x); } local 1481 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
/external/stlport/stlport/stl/ |
_bvector.h | 45 _Bit_reference(unsigned int* __x, unsigned int __y) 46 : _M_p(__x), _M_mask(__y) {} 54 _Bit_reference& operator = (bool __x) { 55 if (__x) *_M_p |= _M_mask; 59 _Bit_reference& operator = (const _Bit_reference& __x) { 60 return *this = bool(__x); 62 bool operator == (const _Bit_reference& __x) const { 63 return bool(*this) == bool(__x); 65 bool operator < (const _Bit_reference& __x) const { 66 return !bool(*this) && bool(__x); 600 insert(end(), __n - size(), __x); local 674 _M_insert_aux(end(), __x); local 804 insert(end(), __new_size - size(), __x); local [all...] |