Home
last modified time | relevance | path

Searched refs:_Compare (Results 1 – 25 of 35) sorted by relevance

12

/openbsd/src/gnu/lib/libstdc++/libstdc++/include/bits/
Dstl_multiset.h71 template <class _Key, class _Compare = less<_Key>,
75 template <class _Key, class _Compare, class _Alloc>
76 inline bool operator==(const multiset<_Key,_Compare,_Alloc>& __x,
77 const multiset<_Key,_Compare,_Alloc>& __y);
79 template <class _Key, class _Compare, class _Alloc>
80 inline bool operator<(const multiset<_Key,_Compare,_Alloc>& __x,
81 const multiset<_Key,_Compare,_Alloc>& __y);
83 template <class _Key, class _Compare, class _Alloc>
88 __glibcpp_class_requires4(_Compare, bool, _Key, _Key, _BinaryFunctionConcept);
96 typedef _Compare key_compare;
[all …]
Dstl_set.h71 template <class _Key, class _Compare = less<_Key>,
75 template <class _Key, class _Compare, class _Alloc>
76 inline bool operator==(const set<_Key,_Compare,_Alloc>& __x,
77 const set<_Key,_Compare,_Alloc>& __y);
79 template <class _Key, class _Compare, class _Alloc>
80 inline bool operator<(const set<_Key,_Compare,_Alloc>& __x,
81 const set<_Key,_Compare,_Alloc>& __y);
84 template <class _Key, class _Compare, class _Alloc>
89 __glibcpp_class_requires4(_Compare, bool, _Key, _Key, _BinaryFunctionConcept);
95 typedef _Compare key_compare;
[all …]
Dstl_multimap.h71 typename _Compare = less<_Key>,
75 template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
76 inline bool operator==(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
77 const multimap<_Key,_Tp,_Compare,_Alloc>& __y);
79 template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
80 inline bool operator<(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
81 const multimap<_Key,_Tp,_Compare,_Alloc>& __y);
104 template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
109 __glibcpp_class_requires4(_Compare, bool, _Key, _Key, _BinaryFunctionConcept)
115 typedef _Compare key_compare;
[all …]
Dstl_map.h89 template <typename _Key, typename _Tp, typename _Compare = less<_Key>,
95 __glibcpp_class_requires4(_Compare, bool, _Key, _Key, _BinaryFunctionConcept)
101 typedef _Compare key_compare;
106 friend class map<_Key,_Tp,_Compare,_Alloc>;
108 _Compare comp;
109 value_compare(_Compare __c) : comp(__c) {} in value_compare()
144 map() : _M_t(_Compare(), allocator_type()) { } in map()
151 map(const _Compare& __comp, const allocator_type& __a = allocator_type())
175 : _M_t(_Compare(), allocator_type()) in map()
191 const _Compare& __comp, const allocator_type& __a = allocator_type())
[all …]
Dstl_tree.h585 typename _Compare, typename _Alloc = allocator<_Val> >
645 _Compare _M_key_compare;
724 _Rb_tree(const _Compare& __comp) in _Rb_tree()
728 _Rb_tree(const _Compare& __comp, const allocator_type& __a) in _Rb_tree()
732 _Rb_tree(const _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>& __x) in _Rb_tree() argument
750 _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>&
751 operator=(const _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>& __x);
765 _Compare
802 swap(_Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>& __t) in swap() argument
889 typename _Compare, typename _Alloc>
[all …]
Dstl_heap.h101 typename _Compare>
104 _Distance __topIndex, _Tp __value, _Compare __comp) in __push_heap()
115 template<typename _RandomAccessIterator, typename _Compare>
118 _Compare __comp) in push_heap()
179 typename _Tp, typename _Compare>
182 _Distance __len, _Tp __value, _Compare __comp) in __adjust_heap()
200 template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
203 _RandomAccessIterator __result, _Tp __value, _Compare __comp) in __pop_heap()
211 template<typename _RandomAccessIterator, typename _Compare>
214 _RandomAccessIterator __last, _Compare __comp) in pop_heap()
[all …]
Dstl_algo.h118 template<typename _Tp, typename _Compare>
120 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) in __median()
123 __glibcpp_function_requires(_BinaryFunctionConcept<_Compare,bool,_Tp,_Tp>) in __median()
1906 template<typename _RandomAccessIter, typename _Tp, typename _Compare>
1909 _Tp __pivot, _Compare __comp) in __unguarded_partition()
1957 template<typename _RandomAccessIter, typename _Tp, typename _Compare>
1959 __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val, _Compare __comp) in __unguarded_linear_insert()
1999 template<typename _RandomAccessIter, typename _Compare>
2002 _Compare __comp) in __insertion_sort()
2038 template<typename _RandomAccessIter, typename _Compare>
[all …]
Dstl_queue.h304 typename _Compare = less<typename _Sequence::value_type> >
313 __glibcpp_class_requires4(_Compare, bool, _Tp, _Tp, _BinaryFunctionConcept)
325 _Compare comp;
332 priority_queue(const _Compare& __x = _Compare(),
353 const _Compare& __x = _Compare(),
/openbsd/src/gnu/gcc/libstdc++-v3/include/bits/
Dstl_multiset.h88 template <class _Key, class _Compare = std::less<_Key>, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
95 __glibcxx_class_requires4(_Compare, bool, _Key, _Key, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
103 typedef _Compare key_compare; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
104 typedef _Compare value_compare; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
137 : _M_t(_Compare(), allocator_type()) { } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
140 multiset(const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
155 : _M_t(_Compare(), allocator_type()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
171 const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
183 multiset(const multiset<_Key,_Compare,_Alloc>& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
193 multiset<_Key,_Compare,_Alloc>& in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
Dstl_set.h91 template<class _Key, class _Compare = std::less<_Key>, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
98 __glibcxx_class_requires4(_Compare, bool, _Key, _Key, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
108 typedef _Compare key_compare; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
109 typedef _Compare value_compare; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
141 : _M_t(_Compare(), allocator_type()) {} in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
150 set(const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
165 : _M_t(_Compare(), allocator_type()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
181 const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
193 set(const set<_Key,_Compare,_Alloc>& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
203 set<_Key,_Compare,_Alloc>& in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
Dstl_multimap.h90 typename _Compare = std::less<_Key>, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
98 typedef _Compare key_compare; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
105 __glibcxx_class_requires4(_Compare, bool, _Key, _Key, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
113 friend class multimap<_Key, _Tp, _Compare, _Alloc>; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
115 _Compare comp; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
117 value_compare(_Compare __c) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
155 : _M_t(_Compare(), allocator_type()) { } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
162 multimap(const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
187 : _M_t(_Compare(), allocator_type()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
203 const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
Dstl_tree.h328 typename _Compare, typename _Alloc = allocator<_Val> >
446 _Rb_tree_impl<_Compare> _M_impl;
571 _Rb_tree(const _Compare& __comp)
575 _Rb_tree(const _Compare& __comp, const allocator_type& __a)
579 _Rb_tree(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)
594 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
595 operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x);
598 _Compare
656 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t);
752 typename _Compare, typename _Alloc>
[all …]
Dstl_map.h91 template <typename _Key, typename _Tp, typename _Compare = std::less<_Key>, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
99 typedef _Compare key_compare; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
106 __glibcxx_class_requires4(_Compare, bool, _Key, _Key, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
114 friend class map<_Key, _Tp, _Compare, _Alloc>; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
116 _Compare comp; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
118 value_compare(_Compare __c) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
158 : _M_t(_Compare(), allocator_type()) { } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
165 map(const _Compare& __comp, const allocator_type& __a = allocator_type()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
189 : _M_t(_Compare(), allocator_type()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
205 const _Compare& __comp, const allocator_type& __a = allocator_type()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
Dstl_heap.h160 typename _Compare>
163 _Distance __topIndex, _Tp __value, _Compare __comp) in __push_heap()
187 template<typename _RandomAccessIterator, typename _Compare>
190 _Compare __comp) in push_heap()
270 typename _Tp, typename _Compare>
273 _Distance __len, _Tp __value, _Compare __comp) in __adjust_heap()
294 template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
297 _RandomAccessIterator __result, _Tp __value, _Compare __comp) in __pop_heap()
317 template<typename _RandomAccessIterator, typename _Compare>
320 _RandomAccessIterator __last, _Compare __comp) in pop_heap()
[all …]
Dstl_algo.h119 template<typename _Tp, typename _Compare>
121 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) in __median()
124 __glibcxx_function_requires(_BinaryFunctionConcept<_Compare,bool,_Tp,_Tp>) in __median()
2270 template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
2274 _Tp __pivot, _Compare __comp) in __unguarded_partition()
2323 template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
2326 _Compare __comp) in __unguarded_linear_insert()
2371 template<typename _RandomAccessIterator, typename _Compare>
2374 _RandomAccessIterator __last, _Compare __comp) in __insertion_sort()
2414 template<typename _RandomAccessIterator, typename _Compare>
[all …]
Dstl_queue.h321 typename _Compare = less<typename _Sequence::value_type> >
330 __glibcxx_class_requires4(_Compare, bool, _Tp, _Tp,
343 _Compare comp;
350 priority_queue(const _Compare& __x = _Compare(),
372 const _Compare& __x = _Compare(),
/openbsd/src/gnu/gcc/libstdc++-v3/include/debug/
Dset.h46 template<typename _Key, typename _Compare = std::less<_Key>,
49 : public _GLIBCXX_STD::set<_Key,_Compare,_Allocator>,
50 public __gnu_debug::_Safe_sequence<set<_Key, _Compare, _Allocator> >
52 typedef _GLIBCXX_STD::set<_Key,_Compare,_Allocator> _Base;
59 typedef _Compare key_compare;
60 typedef _Compare value_compare;
78 explicit set(const _Compare& __comp = _Compare(),
84 const _Compare& __comp = _Compare(),
89 set(const set<_Key,_Compare,_Allocator>& __x) in set() argument
96 set<_Key,_Compare,_Allocator>&
[all …]
Dmultiset.h46 template<typename _Key, typename _Compare = std::less<_Key>,
49 : public _GLIBCXX_STD::multiset<_Key, _Compare, _Allocator>,
50 public __gnu_debug::_Safe_sequence<multiset<_Key, _Compare, _Allocator> >
52 typedef _GLIBCXX_STD::multiset<_Key, _Compare, _Allocator> _Base;
59 typedef _Compare key_compare;
60 typedef _Compare value_compare;
78 explicit multiset(const _Compare& __comp = _Compare(),
84 const _Compare& __comp = _Compare(),
89 multiset(const multiset<_Key,_Compare,_Allocator>& __x) in multiset() argument
96 multiset<_Key,_Compare,_Allocator>&
[all …]
Dmultimap.h46 template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>,
49 : public _GLIBCXX_STD::multimap<_Key, _Tp, _Compare, _Allocator>,
50 public __gnu_debug::_Safe_sequence<multimap<_Key,_Tp,_Compare,_Allocator> >
52 typedef _GLIBCXX_STD::multimap<_Key, _Tp, _Compare, _Allocator> _Base;
60 typedef _Compare key_compare;
80 explicit multimap(const _Compare& __comp = _Compare(),
86 const _Compare& __comp = _Compare(),
91 multimap(const multimap<_Key,_Tp,_Compare,_Allocator>& __x) in multimap() argument
98 multimap<_Key,_Tp,_Compare,_Allocator>&
99 operator=(const multimap<_Key,_Tp,_Compare,_Allocator>& __x)
[all …]
Dmap.h46 template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>,
49 : public _GLIBCXX_STD::map<_Key, _Tp, _Compare, _Allocator>,
50 public __gnu_debug::_Safe_sequence<map<_Key, _Tp, _Compare, _Allocator> >
52 typedef _GLIBCXX_STD::map<_Key, _Tp, _Compare, _Allocator> _Base;
60 typedef _Compare key_compare;
80 explicit map(const _Compare& __comp = _Compare(),
86 const _Compare& __comp = _Compare(),
91 map(const map<_Key,_Tp,_Compare,_Allocator>& __x) in map() argument
98 map<_Key,_Tp,_Compare,_Allocator>&
99 operator=(const map<_Key,_Tp,_Compare,_Allocator>& __x)
[all …]
/openbsd/src/gnu/llvm/libcxx/include/
Dqueue494 class _Compare = less<typename _Container::value_type> >
499 typedef _Compare value_compare;
643 template <class _Compare,
645 class = enable_if_t<!__is_allocator<_Compare>::value>,
648 priority_queue(_Compare, _Container)
649 -> priority_queue<typename _Container::value_type, _Container, _Compare>;
652 class _Compare = less<__iter_value_type<_InputIterator>>,
655 class = enable_if_t<!__is_allocator<_Compare>::value>,
658 priority_queue(_InputIterator, _InputIterator, _Compare = _Compare(), _Container = _Container())
659 -> priority_queue<__iter_value_type<_InputIterator>, _Container, _Compare>;
[all …]
D__tree60 template <class _Tp, class _Compare, class _Allocator> class __tree;
991 template<class _Tp, class _Compare>
993 _LIBCPP_DIAGNOSE_WARNING(!__invokable<_Compare const&, _Tp const&, _Tp const&>::value,
998 template <class _Tp, class _Compare, class _Allocator>
1003 typedef _Compare value_compare;
1548 template <class _Tp, class _Compare, class _Allocator>
1549 __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp)
1558 template <class _Tp, class _Compare, class _Allocator>
1559 __tree<_Tp, _Compare, _Allocator>::__tree(const allocator_type& __a)
1567 template <class _Tp, class _Compare, class _Allocator>
[all …]
Dset510 template <class _Key, class _Compare, class _Allocator>
513 template <class _Key, class _Compare = less<_Key>,
521 typedef __type_identity_t<_Compare> key_compare;
677 static_assert(sizeof(__diagnose_non_const_comparator<_Key, _Compare>()), "");
850 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
854 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
864 typename enable_if<__is_transparent<_Compare, _K2>::value,size_type>::type
873 typename enable_if<__is_transparent<_Compare, _K2>::value, bool>::type
886 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
891 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
[all …]
Dmap572 template <class _Key, class _CP, class _Compare,
573 bool = is_empty<_Compare>::value && !__libcpp_is_final<_Compare>::value>
575 : private _Compare
580 _NOEXCEPT_(is_nothrow_default_constructible<_Compare>::value)
581 : _Compare() {}
583 __map_value_compare(_Compare __c)
584 _NOEXCEPT_(is_nothrow_copy_constructible<_Compare>::value)
585 : _Compare(__c) {}
587 const _Compare& key_comp() const _NOEXCEPT {return *this;}
590 … {return static_cast<const _Compare&>(*this)(__x.__get_value().first, __y.__get_value().first);}
[all …]
/openbsd/src/gnu/llvm/libcxx/include/experimental/
Dset50 template <class _Value, class _Compare = less<_Value>>
51 using set = _VSTD::set<_Value, _Compare,
54 template <class _Value, class _Compare = less<_Value>>
55 using multiset = _VSTD::multiset<_Value, _Compare,

12