Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/libstdc++/include/c_std/
H A Dstd_cmath.h493 { return isgreater(__f1, __f2); } in __capture_isgreater()
502 __capture_isless(_Tp __f1, _Tp __f2) { return isless(__f1, __f2); } in __capture_isless() argument
507 { return islessequal(__f1, __f2); } in __capture_islessequal()
512 { return islessgreater(__f1, __f2); } in __capture_islessgreater()
517 { return isunordered(__f1, __f2); } in __capture_isunordered()
563 isgreater(_Tp __f1, _Tp __f2) in isgreater() argument
568 isgreaterequal(_Tp __f1, _Tp __f2) in isgreaterequal() argument
573 isless(_Tp __f1, _Tp __f2) in isless() argument
578 islessequal(_Tp __f1, _Tp __f2) in islessequal() argument
583 islessgreater(_Tp __f1, _Tp __f2) in islessgreater() argument
[all …]
/freebsd-12.1/contrib/libc++/include/
H A Dforward_list1588 return __f2;
1589 if (__f2 == nullptr)
1594 __node_pointer __t = __f2;
1598 __r = __f2;
1599 __f2 = __t->__next_;
1610 __node_pointer __t = __f2;
1614 __p->__next_ = __f2;
1615 __f2 = __t->__next_;
1621 if (__f2 != nullptr)
1622 __p->__next_ = __f2;
[all …]
H A Dlist2221 iterator __f2 = __c.begin();
2225 if (__comp(*__f2, *__f1))
2235 __f2 = __m2;
2307 if (__comp(*__f2, *__f1))
2312 __link_pointer __f = __f2.__ptr_;
2314 __r = __f2;
2315 __e1 = __f2 = __m2;
2323 while (__f1 != __e1 && __f2 != __e2)
2325 if (__comp(*__f2, *__f1))
2332 if (__e1 == __f2)
[all …]
H A D__string762 _CharT __f2 = *__first2;
769 // Find __f2 the first byte matching in __first1.
770 __first1 = _Traits::find(__first1, __len1 - __len2 + 1, __f2);