Home
last modified time | relevance | path

Searched refs:__first_ (Results 1 – 12 of 12) sorted by relevance

/llvm-project-15.0.7/libcxx/include/__format/
H A Dunicode.h68 : __first_(__first), __last_(__last) {} in __code_point_view()
81 return *__first_++; in __consume()
84 if (__last_ - __first_ < 2 || !__unicode::__is_continuation(__first_ + 1, 1)) [[unlikely]] in __consume()
94 if (__last_ - __first_ < 3 || !__unicode::__is_continuation(__first_ + 1, 2)) [[unlikely]] in __consume()
106 if (__last_ - __first_ < 4 || !__unicode::__is_continuation(__first_ + 1, 3)) [[unlikely]] in __consume()
122 ++__first_; in __consume()
127 const char* __first_;
148 char32_t __result = *__first_++; in __consume()
158 __result += *__first_++ - 0xdc00; in __consume()
164 char32_t __result = *__first_++; in __consume()
[all …]
/llvm-project-15.0.7/libcxx/include/
H A D__split_buffer362 : __first_(_VSTD::move(__c.__first_)),
380 __first_ = __c.__first_;
410 __first_ = __c.__first_;
428 _VSTD::swap(__first_, __x.__first_);
445 _VSTD::swap(__first_, __t.__first_);
467 _VSTD::swap(__first_, __t.__first_);
500 _VSTD::swap(__first_, __t.__first_);
530 _VSTD::swap(__first_, __t.__first_);
562 _VSTD::swap(__first_, __t.__first_);
592 _VSTD::swap(__first_, __t.__first_);
[all …]
H A Dbitset228 : __first_{0}
251 …_VSTD::fill(__first_ + sizeof(__t)/sizeof(__t[0]), __first_ + sizeof(__first_)/sizeof(__first_[0]),
264 _VSTD::fill(__first_ + 1, __first_ + sizeof(__first_)/sizeof(__first_[0]), __storage_type(0));
296 __first_[__i] &= __v.__first_[__i];
305 __first_[__i] |= __v.__first_[__i];
314 __first_[__i] ^= __v.__first_[__i];
521 : __first_(
533 __first_ &= __v.__first_;
541 __first_ |= __v.__first_;
549 __first_ ^= __v.__first_;
[all …]
H A Diomanip571 const _CharT *__first_;
578 : __first_(__f), __last_(__l), __delim_(__d), __escape_(__e) {}
583 return std::__quoted_output(__os, __p.__first_, __p.__last_, __p.__delim_, __p.__escape_);
H A Dregex1420 const _CharT* __first_;
1484 __node<_CharT>* __first_;
1489 : __first_(__s) {}
1492 __node<_CharT>* first() const {return __first_;}
1494 __node<_CharT>*& first() {return __first_;}
2012 if (__s.__first_ != __s.__last_)
2023 else if (__s.__current_ == __s.__first_ &&
3168 __s.__at_first_ && __s.__current_ == __s.__first_);
5787 __states.back().__first_ = __first;
5868 __states.back().__first_ = __first;
[all …]
H A Ddeque2475 _VSTD::swap(__base::__map_.__first_, __buf.__first_);
2562 _VSTD::swap(__base::__map_.__first_, __buf.__first_);
2618 _VSTD::swap(__base::__map_.__first_, __buf.__first_);
2704 _VSTD::swap(__base::__map_.__first_, __buf.__first_);
H A Dvector930 __v.__first_ = __v.__begin_;
950 __v.__first_ = __v.__begin_;
/llvm-project-15.0.7/libcxx/include/__functional/
H A Dboyer_moore_searcher.h120 : __first_(__first), in __first_() function
133 __build_suffix_table(__first_, __last_, __pred_); in __first_()
144 if (__first_ == __last_) in operator()
153 _RandomAccessIterator1 __first_;
169 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
247 : __first_(__first), in __first_() function
271 if (__first_ == __last_) in operator()
281 _RandomAccessIterator1 __first_;
296 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
H A Ddefault_searcher.h35 : __first_(__f), __last_(__l), __pred_(__p) {} in __first_() function
43 return std::__search_impl(__f, __l, __first_, __last_, __pred_, __proj, __proj); in operator()
47 _ForwardIterator __first_;
/llvm-project-15.0.7/libcxx/include/experimental/
H A Dfunctional101 : __first_(__f), __last_(__l), __pred_(__p) {}
113 _ForwardIterator __first_;
206 : __first_(__f), __last_(__l), __pred_(__pred),
207 __pattern_length_(_VSTD::distance(__first_, __last_)),
215 this->__build_suffix_table ( __first_, __last_, __pred_ );
238 _RandomAccessIterator1 __first_;
259 while (__pred_(__first_ [__j-1], __cur [__j-1])) {
355 : __first_(__f), __last_(__l), __pred_(__pred),
356 __pattern_length_(_VSTD::distance(__first_, __last_)),
388 _RandomAccessIterator1 __first_;
[all …]
/llvm-project-15.0.7/libcxx/include/__memory/
H A Duninitialized_algorithms.h514 : __alloc_(__alloc), __first_(__first), __last_(__last) {} in _AllocatorDestroyRangeReverse()
517 …r_destroy(__alloc_, std::reverse_iterator<_Iter>(__last_), std::reverse_iterator<_Iter>(__first_)); in operator()
522 _Iter& __first_; variable
/llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/
H A Dearly-if-conversion-bug1.ll203 …%__first_.i.i.i.i = getelementptr inbounds %"class.std::__1::__libcpp_compressed_pair_imp", %"clas…
221 …%__first_.i.i.i.i.i = getelementptr inbounds %"class.std::__1::__libcpp_compressed_pair_imp", %"cl…
222 …har, std::__1::char_traits<char>, std::__1::allocator<char> >::__rep"* %__first_.i.i.i.i.i, i32 0,…
241 …%__first_.i.i.i20.i.i = getelementptr inbounds %"class.std::__1::__libcpp_compressed_pair_imp", %"…
242 …har, std::__1::char_traits<char>, std::__1::allocator<char> >::__rep"* %__first_.i.i.i20.i.i, i32 …
257 …%__first_.i.i.i11.i.i = getelementptr inbounds %"class.std::__1::__libcpp_compressed_pair_imp", %"…
258 …har, std::__1::char_traits<char>, std::__1::allocator<char> >::__rep"* %__first_.i.i.i11.i.i, i32 …