| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _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/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/backward/ |
| hashtable.h | 224 const unsigned long* __first = __stl_prime_list; local
226 const unsigned long* pos = std::lower_bound(__first, __last, __n);
507 _Node* __first; local
508 for (__first = _M_buckets[__n];
509 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
510 __first = __first->_M_next)
512 return iterator(__first, this);
519 const _Node* __first; local
747 _Node* __first = _M_buckets[__n]; local
766 _Node* __first = _M_buckets[__n]; local
793 _Node* __first = _M_buckets[__n]; local
867 _Node* __first = _M_buckets[__n]; local
1016 _Node* __first = _M_buckets[__bucket]; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| forward_list.h | 486 forward_list(_InputIterator __first, _InputIterator __last,
492 _M_initialize_dispatch(__first, __last, _Integral());
598 assign(_InputIterator __first, _InputIterator __last)
601 insert_after(cbefore_begin(), __first, __last); local
897 _InputIterator __first, _InputIterator __last)
899 forward_list __tmp(__first, __last, this->get_allocator());
[all...] |
| stl_bvector.h | 354 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
356 for (; __first != __last; ++__first)
357 *__first = __x;
361 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
363 if (__first._M_p != __last._M_p)
365 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
366 __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x);
370 __fill_bvector(__first, __last, __x)
942 insert(end(), __first, __last); local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/backward/ |
| hashtable.h | 242 const unsigned long* __first = _Hashtable_prime_list<unsigned long>::_S_get_prime_list(); local
243 const unsigned long* __last = __first + (int)_S_num_primes;
244 const unsigned long* pos = std::lower_bound(__first, __last, __n);
527 _Node* __first; local
528 for (__first = _M_buckets[__n];
529 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
530 __first = __first->_M_next)
532 return iterator(__first, this)
539 const _Node* __first; local
767 _Node* __first = _M_buckets[__n]; local
786 _Node* __first = _M_buckets[__n]; local
813 _Node* __first = _M_buckets[__n]; local
887 _Node* __first = _M_buckets[__n]; local
1036 _Node* __first = _M_buckets[__bucket]; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| forward_list.h | 496 forward_list(_InputIterator __first, _InputIterator __last,
502 _M_initialize_dispatch(__first, __last, _Integral());
607 assign(_InputIterator __first, _InputIterator __last)
610 insert_after(cbefore_begin(), __first, __last); local
904 _InputIterator __first, _InputIterator __last);
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/backward/ |
| hashtable.h | 241 const unsigned long* __first = _Hashtable_prime_list<unsigned long>::_S_get_prime_list(); local
242 const unsigned long* __last = __first + (int)_S_num_primes;
243 const unsigned long* pos = std::lower_bound(__first, __last, __n);
526 _Node* __first; local
527 for (__first = _M_buckets[__n];
528 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
529 __first = __first->_M_next)
531 return iterator(__first, this)
538 const _Node* __first; local
766 _Node* __first = _M_buckets[__n]; local
785 _Node* __first = _M_buckets[__n]; local
812 _Node* __first = _M_buckets[__n]; local
886 _Node* __first = _M_buckets[__n]; local
1036 _Node* __first = _M_buckets[__bucket]; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_tree.h | 745 _M_insert_unique(_InputIterator __first, _InputIterator __last);
749 _M_insert_equal(_InputIterator __first, _InputIterator __last);
756 _M_erase_aux(const_iterator __first, const_iterator __last);
796 erase(const_iterator __first, const_iterator __last)
798 _M_erase_aux(__first, __last);
803 erase(iterator __first, iterator __last)
804 { _M_erase_aux(__first, __last); }
807 erase(const_iterator __first, const_iterator __last)
808 { _M_erase_aux(__first, __last); }
811 erase(const key_type* __first, const key_type* __last)
1474 _M_insert_unique_(end(), *__first); local
1485 _M_insert_equal_(end(), *__first); local
[all...] |