Home
last modified time | relevance | path

Searched refs:__first (Results 1 – 25 of 37) sorted by relevance

12

/external/libcxx/include/
Dalgorithm837 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
839 for (; __first != __last; ++__first)
840 if (!__pred(*__first))
850 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
852 for (; __first != __last; ++__first)
853 if (__pred(*__first))
863 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
865 for (; __first != __last; ++__first)
866 if (__pred(*__first))
876 for_each(_InputIterator __first, _InputIterator __last, _Function __f)
[all …]
D__bit_reference155 __find_bool_true(__bit_iterator<_Cp, _IsConst> __first, typename _Cp::size_type __n)
161 if (__first.__ctz_ != 0)
163 __storage_type __clz_f = static_cast<__storage_type>(__bits_per_word - __first.__ctz_);
165 …__storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f - __…
166 __storage_type __b = *__first.__seg_ & __m;
168 return _It(__first.__seg_, static_cast<unsigned>(_VSTD::__ctz(__b)));
170 return __first + __n;
172 ++__first.__seg_;
175 for (; __n >= __bits_per_word; ++__first.__seg_, __n -= __bits_per_word)
176 if (*__first.__seg_)
[all …]
Dnumeric79 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
81 for (; __first != __last; ++__first)
82 __init = __init + *__first;
89 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op)
91 for (; __first != __last; ++__first)
92 __init = __binary_op(__init, *__first);
120 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
122 if (__first != __last)
124 typename iterator_traits<_InputIterator>::value_type __t(*__first);
126 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
[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 …]
Dvector501 vector(_InputIterator __first,
509 vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a,
516 vector(_ForwardIterator __first,
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)
251 __alloc_traits::construct(__a, _VSTD::__to_raw_pointer(this->__end_), *__first);
263 __split_buffer<_Tp, _Allocator>::__construct_at_end(_ForwardIterator __first, _ForwardIterator __la…
266 for (; __first != __last; ++__first)
268 __alloc_traits::construct(__a, _VSTD::__to_raw_pointer(this->__end_), *__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 …]
Diomanip519 _ForwardIterator __first, _ForwardIterator __last, _CharT __delim, _CharT __escape )
523 for ( ; __first != __last; ++ __first )
525 if (_Traits::eq (*__first, __escape) || _Traits::eq (*__first, __delim))
527 __str.push_back(*__first);
576 … return __quoted_output (__os, __proxy.__first, __proxy.__last, __proxy.__delim, __proxy.__escape);
Dforward_list1231 __node_pointer __first = __h.release();
1232 __node_pointer __last = __first;
1247 while (__first != nullptr)
1249 __node_pointer __next = __first->__next_;
1250 __node_traits::destroy(__a, _VSTD::addressof(__first->__value_));
1251 __node_traits::deallocate(__a, __first, 1);
1252 __first = __next;
1258 __r->__next_ = __first;
1281 __node_pointer __first = __h.release();
1282 __node_pointer __last = __first;
[all …]
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);
1685 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__assign_unique(_InputIterator __first,
1700 for (; __cache != nullptr && __first != __last; ++__first)
1702 __cache->__upcast()->__value_ = *__first;
1717 for (; __first != __last; ++__first)
1718 __insert_unique(*__first);
1724 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__assign_multi(_InputIterator __first,
1740 for (; __cache != nullptr && __first != __last; ++__first)
[all …]
/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;
182 memmove(__result, __first, __n * sizeof(_Up));
195 __copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last,
198 while (__first != __last)
210 >::type __copy_backward(_Tp* __first, _Tp* __last, _Up* __result) {
211 size_t __n = __last - __first;
216 memmove(__result, __first, __n * sizeof(_Up));
/external/libcxx/include/experimental/
Diterator78 : __output(_VSTD::addressof(__os)), __delim(_VSTD::move(__d)), __first(true) {}
81 : __output(_VSTD::addressof(__os)), __delim(__d), __first(true) {}
87 if (!__first)
89 __first = false;
101 bool __first;
Dalgorithm62 _SampleIterator sample(_PopulationIterator __first, _PopulationIterator __last,
65 return _VSTD::__sample(__first, __last, __output, __n, __g);
/external/llvm/test/Transforms/LoopVectorize/
Dvectorize-once.ll31 %__first.addr.04.i = phi i32* [ %incdec.ptr.i, %for.body.i ], [ %A, %entry ]
32 %0 = load i32, i32* %__first.addr.04.i, align 4
34 %incdec.ptr.i = getelementptr inbounds i32, i32* %__first.addr.04.i, i64 1
57 %__first.addr.04.i = phi i32* [ %incdec.ptr.i, %for.body.i ], [ %A, %entry ]
58 %0 = load i32, i32* %__first.addr.04.i, align 4
60 %incdec.ptr.i = getelementptr inbounds i32, i32* %__first.addr.04.i, i64 1
Dee-crash.ll20 %__first.addr.04.i = phi i32* [ %incdec.ptr.i, %for.body.i ], [ %A, %entry ]
21 %0 = load i32, i32* %__first.addr.04.i, align 4
25 %incdec.ptr.i = getelementptr inbounds i32, i32* %__first.addr.04.i, i64 1
/external/swiftshader/third_party/LLVM/test/Analysis/ScalarEvolution/
Dnsw.ll63 %__first.addr.02.i.i = phi i32* [ %begin, %for.body.lr.ph.i.i ], [ %ptrincdec.i.i, %for.body.i.i ]
64 ; CHECK: %__first.addr.02.i.i
66 store i32 0, i32* %__first.addr.02.i.i, align 4
67 %ptrincdec.i.i = getelementptr inbounds i32* %__first.addr.02.i.i, i64 1
96 %__first.addr.08.i.i = getelementptr inbounds i32* %begin, i64 %indvar.i.i
97 ; CHECK: %__first.addr.08.i.i
99 store i32 0, i32* %__first.addr.08.i.i, align 4
/external/swiftshader/third_party/LLVM/test/Transforms/LICM/
Dcrash.ll46 %__first = alloca { i32* }
50 %tmp1 = getelementptr { i32*}* %__first, i32 0, i32 0
53 %tmp3 = getelementptr { i32*}* %__first, i32 0, i32 0
/external/llvm/test/Transforms/SLPVectorizer/X86/
Dcrash_dequeue.ll8 …ET_S4_S4_(%"struct.std::_Deque_iterator.4.157.174.208.259.276.344.731"* %__first, %"struct.std::_D…
10 ….276.344.731", %"struct.std::_Deque_iterator.4.157.174.208.259.276.344.731"* %__first, i64 0, i32 0
12 ….276.344.731", %"struct.std::_Deque_iterator.4.157.174.208.259.276.344.731"* %__first, i64 0, i32 1
/external/llvm/test/Transforms/LICM/
Dcrash.ll47 %__first = alloca { i32* }
51 %tmp1 = getelementptr { i32*}, { i32*}* %__first, i32 0, i32 0
54 %tmp3 = getelementptr { i32*}, { i32*}* %__first, i32 0, i32 0
/external/llvm/test/Analysis/ScalarEvolution/
Dnsw.ll65 %__first.addr.02.i.i = phi i32* [ %begin, %for.body.lr.ph.i.i ], [ %ptrincdec.i.i, %for.body.i.i ]
66 ; CHECK: %__first.addr.02.i.i
68 store i32 0, i32* %__first.addr.02.i.i, align 4
69 %ptrincdec.i.i = getelementptr inbounds i32, i32* %__first.addr.02.i.i, i64 1
98 %__first.addr.08.i.i = getelementptr inbounds i32, i32* %begin, i64 %indvar.i.i
99 ; CHECK: %__first.addr.08.i.i
101 store i32 0, i32* %__first.addr.08.i.i, align 4
/external/llvm/test/Transforms/LoopRotate/
Dnosimplifylatch.ll9 define linkonce_odr hidden i64 @_ZNSt3__14findINS_11__wrap_iterIPiEEiEET_S4_S4_RKT0_(i64 %__first.c…
11 %coerce.val.ip = inttoptr i64 %__first.coerce to i32*

12