/external/libcxx/include/ |
D | algorithm | 817 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 819 for (; __first != __last; ++__first) 830 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 832 for (; __first != __last; ++__first) 843 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 845 for (; __first != __last; ++__first) 856 for_each(_InputIterator __first, _InputIterator __last, _Function __f) 858 for (; __first != __last; ++__first) 888 find(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 890 for (; __first != __last; ++__first) [all …]
|
D | numeric | 159 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) 161 for (; __first != __last; ++__first) 169 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op) 171 for (; __first != __last; ++__first) 180 reduce(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOp __b) 182 for (; __first != __last; ++__first) 190 reduce(_InputIterator __first, _InputIterator __last, _Tp __init) 192 return _VSTD::reduce(__first, __last, __init, _VSTD::plus<>()); 198 reduce(_InputIterator __first, _InputIterator __last) 200 return _VSTD::reduce(__first, __last, [all …]
|
D | charconv | 297 __to_chars_itoa(char* __first, char* __last, _Tp __value, true_type) 300 if (__value < 0 && __first != __last) 306 return __to_chars_itoa(__first, __last, __x, false_type()); 311 __to_chars_itoa(char* __first, char* __last, _Tp __value, false_type) 314 auto __diff = __last - __first; 320 return {__last, errc::value_too_large}; 335 return {__last, errc::value_too_large}; 342 __to_chars_integral(char* __first, char* __last, _Tp __value, int __base, 346 if (__value < 0 && __first != __last) 352 return __to_chars_integral(__first, __last, __x, __base, false_type()); [all …]
|
D | regex | 2560 basic_regex(_ForwardIterator __first, _ForwardIterator __last, 2564 {__parse(__first, __last);} 2620 assign(_InputIterator __first, _InputIterator __last, 2623 basic_string<_CharT> __t(__first, __last); 2646 assign(_ForwardIterator __first, _ForwardIterator __last, 2649 return assign(basic_regex(__first, __last, __f)); 2687 __parse(_ForwardIterator __first, _ForwardIterator __last); 2690 __parse_basic_reg_exp(_ForwardIterator __first, _ForwardIterator __last); 2693 __parse_RE_expression(_ForwardIterator __first, _ForwardIterator __last); 2696 __parse_simple_RE(_ForwardIterator __first, _ForwardIterator __last); [all …]
|
D | __bit_reference | 234 find(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, const _Tp& __valu… 237 return __find_bool_true(__first, static_cast<typename _Cp::size_type>(__last - __first)); 238 return __find_bool_false(__first, static_cast<typename _Cp::size_type>(__last - __first)); 308 count(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, const _Tp& __val… 311 return __count_bool_true(__first, static_cast<typename _Cp::size_type>(__last - __first)); 312 return __count_bool_false(__first, static_cast<typename _Cp::size_type>(__last - __first)); 396 fill(__bit_iterator<_Cp, false> __first, __bit_iterator<_Cp, false> __last, bool __value_) 398 _VSTD::fill_n(__first, static_cast<typename _Cp::size_type>(__last - __first), __value_); 405 __copy_aligned(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, 412 difference_type __n = __last - __first; [all …]
|
D | vector | 527 _InputIterator>::type __last); 529 vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a, 541 _ForwardIterator>::type __last); 543 vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a, 600 assign(_InputIterator __first, _InputIterator __last); 610 assign(_ForwardIterator __first, _ForwardIterator __last); 748 insert(const_iterator __position, _InputIterator __first, _InputIterator __last); 758 insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last); 767 iterator erase(const_iterator __first, const_iterator __last); 815 __construct_at_end(_ForwardIterator __first, _ForwardIterator __last, size_type __n); [all …]
|
D | unordered_set | 443 unordered_set(_InputIterator __first, _InputIterator __last); 445 unordered_set(_InputIterator __first, _InputIterator __last, 449 unordered_set(_InputIterator __first, _InputIterator __last, 455 unordered_set(_InputIterator __first, _InputIterator __last, 457 : unordered_set(__first, __last, __n, hasher(), key_equal(), __a) {} 459 unordered_set(_InputIterator __first, _InputIterator __last, 461 : unordered_set(__first, __last, __n, __hf, key_equal(), __a) {} 588 void insert(_InputIterator __first, _InputIterator __last); 595 iterator erase(const_iterator __first, const_iterator __last) 596 {return __table_.erase(__first, __last);} [all …]
|
D | unordered_map | 917 unordered_map(_InputIterator __first, _InputIterator __last); 919 unordered_map(_InputIterator __first, _InputIterator __last, 923 unordered_map(_InputIterator __first, _InputIterator __last, 952 …unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& … 953 : unordered_map(__first, __last, __n, hasher(), key_equal(), __a) {} 956 … unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf, 958 : unordered_map(__first, __last, __n, __hf, key_equal(), __a) {} 1034 void insert(_InputIterator __first, _InputIterator __last); 1193 iterator erase(const_iterator __first, const_iterator __last) 1194 {return __table_.erase(__first.__i_, __last.__i_);} [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 | string | 868 basic_string(_InputIterator __first, _InputIterator __last); 871 basic_string(_InputIterator __first, _InputIterator __last, const allocator_type& __a); 1038 append(_InputIterator __first, _InputIterator __last) { 1039 const basic_string __temp (__first, __last, __alloc()); 1052 append(_ForwardIterator __first, _ForwardIterator __last) { 1053 return __append_forward_unsafe(__first, __last); 1105 assign(_InputIterator __first, _InputIterator __last); 1114 assign(_ForwardIterator __first, _ForwardIterator __last); 1156 insert(const_iterator __pos, _InputIterator __first, _InputIterator __last); 1165 insert(const_iterator __pos, _ForwardIterator __first, _ForwardIterator __last); [all …]
|
D | forward_list | 1233 __node_pointer __last = __first; 1238 for (--__n; __n != 0; --__n, __last = __last->__next_) 1242 __last->__next_ = __h.release(); 1258 __last->__next_ = __r->__next_; 1260 __r = static_cast<__begin_node_pointer>(__last); 1283 __node_pointer __last = __first; 1288 for (++__f; __f != __l; ++__f, ((void)(__last = __last->__next_))) 1292 __last->__next_ = __h.release(); 1308 __last->__next_ = __r->__next_; 1310 __r = static_cast<__begin_node_pointer>(__last);
|
/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/u-boot/arch/sh/include/asm/ |
D | system.h | 19 struct task_struct *__last; \ 56 : "=z" (__last) \ 60 last = __last; \
|
/external/u-boot/arch/mips/include/asm/ |
D | ptrace.h | 43 unsigned long __last[0]; member 64 #define MAX_REG_OFFSET (offsetof(struct pt_regs, __last))
|
/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/swiftshader/third_party/llvm-7.0/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/swiftshader/third_party/llvm-7.0/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/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)
|
/external/swiftshader/third_party/llvm-7.0/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/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…
|