Searched refs:_D1 (Results 1 - 3 of 3) sorted by relevance
/freebsd-current/contrib/llvm-project/libcxx/include/__memory/ |
H A D | unique_ptr.h | 457 template <class _T1, class _D1, class _T2, class _D2> 459 operator==(const unique_ptr<_T1, _D1>& __x, const unique_ptr<_T2, _D2>& __y) { 464 template <class _T1, class _D1, class _T2, class _D2> 465 inline _LIBCPP_HIDE_FROM_ABI bool operator!=(const unique_ptr<_T1, _D1>& __x, const unique_ptr<_T2, _D2>& __y) { 470 template <class _T1, class _D1, class _T2, class _D2> 471 inline _LIBCPP_HIDE_FROM_ABI bool operator<(const unique_ptr<_T1, _D1>& __x, const unique_ptr<_T2, _D2>& __y) { 472 typedef typename unique_ptr<_T1, _D1>::pointer _P1; 478 template <class _T1, class _D1, class _T2, class _D2> 479 inline _LIBCPP_HIDE_FROM_ABI bool operator>(const unique_ptr<_T1, _D1>& __x, const unique_ptr<_T2, _D2>& __y) { 483 template <class _T1, class _D1, clas [all...] |
/freebsd-current/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | is_permutation.h | 80 using _D1 = __iter_diff_t<_Iter1>; 92 _D1 __c2 = 0; 101 _D1 __c1 = 1; 128 using _D1 = __iter_diff_t<_ForwardIterator1>; 129 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1); 130 if (__l1 == _D1(1)) 175 using _D1 = __iter_diff_t<_Iter1>; 176 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
|
H A D | find_end.h | 152 typedef typename iterator_traits<_Iter1>::difference_type _D1; typedef 162 const _Iter1 __s = __first1 + _D1(__len2 - 1); // End of pattern match can't go before here
|
Completed in 120 milliseconds