Searched defs:_Compare (Results 1 - 5 of 5) sorted by relevance

/external/stlport/stlport/stl/
H A D_heap.c73 class _Compare>
77 _Distance __topIndex, _Tp __val, _Compare __comp)
89 template <class _RandomAccessIterator, class _Compare, variable
93 _RandomAccessIterator __last, _Compare __comp,
100 template <class _RandomAccessIterator, class _Compare>
103 _Compare __comp)
144 class _Tp, class _Compare>
147 _Distance __len, _Tp __val, _Compare __comp)
169 template <class _RandomAccessIterator, class _Tp, class _Compare>
172 _RandomAccessIterator __last, _Tp*, _Compare __com
212 template <class _RandomAccessIterator, class _Compare, variable
[all...]
H A D_queue.h136 class _Compare = less<_STLP_HEADER_TYPENAME _Sequence::value_type> >
140 template <class _Tp, class _Sequence, class _Compare>
153 typedef less< typename vector<_Tp>::value_type> _Compare; typedef in class:priority_queue
156 typedef priority_queue<_Tp, _Sequence, _Compare> _Self;
168 _Compare comp;
171 explicit priority_queue(const _Compare& __x) : c(), comp(__x) {}
172 priority_queue(const _Compare& __x, const _Sequence& __s)
189 _InputIterator __last, const _Compare& __x)
195 const _Compare& __x, const _Sequence& __s)
207 const _Compare
[all...]
H A D_set.h44 template <class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less<_Key>),
48 : public __stlport_class<set<_Key, _Compare, _Alloc> >
51 typedef set<_Key, _Compare, _Alloc> _Self;
56 typedef _Compare key_compare;
57 typedef _Compare value_compare;
89 explicit set(const _Compare& __comp = _Compare(), argument
93 : _M_t(_Compare(), allocator_type()) {}
94 explicit set(const _Compare& __comp)
96 set(const _Compare
258 multiset(const _Compare& __comp = _Compare(), const allocator_type& __a = allocator_type()) argument
[all...]
H A D_tree.c49 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE _Rb_tree<_Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc>::iterator
50 # define __size_type__ _STLP_TYPENAME_ON_RETURN_TYPE _Rb_tree<_Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc>::size_type
318 template <class _Key, class _Compare, variable
320 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc>& variable
321 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::operator=( variable
322 const _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc>& __x) {
347 template <class _Key, class _Compare, variable
350 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_insert(_Rb_tree_node_base * __parent, variable
384 template <class _Key, class _Compare, variable
387 _Rb_tree<_Key,_Compare,_Valu variable
402 template <class _Key, class _Compare, variable
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) { variable
429 template <class _Key, class _Compare, variable
432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, variable
536 template <class _Key, class _Compare, variable
539 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(iterator __position, variable
621 template <class _Key, class _Compare, variable
624 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_copy(_Rb_tree_node_base* __x, variable
652 template <class _Key, class _Compare, variable
655 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc>::_M_erase(_Rb_tree_node_base *__x) { variable
680 template <class _Key, class _Compare, variable
682 bool _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc>::__rb_verify() const { variable
[all...]
H A 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) {
882 template <class _RandomAccessIter, class _Tp, class _Compare>
885 _Tp __pivot, _Compare __comp) {
906 template <class _RandomAccessIter, class _Tp, class _Compare>
908 _Compare __com
1254 template <class _InputIter, class _RandomAccessIter, class _Compare, variable
[all...]

Completed in 108 milliseconds