Home
last modified time | relevance | path

Searched refs:__last (Results 1 – 25 of 32) sorted by relevance

12

/external/libcxx/include/
Dalgorithm837 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
839 for (; __first != __last; ++__first)
850 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
852 for (; __first != __last; ++__first)
863 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
865 for (; __first != __last; ++__first)
876 for_each(_InputIterator __first, _InputIterator __last, _Function __f)
878 for (; __first != __last; ++__first)
888 find(_InputIterator __first, _InputIterator __last, const _Tp& __value_)
890 for (; __first != __last; ++__first)
[all …]
Dregex2543 basic_regex(_ForwardIterator __first, _ForwardIterator __last,
2547 {__parse(__first, __last);}
2603 assign(_InputIterator __first, _InputIterator __last,
2606 basic_string<_CharT> __t(__first, __last);
2629 assign(_ForwardIterator __first, _ForwardIterator __last,
2632 return assign(basic_regex(__first, __last, __f));
2670 __parse(_ForwardIterator __first, _ForwardIterator __last);
2673 __parse_basic_reg_exp(_ForwardIterator __first, _ForwardIterator __last);
2676 __parse_RE_expression(_ForwardIterator __first, _ForwardIterator __last);
2679 __parse_simple_RE(_ForwardIterator __first, _ForwardIterator __last);
[all …]
Dnumeric79 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
81 for (; __first != __last; ++__first)
89 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op)
91 for (; __first != __last; ++__first)
120 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
122 if (__first != __last)
126 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
138 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result,
141 if (__first != __last)
145 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
[all …]
D__bit_reference231 find(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, const _Tp& __valu…
234 return __find_bool_true(__first, static_cast<typename _Cp::size_type>(__last - __first));
235 return __find_bool_false(__first, static_cast<typename _Cp::size_type>(__last - __first));
305 count(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, const _Tp& __val…
308 return __count_bool_true(__first, static_cast<typename _Cp::size_type>(__last - __first));
309 return __count_bool_false(__first, static_cast<typename _Cp::size_type>(__last - __first));
393 fill(__bit_iterator<_Cp, false> __first, __bit_iterator<_Cp, false> __last, bool __value_)
395 _VSTD::fill_n(__first, static_cast<typename _Cp::size_type>(__last - __first), __value_);
402 __copy_aligned(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last,
409 difference_type __n = __last - __first;
[all …]
Dvector507 _InputIterator>::type __last);
509 vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a,
521 _ForwardIterator>::type __last);
523 vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a,
576 assign(_InputIterator __first, _InputIterator __last);
586 assign(_ForwardIterator __first, _ForwardIterator __last);
711 insert(const_iterator __position, _InputIterator __first, _InputIterator __last);
721 insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last);
729 iterator erase(const_iterator __first, const_iterator __last);
777 __construct_at_end(_ForwardIterator __first, _ForwardIterator __last, size_type __n);
[all …]
Dunordered_set387 unordered_set(_InputIterator __first, _InputIterator __last);
389 unordered_set(_InputIterator __first, _InputIterator __last,
393 unordered_set(_InputIterator __first, _InputIterator __last,
399 unordered_set(_InputIterator __first, _InputIterator __last,
401 : unordered_set(__first, __last, __n, hasher(), key_equal(), __a) {}
403 unordered_set(_InputIterator __first, _InputIterator __last,
405 : unordered_set(__first, __last, __n, __hf, key_equal(), __a) {}
535 void insert(_InputIterator __first, _InputIterator __last);
547 iterator erase(const_iterator __first, const_iterator __last)
548 {return __table_.erase(__first, __last);}
[all …]
Dunordered_map808 unordered_map(_InputIterator __first, _InputIterator __last);
810 unordered_map(_InputIterator __first, _InputIterator __last,
814 unordered_map(_InputIterator __first, _InputIterator __last,
845 …unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& …
846 : unordered_map(__first, __last, __n, hasher(), key_equal(), __a) {}
849 … unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf,
851 : unordered_map(__first, __last, __n, __hf, key_equal(), __a) {}
929 void insert(_InputIterator __first, _InputIterator __last);
1090 iterator erase(const_iterator __first, const_iterator __last)
1091 {return __table_.erase(__first.__i_, __last.__i_);}
[all …]
D__split_buffer123 __construct_at_end(_InputIter __first, _InputIter __last);
130 __construct_at_end(_ForwardIterator __first, _ForwardIterator __last);
236 __split_buffer<_Tp, _Allocator>::__construct_at_end(_InputIter __first, _InputIter __last)
239 for (; __first != __last; ++__first)
263 …plit_buffer<_Tp, _Allocator>::__construct_at_end(_ForwardIterator __first, _ForwardIterator __last)
266 for (; __first != __last; ++__first)
Dstring805 basic_string(_InputIterator __first, _InputIterator __last);
808 basic_string(_InputIterator __first, _InputIterator __last, const allocator_type& __a);
953 append(_InputIterator __first, _InputIterator __last) {
954 const basic_string __temp (__first, __last, __alloc());
967 append(_ForwardIterator __first, _ForwardIterator __last) {
968 return __append_forward_unsafe(__first, __last);
1014 assign(_InputIterator __first, _InputIterator __last);
1023 assign(_ForwardIterator __first, _ForwardIterator __last);
1056 insert(const_iterator __pos, _InputIterator __first, _InputIterator __last);
1065 insert(const_iterator __pos, _ForwardIterator __first, _ForwardIterator __last);
[all …]
Dforward_list1232 __node_pointer __last = __first;
1237 for (--__n; __n != 0; --__n, __last = __last->__next_)
1241 __last->__next_ = __h.release();
1257 __last->__next_ = __r->__next_;
1259 __r = static_cast<__begin_node_pointer>(__last);
1282 __node_pointer __last = __first;
1287 for (++__f; __f != __l; ++__f, ((void)(__last = __last->__next_)))
1291 __last->__next_ = __h.release();
1307 __last->__next_ = __r->__next_;
1309 __r = static_cast<__begin_node_pointer>(__last);
D__hash_table1044 void __assign_unique(_InputIterator __first, _InputIterator __last);
1046 void __assign_multi(_InputIterator __first, _InputIterator __last);
1199 iterator erase(const_iterator __first, const_iterator __last);
1686 _InputIterator __last)
1700 for (; __cache != nullptr && __first != __last; ++__first)
1717 for (; __first != __last; ++__first)
1725 _InputIterator __last)
1740 for (; __cache != nullptr && __first != __last; ++__first)
1757 for (; __first != __last; ++__first)
2369 const_iterator __last)
[all …]
Diomanip519 _ForwardIterator __first, _ForwardIterator __last, _CharT __delim, _CharT __escape )
523 for ( ; __first != __last; ++ __first )
576 … return __quoted_output (__os, __proxy.__first, __proxy.__last, __proxy.__delim, __proxy.__escape);
Diterator572 __distance(_InputIter __first, _InputIter __last, input_iterator_tag)
575 for (; __first != __last; ++__first)
583 __distance(_RandIter __first, _RandIter __last, random_access_iterator_tag)
585 return __last - __first;
591 distance(_InputIter __first, _InputIter __last)
593 return __distance(__first, __last, typename iterator_traits<_InputIter>::iterator_category());
/external/libcxx/include/ext/
Dhash_set248 hash_set(_InputIterator __first, _InputIterator __last);
250 hash_set(_InputIterator __first, _InputIterator __last,
254 hash_set(_InputIterator __first, _InputIterator __last,
286 void insert(_InputIterator __first, _InputIterator __last);
293 void erase(const_iterator __first, const_iterator __last)
294 {__table_.erase(__first, __last);}
350 _InputIterator __first, _InputIterator __last)
353 insert(__first, __last);
359 _InputIterator __first, _InputIterator __last, size_type __n,
364 insert(__first, __last);
[all …]
Dhash_map514 hash_map(_InputIterator __first, _InputIterator __last);
516 hash_map(_InputIterator __first, _InputIterator __last,
520 hash_map(_InputIterator __first, _InputIterator __last,
553 void insert(_InputIterator __first, _InputIterator __last);
560 void erase(const_iterator __first, const_iterator __last)
561 {__table_.erase(__first.__i_, __last.__i_);}
626 _InputIterator __first, _InputIterator __last)
629 insert(__first, __last);
635 _InputIterator __first, _InputIterator __last, size_type __n,
640 insert(__first, __last);
[all …]
/external/clang/test/Analysis/Inputs/
Dsystem-header-simulator-cxx.h178 >::type __copy(_Tp* __first, _Tp* __last, _Up* __result) {
179 size_t __n = __last - __first;
195 __copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last,
198 while (__first != __last)
199 *--__result = *--__last;
210 >::type __copy_backward(_Tp* __first, _Tp* __last, _Up* __result) {
211 size_t __n = __last - __first;
/external/llvm/test/Transforms/SLPVectorizer/X86/
Dcrash_dequeue.ll8 ….731"* %__first, %"struct.std::_Deque_iterator.4.157.174.208.259.276.344.731"* nocapture %__last) {
13 …9.276.344.731", %"struct.std::_Deque_iterator.4.157.174.208.259.276.344.731"* %__last, i64 0, i32 0
15 …9.276.344.731", %"struct.std::_Deque_iterator.4.157.174.208.259.276.344.731"* %__last, i64 0, i32 1
/external/libcxx/include/experimental/
Dalgorithm62 _SampleIterator sample(_PopulationIterator __first, _PopulationIterator __last,
65 return _VSTD::__sample(__first, __last, __output, __n, __g);
Dfunctional272 const _RandomAccessIterator2 __last = __l - __pattern_length_;
276 while (__cur <= __last)
423 const _RandomAccessIterator2 __last = __l - __pattern_length_;
426 while (__cur <= __last)
Dfilesystem696 path(_InputIt __first, _InputIt __last) {
698 _PathCVT<_ItVal>::__append_range(__pn_, __first, __last);
754 path& assign(_InputIt __first, _InputIt __last) {
757 _PathCVT<_ItVal>::__append_range(__pn_, __first, __last);
801 path& append(_InputIt __first, _InputIt __last) {
805 if (__first != __last) {
807 _CVT::__append_range(__pn_, __first, __last);
867 path& concat(_InputIt __first, _InputIt __last) {
869 _PathCVT<_ItVal>::__append_range(__pn_, __first, __last);
/external/llvm/test/Transforms/LoopRotate/
Dnosimplifylatch.ll9 …__14findINS_11__wrap_iterIPiEEiEET_S4_S4_RKT0_(i64 %__first.coerce, i64 %__last.coerce, i32* nocap…
12 %coerce.val.ip2 = inttoptr i64 %__last.coerce to i32*
/external/clang/test/CodeGenCXX/
D2007-09-10-RecursiveTypeResolution.cpp33 typename _Tp > inline void find (_InputIterator __last, in find() argument
/external/llvm/test/CodeGen/X86/
D2010-03-05-ConstantFoldCFG.ll9 …sort_loopIPdl17less_than_functorEvT_S2_T0_T1_(double* %__first, double* %__last, i64 %__depth_limi…
/external/swiftshader/third_party/LLVM/test/CodeGen/X86/
D2010-03-05-ConstantFoldCFG.ll9 …sort_loopIPdl17less_than_functorEvT_S2_T0_T1_(double* %__first, double* %__last, i64 %__depth_limi…
/external/clang/www/
Dlibstdc++4.4-clang0x.patch197 + iterator __last)
198 + { splice(__position, std::move(__x), __first, __last); }
486 return std::__is_heap(__first, __comp, __last - __first);

12