Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_minmax.h84 using _ValueT = range_value_t<_Range>; local
90 if constexpr (contiguous_range<_Range> && is_integral_v<_ValueT> &&
91 __is_cheap_to_copy<_ValueT> & __is_identity<_Proj>::value &&
92 __desugars_to_v<__less_tag, _Comp, _ValueT, _ValueT>) {
93 minmax_result<_ValueT> __result = {__r[0], __r[0]};
105 if constexpr (!same_as<remove_cvref_t<range_reference_t<_Range>>, _ValueT> ||
110 minmax_result<_ValueT> __result = {*__first, __result.min};
127 ranges::minmax_result<_ValueT> __result = {*__first, __result.min};
137 _ValueT __i = *__first;
/freebsd/contrib/llvm-project/libcxx/include/__compare/
H A Dordering.h44 using _ValueT = signed char; in _CmpUnspecifiedParam()
46 _LIBCPP_HIDE_FROM_ABI explicit constexpr partial_ordering(_OrdResult __v) noexcept : __value_(_ValueT(__v)) {}
48 _LIBCPP_HIDE_FROM_ABI explicit constexpr partial_ordering(_NCmpResult __v) noexcept : __value_(_ValueT(__v)) {}
51 return __value_ != _ValueT(_NCmpResult::__unordered); variable
111 _ValueT __value_;
120 using _ValueT = signed char;
122 _LIBCPP_HIDE_FROM_ABI explicit constexpr weak_ordering(_OrdResult __v) noexcept : __value_(_ValueT(__v)) {}
182 _ValueT __value_;
190 using _ValueT = signed char;
192 _LIBCPP_HIDE_FROM_ABI explicit constexpr strong_ordering(_OrdResult __v) noexcept : __value_(_ValueT(__
140 using _ValueT = signed char; global() variable
224 using _ValueT = signed char; global() variable
[all...]
/freebsd/contrib/llvm-project/libcxx/include/experimental/
H A Ddeque
H A Dforward_list
H A Dlist
H A Dvector
/freebsd/contrib/llvm-project/libcxx/include/
H A Dmap2159 template <class _KeyT, class _ValueT, class _CompareT = std::less<_KeyT>>
2161 std::map<_KeyT, _ValueT, _CompareT, polymorphic_allocator<std::pair<const _KeyT, _ValueT>>>;
2163 template <class _KeyT, class _ValueT, class _CompareT = std::less<_KeyT>>
2165 … std::multimap<_KeyT, _ValueT, _CompareT, polymorphic_allocator<std::pair<const _KeyT, _ValueT>>>;
H A Dunordered_map2519 template <class _KeyT, class _ValueT, class _HashT = std::hash<_KeyT>, class _PredT = std::equal_to…
2521 …std::unordered_map<_KeyT, _ValueT, _HashT, _PredT, polymorphic_allocator<std::pair<const _KeyT, _V…
2523 template <class _KeyT, class _ValueT, class _HashT = std::hash<_KeyT>, class _PredT = std::equal_to…
2525 …std::unordered_multimap<_KeyT, _ValueT, _HashT, _PredT, polymorphic_allocator<std::pair<const _Key…
H A Dforward_list1552 template <class _ValueT>
1553 …forward_list _LIBCPP_AVAILABILITY_PMR = std::forward_list<_ValueT, polymorphic_allocator<_ValueT>>;
H A Dlist1721 template <class _ValueT>
1722 using list _LIBCPP_AVAILABILITY_PMR = std::list<_ValueT, polymorphic_allocator<_ValueT>>;
H A Ddeque2601 template <class _ValueT>
2602 using deque _LIBCPP_AVAILABILITY_PMR = std::deque<_ValueT, polymorphic_allocator<_ValueT>>;
H A Dvector3008 template <class _ValueT>
3009 using vector _LIBCPP_AVAILABILITY_PMR = std::vector<_ValueT, polymorphic_allocator<_ValueT>>;