Home
last modified time | relevance | path

Searched refs:_Type (Results 1 – 25 of 41) sorted by relevance

12

/freebsd/contrib/llvm-project/libcxx/include/__memory/
H A Duses_allocator_construction.h65 template <class _Type, class _Alloc, class... _Args>
66 _LIBCPP_HIDE_FROM_ABI constexpr _Type __make_obj_using_allocator(const _Alloc& __alloc, _Args&&... …
147 class _Type,
148 … __enable_if_t<__uses_allocator_detail::__uses_allocator_constraints<_Pair, _Type>, int> = 0>
149 …static _LIBCPP_HIDE_FROM_ABI constexpr auto __apply(const _Alloc& __alloc, _Type&& __value) noexce…
162 _Type& __value_;
164 …N constexpr operator _PairMutable() const { return __do_construct(std::forward<_Type>(__value_)); }
171 template <class _Type>
172 struct __uses_allocator_construction_args<_Type, __enable_if_t<!__is_cv_std_pair<_Type>>> {
175 …if constexpr (!uses_allocator_v<remove_cv_t<_Type>, _Alloc> && is_constructible_v<_Type, _Args...>…
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__memory_resource/
H A Dpolymorphic_allocator.h91 template <class _Type>
92 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI _Type* allocate_object(size_t __n = 1) {
93 if (numeric_limits<size_t>::max() / sizeof(_Type) < __n)
95 return static_cast<_Type*>(allocate_bytes(__n * sizeof(_Type), alignof(_Type)));
98 template <class _Type>
99 _LIBCPP_HIDE_FROM_ABI void deallocate_object(_Type* __ptr, size_t __n = 1) {
100 deallocate_bytes(__ptr, __n * sizeof(_Type), alignof(_Type));
103 template <class _Type, class... _CtorArgs>
104 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI _Type* new_object(_CtorArgs&&... __ctor_args) { in new_object()
105 _Type* __ptr = allocate_object<_Type>(); in new_object()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_replace_if.h35 template <class _Iter, class _Sent, class _Type, class _Proj, class _Pred>
37 __replace_if_impl(_Iter __first, _Sent __last, _Pred& __pred, const _Type& __new_value, _Proj& __pr… in __replace_if_impl()
48 class _Type,
51 requires indirectly_writable<_Iter, const _Type&>
53 …operator()(_Iter __first, _Sent __last, _Pred __pred, const _Type& __new_value, _Proj __proj = {})… in operator()
58 class _Type,
61 requires indirectly_writable<iterator_t<_Range>, const _Type&>
63 operator()(_Range&& __range, _Pred __pred, const _Type& __new_value, _Proj __proj = {}) const { in operator()
H A Dranges_replace_copy_if.h39 template <class _InIter, class _Sent, class _OutIter, class _Pred, class _Type, class _Proj>
41 …_InIter __first, _Sent __last, _OutIter __result, _Pred& __pred, const _Type& __new_value, _Proj& … in __replace_copy_if_impl()
58 class _Type,
59 output_iterator<const _Type&> _OutIter,
64 …_InIter __first, _Sent __last, _OutIter __result, _Pred __pred, const _Type& __new_value, _Proj __… in operator()
71 class _Type,
72 output_iterator<const _Type&> _OutIter,
77 …operator()(_Range&& __range, _OutIter __result, _Pred __pred, const _Type& __new_value, _Proj __pr… in operator()
H A Dranges_fill.h32 template <class _Type, output_iterator<const _Type&> _Iter, sentinel_for<_Iter> _Sent>
33 …_LIBCPP_HIDE_FROM_ABI constexpr _Iter operator()(_Iter __first, _Sent __last, const _Type& __value… in operator()
43 template <class _Type, output_range<const _Type&> _Range>
44 …BI constexpr borrowed_iterator_t<_Range> operator()(_Range&& __range, const _Type& __value) const { in operator()
H A Dranges_minmax.h52 template <class _Type,
54 indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
55 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_result<const _Type&>
56 operator()(_LIBCPP_LIFETIMEBOUND const _Type& __a, in operator()
57 _LIBCPP_LIFETIMEBOUND const _Type& __b, in operator()
65 template <copyable _Type,
67 indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
68 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_result<_Type>
69 operator()(initializer_list<_Type> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
73 return ranges::minmax_result<_Type>{*__iters.first, *__iters.second};
H A Dranges_clamp.h34 template <class _Type,
36 indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
37 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr const _Type& operator()( in operator()
38 …const _Type& __value, const _Type& __low, const _Type& __high, _Comp __comp = {}, _Proj __proj = {… in operator()
H A Dranges_contains.h37 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity>
38 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
40 operator()(_Iter __first, _Sent __last, const _Type& __value, _Proj __proj = {}) { in operator()
44 template <input_range _Range, class _Type, class _Proj = identity>
45 …res indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
47 operator()(_Range&& __range, const _Type& __value, _Proj __proj = {}) { in operator()
H A Dranges_lower_bound.h42 class _Type,
44 indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
46 …operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}… in operator()
51 class _Type,
53 …indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::les…
55 operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_count.h38 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity>
39 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
41 operator()(_Iter __first, _Sent __last, const _Type& __value, _Proj __proj = {}) const { in operator()
45 template <input_range _Range, class _Type, class _Proj = identity>
46 …res indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
48 operator()(_Range&& __r, const _Type& __value, _Proj __proj = {}) const { in operator()
H A Dranges_search_n.h43 template <class _Iter1, class _Sent1, class _SizeT, class _Type, class _Pred, class _Proj>
45 …_Iter1 __first, _Sent1 __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj)… in __ranges_search_n_impl()
69 class _Type,
72 requires indirectly_comparable<_Iter, const _Type*, _Pred, _Proj>
77 const _Type& __value, in operator()
83 …template <forward_range _Range, class _Type, class _Pred = ranges::equal_to, class _Proj = identit…
84 requires indirectly_comparable<iterator_t<_Range>, const _Type*, _Pred, _Proj>
86 …_Range&& __range, range_difference_t<_Range> __count, const _Type& __value, _Pred __pred = {}, _Pr… in operator()
H A Dranges_remove.h37 template <permutable _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity>
38 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
40 operator()(_Iter __first, _Sent __last, const _Type& __value, _Proj __proj = {}) const { in operator()
45 template <forward_range _Range, class _Type, class _Proj = identity>
47 … indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
49 operator()(_Range&& __range, const _Type& __value, _Proj __proj = {}) const { in operator()
H A Dranges_upper_bound.h36 class _Type,
38 indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
40 …operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}… in operator()
49 class _Type,
51 …indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::les…
53 operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_binary_search.h38 class _Type,
40 indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
42 …operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}… in operator()
48 class _Type,
50 …indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::les…
52 operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_remove_copy.h45 class _Type,
48 indirect_binary_predicate<ranges::equal_to, projected<_InIter, _Proj>, const _Type*>
50 …operator()(_InIter __first, _Sent __last, _OutIter __result, const _Type& __value, _Proj __proj = … in operator()
55 template <input_range _Range, weakly_incrementable _OutIter, class _Type, class _Proj = identity>
57 … indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
59 operator()(_Range&& __range, _OutIter __result, const _Type& __value, _Proj __proj = {}) const { in operator()
H A Dranges_find_last.h77 template <class _Type>
79 const _Type& __value;
86 template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity>
87 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
89 operator()(_Iter __first, _Sent __last, const _Type& __value, _Proj __proj = {}) { in operator()
90 …return ranges::__find_last_impl(std::move(__first), std::move(__last), __op<_Type>{__value}, __pro…
93 template <forward_range _Range, class _Type, class _Proj = identity>
94 …res indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
96 operator()(_Range&& __range, const _Type& __value, _Proj __proj = {}) { in operator()
97 …return ranges::__find_last_impl(ranges::begin(__range), ranges::end(__range), __op<_Type>{__value}…
H A Dsort.h876 template <class _Type, class... _Options>
877 using __is_any_of _LIBCPP_NODEBUG = _Or<is_same<_Type, _Options>...>;
879 template <class _Type>
881 _Type,
900 template <class _AlgPolicy, class _Type, __enable_if_t<__sort_is_specialized_in_library<_Type>::val…
901 _LIBCPP_HIDE_FROM_ABI void __sort_dispatch(_Type* __first, _Type* __last, __less<>&) { in __sort_dispatch()
902 __less<_Type> __comp; in __sort_dispatch()
903 std::__sort<__less<_Type>&, _Type*>(__first, __last, __comp); in __sort_dispatch()
906 template <class _AlgPolicy, class _Type, __enable_if_t<__sort_is_specialized_in_library<_Type>::val…
907 _LIBCPP_HIDE_FROM_ABI void __sort_dispatch(_Type* __first, _Type* __last, less<_Type>&) { in __sort_dispatch() argument
[all …]
H A Dsearch_n.h34 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class…
36 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl()
71 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class…
73 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl()
115 class _Type,
120 __search_n_impl(_Iter __first, _Sent __last, _DiffT __count, const _Type& __value, _Pred& __pred, _… in __search_n_impl()
128 class _Type,
135 __search_n_impl(_Iter1 __first, _Sent1 __last, _DiffT __count, const _Type& __value, _Pred& __pred,… in __search_n_impl()
H A Dlower_bound.h29 template <class _AlgPolicy, class _Iter, class _Type, class _Proj, class _Comp>
32 const _Type& __value, in __lower_bound_bisecting()
59 template <class _AlgPolicy, class _ForwardIterator, class _Sent, class _Type, class _Proj, class _C…
61 __lower_bound_onesided(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp,… in __lower_bound_onesided()
85 template <class _AlgPolicy, class _ForwardIterator, class _Sent, class _Type, class _Proj, class _C…
87 __lower_bound(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp, _Proj& _… in __lower_bound()
H A Dranges_fill_n.h31 template <class _Type, output_iterator<const _Type&> _Iter>
33 operator()(_Iter __first, iter_difference_t<_Iter> __n, const _Type& __value) const { in operator()
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/
H A Dsearch_n.h31 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class…
33 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl()
68 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class…
70 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl()
112 class _Type,
117 __search_n_impl(_Iter __first, _Sent __last, _DiffT __count, const _Type& __value, _Pred& __pred, _… in __search_n_impl()
125 class _Type,
132 __search_n_impl(_Iter1 __first, _Sent1 __last, _DiffT __count, const _Type& __value, _Pred& __pred,… in __search_n_impl()
H A Dlower_bound.h30 template <class _AlgPolicy, class _Iter, class _Type, class _Proj, class _Comp>
33 const _Type& __value, in __lower_bound_bisecting()
60 template <class _AlgPolicy, class _ForwardIterator, class _Sent, class _Type, class _Proj, class _C…
62 __lower_bound_onesided(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp,… in __lower_bound_onesided()
86 template <class _AlgPolicy, class _ForwardIterator, class _Sent, class _Type, class _Proj, class _C…
88 __lower_bound(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp, _Proj& _… in __lower_bound()
H A Dsort.h925 template <class _Type, class... _Options>
926 using __is_any_of = _Or<is_same<_Type, _Options>...>;
928 template <class _Type>
930 _Type,
949 template <class _AlgPolicy, class _Type, __enable_if_t<__sort_is_specialized_in_library<_Type>::val…
950 _LIBCPP_HIDE_FROM_ABI void __sort_dispatch(_Type* __first, _Type* __last, __less<>&) {
951 __less<_Type> __comp;
952 std::__sort<__less<_Type>&, _Type*>(__first, __last, __comp);
955 template <class _AlgPolicy, class _Type, __enable_if_t<__sort_is_specialized_in_library<_Type>::val…
956 _LIBCPP_HIDE_FROM_ABI void __sort_dispatch(_Type* __first, _Type* __last, less<_Type>&) {
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__memory/
H A Duninitialized_algorithms.h214 template <class _Alloc, class _Type>
215 struct __allocator_has_trivial_copy_construct : _Not<__has_construct<_Alloc, _Type*, const _Type&> …
217 template <class _Type>
218 struct __allocator_has_trivial_copy_construct<allocator<_Type>, _Type> : true_type {};
253 template <class _Alloc, class _Type>
254 struct __allocator_has_trivial_move_construct : _Not<__has_construct<_Alloc, _Type*, _Type&&> > {};
256 template <class _Type>
257 struct __allocator_has_trivial_move_construct<allocator<_Type>, _Type> : true_type {};
/freebsd/contrib/llvm-project/clang/include/clang/Driver/
H A DInputInfo.h54 InputInfo(types::ID _Type, const char *_Filename, const char *_BaseInput) in InputInfo() argument
55 : Kind(Filename), Act(nullptr), Type(_Type), BaseInput(_BaseInput) { in InputInfo()
63 InputInfo(types::ID _Type, const llvm::opt::Arg *_InputArg, in InputInfo() argument
65 : Kind(InputArg), Act(nullptr), Type(_Type), BaseInput(_BaseInput) { in InputInfo()

12