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

<<11121314151617181920>>

  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/
list.tcc 242 iterator __first = begin();
245 while (__first != __last)
247 iterator __next = __first;
249 if (*__first == __value)
254 if (std::__addressof(*__first) != std::__addressof(__value))
255 _M_erase(__first);
257 __extra = __first;
259 __first = __next;
270 iterator __first = begin();
272 if (__first == __last
    [all...]
stl_bvector.h 356 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
358 for (; __first != __last; ++__first)
359 *__first = __x;
363 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
365 if (__first._M_p != __last._M_p)
367 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
368 __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x);
372 __fill_bvector(__first, __last, __x)
959 insert(end(), __first, __last); local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
list.tcc 241 iterator __first = begin();
244 while (__first != __last)
246 iterator __next = __first;
248 if (*__first == __value)
253 if (std::__addressof(*__first) != std::__addressof(__value))
254 _M_erase(__first);
256 __extra = __first;
258 __first = __next;
269 iterator __first = begin();
271 if (__first == __last
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
list.tcc 241 iterator __first = begin();
244 while (__first != __last)
246 iterator __next = __first;
248 if (*__first == __value)
253 if (std::__addressof(*__first) != std::__addressof(__value))
254 _M_erase(__first);
256 __extra = __first;
258 __first = __next;
269 iterator __first = begin();
271 if (__first == __last
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/
list.tcc 189 iterator __first = begin();
192 while (__first != __last)
194 iterator __next = __first;
196 if (*__first == __value)
201 if (&*__first != &__value)
202 _M_erase(__first);
204 __extra = __first;
206 __first = __next;
217 iterator __first = begin();
219 if (__first == __last
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
list.tcc 189 iterator __first = begin();
192 while (__first != __last)
194 iterator __next = __first;
196 if (*__first == __value)
201 if (&*__first != &__value)
202 _M_erase(__first);
204 __extra = __first;
206 __first = __next;
217 iterator __first = begin();
219 if (__first == __last
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/
list.tcc 189 iterator __first = begin();
192 while (__first != __last)
194 iterator __next = __first;
196 if (*__first == __value)
201 if (&*__first != &__value)
202 _M_erase(__first);
204 __extra = __first;
206 __first = __next;
217 iterator __first = begin();
219 if (__first == __last
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/
list.tcc 189 iterator __first = begin();
192 while (__first != __last)
194 iterator __next = __first;
196 if (*__first == __value)
201 if (&*__first != &__value)
202 _M_erase(__first);
204 __extra = __first;
206 __first = __next;
217 iterator __first = begin();
219 if (__first == __last
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
list.tcc 242 iterator __first = begin();
245 while (__first != __last)
247 iterator __next = __first;
249 if (*__first == __value)
254 if (std::__addressof(*__first) != std::__addressof(__value))
255 _M_erase(__first);
257 __extra = __first;
259 __first = __next;
270 iterator __first = begin();
272 if (__first == __last
    [all...]
stl_bvector.h 356 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
358 for (; __first != __last; ++__first)
359 *__first = __x;
363 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
365 if (__first._M_p != __last._M_p)
367 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
368 __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x);
372 __fill_bvector(__first, __last, __x)
959 insert(end(), __first, __last); local
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
list.tcc 242 iterator __first = begin();
245 while (__first != __last)
247 iterator __next = __first;
249 if (*__first == __value)
254 if (std::__addressof(*__first) != std::__addressof(__value))
255 _M_erase(__first);
257 __extra = __first;
259 __first = __next;
270 iterator __first = begin();
272 if (__first == __last
    [all...]
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...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
list.tcc 242 iterator __first = begin();
245 while (__first != __last)
247 iterator __next = __first;
249 if (*__first == __value)
254 if (std::__addressof(*__first) != std::__addressof(__value))
255 _M_erase(__first);
257 __extra = __first;
259 __first = __next;
270 iterator __first = begin();
272 if (__first == __last
    [all...]
stl_bvector.h 356 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
358 for (; __first != __last; ++__first)
359 *__first = __x;
363 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
365 if (__first._M_p != __last._M_p)
367 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
368 __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x);
372 __fill_bvector(__first, __last, __x)
959 insert(end(), __first, __last); local
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
list.tcc 242 iterator __first = begin();
245 while (__first != __last)
247 iterator __next = __first;
249 if (*__first == __value)
254 if (std::__addressof(*__first) != std::__addressof(__value))
255 _M_erase(__first);
257 __extra = __first;
259 __first = __next;
270 iterator __first = begin();
272 if (__first == __last
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/
list.tcc 241 iterator __first = begin();
244 while (__first != __last)
246 iterator __next = __first;
248 if (*__first == __value)
253 if (std::__addressof(*__first) != std::__addressof(__value))
254 _M_erase(__first);
256 __extra = __first;
258 __first = __next;
269 iterator __first = begin();
271 if (__first == __last
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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/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-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/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.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/9/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/9/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/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/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...]

Completed in 3529 milliseconds

<<11121314151617181920>>