HomeSort by relevance Sort by last modified time
    Searched defs:__last (Results 101 - 125 of 153) sorted by null

1 2 3 45 6 7

  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_bvector.h 354 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
356 for (; __first != __last; ++__first)
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);
367 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local
370 __fill_bvector(__first, __last, __x);
539 vector(_InputIterator __first, _InputIterator __last,
544 _M_initialize_dispatch(__first, __last, _Integral())
946 insert(end(), __first, __last); local
962 insert(end(), __mid, __last); local
    [all...]
  /prebuilts/ndk/6/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) {
636 iterator __last = end(); 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());
320 void _M_assign_aux(_ForwardIter __first, _ForwardIter __last, const forward_iterator_tag &)
355 insert(end(), __first, __last); local
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/backward/
hashtable.h 225 const unsigned long* __last = __stl_prime_list + (int)_S_num_primes; local
226 const unsigned long* pos = std::lower_bound(__first, __last, __n);
227 return pos == __last ? *(__last - 1) : *pos;
553 erase(iterator __first, iterator __last);
559 erase(const_iterator __first, const_iterator __last);
622 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
625 _M_erase_bucket(const size_type __n, _Node* __last);
960 erase(iterator __first, iterator __last)
965 size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/
forward_list.h 362 typename _Node_base::_Pointer __last);
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());
969 erase_after(const_iterator __pos, iterator __last)
972 return iterator(this->_M_erase_after(__tmp, &*__last._M_node));
    [all...]
stl_bvector.h 354 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
356 for (; __first != __last; ++__first)
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);
367 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local
370 __fill_bvector(__first, __last, __x);
539 vector(_InputIterator __first, _InputIterator __last,
544 _M_initialize_dispatch(__first, __last, _Integral())
946 insert(end(), __first, __last); local
962 insert(end(), __mid, __last); local
    [all...]
  /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) {
636 iterator __last = end(); 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());
320 void _M_assign_aux(_ForwardIter __first, _ForwardIter __last, const forward_iterator_tag &)
355 insert(end(), __first, __last); local
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/backward/
hashtable.h 225 const unsigned long* __last = __stl_prime_list + (int)_S_num_primes; local
226 const unsigned long* pos = std::lower_bound(__first, __last, __n);
227 return pos == __last ? *(__last - 1) : *pos;
553 erase(iterator __first, iterator __last);
559 erase(const_iterator __first, const_iterator __last);
622 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
625 _M_erase_bucket(const size_type __n, _Node* __last);
960 erase(iterator __first, iterator __last)
965 size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/
forward_list.h 362 typename _Node_base::_Pointer __last);
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());
969 erase_after(const_iterator __pos, iterator __last)
972 return iterator(this->_M_erase_after(__tmp, &*__last._M_node));
    [all...]
stl_bvector.h 354 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
356 for (; __first != __last; ++__first)
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);
367 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local
370 __fill_bvector(__first, __last, __x);
539 vector(_InputIterator __first, _InputIterator __last,
544 _M_initialize_dispatch(__first, __last, _Integral())
942 insert(end(), __first, __last); local
958 insert(end(), __mid, __last); local
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/backward/
hashtable.h 243 const unsigned long* __last = __first + (int)_S_num_primes; local
244 const unsigned long* pos = std::lower_bound(__first, __last, __n);
245 return pos == __last ? *(__last - 1) : *pos;
573 erase(iterator __first, iterator __last);
579 erase(const_iterator __first, const_iterator __last);
642 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
645 _M_erase_bucket(const size_type __n, _Node* __last);
980 erase(iterator __first, iterator __last)
985 size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
forward_list.h 373 _Fwd_list_node_base* __last);
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);
965 erase_after(const_iterator __pos, const_iterator __last)
969 (__last._M_node))); }
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/backward/
hashtable.h 242 const unsigned long* __last = __first + (int)_S_num_primes; local
243 const unsigned long* pos = std::lower_bound(__first, __last, __n);
244 return pos == __last ? *(__last - 1) : *pos;
572 erase(iterator __first, iterator __last);
578 erase(const_iterator __first, const_iterator __last);
641 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
644 _M_erase_bucket(const size_type __n, _Node* __last);
980 erase(iterator __first, iterator __last)
985 size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_deque.h 372 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
375 _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),
387 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
392 const _Tp&, const _Tp*>(__last),
405 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
408 _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),
420 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
425 const _Tp&, const _Tp*>(__last),
879 * @param __last An input iterator.
883 * __last)
1701 insert(end(), __mid, __last); local
    [all...]
  /prebuilts/ndk/8/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) {
636 iterator __last = end(); 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());
320 void _M_assign_aux(_ForwardIter __first, _ForwardIter __last, const forward_iterator_tag &)
355 insert(end(), __first, __last); local
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/EH/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) {
636 iterator __last = end(); 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());
320 void _M_assign_aux(_ForwardIter __first, _ForwardIter __last, const forward_iterator_tag &)
355 insert(end(), __first, __last); local
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/backward/
hashtable.h 243 const unsigned long* __last = __first + (int)_S_num_primes; local
244 const unsigned long* pos = std::lower_bound(__first, __last, __n);
245 return pos == __last ? *(__last - 1) : *pos;
573 erase(iterator __first, iterator __last);
579 erase(const_iterator __first, const_iterator __last);
642 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
645 _M_erase_bucket(const size_type __n, _Node* __last);
980 erase(iterator __first, iterator __last)
985 size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
forward_list.h 373 _Fwd_list_node_base* __last);
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);
965 erase_after(const_iterator __pos, const_iterator __last)
969 (__last._M_node))); }
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/backward/
hashtable.h 242 const unsigned long* __last = __first + (int)_S_num_primes; local
243 const unsigned long* pos = std::lower_bound(__first, __last, __n);
244 return pos == __last ? *(__last - 1) : *pos;
572 erase(iterator __first, iterator __last);
578 erase(const_iterator __first, const_iterator __last);
641 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
644 _M_erase_bucket(const size_type __n, _Node* __last);
980 erase(iterator __first, iterator __last)
985 size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_deque.h 372 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
375 _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),
387 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
392 const _Tp&, const _Tp*>(__last),
405 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
408 _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),
420 _Deque_iterator<_Tp, _Tp&, _Tp*> __last,
425 const _Tp&, const _Tp*>(__last),
879 * @param __last An input iterator.
883 * __last)
1701 insert(end(), __mid, __last); local
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/backward/
hashtable.h 241 const unsigned long* __last = __first + (int)_S_num_primes; local
242 const unsigned long* pos = std::lower_bound(__first, __last, __n);
243 return pos == __last ? *(__last - 1) : *pos;
571 erase(iterator __first, iterator __last);
577 erase(const_iterator __first, const_iterator __last);
640 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
643 _M_erase_bucket(const size_type __n, _Node* __last);
979 erase(iterator __first, iterator __last)
984 size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/
forward_list.h 378 _Fwd_list_node_base* __last);
492 * @param __last 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); }
597 * @param __last An input iterator.
600 * in the range [@a __first,@a __last).
609 assign(_InputIterator __first, _InputIterator __last)
612 _M_assign(__first, __last, __assignable())
1298 insert_after(cbefore_begin(), __first, __last); local
    [all...]

Completed in 567 milliseconds

1 2 3 45 6 7