HomeSort by relevance Sort by last modified time
    Searched defs:__current (Results 1 - 20 of 20) sorted by null

  /ndk/sources/cxx-stl/stlport/stlport/stl/
_iterator_old.h 163 _RandomAccessIterator __current; member in class:reverse_iterator
176 reverse_iterator(const _Self& __x) : __current(__x.base()) {}
177 explicit reverse_iterator(_RandomAccessIterator __x) : __current(__x) {}
178 _Self& operator=(const _Self& __x) {__current = __x.base(); return *this; }
180 _RandomAccessIterator base() const { return __current; }
181 _Reference operator*() const { return *(__current - (difference_type)1); }
186 --__current;
191 --__current;
195 ++__current;
200 ++__current;
    [all...]
_algobase.c 256 _ForwardIter1 __current = __first1; local
257 if (++__current == __last1) return __last1;
259 while (__pred(*__current, *__p)) {
262 if (++__current == __last1)
_algo.c 134 _ForwardIter1 __current = __first1; local
135 if (++__current == __last1)
138 while (*__current == *__p) {
141 if (++__current == __last1)
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/
balanced_quicksort.h 267 _Piece __current = __tl._M_initial; local
276 // Invariant: __current must be a valid (maybe empty) range.
277 _RAIter __begin = __current.first, __end = __current.second;
342 //__current.first = __begin; //already set anyway
343 __current.second = __split_pos1;
353 __current.first = __split_pos2;
354 //__current.second = __end; //already set anyway
367 if (__tl._M_leftover_parts.pop_front(__current))
394 && __tls[__victim]->_M_leftover_parts.pop_back(__current);
    [all...]
workstealing.h 198 _RAIter __current; local
227 __current = __begin + __current_job;
231 __result = __r(__result, __f(__op, __current));
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/
balanced_quicksort.h 267 _Piece __current = __tl._M_initial; local
276 // Invariant: __current must be a valid (maybe empty) range.
277 _RAIter __begin = __current.first, __end = __current.second;
342 //__current.first = __begin; //already set anyway
343 __current.second = __split_pos1;
353 __current.first = __split_pos2;
354 //__current.second = __end; //already set anyway
367 if (__tl._M_leftover_parts.pop_front(__current))
394 && __tls[__victim]->_M_leftover_parts.pop_back(__current);
    [all...]
workstealing.h 198 _RAIter __current; local
227 __current = __begin + __current_job;
231 __result = __r(__result, __f(__op, __current));
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/
balanced_quicksort.h 267 _Piece __current = __tl._M_initial; local
276 // Invariant: __current must be a valid (maybe empty) range.
277 _RAIter __begin = __current.first, __end = __current.second;
342 //__current.first = __begin; //already set anyway
343 __current.second = __split_pos1;
353 __current.first = __split_pos2;
354 //__current.second = __end; //already set anyway
367 if (__tl._M_leftover_parts.pop_front(__current))
394 && __tls[__victim]->_M_leftover_parts.pop_back(__current);
    [all...]
workstealing.h 198 _RAIter __current; local
227 __current = __begin + __current_job;
231 __result = __r(__result, __f(__op, __current));
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
balanced_quicksort.h 267 _Piece __current = __tl._M_initial; local
276 // Invariant: __current must be a valid (maybe empty) range.
277 _RAIter __begin = __current.first, __end = __current.second;
342 //__current.first = __begin; //already set anyway
343 __current.second = __split_pos1;
353 __current.first = __split_pos2;
354 //__current.second = __end; //already set anyway
367 if (__tl._M_leftover_parts.pop_front(__current))
394 && __tls[__victim]->_M_leftover_parts.pop_back(__current);
    [all...]
workstealing.h 198 _RAIter __current; local
227 __current = __begin + __current_job;
231 __result = __r(__result, __f(__op, __current));
  /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/
_iterator_old.h 163 _RandomAccessIterator __current; member in class:reverse_iterator
176 reverse_iterator(const _Self& __x) : __current(__x.base()) {}
177 explicit reverse_iterator(_RandomAccessIterator __x) : __current(__x) {}
178 _Self& operator=(const _Self& __x) {__current = __x.base(); return *this; }
180 _RandomAccessIterator base() const { return __current; }
181 _Reference operator*() const { return *(__current - (difference_type)1); }
186 --__current;
191 --__current;
195 ++__current;
200 ++__current;
    [all...]
_algobase.c 256 _ForwardIter1 __current = __first1; local
257 if (++__current == __last1) return __last1;
259 while (__pred(*__current, *__p)) {
262 if (++__current == __last1)
_algo.c 134 _ForwardIter1 __current = __first1; local
135 if (++__current == __last1)
138 while (*__current == *__p) {
141 if (++__current == __last1)
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
stl_algo.h 4712 _ForwardIterator1 __current = __first1; local
4790 _ForwardIterator1 __current = __first1; local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/
stl_algo.h 4712 _ForwardIterator1 __current = __first1; local
4790 _ForwardIterator1 __current = __first1; local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
stl_algo.h 4712 _ForwardIterator1 __current = __first1; local
4790 _ForwardIterator1 __current = __first1; local
    [all...]
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/
stl_algo.h 255 _ForwardIterator1 __current = __first1; local
267 __current = __first1;
268 if (++__current == __last1)
271 while (__predicate(__current, __p))
275 if (++__current == __last1)
    [all...]
  /external/guice/extensions/persist/lib/
oro-2.0.8.jar 
  /prebuilts/tools/common/m2/repository/oro/oro/2.0.8/
oro-2.0.8.jar 

Completed in 1361 milliseconds