Home
last modified time | relevance | path

Searched refs:__t (Results 1 – 25 of 72) sorted by relevance

123

/NextBSD/contrib/libstdc++/include/tr1/
Dtuple_defs.h49 get(tuple<_GLIBCXX_TEMPLATE_ARGS>& __t) in get() argument
51 return __get_helper<__i, tuple<_GLIBCXX_TEMPLATE_ARGS> >::get_value(__t); in get()
56 get(const tuple<_GLIBCXX_TEMPLATE_ARGS>& __t) in get() argument
58 return __get_helper<__i, tuple<_GLIBCXX_TEMPLATE_ARGS> >::get_value(__t); in get()
63 operator==(const tuple<_GLIBCXX_TEMPLATE_ARGS>& __t,
69 tuple_size<_Tp>::value, _Tp, _Up>::__eq(__t, __u);
74 operator<(const tuple<_GLIBCXX_TEMPLATE_ARGS>& __t,
80 tuple_size<_Tp>::value, _Tp, _Up>::__less(__t, __u);
85 operator!=(const tuple<_GLIBCXX_TEMPLATE_ARGS>& __t,
87 { return !(__t == __u); }
[all …]
Dcomplex62 const std::complex<_Tp> __t = std::tr1::asin(__z);
64 return std::complex<_Tp>(__pi_2 - __t.real(), -__t.imag());
98 std::complex<_Tp> __t(-__z.imag(), __z.real());
99 __t = std::tr1::asinh(__t);
100 return std::complex<_Tp>(__t.imag(), -__t.real());
178 std::complex<_Tp> __t((__z.real() - __z.imag())
181 __t = std::sqrt(__t);
183 return std::log(__t + __z);
217 std::complex<_Tp> __t((__z.real() - __z.imag())
220 __t = std::sqrt(__t);
[all …]
Dtuple111 static bool __eq(const _Tp& __t, const _Up& __u)
113 return get<__i>(__t) == get<__i>(__u) &&
114 __tuple_compare<0, __i+1, __j, _Tp, _Up>::__eq(__t, __u);
116 static bool __less(const _Tp& __t, const _Up& __u)
118 return (get<__i>(__t) < get<__i>(__u)) || !(get<__i>(__u) < get<__i>(__t)) &&
119 __tuple_compare<0, __i+1, __j, _Tp, _Up>::__less(__t, __u);
Dref_fwd.h50 ref(_Tp& __t);
55 cref(const _Tp& __t);
/NextBSD/contrib/libstdc++/include/bits/
Dvalarray_before.h70 _Tp operator()(const _Tp& __t) const in operator()
71 { return abs(__t); } in operator()
77 _Tp operator()(const _Tp& __t) const in operator()
78 { return cos(__t); } in operator()
84 _Tp operator()(const _Tp& __t) const in operator()
85 { return acos(__t); } in operator()
91 _Tp operator()(const _Tp& __t) const in operator()
92 { return cosh(__t); } in operator()
98 _Tp operator()(const _Tp& __t) const in operator()
99 { return sin(__t); } in operator()
[all …]
Dvalarray_array.h113 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
116 new(__b++) _Tp(__t);
124 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
127 *__b++ = __t;
134 const _Tp __t)
136 _Array_init_ctor<_Tp, __is_pod<_Tp>::__value>::_S_do_it(__b, __e, __t);
226 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
229 *__a++ = __t;
236 size_t __s, const _Tp& __t)
239 *__a = __t;
[all …]
Dboost_concept_check.h239 void __aux_require_boolean_expr(const _Tp& __t) {
240 bool __x _IsUnused = __t;
468 *__i++ = __t; // require postincrement and assignment
471 _ValueT __t;
731 __c _IsUnused(__n, __t),
734 __c.insert(__p, __t);
735 __c.insert(__p, __n, __t);
748 typename _Sequence::value_type __t;
760 __c.push_front(__t);
764 typename _FrontInsertionSequence::value_type __t;
[all …]
Dvalarray_after.h359 const typename _Dom::value_type& __t) \
364 return _Expr<_Closure, _Value>(_Closure(__v(), __t)); \
371 operator _Op(const typename _Dom::value_type& __t, \
377 return _Expr<_Closure, _Value>(_Closure(__t, __v())); \
504 const typename _Dom::value_type& __t) \
508 return _Expr<_Closure, _Tp>(_Closure(__e(), __t)); \
515 _Fun(const typename _Dom::value_type& __t, \
520 return _Expr<_Closure, _Tp>(_Closure(__t, __e())); \
533 _Fun(const valarray<_Tp>& __v, const _Tp& __t) \
536 return _Expr<_Closure, _Tp>(_Closure(__v, __t)); \
[all …]
Dstl_tree.h673 swap(_Rb_tree& __t);
938 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t)
942 if (__t._M_root() != 0)
944 _M_root() = __t._M_root();
945 _M_leftmost() = __t._M_leftmost();
946 _M_rightmost() = __t._M_rightmost();
949 __t._M_root() = 0;
950 __t._M_leftmost() = __t._M_end();
951 __t._M_rightmost() = __t._M_end();
954 else if (__t._M_root() == 0)
[all …]
/NextBSD/contrib/libstdc++/src/
Dvalarray-inst.cc59 valarray<size_t>& __t = const_cast<valarray<size_t>&>(__a); in __valarray_product() local
60 return __valarray_product(&__t[0], &__t[0] + __n); in __valarray_product()
76 size_t* const __t = static_cast<size_t*> in __gslice_to_index() local
78 __valarray_fill(__t, __n, size_t(0)); in __gslice_to_index()
92 __a += __s[__k] * __t[__k]; in __gslice_to_index()
98 ++__t[__n - 1]; in __gslice_to_index()
101 if (__t[__k2] >= __l[__k2]) in __gslice_to_index()
103 __t[__k2] = 0; in __gslice_to_index()
104 ++__t[__k2 - 1]; in __gslice_to_index()
/NextBSD/contrib/libc++/include/
D__split_buffer424 __split_buffer<value_type, __alloc_rr&> __t(__n, 0, __alloc());
425 __t.__construct_at_end(move_iterator<pointer>(__begin_),
427 _VSTD::swap(__first_, __t.__first_);
428 _VSTD::swap(__begin_, __t.__begin_);
429 _VSTD::swap(__end_, __t.__end_);
430 _VSTD::swap(__end_cap(), __t.__end_cap());
444 __split_buffer<value_type, __alloc_rr&> __t(size(), 0, __alloc());
445 __t.__construct_at_end(move_iterator<pointer>(__begin_),
447 __t.__end_ = __t.__begin_ + (__end_ - __begin_);
448 _VSTD::swap(__first_, __t.__first_);
[all …]
Dtuple219 explicit __tuple_leaf(_Tp&& __t) _NOEXCEPT_((is_nothrow_constructible<_Hp, _Tp>::value))
220 : value(_VSTD::forward<_Tp>(__t))
235 explicit __tuple_leaf(integral_constant<int, 0>, const _Alloc&, _Tp&& __t)
236 : value(_VSTD::forward<_Tp>(__t))
249 explicit __tuple_leaf(integral_constant<int, 1>, const _Alloc& __a, _Tp&& __t)
250 : value(allocator_arg_t(), __a, _VSTD::forward<_Tp>(__t))
263 explicit __tuple_leaf(integral_constant<int, 2>, const _Alloc& __a, _Tp&& __t)
264 : value(_VSTD::forward<_Tp>(__t), __a)
275 __tuple_leaf(const __tuple_leaf& __t) = default;
276 __tuple_leaf(__tuple_leaf&& __t) = default;
[all …]
Dthread291 thread(thread&& __t) _NOEXCEPT : __t_(__t.__t_) {__t.__t_ = 0;}
292 thread& operator=(thread&& __t) _NOEXCEPT;
296 void swap(thread& __t) _NOEXCEPT {_VSTD::swap(__t_, __t.__t_);}
335 __thread_execute(tuple<_Fp, _Args...>& __t, __tuple_indices<_Indices...>)
337 __invoke(_VSTD::move(_VSTD::get<0>(__t)), _VSTD::move(_VSTD::get<_Indices>(__t))...);
395 thread::operator=(thread&& __t) _NOEXCEPT
399 __t_ = __t.__t_;
400 __t.__t_ = 0;
437 sleep_until(const chrono::time_point<_Clock, _Duration>& __t)
443 while (_Clock::now() < __t)
[all …]
Dnumeric117 typename iterator_traits<_InputIterator>::value_type __t(*__first);
118 *__result = __t;
121 __t = __t + *__first;
122 *__result = __t;
136 typename iterator_traits<_InputIterator>::value_type __t(*__first);
137 *__result = __t;
140 __t = __binary_op(__t, *__first);
141 *__result = __t;
D__tree652 {__tree_iterator __t(*this); ++(*this); return __t;}
662 {__tree_iterator __t(*this); --(*this); return __t;}
748 {__tree_const_iterator __t(*this); ++(*this); return __t;}
767 {__tree_const_iterator __t(*this); --(*this); return __t;}
891 __tree(const __tree& __t);
892 __tree& operator=(const __tree& __t);
898 __tree(__tree&& __t)
902 __tree(__tree&& __t, const allocator_type& __a);
903 __tree& operator=(__tree&& __t)
927 void swap(__tree& __t)
[all …]
D__mutex_base122 unique_lock(mutex_type& __m, const chrono::time_point<_Clock, _Duration>& __t)
123 : __m_(&__m), __owns_(__m.try_lock_until(__t)) {}
165 bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __t);
233 unique_lock<_Mutex>::try_lock_until(const chrono::time_point<_Clock, _Duration>& __t)
239 __owns_ = __m_->try_lock_until(__t);
294 const chrono::time_point<_Clock, _Duration>& __t);
299 const chrono::time_point<_Clock, _Duration>& __t,
350 const chrono::time_point<_Clock, _Duration>& __t)
353 wait_for(__lk, __t - _Clock::now());
354 return _Clock::now() < __t ? cv_status::no_timeout : cv_status::timeout;
[all …]
Dfunctional506 auto operator()(_T1&& __t, _T2&& __u) const
507 _NOEXCEPT_(noexcept(_VSTD::forward<_T1>(__t) + _VSTD::forward<_T2>(__u)))
508 -> decltype (_VSTD::forward<_T1>(__t) + _VSTD::forward<_T2>(__u))
509 { return _VSTD::forward<_T1>(__t) + _VSTD::forward<_T2>(__u); }
533 auto operator()(_T1&& __t, _T2&& __u) const
534 _NOEXCEPT_(noexcept(_VSTD::forward<_T1>(__t) - _VSTD::forward<_T2>(__u)))
535 -> decltype (_VSTD::forward<_T1>(__t) - _VSTD::forward<_T2>(__u))
536 { return _VSTD::forward<_T1>(__t) - _VSTD::forward<_T2>(__u); }
560 auto operator()(_T1&& __t, _T2&& __u) const
561 _NOEXCEPT_(noexcept(_VSTD::forward<_T1>(__t) * _VSTD::forward<_T2>(__u)))
[all …]
Dexception188 _LIBCPP_INLINE_VISIBILITY explicit __nested(const _Tp& __t) : _Tp(__t) {}
195 throw_with_nested(_Tp&& __t, typename enable_if<
201 throw_with_nested (_Tp& __t, typename enable_if<
207 throw __nested<typename remove_reference<_Tp>::type>(_VSTD::forward<_Tp>(__t));
215 throw_with_nested(_Tp&& __t, typename enable_if<
221 throw_with_nested (_Tp& __t, typename enable_if<
227 throw _VSTD::forward<_Tp>(__t);
Dvalarray463 explicit __scalar_expr(const value_type& __t, size_t __s) : __t_(__t), __s_(__s) {}
1220 value_type* __t = __vp_;
1222 for (size_t __n = __size_; __n; --__n, __t += __stride_, __s += __sa.__stride_)
1223 *__t = *__s;
1237 value_type* __t = __vp_;
1238 for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
1239 *__t = __v[__i];
1252 value_type* __t = __vp_;
1253 for (size_t __i = 0; __i < __size_; ++__i, __t += __stride_)
1254 *__t *= __v[__i];
[all …]
Dcondition_variable140 const chrono::time_point<_Clock, _Duration>& __t);
145 const chrono::time_point<_Clock, _Duration>& __t,
210 const chrono::time_point<_Clock, _Duration>& __t)
217 return __cv_.wait_until(__lk, __t);
224 const chrono::time_point<_Clock, _Duration>& __t,
228 if (wait_until(__lock, __t) == cv_status::timeout)
D__functional_base72 auto operator()(_T1&& __t, _T2&& __u) const
73 _NOEXCEPT_(noexcept(_VSTD::forward<_T1>(__t) < _VSTD::forward<_T2>(__u)))
74 -> decltype (_VSTD::forward<_T1>(__t) < _VSTD::forward<_T2>(__u))
75 { return _VSTD::forward<_T1>(__t) < _VSTD::forward<_T2>(__u); }
484 ref(_Tp& __t) _NOEXCEPT
486 return reference_wrapper<_Tp>(__t);
492 ref(reference_wrapper<_Tp> __t) _NOEXCEPT
494 return ref(__t.get());
500 cref(const _Tp& __t) _NOEXCEPT
502 return reference_wrapper<const _Tp>(__t);
[all …]
/NextBSD/contrib/gcc/
HDtree.h580 ({ const tree __t = (T); \
581 if (TREE_CODE (__t) != (CODE)) \
582 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
584 __t; })
587 ({ const tree __t = (T); \
588 if (TREE_CODE (__t) == (CODE)) \
589 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
591 __t; })
594 ({ const tree __t = (T); \
595 if (TREE_CODE (__t) != (CODE1) \
[all …]
HDlonglong.h135 UDItype __xr = (X), __t, __a; \
136 __t = __builtin_alpha_cmpbge (0, __xr); \
137 __a = __clz_tab[__t ^ 0xff] - 1; \
138 __t = __builtin_alpha_extbl (__xr, __a); \
139 (COUNT) = 64 - (__clz_tab[__t] + __a*8); \
143 UDItype __xr = (X), __t, __a; \
144 __t = __builtin_alpha_cmpbge (0, __xr); \
145 __t = ~__t & -~__t; \
146 __a = ((__t & 0xCC) != 0) * 2; \
147 __a += ((__t & 0xF0) != 0) * 4; \
[all …]
/NextBSD/contrib/libstdc++/include/std/
Dstd_complex.h205 complex<_Tp>::operator=(const _Tp& __t)
207 _M_real = __t;
215 complex<_Tp>::operator+=(const _Tp& __t)
217 _M_real += __t;
224 complex<_Tp>::operator-=(const _Tp& __t)
226 _M_real -= __t;
233 complex<_Tp>::operator*=(const _Tp& __t)
235 _M_real *= __t;
236 _M_imag *= __t;
243 complex<_Tp>::operator/=(const _Tp& __t)
[all …]
/NextBSD/contrib/libc++/include/experimental/
Dtuple60 decltype(auto) __apply_tuple_impl(_Fn && __f, _Tuple && __t,
64 _VSTD::get<_Id>(_VSTD::forward<_Tuple>(__t))...
70 decltype(auto) apply(_Fn && __f, _Tuple && __t) {
72 _VSTD::forward<_Fn>(__f), _VSTD::forward<_Tuple>(__t),

123