Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/libcxx/include/__iterator/
H A Dbounded_iter.h63 : __current_(__other.__current_), in __bounded_iter()
117 ++__current_;
127 --__current_;
137 __current_ += __n;
165 return __x.__current_ - __y.__current_;
176 return __x.__current_ == __y.__current_;
180 return __x.__current_ != __y.__current_;
184 return __x.__current_ < __y.__current_;
188 return __x.__current_ > __y.__current_;
192 return __x.__current_ <= __y.__current_;
[all …]
H A Dcounted_iterator.h91 : __current_(__other.__current_), __count_(__other.__count_) {}
96 __current_ = __other.__current_;
109 return *__current_;
116 return *__current_;
127 ++__current_;
137 return __current_++;
143 return __current_++;
159 --__current_;
189 __current_ += __n;
224 __current_ -= __n;
[all …]
H A Dmove_iterator.h116 ++__current_;
121 return __current_;
127 : __current_() {}
152 ++__current_;
184 ++__current_;
190 --__current_;
195 --__current_;
202 __current_ += __n;
209 __current_ -= __n;
242 return ranges::iter_swap(__x.__current_, __y.__current_);
[all …]
/freebsd-14.2/contrib/llvm-project/libcxx/include/__ranges/
H A Dtransform_view.h208 : __parent_(__i.__parent_), __current_(std::move(__i.__current_)) {}
220 ++__current_;
237 --__current_;
252 __current_ += __n;
273 return __x.__current_ == __y.__current_;
279 return __x.__current_ < __y.__current_;
285 return __x.__current_ > __y.__current_;
291 return __x.__current_ <= __y.__current_;
297 return __x.__current_ >= __y.__current_;
303 return __x.__current_ <=> __y.__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)) {}
158 return __current_;
162 __current_ =
179 --__current_;
180 } while (!std::invoke(*__parent_->__pred_, *__current_));
194 return __x.__current_ == __y.__current_;
199 return ranges::iter_move(__it.__current_);
204 … __iterator const& __y) noexcept(noexcept(ranges::iter_swap(__x.__current_, __y.__current_)))
207 return ranges::iter_swap(__x.__current_, __y.__current_);
[all …]
H A Delements_view.h212 : __current_(std::move(__i.__current_)) {}
221 ++__current_;
231 ++__current_;
238 --__current_;
246 --__current_;
253 __current_ += __n;
260 __current_ -= __n;
273 return __x.__current_ == __y.__current_;
279 return __x.__current_ < __y.__current_;
303 return __x.__current_ <=> __y.__current_;
[all …]
H A Drepeat_view.h142 : __value_(__value), __current_(__bound_sentinel) {}
155 ++__current_;
167 …_LIBCPP_ASSERT_UNCATEGORIZED(__current_ > 0, "The value of bound must be greater than or equal to …
168 --__current_;
180 …_LIBCPP_ASSERT_UNCATEGORIZED(__current_ + __n >= 0, "The value of bound must be greater than or eq…
181 __current_ += __n;
188 __current_ -= __n;
195 return __x.__current_ == __y.__current_;
199 return __x.__current_ <=> __y.__current_;
218 …return static_cast<difference_type>(__x.__current_) - static_cast<difference_type>(__y.__current_);
[all …]
H A Dzip_view.h256 : __current_(std::move(__current)) {}
275 : __current_(std::move(__i.__current_)) {}
282 ranges::__tuple_for_each([](auto& __i) { ++__i; }, __current_);
299 ranges::__tuple_for_each([](auto& __i) { --__i; }, __current_);
336 return __x.__current_ == __y.__current_;
338 return ranges::__tuple_any_equals(__x.__current_, __y.__current_);
345 return __x.__current_ < __y.__current_;
370 return __x.__current_ <=> __y.__current_;
399 const auto __diffs = ranges::__tuple_zip_transform(minus<>(), __x.__current_, __y.__current_);
421 ranges::__tuple_zip_for_each(ranges::iter_swap, __l.__current_, __r.__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-14.2/contrib/llvm-project/libcxx/src/
H A Dregex.cpp357 if (__s.__current_ != __s.__last_) { in __exec()
358 switch (*__s.__current_) { in __exec()
366 ++__s.__current_; in __exec()
378 if (__s.__current_ != __s.__last_) { in __exec()
379 switch (*__s.__current_) { in __exec()
389 ++__s.__current_; in __exec()
/freebsd-14.2/contrib/llvm-project/libcxx/include/
H A Dregex1327 const _CharT* __current_;
1338 __current_(nullptr),
1689 __s.__current_ += __len;
1917 if (__s.__current_ != __s.__last_ && *__s.__current_ != 0) {
1919 ++__s.__current_;
1969 if (__s.__current_ != __s.__last_ && *__s.__current_ == __c_) {
1971 ++__s.__current_;
2004 ++__s.__current_;
2035 if (__s.__current_ != __s.__last_ && __traits_.translate(*__s.__current_) == __c_) {
2037 ++__s.__current_;
[all …]