| /third_party/boost/boost/mp11/ |
| D | tuple.hpp | 34 template<class F, class Tp, std::size_t... J> BOOST_MP11_CONSTEXPR auto tuple_apply_impl( F && f, T… in tuple_apply_impl()
35 -> decltype( std::forward<F>(f)( std::get<J>(std::forward<Tp>(tp))... ) ) in tuple_apply_impl()
37 return std::forward<F>(f)( std::get<J>(std::forward<Tp>(tp))... ); in tuple_apply_impl()
42 template<class F, class Tp,
43 … class Seq = make_index_sequence<std::tuple_size<typename std::remove_reference<Tp>::type>::value>>
44 BOOST_MP11_CONSTEXPR auto tuple_apply( F && f, Tp && tp ) in tuple_apply()
45 -> decltype( detail::tuple_apply_impl( std::forward<F>(f), std::forward<Tp>(tp), Seq() ) ) in tuple_apply()
47 return detail::tuple_apply_impl( std::forward<F>(f), std::forward<Tp>(tp), Seq() ); in tuple_apply()
54 template<class T, class Tp, std::size_t... J> BOOST_MP11_CONSTEXPR T construct_from_tuple_impl( Tp … in construct_from_tuple_impl()
56 return T( std::get<J>(std::forward<Tp>(tp))... ); in construct_from_tuple_impl()
[all …]
|
| /third_party/boost/libs/mp11/doc/mp11/ |
| D | tuple.adoc | 18 template<class F, class Tp> constexpr /*...*/ tuple_apply(F&& f, Tp&& tp);
20 `tuple_apply(f, tp)` returns `std::forward<F>(f)(std::get<J>(std::forward<Tp>(tp))...)` for `J` in …
21 where `N` is `std::tuple_size<typename std::remove_reference<Tp>::type>::value`. Same as `std::appl…
25 template<class T, class Tp> T construct_from_tuple(Tp&& tp);
27 `construct_from_tuple<T>(tp)` returns `T(std::get<J>(std::forward<Tp>(tp))...)` for `J` in 0..`N-1`,
28 where `N` is `std::tuple_size<typename std::remove_reference<Tp>::type>::value`. Same as `std::make…
33 template<class Tp, class F> constexpr F tuple_for_each(Tp&& tp, F&& f);
36 … `f(std::get<J>(std::forward<Tp>(tp)))` for `J` in 0..`N-1`, where `N` is `std::tuple_size<typenam…
42 template<class F, class... Tp> constexpr /*...*/ tuple_transform(F const& f, Tp&&... tp);
49 the expression `f(std::get<J>(std::forward<Tp>(tp))...)` for `J` in 0..`N-1`, where `N` is the leng…
|
| D | examples.adoc | 193 template<class R, class...Is, class... Ks, class Tp>
194 R tuple_cat_( mp_list<Is...>, mp_list<Ks...>, Tp tp )
199 template<class... Tp,
200 class R = mp_append<std::tuple<>, typename std::remove_reference<Tp>::type...>>
201 R tuple_cat( Tp &&... tp )
203 std::size_t const N = sizeof...(Tp);
208 mp_rename<typename std::remove_reference<Tp>::type, mp_list>...>;
225 std::forward_as_tuple( std::forward<Tp>(tp)... ) );
255 that `Tp` that we're passing to the helper `tuple_cat_` is (correctly) `tuple<unique_ptr<int>&&, un…
261 template<class R, class...Is, class... Ks, class Tp>
[all …]
|
| /third_party/boost/boost/detail/ |
| D | binary_search.hpp | 36 template <class ForwardIter, class Tp>
38 const Tp& val) in lower_bound()
61 template <class ForwardIter, class Tp, class Compare>
63 const Tp& val, Compare comp) in lower_bound()
86 template <class ForwardIter, class Tp>
88 const Tp& val) in upper_bound()
111 template <class ForwardIter, class Tp, class Compare>
113 const Tp& val, Compare comp) in upper_bound()
136 template <class ForwardIter, class Tp>
138 equal_range(ForwardIter first, ForwardIter last, const Tp& val) in equal_range()
[all …]
|
| /third_party/boost/boost/thread/detail/ |
| D | move.hpp | 311 template <class Tp>
312 struct remove_reference : boost::remove_reference<Tp> {};
313 template <class Tp>
314 struct decay : boost::decay<Tp> {};
316 template <class Tp>
319 typedef Tp type;
321 template <class Tp>
322 struct remove_reference<Tp&>
324 typedef Tp type;
326 template <class Tp>
[all …]
|
| /third_party/boost/libs/unordered/test/unordered/ |
| D | minimal_allocator.cpp | 12 template <class Tp> struct SimpleAllocator
14 typedef Tp value_type;
20 Tp* allocate(std::size_t n) in allocate()
22 return static_cast<Tp*>(::operator new(n * sizeof(Tp))); in allocate()
25 void deallocate(Tp* p, std::size_t) { ::operator delete((void*)p); } in deallocate()
|
| /third_party/boost/libs/mp11/test/ |
| D | tuple_transform_2.cpp | 38 template<class Tp> struct test_element
40 Tp& tp;
156 using Tp = mp_rename<mp_iota< mp_int<N> >, std::tuple>; in main() typedef
158 auto const r = tuple_transform( q, Tp(), Tp(), Tp(), Tp() ); in main()
160 mp_for_each<Tp>( test_element<decltype(r)>{ r } ); in main()
|
| /third_party/json/benchmarks/thirdparty/benchmark/src/ |
| D | log.h | 19 template <class Tp>
20 friend LogType& operator<<(LogType&, Tp const&);
29 template <class Tp>
30 LogType& operator<<(LogType& log, Tp const& value) {
|
| D | sysinfo.cc | 179 template <class Tp,
180 class = typename std::enable_if<std::is_integral<Tp>::value>::type>
181 bool GetSysctl(std::string const& Name, Tp* Out) { in GetSysctl()
185 *Out = static_cast<Tp>(Buff.GetAsUnsigned()); in GetSysctl()
189 template <class Tp, size_t N>
190 bool GetSysctl(std::string const& Name, std::array<Tp, N>* Out) { in GetSysctl() argument
193 *Out = Buff.GetAsArray<Tp, N>(); in GetSysctl()
|
| /third_party/benchmark/src/ |
| D | log.h | 19 template <class Tp>
20 friend LogType& operator<<(LogType&, Tp const&);
29 template <class Tp>
30 LogType& operator<<(LogType& log, Tp const& value) {
|
| D | sysinfo.cc | 187 template <class Tp,
188 class = typename std::enable_if<std::is_integral<Tp>::value>::type>
189 bool GetSysctl(std::string const& Name, Tp* Out) { in GetSysctl()
193 *Out = static_cast<Tp>(Buff.GetAsUnsigned()); in GetSysctl()
197 template <class Tp, size_t N>
198 bool GetSysctl(std::string const& Name, std::array<Tp, N>* Out) { in GetSysctl() argument
201 *Out = Buff.GetAsArray<Tp, N>(); in GetSysctl()
|
| /third_party/boost/boost/graph/detail/ |
| D | sparse_ordering.hpp | 113 template < typename Tp, typename Sequence = std::deque< Tp > >
114 class sparse_ordering_queue : public boost::queue< Tp, Sequence >
119 typedef queue< Tp, Sequence > base;
126 inline Tp& operator[](int n) { return this->c[n]; } in operator []()
|
| /third_party/boost/libs/tuple/test/ |
| D | std_tuple_element.cpp | 19 template<class Tp, std::size_t I, class E> void test() in test()
21 BOOST_TEST_TRAIT_TRUE((boost::is_same<typename std::tuple_element<I, Tp>::type, E>)); in test()
23 typedef typename Tp::inherited Tp2; in test()
|
| D | std_tuple_size.cpp | 18 template<class Tp> void test( std::size_t x ) in test()
20 BOOST_TEST_EQ( std::tuple_size< Tp >::value, x ); in test()
21 BOOST_TEST_EQ( std::tuple_size< typename Tp::inherited >::value, x ); in test()
|
| /third_party/boost/boost/variant/detail/ |
| D | multivisitors_cpp11_based.hpp | 56 template <typename Tp, bool MoveSemantics>
57 MoveableWrapper<Tp, MoveSemantics>
58 wrap(Tp& t) in wrap()
60 return MoveableWrapper<Tp, MoveSemantics>{t}; in wrap()
|
| /third_party/boost/libs/mp11/doc/article/ |
| D | simple_cxx11_metaprogramming.adoc | 655 template<class... Tp,
656 class R = mp_append<typename std::remove_reference<Tp>::type...>>
657 R tuple_cat( Tp &&... tp );
675 template<class... Tp,
676 class R = mp_append<std::tuple<>, typename std::remove_reference<Tp>::type...>>
677 R tuple_cat( Tp &&... tp );
788 template<class... Tp,
789 class R = mp_append<std::tuple<>, typename std::remove_reference<Tp>::type...>>
790 R tuple_cat( Tp &&... tp )
792 std::size_t const N = sizeof...(Tp);
[all …]
|
| /third_party/json/benchmarks/thirdparty/benchmark/include/benchmark/ |
| D | benchmark.h | 305 template <class Tp>
307 void DoNotOptimize(Tp const& value) { in DoNotOptimize()
311 template <class Tp>
312 inline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp& value) { in DoNotOptimize()
326 template <class Tp>
327 inline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp const& value) { in DoNotOptimize()
336 template <class Tp>
337 inline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp const& value) { in DoNotOptimize()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonTargetTransformInfo.h | 113 unsigned getAddressComputationCost(Type *Tp, ScalarEvolution *SE,
120 unsigned getShuffleCost(TTI::ShuffleKind Kind, Type *Tp, int Index,
|
| /third_party/benchmark/include/benchmark/ |
| D | benchmark.h | 412 template <class Tp>
413 inline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp const& value) { in DoNotOptimize()
417 template <class Tp>
418 inline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp& value) { in DoNotOptimize()
432 template <class Tp>
433 inline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp const& value) { in DoNotOptimize()
442 template <class Tp>
443 inline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp const& value) { in DoNotOptimize()
|
| /third_party/mbedtls/tests/data_files/ |
| D | rsa_pkcs8_pbes2_pbkdf2_1024_3des_sha224.pem | 6 /Tkmk+sE3Lx+sBMqe/rpBeZM31fB9ShS9FgDGfE+ARvzcuQslYNazdT2KVeu+5Tp
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | IVDescriptors.cpp | 748 Type *Tp) { in getRecurrenceIdentity() argument
754 return ConstantInt::get(Tp, 0); in getRecurrenceIdentity()
757 return ConstantInt::get(Tp, 1); in getRecurrenceIdentity()
760 return ConstantInt::get(Tp, -1, true); in getRecurrenceIdentity()
763 return ConstantFP::get(Tp, 1.0L); in getRecurrenceIdentity()
766 return ConstantFP::get(Tp, 0.0L); in getRecurrenceIdentity()
|
| /third_party/boost/boost/geometry/srs/projections/proj/ |
| D | omerc.hpp | 124 T u, v, Qp, Sp, Tp, Vp, Up; in inv() local
135 Tp = .5 * (Qp + 1. / Qp); in inv()
137 Up = (Vp * this->m_proj_parm.cosgam + Sp * this->m_proj_parm.singam) / Tp; in inv()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | TargetTransformInfo.h | 919 int getShuffleCost(ShuffleKind Kind, Type *Tp, int Index = 0,
1019 unsigned getNumberOfParts(Type *Tp) const;
1320 virtual int getShuffleCost(ShuffleKind Kind, Type *Tp, int Index,
1357 virtual unsigned getNumberOfParts(Type *Tp) = 0;
1724 int getShuffleCost(ShuffleKind Kind, Type *Tp, int Index, in getShuffleCost() argument
1726 return Impl.getShuffleCost(Kind, Tp, Index, SubTp); in getShuffleCost()
1789 unsigned getNumberOfParts(Type *Tp) override { in getNumberOfParts() argument
1790 return Impl.getNumberOfParts(Tp); in getNumberOfParts()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARM/ |
| D | ARMTargetTransformInfo.cpp | 575 int ARMTTIImpl::getShuffleCost(TTI::ShuffleKind Kind, Type *Tp, int Index, in getShuffleCost() argument
593 std::pair<int, MVT> LT = TLI->getTypeLegalizationCost(DL, Tp); in getShuffleCost()
615 std::pair<int, MVT> LT = TLI->getTypeLegalizationCost(DL, Tp); in getShuffleCost()
640 std::pair<int, MVT> LT = TLI->getTypeLegalizationCost(DL, Tp); in getShuffleCost()
656 std::pair<int, MVT> LT = TLI->getTypeLegalizationCost(DL, Tp); in getShuffleCost()
663 int BaseCost = ST->hasMVEIntegerOps() && Tp->isVectorTy() in getShuffleCost()
666 return BaseCost * BaseT::getShuffleCost(Kind, Tp, Index, SubTp); in getShuffleCost()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/SystemZ/ |
| D | SystemZTargetTransformInfo.cpp | 513 int SystemZTTIImpl::getShuffleCost(TTI::ShuffleKind Kind, Type *Tp, int Index, in getShuffleCost() argument
515 assert (Tp->isVectorTy()); in getShuffleCost()
517 unsigned NumVectors = getNumVectorRegs(Tp); in getShuffleCost()
524 if (Tp->getScalarType()->isFP128Ty()) in getShuffleCost()
547 return BaseT::getShuffleCost(Kind, Tp, Index, SubTp); in getShuffleCost()
|