Home
last modified time | relevance | path

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

/llvm-project-15.0.7/libcxx/include/__iterator/
H A Dbounded_iter.h58 : __current_(__other.__current_), in __bounded_iter()
112 ++__current_;
122 --__current_;
132 __current_ += __n;
160 return __x.__current_ - __y.__current_;
171 return __x.__current_ == __y.__current_;
175 return __x.__current_ != __y.__current_;
179 return __x.__current_ < __y.__current_;
183 return __x.__current_ > __y.__current_;
187 return __x.__current_ <= __y.__current_;
[all …]
H A Dcounted_iterator.h87 : __current_(__other.__current_), __count_(__other.__count_) {}
93 __current_ = __other.__current_;
110 return *__current_;
118 return *__current_;
131 ++__current_;
144 return __current_++;
162 --__current_;
196 __current_ += __n;
237 __current_ -= __n;
284 noexcept(noexcept(ranges::iter_swap(__x.__current_, __y.__current_)))
[all …]
H A Dmove_iterator.h94 move_iterator& operator++() { ++__current_; return *this; }
97 pointer operator->() const { return __current_; }
114 __current_ = __u.base();
134 void operator++(int) { ++__current_; }
137 move_iterator() : __current_() {}
152 __current_ = __u.base();
157 _Iter base() const { return __current_; }
208 return ranges::iter_move(__i.__current_);
214 noexcept(noexcept(ranges::iter_swap(__x.__current_, __y.__current_)))
216 return ranges::iter_swap(__x.__current_, __y.__current_);
[all …]
/llvm-project-15.0.7/libcxx/include/__ranges/
H A Dtransform_view.h194 : __parent_(__i.__parent_), __current_(std::move(__i.__current_)) {}
198 return __current_;
215 ++__current_;
235 --__current_;
276 return __x.__current_ == __y.__current_;
283 return __x.__current_ < __y.__current_;
290 return __x.__current_ > __y.__current_;
297 return __x.__current_ <= __y.__current_;
304 return __x.__current_ >= __y.__current_;
311 return __x.__current_ <=> __y.__current_;
[all …]
H A Dfilter_view.h143 constexpr iterator_t<_View> base() && { return std::move(__current_); }
151 return __current_;
156 __current_ = ranges::find_if(std::move(++__current_), ranges::end(__parent_->__base_),
172 --__current_;
173 } while (!std::invoke(*__parent_->__pred_, *__current_));
187 return __x.__current_ == __y.__current_;
192 noexcept(noexcept(ranges::iter_move(__it.__current_)))
194 return ranges::iter_move(__it.__current_);
199 noexcept(noexcept(ranges::iter_swap(__x.__current_, __y.__current_)))
202 return ranges::iter_swap(__x.__current_, __y.__current_);
[all …]
H A Dzip_view.h246 : __current_(std::move(__current)) {}
267 : __current_(std::move(__i.__current_)) {}
276 ranges::__tuple_for_each([](auto& __i) { ++__i; }, __current_);
294 ranges::__tuple_for_each([](auto& __i) { --__i; }, __current_);
331 return __x.__current_ == __y.__current_;
333 return ranges::__tuple_any_equals(__x.__current_, __y.__current_);
340 return __x.__current_ < __y.__current_;
365 return __x.__current_ <=> __y.__current_;
394 const auto __diffs = ranges::__tuple_zip_transform(minus<>(), __x.__current_, __y.__current_);
416 ranges::__tuple_zip_for_each(ranges::iter_swap, __l.__current_, __r.__current_);
[all …]
H A Dlazy_split_view.h70 _LIBCPP_NO_UNIQUE_ADDRESS _MaybeCurrent __current_ = _MaybeCurrent(); variable
102 __current_.__emplace(ranges::begin(__base_)); in begin()
148 _LIBCPP_NO_UNIQUE_ADDRESS _MaybeCurrent __current_ = _MaybeCurrent();
154 return __current_;
156 return *__parent_->__current_;
163 return __current_;
165 return *__parent_->__current_;
209 : __parent_(std::addressof(__parent)), __current_(std::move(__current)) {}
214 : __parent_(__i.__parent_), __current_(std::move(__i.__current_)) {}
274 return __x.__current_ == __y.__current_ && __x.__trailing_empty_ == __y.__trailing_empty_;
/llvm-project-15.0.7/libcxx/src/
H A Dregex.cpp384 if (__s.__current_ != __s.__last_) in __exec()
386 switch (*__s.__current_) in __exec()
395 ++__s.__current_; in __exec()
411 if (__s.__current_ != __s.__last_) in __exec()
413 switch (*__s.__current_) in __exec()
424 ++__s.__current_; in __exec()
/llvm-project-15.0.7/libcxx/include/
H A Dregex1421 const _CharT* __current_;
1860 __s.__current_ += __len;
1914 __s.__current_ += __len;
1969 __s.__current_ += __len;
2171 if (__s.__current_ != __s.__last_ && *__s.__current_ != 0)
2174 ++__s.__current_;
2233 if (__s.__current_ != __s.__last_ && *__s.__current_ == __c_)
2236 ++__s.__current_;
2277 ++__s.__current_;
2318 ++__s.__current_;
[all …]