Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Dbounded_iter.h72 : __current_(__other.__current_), in __bounded_iter()
91 : __current_(__current), __begin_(__begin), __end_(__end) { in __bounded_iter()
111 … __current_ != __end_, "__bounded_iter::operator*: Attempt to dereference an iterator at the end");
112 return *__current_;
117 …__current_ != __end_, "__bounded_iter::operator->: Attempt to dereference an iterator at the end");
118 return std::__to_address(__current_);
123 …__n >= __begin_ - __current_, "__bounded_iter::operator[]: Attempt to index an iterator past the s…
125 …__n < __end_ - __current_, "__bounded_iter::operator[]: Attempt to index an iterator at or past th…
126 return __current_[__n];
134 … __current_ != __end_, "__bounded_iter::operator++: Attempt to advance an iterator past the end");
[all …]
H A Dcounted_iterator.h84 : __current_(std::move(__iter)), __count_(__n) {
91 : __current_(__other.__current_), __count_(__other.__count_) {}
96 __current_ = __other.__current_;
101 _LIBCPP_HIDE_FROM_ABI constexpr const _Iter& base() const& noexcept { return __current_; }
103 _LIBCPP_HIDE_FROM_ABI constexpr _Iter base() && { return std::move(__current_); }
109 return *__current_;
116 return *__current_;
122 return std::to_address(__current_);
127 ++__current_;
137 return __current_++;
[all …]
H A Dmove_iterator.h112 …_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 explicit move_iterator(_Iter __i) : __current_(std::move(__i)) …
115 ++__current_;
120 return __current_;
126 : __current_() {}
130 …_LIBCPP_HIDE_FROM_ABI constexpr move_iterator(const move_iterator<_Up>& __u) : __current_(__u.base…
135 __current_ = __u.base();
139 _LIBCPP_HIDE_FROM_ABI constexpr const _Iter& base() const& noexcept { return __current_; }
140 _LIBCPP_HIDE_FROM_ABI constexpr _Iter base() && { return std::move(__current_); }
142 …_LIBCPP_HIDE_FROM_ABI constexpr reference operator*() const { return ranges::iter_move(__current_)…
144 return ranges::iter_move(__current_ + __n);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dtransform_view.h190 iterator_t<_Base> __current_ = iterator_t<_Base>();
201 : __parent_(std::addressof(__parent)), __current_(std::move(__current)) {}
208 : __parent_(__i.__parent_), __current_(std::move(__i.__current_)) {}
210 …BCPP_HIDE_FROM_ABI constexpr const iterator_t<_Base>& base() const& noexcept { return __current_; }
212 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_Base> base() && { return std::move(__current_); }
215 noexcept(noexcept(std::invoke(*__parent_->__func_, *__current_))) {
216 return std::invoke(*__parent_->__func_, *__current_);
220 ++__current_;
224 _LIBCPP_HIDE_FROM_ABI constexpr void operator++(int) { ++__current_; }
237 --__current_;
[all …]
H A Dfilter_view.h131 _LIBCPP_NO_UNIQUE_ADDRESS iterator_t<_View> __current_ = iterator_t<_View>();
149 : __current_(std::move(__current)), __parent_(std::addressof(__parent)) {}
151 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_View> const& base() const& noexcept { return __current_; }
152 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_View> base() && { return std::move(__current_); }
154 _LIBCPP_HIDE_FROM_ABI constexpr range_reference_t<_View> operator*() const { return *__current_; }
158 return __current_;
162 __current_ =
163 ranges::find_if(std::move(++__current_), ranges::end(__parent_->__base_), std::ref(*__parent_->__pred_));
179 --__current_;
180 } while (!std::invoke(*__parent_->__pred_, *__current_));
[all...]
H A Delements_view.h176 iterator_t<_Base> __current_ = iterator_t<_Base>();
208 …_LIBCPP_HIDE_FROM_ABI constexpr explicit __iterator(iterator_t<_Base> __current) : __current_(std:…
212 : __current_(std::move(__i.__current_)) {}
214 …BCPP_HIDE_FROM_ABI constexpr const iterator_t<_Base>& base() const& noexcept { return __current_; }
216 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_Base> base() && { return std::move(__current_); }
218 …BCPP_HIDE_FROM_ABI constexpr decltype(auto) operator*() const { return __get_element(__current_); }
221 ++__current_;
225 _LIBCPP_HIDE_FROM_ABI constexpr void operator++(int) { ++__current_; }
231 ++__current_;
238 --__current_;
[all …]
H A Drepeat_view.h144 : __value_(__value), __current_(__bound_sentinel) {}
157 ++__current_;
169 …_LIBCPP_ASSERT_UNCATEGORIZED(__current_ > 0, "The value of bound must be greater than or equal to …
170 --__current_;
182 …_LIBCPP_ASSERT_UNCATEGORIZED(__current_ + __n >= 0, "The value of bound must be greater than or eq…
183 __current_ += __n;
189 …_LIBCPP_ASSERT_UNCATEGORIZED(__current_ - __n >= 0, "The value of bound must be greater than or eq…
190 __current_ -= __n;
197 return __x.__current_ == __y.__current_;
201 return __x.__current_ <=> __y.__current_;
[all …]
H A Dzip_view.h253 __tuple_or_pair<iterator_t<__maybe_const<_Const, _Views>>...> __current_;
257 : __current_(std::move(__current)) {}
276 : __current_(std::move(__i.__current_)) {}
279 return ranges::__tuple_transform([](auto& __i) -> decltype(auto) { return *__i; }, __current_);
283 ranges::__tuple_for_each([](auto& __i) { ++__i; }, __current_);
300 ranges::__tuple_for_each([](auto& __i) { --__i; }, __current_);
315 …tuple_for_each([&]<class _Iter>(_Iter& __i) { __i += iter_difference_t<_Iter>(__x); }, __current_);
322 …tuple_for_each([&]<class _Iter>(_Iter& __i) { __i -= iter_difference_t<_Iter>(__x); }, __current_);
330 …s _Iter>(_Iter& __i) -> decltype(auto) { return __i[iter_difference_t<_Iter>(__n)]; }, __current_);
337 return __x.__current_ == __y.__current_;
[all …]
H A Dchunk_by_view.h143 _LIBCPP_NO_UNIQUE_ADDRESS iterator_t<_View> __current_ = iterator_t<_View>(); variable
148 : __parent_(std::addressof(__parent)), __current_(__current), __next_(__next) {} in __iterator()
161 …_LIBCPP_ASSERT_PEDANTIC(__current_ != __next_, "Trying to dereference past-the-end chunk_by_view i…
162 return {__current_, __next_};
167 …_LIBCPP_ASSERT_PEDANTIC(__current_ != __next_, "Trying to increment past end chunk_by_view iterato…
168 __current_ = __next_;
169 __next_ = __parent_->__find_next(__current_);
182 __next_ = __current_;
183 __current_ = __parent_->__find_prev(__next_);
196 return __x.__current_ == __y.__current_;
[all …]
H A Dlazy_split_view.h76 _LIBCPP_NO_UNIQUE_ADDRESS _MaybeCurrent __current_ = _MaybeCurrent(); variable
108 __current_.__emplace(ranges::begin(__base_)); in begin()
154 _LIBCPP_NO_UNIQUE_ADDRESS _MaybeCurrent __current_ = _MaybeCurrent();
159 return __current_;
161 return *__parent_->__current_;
167 return __current_;
169 return *__parent_->__current_;
202 : __parent_(std::addressof(__parent)), __current_(std::move(__current)) {}
206 : __parent_(__i.__parent_), __current_(std::move(__i.__current_)) {}
263 return __x.__current_ == __y.__current_ && __x.__trailing_empty_ == __y.__trailing_empty_;
/freebsd/contrib/llvm-project/libcxx/src/
H A Dregex.cpp357 if (__s.__current_ != __s.__last_) { in __get_collation_name()
358 switch (*__s.__current_) { in __get_collation_name()
366 ++__s.__current_; in __get_classname()
378 if (__s.__current_ != __s.__last_) { in __get_classname()
379 switch (*__s.__current_) {
389 ++__s.__current_; in __exec()
/freebsd/contrib/llvm-project/libcxx/include/
H A Dregex1326 const _CharT* __current_;
1337 __current_(nullptr),
1530 __s.__loop_data_[__loop_id_].second = __s.__current_;
1544 if (__do_repeat && __do_alt && __s.__loop_data_[__loop_id_].second == __s.__current_)
1633 __s.__sub_matches_[__mexp_ - 1].first = __s.__current_;
1657 __s.__sub_matches_[__mexp_ - 1].second = __s.__current_;
1685 …if (__s.__last_ - __s.__current_ >= __len && std::equal(__sm.first, __sm.second, __s.__current_)) {
1687 __s.__current_ += __len;
1722 if (__s.__last_ - __s.__current_ >= __len) {
1724 …if (__traits_.translate_nocase(__sm.first[__i]) != __traits_.translate_nocase(__s.__current_[__i]))
[all …]