Home
last modified time | relevance | path

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

/NextBSD/contrib/libstdc++/include/debug/
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 …]
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 …]
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;
78 explicit map(const _Compare& __comp = _Compare(),
84 const _Compare& __comp = _Compare(),
89 map(const map<_Key,_Tp,_Compare,_Allocator>& __x) in map() argument
96 map<_Key,_Tp,_Compare,_Allocator>&
97 operator=(const map<_Key,_Tp,_Compare,_Allocator>& __x)
[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;
78 explicit multimap(const _Compare& __comp = _Compare(),
84 const _Compare& __comp = _Compare(),
89 multimap(const multimap<_Key,_Tp,_Compare,_Allocator>& __x) in multimap() argument
96 multimap<_Key,_Tp,_Compare,_Allocator>&
97 operator=(const multimap<_Key,_Tp,_Compare,_Allocator>& __x)
[all …]
Dlist463 template<class _Compare>
465 merge(list& __x, _Compare __comp)
/NextBSD/contrib/libstdc++/include/bits/
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()
150 set(const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
181 const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
519 template<class _Key, class _Compare, class _Alloc>
521 operator==(const set<_Key, _Compare, _Alloc>& __x,
522 const set<_Key, _Compare, _Alloc>& __y)
536 template<class _Key, class _Compare, class _Alloc>
[all …]
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()
140 multiset(const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
171 const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
505 template <class _Key, class _Compare, class _Alloc>
507 operator==(const multiset<_Key, _Compare, _Alloc>& __x,
508 const multiset<_Key, _Compare, _Alloc>& __y)
522 template <class _Key, class _Compare, class _Alloc>
[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()
162 multimap(const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
203 const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
610 template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
612 operator==(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
[all …]
Dstl_tree.h330 typename _Compare, typename _Alloc = allocator<_Val> >
466 _Rb_tree_impl<_Compare> _M_impl;
591 _Rb_tree(const _Compare& __comp,
615 _Compare
769 typename _Compare, typename _Alloc>
771 operator==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
772 const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
779 typename _Compare, typename _Alloc>
781 operator<(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
782 const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
[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()
165 map(const _Compare& __comp, const allocator_type& __a = allocator_type()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
205 const _Compare& __comp, const allocator_type& __a = allocator_type()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
680 template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
682 operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x,
[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(),
Dstl_algobase.h224 template<typename _Tp, typename _Compare>
226 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
244 template<typename _Tp, typename _Compare>
246 max(const _Tp& __a, const _Tp& __b, _Compare __comp)
874 typename _Compare>
878 _Compare __comp)
/NextBSD/contrib/libc++/include/
D__tree26 template <class _Tp, class _Compare, class _Allocator> class __tree;
788 template <class _Tp, class _Compare, class _Allocator>
793 typedef _Compare value_compare;
1109 template <class _Tp, class _Compare, class _Allocator>
1110 __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp)
1119 template <class _Tp, class _Compare, class _Allocator>
1120 __tree<_Tp, _Compare, _Allocator>::__tree(const allocator_type& __a)
1128 template <class _Tp, class _Compare, class _Allocator>
1129 __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp,
1139 template <class _Tp, class _Compare, class _Allocator>
[all …]
Dmap452 template <class _Key, class _CP, class _Compare,
453 bool = is_empty<_Compare>::value && !__libcpp_is_final<_Compare>::value
456 : private _Compare
461 _NOEXCEPT_(is_nothrow_default_constructible<_Compare>::value)
462 : _Compare() {}
464 __map_value_compare(_Compare c)
465 _NOEXCEPT_(is_nothrow_copy_constructible<_Compare>::value)
466 : _Compare(c) {}
468 const _Compare& key_comp() const _NOEXCEPT {return *this;}
471 {return static_cast<const _Compare&>(*this)(__x.__cc.first, __y.__cc.first);}
[all …]
Dalgorithm741 template <class _Compare>
744 _Compare __comp_;
745 __debug_less(_Compare& __c) : __comp_(__c) {}
2552 template <class _ForwardIterator, class _Compare>
2555 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2578 template <class _Tp, class _Compare>
2581 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2596 template<class _Tp, class _Compare>
2599 min(initializer_list<_Tp> __t, _Compare __comp)
2616 template <class _ForwardIterator, class _Compare>
[all …]
Dqueue385 class _Compare = less<typename _Container::value_type> >
390 typedef _Compare value_compare;
498 template <class _Tp, class _Container, class _Compare>
500 priority_queue<_Tp, _Container, _Compare>::priority_queue(const _Compare& __comp,
510 template <class _Tp, class _Container, class _Compare>
512 priority_queue<_Tp, _Container, _Compare>::priority_queue(const value_compare& __comp,
522 template <class _Tp, class _Container, class _Compare>
525 priority_queue<_Tp, _Container, _Compare>::priority_queue(_InputIter __f, _InputIter __l,
533 template <class _Tp, class _Container, class _Compare>
536 priority_queue<_Tp, _Container, _Compare>::priority_queue(_InputIter __f, _InputIter __l,
[all …]
Dset398 template <class _Key, class _Compare = less<_Key>,
406 typedef _Compare key_compare;
657 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
661 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
671 typename enable_if<__is_transparent<_Compare, _K2>::value,size_type>::type
683 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
688 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
701 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
705 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
718 typename enable_if<__is_transparent<_Compare, _K2>::value,pair<iterator,iterator>>::type
[all …]
Dforward_list728 template <class _Compare>
730 void merge(forward_list&& __x, _Compare __comp)
735 template <class _Compare> void merge(forward_list& __x, _Compare __comp);
738 template <class _Compare> void sort(_Compare __comp);
749 template <class _Compare>
752 __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
754 template <class _Compare>
757 __sort(__node_pointer __f, difference_type __sz, _Compare& __comp);
1463 template <class _Compare>
1465 forward_list<_Tp, _Alloc>::merge(forward_list& __x, _Compare __comp)
[all …]
/NextBSD/contrib/libstdc++/include/ext/
Drb_tree81 template <class _Key, class _Value, class _KeyOfValue, class _Compare,
84 : public _Rb_tree<_Key, _Value, _KeyOfValue, _Compare, _Alloc>
86 typedef _Rb_tree<_Key, _Value, _KeyOfValue, _Compare, _Alloc> _Base;
89 rb_tree(const _Compare& __comp = _Compare(),
Dbitmap_allocator.h252 template<typename _ForwardIterator, typename _Tp, typename _Compare>
255 const _Tp& __val, _Compare __comp)
/NextBSD/contrib/libstdc++/
DChangeLog-2002278 _RandomAccessIter2, _Distance, _Compare), lower_bound(_ForwardIter,
280 const _Tp&, _Compare), upper_bound(_ForwardIter, _ForwardIter,
282 _Compare), equal_range(_ForwardIter, _ForwardIter, const _Tp&),
283 equal_range(_ForwardIter, _ForwardIter, const _Tp&, _Compare),
287 _Distance, _Distance, _Compare), __rotate_adaptive(_BidirectionalIter1,
293 _Pointer, _Distance, _Compare), inplace_merge(_BidirectionalIter,
296 _Compare), __find_end(_BidirectionalIter1, _BidirectionalIter1,
DChangeLog-2005523 _BinaryPredicateConcept<_Compare, _InputValueType, _OutputValueType>
526 (binary_search): Remove redundant _BinaryPredicateConcept<_Compare,
DChangeLog-20044174 specialized on whether the _Compare parameter is a POD type or
4176 member, otherwise it makes the _Compare parameter a base class of