Home
last modified time | relevance | path

Searched refs:__i_ (Results 1 – 8 of 8) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__random/
H A Dsubtract_with_carry_engine.h151 __i_ = 0; in seed()
162 __i_ = 0; in seed()
174 __i_ = 0; in __seed()
186 __i_ = 0; in __seed()
196 __i_ = (__i_ + 1) % __r; in operator()
205 if (__x.__i_ == __y.__i_)
207 if (__x.__i_ == 0 || __y.__i_ == 0) {
209 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j, __y.__x_ + __y.__i_))
215 if (__x.__i_ < __y.__i_) {
217 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j), __y.__x_ + __y.__i_))
[all …]
H A Dmersenne_twister_engine.h143 size_t __i_; variable
654 __i_ = 0; in seed()
766 if (__x.__i_ == __y.__i_)
768 if (__x.__i_ == 0 || __y.__i_ == 0) {
769 size_t __j = std::min(_Np - __x.__i_, _Np - __y.__i_);
770 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j, __y.__x_ + __y.__i_))
772 if (__x.__i_ == 0)
776 if (__x.__i_ < __y.__i_) {
778 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j), __y.__x_ + __y.__i_))
785 if (!std::equal(__y.__x_ + __y.__i_, __y.__x_ + (__y.__i_ + __j), __x.__x_ + __x.__i_))
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Dwrap_iter.h41 iterator_type __i_;
44 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter() _NOEXCEPT : __i_() {} in __wrap_iter()
47 : __i_(__u.base()) {} in __wrap_iter()
48 …HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 reference operator*() const _NOEXCEPT { return *__i_; }
50 return std::__to_address(__i_);
53 ++__i_;
63 --__i_;
77 __i_ += __n;
88 return __i_[__n];
91 …P_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 iterator_type base() const _NOEXCEPT { return __i_; } in base()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dlazy_split_view.h184 __outer_iterator __i_ = __outer_iterator();
188 …_LIBCPP_HIDE_FROM_ABI constexpr explicit value_type(__outer_iterator __i) : __i_(std::move(__i)) {}
289 __outer_iterator<_Const> __i_ = __outer_iterator<_OuterConst>();
298 auto [__pcur, __pend] = ranges::subrange{__i_.__parent_->__pattern_};
299 auto __end = ranges::end(__i_.__parent_->__base_);
302 const auto& __cur = __i_.__current();
311 auto __cur = __i_.__current();
331 return __i_.__current();
348 return std::move(__i_.__current());
351 _LIBCPP_HIDE_FROM_ABI constexpr decltype(auto) operator*() const { return *__i_.__current(); }
[all …]
/freebsd/contrib/llvm-project/libcxx/include/ext/
H A Dhash_map340 _HashIterator __i_;
360 ++__i_;
370 return __x.__i_ == __y.__i_;
373 return __x.__i_ != __y.__i_;
390 _HashIterator __i_;
406 : __i_(__i.__i_) {}
412 ++__i_;
423 return __x.__i_ == __y.__i_;
427 return __x.__i_ != __y.__i_;
530 __table_.erase(__first.__i_, __last.__i_);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dmap857 _TreeIterator __i_;
874 ++__i_;
884 --__i_;
894 return __x.__i_ == __y.__i_;
897 return __x.__i_ != __y.__i_;
932 ++__i_;
942 --__i_;
952 return __x.__i_ == __y.__i_;
955 return __x.__i_ != __y.__i_;
1316 return __tree_.erase(__f.__i_, __l.__i_);
[all …]
H A Dunordered_map918 _HashIterator __i_;
937 ++__i_;
947 return __x.__i_ == __y.__i_;
951 return __x.__i_ != __y.__i_;
969 _HashIterator __i_;
985 : __i_(__i.__i_) {}
991 ++__i_;
1002 return __x.__i_ == __y.__i_;
1007 return __x.__i_ != __y.__i_;
1329 return __table_.erase(__first.__i_, __last.__i_);
[all …]
/freebsd/contrib/llvm-project/lldb/source/Plugins/Language/CPlusPlus/
H A DLibCxx.cpp278 auto __i_(valobj_sp->GetChildMemberWithName("__i_")); in Update() local
279 if (!__i_) { in Update()
284 __i_->GetCompilerType().GetTypeTemplateArgument(0)); in Update()