Home
last modified time | relevance | path

Searched refs:__value_ (Results 1 – 25 of 34) sorted by relevance

12

/freebsd-13.1/contrib/llvm-project/libcxx/include/__ranges/
H A Dnon_propagating_cache.h45 optional<_Tp> __value_ = nullopt; variable
52 : __value_(nullopt) in __non_propagating_cache()
57 : __value_(nullopt) in __non_propagating_cache()
59 __other.__value_.reset(); in __non_propagating_cache()
65 __value_.reset();
72 __value_.reset();
73 __other.__value_.reset();
78 constexpr _Tp& operator*() { return *__value_; }
80 constexpr _Tp const& operator*() const { return *__value_; }
83 constexpr bool __has_value() const { return __value_.has_value(); } in __has_value()
[all …]
/freebsd-13.1/contrib/llvm-project/libcxx/include/
H A Dcompare238 _ValueT __value_;
273 return __v.__value_ < 0;
281 return __v.__value_ > 0;
289 return 0 < __v.__value_;
297 return 0 > __v.__value_;
313 _ValueT __value_;
354 return __v.__value_ < 0;
362 return __v.__value_ > 0;
370 return 0 < __v.__value_;
378 return 0 > __v.__value_;
[all …]
H A Dforward_list281 value_type __value_;
424 __get_unsafe_node_pointer()->__value_);}
1138 return base::__before_begin()->__next_->__value_;
1175 __node_traits::destroy(__a, _VSTD::addressof(__p->__value_));
1517 if (__i.__get_begin()->__next_->__value_ == __v)
1545 if (__pred(__i.__get_begin()->__next_->__value_))
1608 if (__comp(__f2->__value_, __f1->__value_))
1612 __comp(__t->__next_->__value_, __f1->__value_))
1624 if (__comp(__f2->__value_, __f1->__value_))
1628 __comp(__t->__next_->__value_, __f1->__value_))
[all …]
H A D__tree753 __node_value_type __value_;
837 {return __get_np()->__value_;}
918 {return __get_np()->__value_;}
1762 __cache.__get()->__value_ = _VSTD::move(__t.remove(__t.begin())->__value_);
2214 __nd->__value_ = __v;
2493 if (value_comp()(__k, __rt->__value_))
2514 if (value_comp()(__k, __rt->__value_))
2621 if (value_comp()(__k, __rt->__value_))
2649 if (value_comp()(__k, __rt->__value_))
2677 if (value_comp()(__k, __rt->__value_))
[all …]
H A Dlist272 _Tp __value_;
362 return __ptr_->__as_node()->__value_;
489 return __ptr_->__as_node()->__value_;
980 return base::__end_.__next_->__as_node()->__value_;
986 return base::__end_.__next_->__as_node()->__value_;
992 return base::__end_.__prev_->__as_node()->__value_;
998 return base::__end_.__prev_->__as_node()->__value_;
1664 return __hold.release()->__value_;
1686 return __hold.release()->__value_;
1766 __node_alloc_traits::destroy(__na, _VSTD::addressof(__np->__value_));
[all …]
H A D__node_handle163 return static_cast<_Derived const*>(this)->__ptr_->__value_;
177 __ptr_->__value_.__ref().first;
184 __ptr_->__value_.__ref().second;
H A D__hash_table101 __node_value_type __value_;
326 return __node_->__upcast()->__value_;
447 return __node_->__upcast()->__value_;
559 return __node_->__upcast()->__value_;
704 return __node_->__upcast()->__value_;
1652 __cache->__upcast()->__value_ =
1713 __cache->__upcast()->__value_ = *__first;
1910 __nd->__hash_ = hash_function()(__nd->__value_);
2016 __cp->__hash_ = hash_function()(__cp->__value_);
2037 if (__p != end() && key_eq()(*__p, __cp->__value_))
[all …]
H A Doptional368 __raw_type* __value_;
388 : __value_(nullptr) {}
393 : __value_(_VSTD::addressof(__uarg))
401 _LIBCPP_CONSTEXPR_AFTER_CXX17 void reset() noexcept { __value_ = nullptr; }
405 { return __value_ != nullptr; }
409 { return *__value_; }
413 { return _VSTD::forward<value_type>(*__value_); }
423 __value_ = _VSTD::addressof(__val);
441 *__value_ = _VSTD::forward<_That>(__opt).__get();
/freebsd-13.1/contrib/llvm-project/libcxx/include/__algorithm/
H A Dsearch_n.h29 … _Size __count, const _Tp& __value_, _BinaryPredicate __pred, in __search_n() argument
38 if (__pred(*__first, __value_)) in __search_n()
50 if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first in __search_n()
63 … const _Tp& __value_, _BinaryPredicate __pred, in __search_n() argument
76 if (__pred(*__first, __value_)) in __search_n()
87 if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first in __search_n()
99 …_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_, _BinaryPred… in search_n() argument
101 __first, __last, _VSTD::__convert_to_integral(__count), __value_, __pred, in search_n()
107 search_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) { in search_n() argument
109 …return _VSTD::search_n(__first, __last, _VSTD::__convert_to_integral(__count), __value_, __equal_t… in search_n()
H A Dequal_range.h31 __equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __co… in __equal_range() argument
40 if (__comp(*__m, __value_)) in __equal_range()
45 else if (__comp(__value_, *__m)) in __equal_range()
55 _VSTD::__lower_bound<_Compare>(__first, __m, __value_, __comp), in __equal_range()
56 _VSTD::__upper_bound<_Compare>(++__mp1, __last, __value_, __comp) in __equal_range()
67 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in equal_range() argument
70 return _VSTD::__equal_range<_Comp_ref>(__first, __last, __value_, __comp); in equal_range()
77 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) in equal_range() argument
79 return _VSTD::equal_range(__first, __last, __value_, in equal_range()
H A Dbinary_search.h30 __binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __… in __binary_search() argument
32 __first = _VSTD::__lower_bound<_Compare>(__first, __last, __value_, __comp); in __binary_search()
33 return __first != __last && !__comp(__value_, *__first); in __binary_search()
40 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __co… in binary_search() argument
43 return _VSTD::__binary_search<_Comp_ref>(__first, __last, __value_, __comp); in binary_search()
50 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) in binary_search() argument
52 return _VSTD::binary_search(__first, __last, __value_, in binary_search()
H A Dfill.h29 __fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) in __fill() argument
32 *__first = __value_; in __fill()
38 __fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_acc… in __fill() argument
40 _VSTD::fill_n(__first, __last - __first, __value_); in __fill()
46 fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) in fill() argument
48 …_VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_cate… in fill()
H A Dlower_bound.h28 __lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __co… in __lower_bound() argument
37 if (__comp(*__m, __value_)) in __lower_bound()
52 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in lower_bound() argument
55 return _VSTD::__lower_bound<_Comp_ref>(__first, __last, __value_, __comp); in lower_bound()
62 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) in lower_bound() argument
64 return _VSTD::lower_bound(__first, __last, __value_, in lower_bound()
H A Dupper_bound.h28 __upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __co… in __upper_bound() argument
37 if (__comp(__value_, *__m)) in __upper_bound()
52 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in upper_bound() argument
55 return _VSTD::__upper_bound<_Comp_ref>(__first, __last, __value_, __comp); in upper_bound()
62 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) in upper_bound() argument
64 return _VSTD::upper_bound(__first, __last, __value_, in upper_bound()
H A Dfill_n.h28 __fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) in __fill_n() argument
31 *__first = __value_; in __fill_n()
38 fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) in fill_n() argument
40 return _VSTD::__fill_n(__first, _VSTD::__convert_to_integral(__n), __value_); in fill_n()
H A Dremove.h28 remove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) in remove() argument
30 __first = _VSTD::find(__first, __last, __value_); in remove()
36 if (!(*__i == __value_)) in remove()
H A Dfind.h26 find(_InputIterator __first, _InputIterator __last, const _Tp& __value_) { in find() argument
28 if (*__first == __value_) in find()
H A Dremove_copy.h26 …_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) in remove_copy() argument
30 if (!(*__first == __value_)) in remove_copy()
H A Dcount.h28 count(_InputIterator __first, _InputIterator __last, const _Tp& __value_) { in count() argument
31 if (*__first == __value_) in count()
/freebsd-13.1/contrib/llvm-project/libcxx/include/__iterator/
H A Dfront_insert_iterator.h52 …TEXPR_AFTER_CXX17 front_insert_iterator& operator=(const typename _Container::value_type& __value_)
53 {container->push_front(__value_); return *this;}
55 …_CONSTEXPR_AFTER_CXX17 front_insert_iterator& operator=(typename _Container::value_type&& __value_)
56 {container->push_front(_VSTD::move(__value_)); return *this;}
H A Dback_insert_iterator.h52 …STEXPR_AFTER_CXX17 back_insert_iterator& operator=(const typename _Container::value_type& __value_)
53 {container->push_back(__value_); return *this;}
55 …P_CONSTEXPR_AFTER_CXX17 back_insert_iterator& operator=(typename _Container::value_type&& __value_)
56 {container->push_back(_VSTD::move(__value_)); return *this;}
H A Distream_iterator.h48 _Tp __value_; variable
50 …IBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR istream_iterator() : __in_stream_(nullptr), __value_() {} in istream_iterator()
53 if (!(*__in_stream_ >> __value_)) in istream_iterator()
57 _LIBCPP_INLINE_VISIBILITY const _Tp& operator*() const {return __value_;}
61 if (!(*__in_stream_ >> __value_))
H A Dinsert_iterator.h54 …P_CONSTEXPR_AFTER_CXX17 insert_iterator& operator=(const typename _Container::value_type& __value_)
55 {iter = container->insert(iter, __value_); ++iter; return *this;}
57 …LIBCPP_CONSTEXPR_AFTER_CXX17 insert_iterator& operator=(typename _Container::value_type&& __value_)
58 {iter = container->insert(iter, _VSTD::move(__value_)); ++iter; return *this;}
H A Dostream_iterator.h58 _LIBCPP_INLINE_VISIBILITY ostream_iterator& operator=(const _Tp& __value_)
60 *__out_stream_ << __value_;
/freebsd-13.1/contrib/llvm-project/libcxx/include/__memory/
H A Dcompressed_pair.h43 __compressed_pair_elem(__value_init_tag) : __value_() {} in __compressed_pair_elem()
51 : __value_(_VSTD::forward<_Up>(__u)) in __compressed_pair_elem()
61 : __value_(_VSTD::forward<_Args>(_VSTD::get<_Indexes>(__args))...) {} in __compressed_pair_elem()
65 _LIBCPP_INLINE_VISIBILITY reference __get() _NOEXCEPT { return __value_; } in __get()
67 const_reference __get() const _NOEXCEPT { return __value_; } in __get()
70 _Tp __value_;

12