Home
last modified time | relevance | path

Searched refs:__f2 (Results 1 – 4 of 4) sorted by relevance

/external/libcxx/include/
Dforward_list772 __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
1498 forward_list<_Tp, _Alloc>::__merge(__node_pointer __f1, __node_pointer __f2,
1502 return __f2;
1503 if (__f2 == nullptr)
1506 if (__comp(__f2->__value_, __f1->__value_))
1508 __node_pointer __t = __f2;
1512 __r = __f2;
1513 __f2 = __t->__next_;
1520 while (__f1 != nullptr && __f2 != nullptr)
1522 if (__comp(__f2->__value_, __f1->__value_))
[all …]
Dlist2114 iterator __f2 = __c.begin();
2116 while (__f1 != __e1 && __f2 != __e2)
2118 if (__comp(*__f2, *__f1))
2121 iterator __m2 = _VSTD::next(__f2);
2126 __node_pointer __f = __f2.__ptr_;
2128 __f2 = __m2;
2200 iterator __f2 = __e1 = __sort(__e1, __e2, __n - __n2, __comp);
2201 if (__comp(*__f2, *__f1))
2203 iterator __m2 = _VSTD::next(__f2);
2206 __node_pointer __f = __f2.__ptr_;
[all …]
/external/stlport/stlport/stl/debug/
D_string.h674 const _CharT* __f2, const _CharT* __l2) in _M_compare() argument
675 { return _Base::_M_compare(__f1, __l1, __f2, __l2); } in _M_compare()
677 const _CharT* __f2, const _CharT* __l2) in _M_compare() argument
678 { return _Base::_M_compare(__f1._M_iterator, __l1._M_iterator, __f2, __l2); } in _M_compare()
680 const_iterator __f2, const_iterator __l2) in _M_compare() argument
681 { return _Base::_M_compare(__f1, __l1, __f2._M_iterator, __l2._M_iterator); } in _M_compare()
683 const_iterator __f2, const_iterator __l2) in _M_compare() argument
684 …{ return _Base::_M_compare(__f1._M_iterator, __l1._M_iterator, __f2._M_iterator, __l2._M_iterator)… in _M_compare()
/external/stlport/stlport/stl/
D_string.h1072 const _CharT* __f2, const _CharT* __l2) { in _M_compare() argument
1074 const ptrdiff_t __n2 = __l2 - __f2; in _M_compare()
1075 const int cmp = _Traits::compare(__f1, __f2, (min) (__n1, __n2)); in _M_compare()