| /haiku/headers/cpp/ |
| H A D | stl_multiset.h | 42 template <class _Key, class _Compare = less<_Key>,
45 template <class _Key, class _Compare,
54 typedef _Compare key_compare;
55 typedef _Compare value_compare;
75 multiset() : _M_t(_Compare(), allocator_type()) {}
76 explicit multiset(const _Compare& __comp,
84 : _M_t(_Compare(), allocator_type())
89 const _Compare& __comp,
96 : _M_t(_Compare(), allocator_type())
100 const _Compare
[all...] |
| H A D | stl_set.h | 42 template <class _Key, class _Compare = less<_Key>,
45 template <class _Key, class _Compare,
54 typedef _Compare key_compare;
55 typedef _Compare value_compare;
75 set() : _M_t(_Compare(), allocator_type()) {}
76 explicit set(const _Compare& __comp,
83 : _M_t(_Compare(), allocator_type())
87 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
92 : _M_t(_Compare(), allocator_type())
96 const value_type* __last, const _Compare
[all...] |
| H A D | stl_map.h | 42 template <class _Key, class _Tp, class _Compare = less<_Key>,
45 template <class _Key, class _Tp, class _Compare,
57 typedef _Compare key_compare;
61 friend class map<_Key,_Tp,_Compare,_Alloc>;
63 _Compare _M_comp;
64 value_compare(_Compare __c) : _M_comp(__c) {}
90 map() : _M_t(_Compare(), allocator_type()) {}
91 explicit map(const _Compare& __comp,
98 : _M_t(_Compare(), allocator_type())
102 map(_InputIterator __first, _InputIterator __last, const _Compare
[all...] |
| H A D | stl_multimap.h | 42 template <class _Key, class _Tp, class _Compare = less<_Key>,
45 template <class _Key, class _Tp, class _Compare,
57 typedef _Compare key_compare;
60 friend class multimap<_Key,_Tp,_Compare,_Alloc>;
62 _Compare _M_comp;
63 value_compare(_Compare __c) : _M_comp(__c) {}
89 multimap() : _M_t(_Compare(), allocator_type()) { }
90 explicit multimap(const _Compare& __comp,
97 : _M_t(_Compare(), allocator_type())
102 const _Compare
[all...] |
| H A D | stl_heap.h | 73 class _Compare>
76 _Distance __topIndex, _Tp __value, _Compare __comp)
87 template <class _RandomAccessIterator, class _Compare,
91 _RandomAccessIterator __last, _Compare __comp,
98 template <class _RandomAccessIterator, class _Compare>
101 _Compare __comp)
154 class _Tp, class _Compare>
157 _Distance __len, _Tp __value, _Compare __comp)
175 template <class _RandomAccessIterator, class _Tp, class _Compare,
179 _RandomAccessIterator __result, _Tp __value, _Compare __com
[all...] |
| H A D | stl_tree.h | 521 template <class _Key, class _Value, class _KeyOfValue, class _Compare,
579 _Compare _M_key_compare;
648 _Rb_tree(const _Compare& __comp)
652 _Rb_tree(const _Compare& __comp, const allocator_type& __a)
656 _Rb_tree(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x)
671 _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>&
672 operator=(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x);
685 _Compare key_comp() const { return _M_key_compare; }
702 void swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __t) {
760 class _Compare, clas
1316 rb_tree(const _Compare& __comp = _Compare(), const allocator_type& __a = allocator_type()) argument
[all...] |
| H A D | stl_queue.h | 115 class _Compare = less<typename _Sequence::value_type> >
117 template <class _Tp, class _Sequence, class _Compare>
129 _Compare comp;
132 explicit priority_queue(const _Compare& __x) : c(), comp(__x) {}
133 priority_queue(const _Compare& __x, const _Sequence& __s)
144 _InputIterator __last, const _Compare& __x)
150 const _Compare& __x, const _Sequence& __s)
162 const _Compare& __x)
167 const _Compare& __x, const _Sequence& __c)
|
| H A D | stl_algo.h | 61 template <class _Tp, class _Compare>
63 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) {
1128 template <class _RandomAccessIter, class _Tp, class _Compare>
1131 _Tp __pivot, _Compare __comp)
1162 template <class _RandomAccessIter, class _Tp, class _Compare>
1164 _Compare __comp) {
1187 template <class _RandomAccessIter, class _Tp, class _Compare>
1189 _RandomAccessIter __last, _Tp*, _Compare __comp) {
1206 template <class _RandomAccessIter, class _Compare>
1208 _RandomAccessIter __last, _Compare __com
[all...] |
| H A D | stl_algobase.h | 102 template <class _Tp, class _Compare>
103 inline const _Tp& min(const _Tp& __a, const _Tp& __b, _Compare __comp) {
107 template <class _Tp, class _Compare>
108 inline const _Tp& max(const _Tp& __a, const _Tp& __b, _Compare __comp) {
420 template <class _InputIter1, class _InputIter2, class _Compare>
423 _Compare __comp) {
|
| /haiku/headers/private/kernel/util/ |
| H A D | AVLTree.h | 80 inline int _Compare(const Key& a, const Value* b);
81 inline int _Compare(const Value* a, const Value* b);
391 return _Compare(*(const Key*)key, _GetValue(node));
400 return _Compare(_GetValue(node1), _GetValue(node2));
422 AVLTree<Definition>::_Compare(const Key& a, const Value* b) function in class:AVLTree
430 AVLTree<Definition>::_Compare(const Value* a, const Value* b) function in class:AVLTree
|
| /haiku/src/add-ons/kernel/file_systems/bfs/ |
| H A D | Journal.cpp | 34 static int _Compare(block_run& a, block_run& b);
234 run_array::_Compare(block_run& a, block_run& b) function in class:run_array
253 int cmp = _Compare(runs[i], run);
262 if (_Compare(runs[i], run) < 0)
266 if (_Compare(runs[i], run) > 0)
|