Home
last modified time | relevance | path

Searched refs:equal_to (Results 1 – 25 of 69) sorted by relevance

123

/freebsd/contrib/llvm-project/libcxx/include/experimental/
H A Dunordered_set
H A Dunordered_map
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__functional/
H A Doperations.h103 struct _LIBCPP_TEMPLATE_VIS equal_to : __binary_function<_Tp, _Tp, bool> { struct
107 _LIBCPP_CTAD_SUPPORTED_FOR_TYPE(equal_to); argument
112 inline const bool __desugars_to_v<__equal_tag, equal_to<_Tp>, _Tp, _Tp> = true;
116 inline const bool __desugars_to_v<__equal_tag, equal_to<void>, _Tp, _Up> = true;
/freebsd/contrib/llvm-project/libcxx/include/
H A Dunordered_set24 template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
201 class Pred = equal_to<typename iterator_traits<InputIterator>::value_type>,
210 class Pred = equal_to<ranges::range_value_t<R>>,
216 class Pred = equal_to<T>, class Allocator = allocator<T>>
225 equal_to<typename iterator_traits<InputIterator>::value_type>,
232 equal_to<typename iterator_traits<InputIterator>::value_type>,
238 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
243 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
248 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
252 -> unordered_set<T, hash<T>, equal_to<T>, Allocator>; // C++17
[all …]
H A Dunordered_map22 template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
233 class Hash = hash<iter_key_t<InputIterator>>, class Pred = equal_to<iter_key_t<InputIterator>>,
241 class Pred = equal_to<range-key-type<R>>,
248 class Pred = equal_to<Key>, class Allocator = allocator<pair<const Key, T>>>
256 hash<iter_key_t<InputIterator>>, equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
261 hash<iter_key_t<InputIterator>>, equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
266 equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
271 equal_to<range-key-type<R>>, Allocator>; // C++23
276 equal_to<range-key-type<R>>, Allocator>; // C++23
281 equal_to<range-key-type<R>>, Allocator>; // C++23
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_adjacent_find.h39 …direct_binary_predicate<projected<_Iter, _Proj>, projected<_Iter, _Proj>> _Pred = ranges::equal_to>
48 _Pred = ranges::equal_to>
H A Dranges_contains.h38 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
45 …requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _…
H A Dranges_count.h39 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
46 …requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _…
H A Dranges_remove.h38 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
47 … indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
H A Dranges_replace.h38 indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type1*>
47 … indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type1*>
H A Dranges_unique.h47 indirect_equivalence_relation<projected<_Iter, _Proj>> _Comp = ranges::equal_to>
57 … indirect_equivalence_relation<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::equal_to>
H A Dranges_remove_copy.h48 indirect_binary_predicate<ranges::equal_to, projected<_InIter, _Proj>, const _Type*>
57 … indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
H A Dranges_starts_with.h40 class _Pred = ranges::equal_to,
65 class _Pred = ranges::equal_to,
H A Dranges_contains_subrange.h43 class _Pred = ranges::equal_to,
65 class _Pred = ranges::equal_to,
H A Dranges_replace_copy.h49 indirect_binary_predicate<ranges::equal_to, projected<_InIter, _Proj>, const _OldType*>
68 … indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _OldType*>
H A Dranges_find_end.h43 class _Pred = ranges::equal_to,
70 class _Pred = ranges::equal_to,
H A Dranges_find.h53 requires indirect_binary_predicate<ranges::equal_to, projected<_Ip, _Proj>, const _Tp*>
60 …requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Rp>, _Proj>, const _Tp*>
H A Dranges_find_first_of.h58 class _Pred = ranges::equal_to,
76 class _Pred = ranges::equal_to,
H A Dranges_is_permutation.h57 …quivalence_relation<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Pred = ranges::equal_to>
75 … projected<iterator_t<_Range2>, _Proj2>> _Pred = ranges::equal_to>
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A Dunordered_set24 template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
201 class Pred = equal_to<typename iterator_traits<InputIterator>::value_type>,
210 class Pred = equal_to<ranges::range_value_t<R>>,
216 class Pred = equal_to<T>, class Allocator = allocator<T>>
225 equal_to<typename iterator_traits<InputIterator>::value_type>,
232 equal_to<typename iterator_traits<InputIterator>::value_type>,
238 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
243 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
248 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23
252 -> unordered_set<T, hash<T>, equal_to<T>, Allocator>; // C++17
[all …]
H A Dalgorithm68 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
74 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
79 requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
83 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
106 requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
111 indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
194 requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
199 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
247 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
253 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
[all …]
H A Dunordered_map22 template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
233 class Hash = hash<iter_key_t<InputIterator>>, class Pred = equal_to<iter_key_t<InputIterator>>,
241 class Pred = equal_to<range-key-type<R>>,
248 class Pred = equal_to<Key>, class Allocator = allocator<pair<const Key, T>>>
256 hash<iter_key_t<InputIterator>>, equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
261 hash<iter_key_t<InputIterator>>, equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
266 equal_to<iter_key_t<InputIterator>>, Allocator>; // C++17
271 equal_to<range-key-type<R>>, Allocator>; // C++23
276 equal_to<range-key-type<R>>, Allocator>; // C++23
281 equal_to<range-key-type<R>>, Allocator>; // C++23
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRDFRegisters.h173 bool equal_to(RegisterRef A, RegisterRef B) const;
337 template <> struct equal_to<llvm::rdf::RegisterRef> {
338 constexpr equal_to(const llvm::rdf::PhysicalRegisterInfo &pri) : PRI(&pri) {}
341 return PRI->equal_to(A, B);
349 template <> struct equal_to<llvm::rdf::RegisterAggr> {
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DSMTAPI.h69 return LHS.equal_to(RHS);
81 virtual bool equal_to(SMTSort const &other) const = 0;
118 return LHS.equal_to(RHS);
130 virtual bool equal_to(SMTExpr const &other) const = 0;
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h88 class _BinaryPredicate = equal_to<>>
99 is_same_v<_BinaryPredicate, equal_to<>>>;
219 class _BinaryPredicate = equal_to<>>
230 is_same_v<_BinaryPredicate, equal_to<>>>;

123