/ndk/sources/cxx-stl/stlport/stlport/stl/ |
_heap.c | 73 class _Compare> 77 _Distance __topIndex, _Tp __val, _Compare __comp) 89 template <class _RandomAccessIterator, class _Compare, 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 __comp [all...] |
_queue.h | 136 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; 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& __x [all...] |
_tree.c | 49 # 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, 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, 384 template <class _Key, class _Compare, 387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) [all...] |
_algo.c | 41 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 __comp) [all...] |
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
_heap.c | 73 class _Compare> 77 _Distance __topIndex, _Tp __val, _Compare __comp) 89 template <class _RandomAccessIterator, class _Compare, 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 __comp [all...] |
_queue.h | 136 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; 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& __x [all...] |
_tree.c | 49 # 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, 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, 384 template <class _Key, class _Compare, 387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) [all...] |
_algo.c | 41 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 __comp) [all...] |
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
_heap.c | 73 class _Compare> 77 _Distance __topIndex, _Tp __val, _Compare __comp) 89 template <class _RandomAccessIterator, class _Compare, 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 __comp [all...] |
_queue.h | 136 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; 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& __x [all...] |
_tree.c | 49 # 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, 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, 384 template <class _Key, class _Compare, 387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) [all...] |
_algo.c | 41 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 __comp) [all...] |
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
_heap.c | 73 class _Compare> 77 _Distance __topIndex, _Tp __val, _Compare __comp) 89 template <class _RandomAccessIterator, class _Compare, 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 __comp [all...] |
_queue.h | 136 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; 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& __x [all...] |
_tree.c | 49 # 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, 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, 384 template <class _Key, class _Compare, 387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) [all...] |
_algo.c | 41 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 __comp) [all...] |
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
_heap.c | 73 class _Compare> 77 _Distance __topIndex, _Tp __val, _Compare __comp) 89 template <class _RandomAccessIterator, class _Compare, 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 __comp [all...] |
_queue.h | 136 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; 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& __x [all...] |
_tree.c | 49 # 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, 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, 384 template <class _Key, class _Compare, 387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) [all...] |
_algo.c | 41 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 __comp) [all...] |
/prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
_heap.c | 73 class _Compare> 77 _Distance __topIndex, _Tp __val, _Compare __comp) 89 template <class _RandomAccessIterator, class _Compare, 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 __comp [all...] |
_queue.h | 136 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; 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& __x [all...] |
_tree.c | 49 # 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, 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, 384 template <class _Key, class _Compare, 387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) [all...] |
_algo.c | 41 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 __comp) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
comutil.h | 123 int _Compare(const _bstr_t &str) const throw(); 206 inline bool _bstr_t::operator==(const _bstr_t &str) const throw() { return _Compare(str)==0; } 207 inline bool _bstr_t::operator!=(const _bstr_t &str) const throw() { return _Compare(str)!=0; } 208 inline bool _bstr_t::operator<(const _bstr_t &str) const throw() { return _Compare(str)<0; } 209 inline bool _bstr_t::operator>(const _bstr_t &str) const throw() { return _Compare(str)>0; } 210 inline bool _bstr_t::operator<=(const _bstr_t &str) const throw() { return _Compare(str)<=0; } 211 inline bool _bstr_t::operator>=(const _bstr_t &str) const throw() { return _Compare(str)>=0; } 266 inline int _bstr_t::_Compare(const _bstr_t &str) const throw() {
|