| /external/stlport/stlport/stl/ |
| _algobase.c | 255 _ForwardIter2 __p = __p1; local
259 while (__pred(*__current, *__p)) {
260 if (++__p == __last2)
|
| _list.h | 285 _Node* __p = this->_M_node.allocate(1); local
287 _Copy_Construct(&__p->_M_data, __x);
289 _STLP_UNWIND(this->_M_node.deallocate(__p, 1))
290 return __p;
295 _Node* __p = this->_M_node.allocate(1); local
297 _STLP_STD::_Construct(&__p->_M_data);
299 _STLP_UNWIND(this->_M_node.deallocate(__p, 1))
300 return __p;
427 _Node_base* __p = __n->_M_prev; local
429 __tmp->_M_prev = __p;
652 _Node_base* __p = &this->_M_node._M_data; local
[all...] |
| _tree.h | 377 _Base_ptr _M_copy(_Base_ptr __x, _Base_ptr __p);
503 pair<iterator,iterator> __p = equal_range(__x); local
504 size_type __n = _STLP_STD::distance(__p.first, __p.second);
505 erase(__p.first, __p.second);
597 pair<const_iterator, const_iterator> __p = equal_range(__x); local
598 return _STLP_STD::distance(__p.first, __p.second);
616 pair<iterator, iterator> __p; local
629 pair<const_iterator, const_iterator> __p; local
[all...] |
| _algo.c | 133 _ForwardIter2 __p = __p1;
138 while (*__current == *__p) {
139 if (++__p == __last2)
465 _RandomAccessIter __p = __first; local
469 if (__p > __first + __l) {
470 *__p = *(__p - __l);
471 __p -= __l;
474 *__p = *(__p + __k)
[all...] |
| /external/stlport/stlport/stl/debug/ |
| _hashtable.h | 285 pair<iterator, iterator> __p = equal_range(__key); local
286 size_type __n = _STLP_STD::distance(__p.first, __p.second);
287 _Invalidate_iterators(__p.first, __p.second);
288 _M_non_dbg_impl.erase(__p.first._M_iterator, __p.second._M_iterator);
|
| _tree.h | 211 _STLP_STD::pair<_Base_iterator, _Base_iterator> __p; local
212 __p = _M_non_dbg_impl.equal_range_unique(__x);
213 return pair<iterator, iterator>(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.second));
217 _STLP_STD::pair<_Base_const_iterator, _Base_const_iterator> __p; local
218 __p = _M_non_dbg_impl.equal_range_unique(__x);
219 return pair<const_iterator, const_iterator>(const_iterator(&_M_iter_list, __p.first),
220 const_iterator(&_M_iter_list, __p.second));
276 pair<iterator, iterator> __p = equal_range(__x); local
277 size_type __n = _STLP_STD::distance(__p.first._M_iterator, __p.second._M_iterator)
[all...] |
| /ndk/sources/android/stlport/stlport/stl/ |
| _algobase.c | 255 _ForwardIter2 __p = __p1; local
259 while (__pred(*__current, *__p)) {
260 if (++__p == __last2)
|
| _list.h | 285 _Node* __p = this->_M_node.allocate(1); local
287 _Copy_Construct(&__p->_M_data, __x);
289 _STLP_UNWIND(this->_M_node.deallocate(__p, 1))
290 return __p;
295 _Node* __p = this->_M_node.allocate(1); local
297 _STLP_STD::_Construct(&__p->_M_data);
299 _STLP_UNWIND(this->_M_node.deallocate(__p, 1))
300 return __p;
427 _Node_base* __p = __n->_M_prev; local
429 __tmp->_M_prev = __p;
652 _Node_base* __p = &this->_M_node._M_data; local
[all...] |
| _tree.h | 377 _Base_ptr _M_copy(_Base_ptr __x, _Base_ptr __p);
503 pair<iterator,iterator> __p = equal_range(__x); local
504 size_type __n = _STLP_STD::distance(__p.first, __p.second);
505 erase(__p.first, __p.second);
597 pair<const_iterator, const_iterator> __p = equal_range(__x); local
598 return _STLP_STD::distance(__p.first, __p.second);
616 pair<iterator, iterator> __p; local
629 pair<const_iterator, const_iterator> __p; local
[all...] |
| _algo.c | 133 _ForwardIter2 __p = __p1;
138 while (*__current == *__p) {
139 if (++__p == __last2)
465 _RandomAccessIter __p = __first; local
469 if (__p > __first + __l) {
470 *__p = *(__p - __l);
471 __p -= __l;
474 *__p = *(__p + __k)
[all...] |
| /ndk/sources/android/stlport/stlport/stl/debug/ |
| _hashtable.h | 285 pair<iterator, iterator> __p = equal_range(__key); local
286 size_type __n = _STLP_STD::distance(__p.first, __p.second);
287 _Invalidate_iterators(__p.first, __p.second);
288 _M_non_dbg_impl.erase(__p.first._M_iterator, __p.second._M_iterator);
|
| _tree.h | 211 _STLP_STD::pair<_Base_iterator, _Base_iterator> __p; local
212 __p = _M_non_dbg_impl.equal_range_unique(__x);
213 return pair<iterator, iterator>(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.second));
217 _STLP_STD::pair<_Base_const_iterator, _Base_const_iterator> __p; local
218 __p = _M_non_dbg_impl.equal_range_unique(__x);
219 return pair<const_iterator, const_iterator>(const_iterator(&_M_iter_list, __p.first),
220 const_iterator(&_M_iter_list, __p.second));
276 pair<iterator, iterator> __p = equal_range(__x); local
277 size_type __n = _STLP_STD::distance(__p.first._M_iterator, __p.second._M_iterator)
[all...] |
