/external/libcxx/include/ |
D | algorithm | 925 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 927 for (; __first != __last; ++__first) 938 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 940 for (; __first != __last; ++__first) 951 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 953 for (; __first != __last; ++__first) 964 for_each(_InputIterator __first, _InputIterator __last, _Function __f) 966 for (; __first != __last; ++__first) 996 find(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 998 for (; __first != __last; ++__first) [all …]
|
D | numeric | 158 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) 160 for (; __first != __last; ++__first) 168 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op) 170 for (; __first != __last; ++__first) 179 reduce(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOp __b) 181 for (; __first != __last; ++__first) 189 reduce(_InputIterator __first, _InputIterator __last, _Tp __init) 191 return _VSTD::reduce(__first, __last, __init, _VSTD::plus<>()); 197 reduce(_InputIterator __first, _InputIterator __last) 199 return _VSTD::reduce(__first, __last, [all …]
|
D | regex | 2553 basic_regex(_ForwardIterator __first, _ForwardIterator __last, 2557 {__parse(__first, __last);} 2613 assign(_InputIterator __first, _InputIterator __last, 2616 basic_string<_CharT> __t(__first, __last); 2639 assign(_ForwardIterator __first, _ForwardIterator __last, 2642 return assign(basic_regex(__first, __last, __f)); 2680 __parse(_ForwardIterator __first, _ForwardIterator __last); 2683 __parse_basic_reg_exp(_ForwardIterator __first, _ForwardIterator __last); 2686 __parse_RE_expression(_ForwardIterator __first, _ForwardIterator __last); 2689 __parse_simple_RE(_ForwardIterator __first, _ForwardIterator __last); [all …]
|
D | __bit_reference | 233 find(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, const _Tp& __valu… 236 return __find_bool_true(__first, static_cast<typename _Cp::size_type>(__last - __first)); 237 return __find_bool_false(__first, static_cast<typename _Cp::size_type>(__last - __first)); 307 count(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, const _Tp& __val… 310 return __count_bool_true(__first, static_cast<typename _Cp::size_type>(__last - __first)); 311 return __count_bool_false(__first, static_cast<typename _Cp::size_type>(__last - __first)); 395 fill(__bit_iterator<_Cp, false> __first, __bit_iterator<_Cp, false> __last, bool __value_) 397 _VSTD::fill_n(__first, static_cast<typename _Cp::size_type>(__last - __first), __value_); 404 __copy_aligned(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, 411 difference_type __n = __last - __first; [all …]
|
D | vector | 504 _InputIterator>::type __last); 506 vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a, 518 _ForwardIterator>::type __last); 520 vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a, 576 assign(_InputIterator __first, _InputIterator __last); 586 assign(_ForwardIterator __first, _ForwardIterator __last); 724 insert(const_iterator __position, _InputIterator __first, _InputIterator __last); 734 insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last); 743 iterator erase(const_iterator __first, const_iterator __last); 791 __construct_at_end(_ForwardIterator __first, _ForwardIterator __last, size_type __n); [all …]
|
D | unordered_set | 387 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) {} 532 void insert(_InputIterator __first, _InputIterator __last); 539 iterator erase(const_iterator __first, const_iterator __last) 540 {return __table_.erase(__first, __last);} [all …]
|
D | unordered_map | 808 unordered_map(_InputIterator __first, _InputIterator __last); 810 unordered_map(_InputIterator __first, _InputIterator __last, 814 unordered_map(_InputIterator __first, _InputIterator __last, 843 …unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& … 844 : unordered_map(__first, __last, __n, hasher(), key_equal(), __a) {} 847 … unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf, 849 : unordered_map(__first, __last, __n, __hf, key_equal(), __a) {} 925 void insert(_InputIterator __first, _InputIterator __last); 1084 iterator erase(const_iterator __first, const_iterator __last) 1085 {return __table_.erase(__first.__i_, __last.__i_);} [all …]
|
D | string | 809 basic_string(_InputIterator __first, _InputIterator __last); 812 basic_string(_InputIterator __first, _InputIterator __last, const allocator_type& __a); 956 append(_InputIterator __first, _InputIterator __last) { 957 const basic_string __temp (__first, __last, __alloc()); 970 append(_ForwardIterator __first, _ForwardIterator __last) { 971 return __append_forward_unsafe(__first, __last); 1017 assign(_InputIterator __first, _InputIterator __last); 1026 assign(_ForwardIterator __first, _ForwardIterator __last); 1059 insert(const_iterator __pos, _InputIterator __first, _InputIterator __last); 1068 insert(const_iterator __pos, _ForwardIterator __first, _ForwardIterator __last); [all …]
|
D | __split_buffer | 123 __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)
|
D | forward_list | 1202 __node_pointer __last = __first; 1207 for (--__n; __n != 0; --__n, __last = __last->__next_) 1211 __last->__next_ = __h.release(); 1227 __last->__next_ = __r->__next_; 1229 __r = static_cast<__begin_node_pointer>(__last); 1252 __node_pointer __last = __first; 1257 for (++__f; __f != __l; ++__f, ((void)(__last = __last->__next_))) 1261 __last->__next_ = __h.release(); 1277 __last->__next_ = __r->__next_; 1279 __r = static_cast<__begin_node_pointer>(__last);
|
D | __hash_table | 1043 void __assign_unique(_InputIterator __first, _InputIterator __last); 1045 void __assign_multi(_InputIterator __first, _InputIterator __last); 1198 iterator erase(const_iterator __first, const_iterator __last); 1685 _InputIterator __last) 1699 for (; __cache != nullptr && __first != __last; ++__first) 1716 for (; __first != __last; ++__first) 1724 _InputIterator __last) 1739 for (; __cache != nullptr && __first != __last; ++__first) 1756 for (; __first != __last; ++__first) 2369 const_iterator __last) [all …]
|
D | iomanip | 519 _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);
|
D | iterator | 571 __distance(_InputIter __first, _InputIter __last, input_iterator_tag) 574 for (; __first != __last; ++__first) 582 __distance(_RandIter __first, _RandIter __last, random_access_iterator_tag) 584 return __last - __first; 590 distance(_InputIter __first, _InputIter __last) 592 return __distance(__first, __last, typename iterator_traits<_InputIter>::iterator_category());
|
D | __tree | 1107 void __assign_unique(_InputIterator __first, _InputIterator __last); 1109 void __assign_multi(_InputIterator __first, _InputIterator __last); 1583 __tree<_Tp, _Compare, _Allocator>::__assign_unique(_InputIterator __first, _InputIterator __last) 1597 for (; __cache != nullptr && __first != __last; ++__first) 1621 for (; __first != __last; ++__first) 1628 __tree<_Tp, _Compare, _Allocator>::__assign_multi(_InputIterator __first, _InputIterator __last) 1643 for (; __cache != nullptr && __first != __last; ++__first) 1667 for (; __first != __last; ++__first)
|
/external/libcxx/include/ext/ |
D | hash_set | 248 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 …]
|
D | hash_map | 514 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/ |
D | system-header-simulator-cxx.h | 178 >::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/ |
D | crash_dequeue.ll | 8 ….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/llvm/test/Transforms/LoopRotate/ |
D | nosimplifylatch.ll | 9 …__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/ |
D | 2007-09-10-RecursiveTypeResolution.cpp | 33 typename _Tp > inline void find (_InputIterator __last, in find() argument
|
/external/libcxx/include/experimental/ |
D | functional | 273 const _RandomAccessIterator2 __last = __l - __pattern_length_; 277 while (__cur <= __last) 424 const _RandomAccessIterator2 __last = __l - __pattern_length_; 427 while (__cur <= __last)
|
D | filesystem | 697 path(_InputIt __first, _InputIt __last) { 699 _PathCVT<_ItVal>::__append_range(__pn_, __first, __last); 755 path& assign(_InputIt __first, _InputIt __last) { 758 _PathCVT<_ItVal>::__append_range(__pn_, __first, __last); 802 path& append(_InputIt __first, _InputIt __last) { 806 if (__first != __last) { 808 _CVT::__append_range(__pn_, __first, __last); 868 path& concat(_InputIt __first, _InputIt __last) { 870 _PathCVT<_ItVal>::__append_range(__pn_, __first, __last);
|
/external/swiftshader/third_party/LLVM/test/CodeGen/X86/ |
D | 2010-03-05-ConstantFoldCFG.ll | 9 …sort_loopIPdl17less_than_functorEvT_S2_T0_T1_(double* %__first, double* %__last, i64 %__depth_limi…
|
/external/llvm/test/CodeGen/X86/ |
D | 2010-03-05-ConstantFoldCFG.ll | 9 …sort_loopIPdl17less_than_functorEvT_S2_T0_T1_(double* %__first, double* %__last, i64 %__depth_limi…
|
/external/clang/www/ |
D | libstdc++4.4-clang0x.patch | 197 + iterator __last) 198 + { splice(__position, std::move(__x), __first, __last); } 486 return std::__is_heap(__first, __comp, __last - __first);
|