HomeSort by relevance Sort by last modified time
    Searched full:__first (Results 351 - 375 of 1386) sorted by null

<<11121314151617181920>>

  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_bvector.h 358 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
360 for (; __first != __last; ++__first)
361 *__first = __x;
365 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
367 if (__first._M_p != __last._M_p)
369 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
370 __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x);
374 __fill_bvector(__first, __last, __x)
    [all...]
deque.tcc 219 erase(iterator __first, iterator __last)
221 if (__first == __last)
222 return __first;
223 else if (__first == begin() && __last == end())
230 const difference_type __n = __last - __first;
231 const difference_type __elems_before = __first - begin();
234 if (__first != begin())
235 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);
241 _GLIBCXX_MOVE3(__last, end(), __first);
252 _M_assign_aux(_InputIterator __first, _InputIterator __last
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/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/6/sources/cxx-stl/gnu-libstdc++/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/7/sources/cxx-stl/gnu-libstdc++/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/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/5/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)
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)
946 insert(end(), __first, __last); local
    [all...]
  /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)
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)
946 insert(end(), __first, __last); local
    [all...]
  /prebuilts/ndk/7/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)
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)
946 insert(end(), __first, __last); local
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/
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/9/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/
stl_algobase.h 303 __copy_m(_II __first, _II __last, _OI __result)
305 for (; __first != __last; ++__result, ++__first)
306 *__result = *__first;
317 __copy_m(_II __first, _II __last, _OI __result)
319 for (; __first != __last; ++__result, ++__first)
320 *__result = std::move(*__first);
331 __copy_m(_II __first, _II __last, _OI __result)
334 for(_Distance __n = __last - __first; __n > 0; --__n
    [all...]
deque.tcc 222 _M_erase(iterator __first, iterator __last)
224 if (__first == __last)
225 return __first;
226 else if (__first == begin() && __last == end())
233 const difference_type __n = __last - __first;
234 const difference_type __elems_before = __first - begin();
237 if (__first != begin())
238 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);
244 _GLIBCXX_MOVE3(__last, end(), __first);
255 _M_assign_aux(_InputIterator __first, _InputIterator __last
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
deque.tcc 217 erase(iterator __first, iterator __last)
219 if (__first == __last)
220 return __first;
221 else if (__first == begin() && __last == end())
228 const difference_type __n = __last - __first;
229 const difference_type __elems_before = __first - begin();
232 if (__first != begin())
233 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);
239 _GLIBCXX_MOVE3(__last, end(), __first);
250 _M_assign_aux(_InputIterator __first, _InputIterator __last
    [all...]
stl_algobase.h 302 __copy_m(_II __first, _II __last, _OI __result)
304 for (; __first != __last; ++__result, ++__first)
305 *__result = *__first;
316 __copy_m(_II __first, _II __last, _OI __result)
318 for (; __first != __last; ++__result, ++__first)
319 *__result = std::move(*__first);
330 __copy_m(_II __first, _II __last, _OI __result)
333 for(_Distance __n = __last - __first; __n > 0; --__n
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
deque.tcc 217 erase(iterator __first, iterator __last)
219 if (__first == __last)
220 return __first;
221 else if (__first == begin() && __last == end())
228 const difference_type __n = __last - __first;
229 const difference_type __elems_before = __first - begin();
232 if (__first != begin())
233 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);
239 _GLIBCXX_MOVE3(__last, end(), __first);
250 _M_assign_aux(_InputIterator __first, _InputIterator __last
    [all...]
stl_algobase.h 302 __copy_m(_II __first, _II __last, _OI __result)
304 for (; __first != __last; ++__result, ++__first)
305 *__result = *__first;
316 __copy_m(_II __first, _II __last, _OI __result)
318 for (; __first != __last; ++__result, ++__first)
319 *__result = std::move(*__first);
330 __copy_m(_II __first, _II __last, _OI __result)
333 for(_Distance __n = __last - __first; __n > 0; --__n
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/
deque.tcc 217 erase(iterator __first, iterator __last)
219 if (__first == __last)
220 return __first;
221 else if (__first == begin() && __last == end())
228 const difference_type __n = __last - __first;
229 const difference_type __elems_before = __first - begin();
232 if (__first != begin())
233 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);
239 _GLIBCXX_MOVE3(__last, end(), __first);
250 _M_assign_aux(_InputIterator __first, _InputIterator __last
    [all...]
stl_algobase.h 302 __copy_m(_II __first, _II __last, _OI __result)
304 for (; __first != __last; ++__result, ++__first)
305 *__result = *__first;
316 __copy_m(_II __first, _II __last, _OI __result)
318 for (; __first != __last; ++__result, ++__first)
319 *__result = std::move(*__first);
330 __copy_m(_II __first, _II __last, _OI __result)
333 for(_Distance __n = __last - __first; __n > 0; --__n
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/
deque.tcc 219 erase(iterator __first, iterator __last)
221 if (__first == __last)
222 return __first;
223 else if (__first == begin() && __last == end())
230 const difference_type __n = __last - __first;
231 const difference_type __elems_before = __first - begin();
234 if (__first != begin())
235 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);
241 _GLIBCXX_MOVE3(__last, end(), __first);
252 _M_assign_aux(_InputIterator __first, _InputIterator __last
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
deque.tcc 219 erase(iterator __first, iterator __last)
221 if (__first == __last)
222 return __first;
223 else if (__first == begin() && __last == end())
230 const difference_type __n = __last - __first;
231 const difference_type __elems_before = __first - begin();
234 if (__first != begin())
235 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);
241 _GLIBCXX_MOVE3(__last, end(), __first);
252 _M_assign_aux(_InputIterator __first, _InputIterator __last
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
deque.tcc 219 erase(iterator __first, iterator __last)
221 if (__first == __last)
222 return __first;
223 else if (__first == begin() && __last == end())
230 const difference_type __n = __last - __first;
231 const difference_type __elems_before = __first - begin();
234 if (__first != begin())
235 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);
241 _GLIBCXX_MOVE3(__last, end(), __first);
252 _M_assign_aux(_InputIterator __first, _InputIterator __last
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
deque.tcc 219 erase(iterator __first, iterator __last)
221 if (__first == __last)
222 return __first;
223 else if (__first == begin() && __last == end())
230 const difference_type __n = __last - __first;
231 const difference_type __elems_before = __first - begin();
234 if (__first != begin())
235 _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);
241 _GLIBCXX_MOVE3(__last, end(), __first);
252 _M_assign_aux(_InputIterator __first, _InputIterator __last
    [all...]
  /external/stlport/stlport/stl/
_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...]
_string.h 456 _Self& _M_append(const _CharT* __first, const _CharT* __last);
460 _Self& _M_appendT(_InputIter __first, _InputIter __last,
462 for ( ; __first != __last ; ++__first)
463 push_back(*__first);
468 _Self& _M_appendT(_ForwardIter __first, _ForwardIter __last,
470 if (__first != __last) {
471 size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last));
476 __new_finish = uninitialized_copy(__first, __last, __new_finish);
482 _Traits::assign(*this->_M_finish, *__first++)
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_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...]

Completed in 512 milliseconds

<<11121314151617181920>>