Home
last modified time | relevance | path

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

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_heap.h42 template <class _RandomAccessIterator, class _Compare>
45 _Compare __comp);
66 class _Tp, class _Compare>
69 _Distance __len, _Tp __val, _Compare __comp);
71 template <class _RandomAccessIterator, class _Tp, class _Compare,
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp, in __pop_heap()
83 template <class _RandomAccessIterator, class _Compare>
86 _RandomAccessIterator __last, _Compare __comp);
92 template <class _RandomAccessIterator, class _Compare>
95 _RandomAccessIterator __last, _Compare __comp);
[all …]
D_map.h42 template <class _Key, class _Tp, _STLP_DFL_TMPL_PARAM(_Compare, less<_Key> ), in _STLP_CREATE_ITERATOR_TRAITS()
46 : public __stlport_class<map<_Key, _Tp, _Compare, _Alloc> > in _STLP_CREATE_ITERATOR_TRAITS()
49 typedef map<_Key, _Tp, _Compare, _Alloc> _Self; in _STLP_CREATE_ITERATOR_TRAITS()
58 typedef _Compare key_compare; in _STLP_CREATE_ITERATOR_TRAITS()
62 friend class map<_Key,_Tp,_Compare,_Alloc>; in _STLP_CREATE_ITERATOR_TRAITS()
65 _Compare comp; in _STLP_CREATE_ITERATOR_TRAITS()
66 value_compare(_Compare __c) : comp(__c) {} in _STLP_CREATE_ITERATOR_TRAITS()
99 map() : _M_t(_Compare(), allocator_type()) {} in _STLP_CREATE_ITERATOR_TRAITS()
101 explicit map(const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
104 explicit map(const _Compare& __comp) in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
D_set.h44 template <class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less<_Key>), in _STLP_CREATE_ITERATOR_TRAITS()
48 : public __stlport_class<set<_Key, _Compare, _Alloc> > in _STLP_CREATE_ITERATOR_TRAITS()
51 typedef set<_Key, _Compare, _Alloc> _Self; in _STLP_CREATE_ITERATOR_TRAITS()
56 typedef _Compare key_compare; in _STLP_CREATE_ITERATOR_TRAITS()
57 typedef _Compare value_compare; in _STLP_CREATE_ITERATOR_TRAITS()
89 explicit set(const _Compare& __comp = _Compare(), in _STLP_CREATE_ITERATOR_TRAITS()
93 : _M_t(_Compare(), allocator_type()) {} in _STLP_CREATE_ITERATOR_TRAITS()
94 explicit set(const _Compare& __comp) in _STLP_CREATE_ITERATOR_TRAITS()
96 set(const _Compare& __comp, const allocator_type& __a) in _STLP_CREATE_ITERATOR_TRAITS()
103 : _M_t(_Compare(), allocator_type()) in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
D_heap.c73 class _Compare>
77 _Distance __topIndex, _Tp __val, _Compare __comp) in __push_heap()
89 template <class _RandomAccessIterator, class _Compare,
93 _RandomAccessIterator __last, _Compare __comp, in __push_heap_aux()
100 template <class _RandomAccessIterator, class _Compare>
103 _Compare __comp) in push_heap()
144 class _Tp, class _Compare>
147 _Distance __len, _Tp __val, _Compare __comp) in __adjust_heap()
169 template <class _RandomAccessIterator, class _Tp, class _Compare>
172 _RandomAccessIterator __last, _Tp*, _Compare __comp) in __pop_heap_aux()
[all …]
D_queue.h136 class _Compare = less<_STLP_HEADER_TYPENAME _Sequence::value_type> > in _STLP_RELOPS_OPERATORS()
140 template <class _Tp, class _Sequence, class _Compare> in _STLP_RELOPS_OPERATORS()
153 typedef less< typename vector<_Tp>::value_type> _Compare; in _STLP_RELOPS_OPERATORS() typedef
156 typedef priority_queue<_Tp, _Sequence, _Compare> _Self; in _STLP_RELOPS_OPERATORS()
168 _Compare comp; in _STLP_RELOPS_OPERATORS()
171 explicit priority_queue(const _Compare& __x) : c(), comp(__x) {} in _STLP_RELOPS_OPERATORS()
172 priority_queue(const _Compare& __x, const _Sequence& __s) in _STLP_RELOPS_OPERATORS()
189 _InputIterator __last, const _Compare& __x) in _STLP_RELOPS_OPERATORS()
195 const _Compare& __x, const _Sequence& __s) in _STLP_RELOPS_OPERATORS()
207 const _Compare& __x) in _STLP_RELOPS_OPERATORS()
[all …]
D_algo.h419 template <class _RandomAccessIter, class _Compare>
420 void sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp);
427 template <class _RandomAccessIter, class _Compare>
429 _RandomAccessIter __last, _Compare __comp);
437 template <class _RandomAccessIter, class _Compare>
439 _RandomAccessIter __last, _Compare __comp);
446 template <class _InputIter, class _RandomAccessIter, class _Compare>
450 _RandomAccessIter __result_last, _Compare __comp);
457 template <class _RandomAccessIter, class _Compare>
459 _RandomAccessIter __last, _Compare __comp);
[all …]
D_algo.c41 template <class _BidirectionalIter, class _Distance, class _Compare>
46 _Compare __comp);
50 class _BidirectionalIter3, class _Compare>
56 _Compare __comp);
78 template <class _Tp, class _Compare>
83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) { in __median()
882 template <class _RandomAccessIter, class _Tp, class _Compare>
885 _Tp __pivot, _Compare __comp) { in __unguarded_partition()
906 template <class _RandomAccessIter, class _Tp, class _Compare>
908 _Compare __comp) { in __unguarded_linear_insert()
[all …]
D_tree.c49 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE _Rb_tree<_Key, _Compare, _Value, _KeyOfValue,…
50 # define __size_type__ _STLP_TYPENAME_ON_RETURN_TYPE _Rb_tree<_Key, _Compare, _Value, _KeyOfValue…
318 template <class _Key, class _Compare,
320 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc>&
321 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::operator=(
322 const _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc>& __x) {
347 template <class _Key, class _Compare,
350 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_insert(_Rb_tree_node_base * __parent, in _M_insert()
384 template <class _Key, class _Compare,
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) { in insert_equal()
[all …]
D_tree.h289 template <class _Key, class _Compare,
294 typedef _Rb_tree<_Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc> _Self;
333 _Compare _M_key_compare;
383 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(_Compare())
386 _Rb_tree(const _Compare& __comp)
390 _Rb_tree(const _Compare& __comp, const allocator_type& __a)
419 _Compare key_comp() const { return _M_key_compare; }
666 #define _STLP_TEMPLATE_HEADER template <class _Key, class _Compare, class _Value, class _KeyOfValue…
667 #define _STLP_TEMPLATE_CONTAINER _STLP_PRIV _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Allo…
673 template <class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, class _Alloc>
[all …]
D_algobase.h151 template <class _Tp, class _Compare>
152 inline const _Tp& (min)(const _Tp& __a, const _Tp& __b, _Compare __comp) {
156 template <class _Tp, class _Compare>
157 inline const _Tp& (max)(const _Tp& __a, const _Tp& __b, _Compare __comp) {
161 template <class _Tp, class _Compare>
162 inline const _Tp (min)(const _Tp __a, const _Tp __b, _Compare __comp) { in _Tp()
166 template <class _Tp, class _Compare>
167 inline const _Tp (max)(const _Tp __a, const _Tp __b, _Compare __comp) { in _Tp()
581 template <class _InputIter1, class _InputIter2, class _Compare>
584 _Compare __comp);
D_algobase.c55 template <class _InputIter1, class _InputIter2, class _Compare>
58 _Compare __comp) { in lexicographical_compare()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
D__tree26 template <class _Tp, class _Compare, class _Allocator> class __tree;
31 template <class _Key, class _Tp, class _Compare, class _Allocator>
33 template <class _Key, class _Tp, class _Compare, class _Allocator>
35 template <class _Key, class _Compare, class _Allocator>
37 template <class _Key, class _Compare, class _Allocator>
780 template <class _Tp, class _Compare, class _Allocator>
785 typedef _Compare value_compare;
1123 template <class _Tp, class _Compare, class _Allocator>
1124 __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp)
1133 template <class _Tp, class _Compare, class _Allocator>
[all …]
Dmap436 template <class _Key, class _CP, class _Compare, bool = is_empty<_Compare>::value
438 && !__is_final(_Compare)
442 : private _Compare
447 _NOEXCEPT_(is_nothrow_default_constructible<_Compare>::value)
448 : _Compare() {}
450 __map_value_compare(_Compare c)
451 _NOEXCEPT_(is_nothrow_copy_constructible<_Compare>::value)
452 : _Compare(c) {}
454 const _Compare& key_comp() const _NOEXCEPT {return *this;}
457 {return static_cast<const _Compare&>(*this)(__x.__cc.first, __y.__cc.first);}
[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 …]
Dalgorithm739 template <class _Compare>
742 _Compare __comp_;
743 __debug_less(_Compare& __c) : __comp_(__c) {}
2524 template <class _ForwardIterator, class _Compare>
2527 __min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2539 template <class _ForwardIterator, class _Compare>
2542 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2558 template <class _Tp, class _Compare>
2561 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2576 template<class _Tp, class _Compare>
[all …]
Dset396 template <class _Key, class _Compare = less<_Key>,
404 typedef _Compare key_compare;
655 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
659 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
675 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
680 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
693 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
697 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
710 typename enable_if<__is_transparent<_Compare, _K2>::value,pair<iterator,iterator>>::type
714 …typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::ty…
[all …]
Dforward_list748 template <class _Compare>
750 void merge(forward_list&& __x, _Compare __comp)
755 template <class _Compare> void merge(forward_list& __x, _Compare __comp);
758 template <class _Compare> void sort(_Compare __comp);
769 template <class _Compare>
772 __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
774 template <class _Compare>
777 __sort(__node_pointer __f, difference_type __sz, _Compare& __comp);
1482 template <class _Compare>
1484 forward_list<_Tp, _Alloc>::merge(forward_list& __x, _Compare __comp)
[all …]
/ndk/sources/cxx-stl/stlport/stlport/stl/pointers/
D_set.h55 template <class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less<_Key>),
59 : public __stlport_class<set<_Key, _Compare, _Alloc> >
63 typedef _STLP_PRIV _AssocStorageTypes<_Key, _Compare> _AssocStorageTypes;
67 typedef _STLP_PRIV _AssocStorageTypes<_Key, _Compare>::_KeyStorageType _KeyStorageType;
68 typedef _STLP_PRIV _AssocStorageTypes<_Key, _Compare>::_CompareStorageType _CompareStorageType;
73 typedef set<_Key, _Compare, _Alloc> _Self;
77 typedef _Compare key_compare;
78 typedef _Compare value_compare;
130 explicit set(const _Compare& __comp,
137 : _M_t(_Compare(), _StorageTypeAlloc()) {
[all …]
D_tools.h183 template <class _Tp, class _Compare>
191 typedef typename _IsSTLportClass<_Compare>::_Ret _STLportLess;
195 _BinaryPredWrapper<_KeyStorageType, _Tp, _Compare>,
196 _Compare>::_Ret _CompareStorageType;
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/
D_tree.h49 template <class _Key, class _Compare>
53 _DbgCompare(const _Compare& __cmp) : _M_non_dbg_cmp(__cmp) {} in _DbgCompare()
68 _Compare non_dbg_key_comp() const { return _M_non_dbg_cmp; } in operator()
70 _Compare _M_non_dbg_cmp; in operator()
73 …LP_PRIV _STLP_NON_DBG_NAME(Rb_tree) <_Key, _STLP_PRIV _DbgCompare<_Key, _Compare>, _Value, _KeyOfV…
77 template <class _Key, class _Compare,
82 template <class _Key, class _Compare,
90 template <class _Key, class _Compare,
95 typedef _Rb_tree<_Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc> _Self;
123 _Rb_tree(const _Compare& __comp) in _Rb_tree()
[all …]