Home
last modified time | relevance | path

Searched refs:__end_ (Results 1 – 16 of 16) sorted by relevance

/llvm-project-15.0.7/libcxx/include/
H A D__split_buffer364 __end_(_VSTD::move(__c.__end_)),
382 __end_ = __c.__end_;
412 __end_ = __c.__end_;
430 _VSTD::swap(__end_, __x.__end_);
447 _VSTD::swap(__end_, __t.__end_);
469 _VSTD::swap(__end_, __t.__end_);
502 _VSTD::swap(__end_, __t.__end_);
532 _VSTD::swap(__end_, __t.__end_);
564 _VSTD::swap(__end_, __t.__end_);
594 _VSTD::swap(__end_, __t.__end_);
[all …]
H A Dvalarray2818 __end_(nullptr)
2844 __end_(nullptr)
2852 __end_(nullptr)
2877 __end_(nullptr)
2905 __end_(__v.__end_)
2913 __end_(nullptr)
2942 __end_(nullptr)
3095 __end_ = __v.__end_;
3615 _VSTD::swap(__end_, __v.__end_);
3678 for (; __r.__end_ != __tb; ++__r.__end_)
[all …]
H A Dvector791 : __v_(__v), __pos_(__v.__end_), __new_end_(__v.__end_ + __n) {
797 __v_.__end_ = __pos_;
928 _VSTD::swap(this->__end_, __v.__end_);
946 … __v.__end_ = std::__uninitialized_allocator_move_if_noexcept(__alloc(), __p, __end_, __v.__end_);
948 _VSTD::swap(this->__end_, __v.__end_);
1251 this->__end_ = __x.__end_;
1266 this->__end_ = __x.__end_;
1351 this->__end_ = __c.__end_;
1572 __v.__end_++;
1614 __v.__end_++;
[all …]
H A Dregex3122 swap(__end_, __r.__end_);
4830 __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
4863 __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
4871 __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
4878 __end_->first() = new __match_any<_CharT>(__end_->first());
4879 __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
4887 __end_ = static_cast<__owns_one_state<_CharT>*>(__end_->first());
4894 __end_->first() = new __empty_state<_CharT>(__end_->first());
4946 __end_ = __r;
6388 __end_(__b),
[all …]
H A Dlist575 __node_base __end_;
735 __link_pointer __f = __end_.__next_;
767 swap(__end_, __c.__end_);
769 __end_.__next_ = __end_.__prev_ = __end_as_link();
771 __end_.__prev_->__next_ = __end_.__next_->__prev_ = __end_as_link();
773 __c.__end_.__next_ = __c.__end_.__prev_ = __c.__end_as_link();
775 __c.__end_.__prev_->__next_ = __c.__end_.__next_->__prev_ = __c.__end_as_link();
1164 __l->__next_ = base::__end_.__next_;
1166 base::__end_.__next_ = __f;
1176 __f->__prev_ = base::__end_.__prev_;
[all …]
H A Ddeque976 const pointer __end_;
981 const iterator __end_;
987 return __pos_ != __end_;
995 return __deque_range(__end_, __end_);
1006 __pos_ = __end_;
1027 : __pos_(__r.__begin_), __end_(__r.__end_), __begin_(__r.__begin_), __base_(__db) {}
1035 const pointer __end_;
2477 _VSTD::swap(__base::__map_.__end_, __buf.__end_);
2564 _VSTD::swap(__base::__map_.__end_, __buf.__end_);
2620 _VSTD::swap(__base::__map_.__end_, __buf.__end_);
[all …]
/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A Dcxx0x-initializer-stdinitializerlist-startend.cpp11 const _E* __end_; member in std::initializer_list
15 __end_(__e) in initializer_list()
27 initializer_list() : __begin_(nullptr), __end_(nullptr) {} in initializer_list()
29 size_t size() const {return __end_ - __begin_;} in size()
31 const _E* end() const {return __end_;} in end()
H A Dcxx0x-initializer-stdinitializerlist-pr12086.cpp14 const _E* __end_; member in std::initializer_list
22 __end_(__b + __s) in initializer_list()
38 constexpr initializer_list() : __begin_(nullptr), __end_(nullptr) {} in initializer_list()
40 size_t size() const {return __end_ - __begin_;} in size()
42 const _E* end() const {return __end_;} in end()
/llvm-project-15.0.7/libcxx/include/__ranges/
H A Dsubrange.h89 _LIBCPP_NO_UNIQUE_ADDRESS _Sent __end_ = _Sent(); variable
99 : __begin_(std::move(__iter)), __end_(std::move(__sent)) in subrange()
106 : __begin_(std::move(__iter)), __end_(std::move(__sent)), __size_(__n) in subrange()
109 _LIBCPP_ASSERT((__end_ - __begin_) == static_cast<iter_difference_t<_Iter>>(__n), in subrange()
146 return _Pair(__begin_, __end_); in _Pair()
160 return __end_; in end()
164 return __begin_ == __end_; in empty()
174 return std::__to_unsigned_like(__end_ - __begin_); in size()
209 auto __d = __n - ranges::advance(__begin_, __n, __end_); in advance()
H A Dtake_view.h148 _LIBCPP_NO_UNIQUE_ADDRESS sentinel_t<_Base> __end_ = sentinel_t<_Base>(); variable
158 constexpr explicit __sentinel(sentinel_t<_Base> __end) : __end_(std::move(__end)) {} in __sentinel()
163 : __end_(std::move(__s.__end_)) {} in __sentinel()
166 constexpr sentinel_t<_Base> base() const { return __end_; } in base()
170 return __lhs.count() == 0 || __lhs.base() == __rhs.__end_;
177 return __lhs.count() == 0 || __lhs.base() == __rhs.__end_;
H A Dtransform_view.h360 sentinel_t<_Base> __end_ = sentinel_t<_Base>();
373 constexpr explicit __sentinel(sentinel_t<_Base> __end) : __end_(__end) {}
381 : __end_(std::move(__i.__end_)) {}
384 constexpr sentinel_t<_Base> base() const { return __end_; }
390 return __x.__current_ == __y.__end_;
398 return __x.__current_ - __y.__end_;
406 return __x.__end_ - __y.__current_;
H A Djoin_view.h148 sentinel_t<_Base> __end_ = sentinel_t<_Base>();
156 : __end_(ranges::end(__parent.__base_)) {}
161 : __end_(std::move(__s.__end_)) {}
167 return __x.__outer_ == __y.__end_;
H A Dfilter_view.h210 sentinel_t<_View> __end_ = sentinel_t<_View>();
217 : __end_(ranges::end(__parent.__base_))
221 constexpr sentinel_t<_View> base() const { return __end_; }
225 return __x.__current_ == __y.__end_;
H A Dzip_view.h425 __tuple_or_pair<sentinel_t<__maybe_const<_Const, _Views>>...> __end_;
428 … __sentinel(__tuple_or_pair<sentinel_t<__maybe_const<_Const, _Views>>...> __end) : __end_(__end) {}
446 : __end_(std::move(__i.__end_)) {}
452 return ranges::__tuple_any_equals(__iter_current(__x), __y.__end_);
461 const auto __diffs = ranges::__tuple_zip_transform(minus<>(), __iter_current(__x), __y.__end_);
/llvm-project-15.0.7/libcxx/include/__format/
H A Dformat_parse_context.h36 __end_(__fmt.end()),
49 return __end_; in end()
85 iterator __end_; variable
/llvm-project-15.0.7/libcxx/include/__iterator/
H A Dbounded_iter.h60 __end_(__other.__end_) {} in __bounded_iter()
78 : __current_(__current), __begin_(__begin), __end_(__end) { in __bounded_iter()
197 return __iter >= __begin_ && __iter < __end_; in __in_bounds()
203 _Iterator __begin_, __end_; // valid range represented as [begin, end) member