| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _slist_base.c | 64 _Slist_node_base* __first = __before_first->_M_next; local
67 __pos->_M_next = __first;
|
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
53 __first->_M_prev->_M_next = __last;
54 __position->_M_prev->_M_next = __first;
59 __last->_M_prev = __first->_M_prev;
60 __first->_M_prev = __tmp;
141 _Literator __first = __that.begin(); local
143 while (__first != __last) {
144 _Literator __next = __first;
146 if (__pred(*__first)) __that.erase(__first);
154 _Literator __first = __that.begin(); local
[all...] |
| _hashtable.c | 63 const size_t* __first = _S_primes(__size); local
64 return *(__first + __size - 1);
71 const size_t* __first = _S_primes(__size); local
72 const size_t* __last = __first + __size;
73 const size_t* pos = __lower_bound(__first, __last, __n,
334 ::erase(const_iterator __first, const_iterator __last) {
335 if (__first == __last)
337 size_type __f_bucket = _M_bkt_num(*__first);
342 if (__cur == __first._M_ite) {
348 for (; (__cur != __last) && (__cur != __first._M_ite); ++__prev, ++__cur)
406 const size_type *__first; local
[all...] |
| _string.c | 196 basic_string<_CharT, _Traits, _Alloc>::_M_append(const _CharT* __first, const _CharT* __last) {
197 if (__first != __last) {
198 size_type __n = __STATIC_CAST(size_type, __last - __first);
203 __new_finish = _STLP_PRIV __ucopy(__first, __last, __new_finish);
209 const _CharT* __f1 = __first;
213 _Traits::assign(*end(), *__first); local
315 const _CharT* __first, const _CharT* __last,
318 if (__first != __last) {
319 const size_t __n = __last - __first;
328 _M_copy(__first, __last, __pos)
[all...] |
| _list.h | 67 _Node_base* __first, _Node_base* __last);
324 list(_InputIterator __first, _InputIterator __last,
327 { _M_insert(begin(), __first, __last); } local
331 list(_InputIterator __first, _InputIterator __last)
333 { _M_insert(begin(), __first, __last); } local
336 list(const value_type* __first, const value_type* __last,
339 { _M_insert(begin(), __first, __last); } local
340 list(const_iterator __first, const_iterator __last,
343 { _M_insert(begin(), __first, __last); } local
438 void _M_insert(iterator __pos, _InputIterator __first, _InputIterator __last)
635 iterator __first = begin(); local
[all...] |
| _vector.h | 270 void _M_initialize_aux(_InputIterator __first, _InputIterator __last,
272 { _M_range_initialize(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator)); }
277 vector(_InputIterator __first, _InputIterator __last,
281 _M_initialize_aux(__first, __last, _Integral());
286 vector(_InputIterator __first, _InputIterator __last)
289 _M_initialize_aux(__first, __last, _Integral());
294 vector(const _Tp* __first, const _Tp* __last,
296 : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__last - __first, __a) {
298 this->_M_finish = _STLP_PRIV __ucopy_ptrs(__first, __last, this->_M_start, _TrivialUCopy())
355 insert(end(), __first, __last); local
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/ |
| _slist_base.c | 64 _Slist_node_base* __first = __before_first->_M_next; local
67 __pos->_M_next = __first;
|
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
53 __first->_M_prev->_M_next = __last;
54 __position->_M_prev->_M_next = __first;
59 __last->_M_prev = __first->_M_prev;
60 __first->_M_prev = __tmp;
141 _Literator __first = __that.begin(); local
143 while (__first != __last) {
144 _Literator __next = __first;
146 if (__pred(*__first)) __that.erase(__first);
154 _Literator __first = __that.begin(); local
[all...] |
| _hashtable.c | 63 const size_t* __first = _S_primes(__size); local
64 return *(__first + __size - 1);
71 const size_t* __first = _S_primes(__size); local
72 const size_t* __last = __first + __size;
73 const size_t* pos = __lower_bound(__first, __last, __n,
334 ::erase(const_iterator __first, const_iterator __last) {
335 if (__first == __last)
337 size_type __f_bucket = _M_bkt_num(*__first);
342 if (__cur == __first._M_ite) {
348 for (; (__cur != __last) && (__cur != __first._M_ite); ++__prev, ++__cur)
406 const size_type *__first; local
[all...] |
| _string.c | 196 basic_string<_CharT, _Traits, _Alloc>::_M_append(const _CharT* __first, const _CharT* __last) {
197 if (__first != __last) {
198 size_type __n = __STATIC_CAST(size_type, __last - __first);
203 __new_finish = _STLP_PRIV __ucopy(__first, __last, __new_finish);
209 const _CharT* __f1 = __first;
213 _Traits::assign(*end(), *__first); local
315 const _CharT* __first, const _CharT* __last,
318 if (__first != __last) {
319 const size_t __n = __last - __first;
328 _M_copy(__first, __last, __pos)
[all...] |
| /ndk/sources/cxx-stl/stlport/src/ |
| num_put.cpp | 84 Char __first = *iostr.begin(); local
86 if (__first == Plus || __first == Minus) {
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _list.h | 85 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
86 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
121 list(_InputIterator __first, _InputIterator __last,
123 : _ConstructCheck(__first, __last),
124 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last), __a),
128 list(_InputIterator __first, _InputIterator __last)
129 : _ConstructCheck(__first, __last),
130 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)),
135 list(const value_type* __first, const value_type* __last,
137 : _ConstructCheck(__first, __last)
340 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
416 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
436 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
450 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
[all...] |
| _slist.h | 101 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
102 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
138 slist(_InputIterator __first, _InputIterator __last,
140 : _ConstructCheck(__first, __last),
141 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last), __a),
145 slist(_InputIterator __first, _InputIterator __last)
146 : _ConstructCheck(__first, __last),
147 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)),
152 slist(const value_type* __first, const value_type* __last,
154 : _ConstructCheck(__first, __last)
442 iterator __first = __before_first; ++__first; local
503 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
515 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
552 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
566 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _vector.h | 133 vector(_InputIterator __first, _InputIterator __last,
135 : _M_impl(__first, __last,
140 vector(_InputIterator __first, _InputIterator __last)
141 : _M_impl(__first, __last) {}
145 vector(const_iterator __first, const_iterator __last,
147 : _M_impl(cast_traits::to_storage_type_cptr(__first), cast_traits::to_storage_type_cptr(__last),
159 void assign(_InputIterator __first, _InputIterator __last)
160 { _M_impl.assign(__first, __last); }
162 void assign(const_iterator __first, const_iterator __last) {
163 _M_impl.assign(cast_traits::to_storage_type_cptr(__first),
197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); } local
[all...] |
| _deque.h | 178 deque(_InputIterator __first, _InputIterator __last,
181 : _M_impl(__first, __last,
187 insert(end(), __first, __last); local
193 deque(_InputIterator __first, _InputIterator __last)
195 : _M_impl(__first, __last) {}
197 { insert(end(), __first, __last); }
202 deque(const_pointer __first, const_pointer __last,
204 : _M_impl(cast_traits::to_storage_type_cptr(__first),
208 deque(const_iterator __first, const_iterator __last,
210 : _M_impl(ite_cast_traits::to_storage_type_cite(__first),
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _list.h | 85 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
86 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
121 list(_InputIterator __first, _InputIterator __last,
123 : _ConstructCheck(__first, __last),
124 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last), __a),
128 list(_InputIterator __first, _InputIterator __last)
129 : _ConstructCheck(__first, __last),
130 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)),
135 list(const value_type* __first, const value_type* __last,
137 : _ConstructCheck(__first, __last)
340 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
416 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
436 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
450 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
[all...] |
| _slist.h | 101 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
102 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
138 slist(_InputIterator __first, _InputIterator __last,
140 : _ConstructCheck(__first, __last),
141 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last), __a),
145 slist(_InputIterator __first, _InputIterator __last)
146 : _ConstructCheck(__first, __last),
147 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)),
152 slist(const value_type* __first, const value_type* __last,
154 : _ConstructCheck(__first, __last)
442 iterator __first = __before_first; ++__first; local
503 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
515 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
552 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
566 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _vector.h | 133 vector(_InputIterator __first, _InputIterator __last,
135 : _M_impl(__first, __last,
140 vector(_InputIterator __first, _InputIterator __last)
141 : _M_impl(__first, __last) {}
145 vector(const_iterator __first, const_iterator __last,
147 : _M_impl(cast_traits::to_storage_type_cptr(__first), cast_traits::to_storage_type_cptr(__last),
159 void assign(_InputIterator __first, _InputIterator __last)
160 { _M_impl.assign(__first, __last); }
162 void assign(const_iterator __first, const_iterator __last) {
163 _M_impl.assign(cast_traits::to_storage_type_cptr(__first),
197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); } local
[all...] |
| _deque.h | 178 deque(_InputIterator __first, _InputIterator __last,
181 : _M_impl(__first, __last,
187 insert(end(), __first, __last); local
193 deque(_InputIterator __first, _InputIterator __last)
195 : _M_impl(__first, __last) {}
197 { insert(end(), __first, __last); }
202 deque(const_pointer __first, const_pointer __last,
204 : _M_impl(cast_traits::to_storage_type_cptr(__first),
208 deque(const_iterator __first, const_iterator __last,
210 : _M_impl(ite_cast_traits::to_storage_type_cite(__first),
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/backward/ |
| hashtable.h | 240 const unsigned long* __first = _Hashtable_prime_list<unsigned long>::_S_get_prime_list(); local
241 const unsigned long* __last = __first + (int)_S_num_primes;
242 const unsigned long* pos = std::lower_bound(__first, __last, __n);
525 _Node* __first; local
526 for (__first = _M_buckets[__n];
527 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
528 __first = __first->_M_next)
530 return iterator(__first, this)
537 const _Node* __first; local
765 _Node* __first = _M_buckets[__n]; local
784 _Node* __first = _M_buckets[__n]; local
811 _Node* __first = _M_buckets[__n]; local
885 _Node* __first = _M_buckets[__n]; local
1035 _Node* __first = _M_buckets[__bucket]; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| forward_list.h | 491 * @param __first An input iterator.
496 * [@a __first,@a __last). This is linear in N (where N is
497 * distance(@a __first,@a __last)).
501 forward_list(_InputIterator __first, _InputIterator __last,
504 { _M_range_initialize(__first, __last); }
596 * @param __first An input iterator.
600 * in the range [@a __first,@a __last).
609 assign(_InputIterator __first, _InputIterator __last)
611 typedef is_assignable<_Tp, decltype(*__first)> __assignable;
612 _M_assign(__first, __last, __assignable())
1298 insert_after(cbefore_begin(), __first, __last); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/backward/ |
| hashtable.h | 240 const unsigned long* __first = _Hashtable_prime_list<unsigned long>::_S_get_prime_list(); local
241 const unsigned long* __last = __first + (int)_S_num_primes;
242 const unsigned long* pos = std::lower_bound(__first, __last, __n);
525 _Node* __first; local
526 for (__first = _M_buckets[__n];
527 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
528 __first = __first->_M_next)
530 return iterator(__first, this)
537 const _Node* __first; local
765 _Node* __first = _M_buckets[__n]; local
784 _Node* __first = _M_buckets[__n]; local
811 _Node* __first = _M_buckets[__n]; local
885 _Node* __first = _M_buckets[__n]; local
1035 _Node* __first = _M_buckets[__bucket]; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| forward_list.h | 491 * @param __first An input iterator.
496 * [@a __first,@a __last). This is linear in N (where N is
497 * distance(@a __first,@a __last)).
501 forward_list(_InputIterator __first, _InputIterator __last,
504 { _M_range_initialize(__first, __last); }
596 * @param __first An input iterator.
600 * in the range [@a __first,@a __last).
609 assign(_InputIterator __first, _InputIterator __last)
611 typedef is_assignable<_Tp, decltype(*__first)> __assignable;
612 _M_assign(__first, __last, __assignable())
1298 insert_after(cbefore_begin(), __first, __last); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/backward/ |
| hashtable.h | 240 const unsigned long* __first = _Hashtable_prime_list<unsigned long>::_S_get_prime_list(); local
241 const unsigned long* __last = __first + (int)_S_num_primes;
242 const unsigned long* pos = std::lower_bound(__first, __last, __n);
525 _Node* __first; local
526 for (__first = _M_buckets[__n];
527 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
528 __first = __first->_M_next)
530 return iterator(__first, this)
537 const _Node* __first; local
765 _Node* __first = _M_buckets[__n]; local
784 _Node* __first = _M_buckets[__n]; local
811 _Node* __first = _M_buckets[__n]; local
885 _Node* __first = _M_buckets[__n]; local
1035 _Node* __first = _M_buckets[__bucket]; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| forward_list.h | 491 * @param __first An input iterator.
496 * [@a __first,@a __last). This is linear in N (where N is
497 * distance(@a __first,@a __last)).
501 forward_list(_InputIterator __first, _InputIterator __last,
504 { _M_range_initialize(__first, __last); }
596 * @param __first An input iterator.
600 * in the range [@a __first,@a __last).
609 assign(_InputIterator __first, _InputIterator __last)
611 typedef is_assignable<_Tp, decltype(*__first)> __assignable;
612 _M_assign(__first, __last, __assignable())
1298 insert_after(cbefore_begin(), __first, __last); local
[all...] |
