/external/stlport/stlport/stl/ |
H A D | _iterator_base.h | 431 #define _STLP_CREATE_ITERATOR_TRAITS_BASE(Motif, Traits) \ 435 struct _Const##Motif : public _STLP_STD::_Const_##Traits<_Tp> { \ 440 struct _##Motif : public _STLP_STD::_Nonconst_##Traits<_Tp> { \ 445 #define _STLP_CREATE_ITERATOR_TRAITS(Motif, Traits) \ 447 _STLP_CREATE_ITERATOR_TRAITS_BASE(Motif, Traits) \ 450 #define _STLP_CREATE_HASH_ITERATOR_TRAITS(Motif, Traits) \ 452 _STLP_CREATE_ITERATOR_TRAITS_BASE(NonLocal##Motif, Traits) \ 453 _STLP_CREATE_ITERATOR_TRAITS_BASE(Local##Motif, Traits) \
|
/external/skia/src/core/ |
H A D | SkPictureFlat.h | 263 template <typename Traits, typename T> 273 Traits::Flatten(buffer, obj); 289 template <typename Traits, typename T> 302 Traits::Unflatten(buffer, result); 361 template <typename T, typename Traits> friend class SkFlatDictionary; 364 template <typename T, typename Traits> 526 Traits::Flatten(fScratch, element); 553 element->unflatten<Traits>(dst,
|
H A D | SkTDynamicHash.h | 15 // Traits requires: 18 // We'll look on T for these by default, or you can pass a custom Traits type. 21 typename Traits = T, 233 static const Key& GetKey(const T& t) { return Traits::GetKey(t); } 234 static uint32_t Hash(const Key& key) { return Traits::Hash(key); }
|
/external/skia/tests/ |
H A D | FlatDataTest.cpp | 41 template <typename Traits, typename T> 45 SkFlatData* data1 = SkFlatData::Create<Traits>(&controller, obj, 0); 46 SkFlatData* data2 = SkFlatData::Create<Traits>(&controller, obj, 1);
|
/external/mesa3d/src/gallium/state_trackers/d3d1x/d3d1xstutil/include/ |
H A D | d3d1xstutil.h | 513 template<typename T, typename Traits> 522 void add_ref() {Traits::add_ref(p);} 523 void release() {Traits::release(p);}
|
/external/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 23 // A Traits class specifies how keys are compared. It also allows IntervalMap to 38 // template <typename KeyT, typename ValT, unsigned N, typename Traits> 66 // template <typename KeyT, typename ValT, unsigned N, typename Traits> 90 // template <typename KeyT, typename ValT, unsigned N, typename Traits> 549 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals. 551 // - Traits::stopLess(stop(i), start(i + 1) - Sorted. 553 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1)) 558 template <typename KeyT, typename ValT, unsigned N, typename Traits> 577 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) && 579 while (i != Size && Traits [all...] |
H A D | ilist.h | 49 template<typename NodeTy, typename Traits> class iplist; 149 typedef ilist_traits<NodeTy> Traits; typedef in class:llvm::ilist_iterator 214 NodePtr = Traits::getPrev(NodePtr); 219 NodePtr = Traits::getNext(NodePtr); 302 /// sentinel is created by the Traits::createSentinel method and is a link 312 template<typename NodeTy, typename Traits=ilist_traits<NodeTy> > 313 class iplist : public Traits { 355 Traits::destroySentinel(getTail());
|
/external/llvm/include/llvm/IR/ |
H A D | SymbolTableListTraits.h | 1 //===-- llvm/SymbolTableListTraits.h - Traits for iplist --------*- C++ -*-===// 34 template<typename NodeTy, typename Traits> class iplist;
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | SSAUpdaterImpl.h | 37 typedef SSAUpdaterTraits<UpdaterT> Traits; typedef in class:llvm::SSAUpdaterImpl 38 typedef typename Traits::BlkT BlkT; 39 typedef typename Traits::ValT ValT; 40 typedef typename Traits::PhiT PhiT; 86 ValT V = Traits::GetUndefVal(BB, Updater); 117 Traits::FindPredecessorBlocks(Info->BB, &Preds); 184 for (typename Traits::BlkSucc_iterator SI = 185 Traits::BlkSucc_begin(Info->BB), 186 E = Traits::BlkSucc_end(Info->BB); SI != E; ++SI) { 244 Pred->AvailableVal = Traits [all...] |
/external/libcxx/test/strings/basic.string/ |
H A D | types.pass.cpp | 43 template <class Traits, class Allocator> 47 typedef std::basic_string<typename Traits::char_type, Traits, Allocator> S; 49 static_assert((std::is_same<typename S::traits_type, Traits>::value), ""); 50 static_assert((std::is_same<typename S::value_type, typename Traits::char_type>::value), "");
|
/external/eigen/Eigen/src/Cholesky/ |
H A D | LDLT.h | 68 typedef internal::LDLT_Traits<MatrixType,UpLo> Traits; typedef in class:Eigen::LDLT 120 inline typename Traits::MatrixU matrixU() const 123 return Traits::getU(m_matrix); 127 inline typename Traits::MatrixL matrixL() const 130 return Traits::getL(m_matrix);
|
H A D | LLT.h | 70 typedef internal::LLT_Traits<MatrixType,UpLo> Traits; typedef in class:Eigen::LLT 97 inline typename Traits::MatrixU matrixU() const 100 return Traits::getU(m_matrix); 104 inline typename Traits::MatrixL matrixL() const 107 return Traits::getL(m_matrix); 393 bool ok = Traits::inplace_decomposition(m_matrix);
|
/external/eigen/Eigen/src/Core/ |
H A D | PermutationMatrix.h | 55 typedef internal::traits<Derived> Traits; typedef in class:Eigen::PermutationBase 60 typedef typename Traits::IndicesType IndicesType; 62 Flags = Traits::Flags, 63 CoeffReadCost = Traits::CoeffReadCost, 64 RowsAtCompileTime = Traits::RowsAtCompileTime, 65 ColsAtCompileTime = Traits::ColsAtCompileTime, 66 MaxRowsAtCompileTime = Traits::MaxRowsAtCompileTime, 67 MaxColsAtCompileTime = Traits::MaxColsAtCompileTime 69 typedef typename Traits::Scalar Scalar; 70 typedef typename Traits 286 typedef internal::traits<PermutationMatrix> Traits; typedef in class:Eigen::PermutationMatrix 401 typedef internal::traits<Map> Traits; typedef in class:Eigen::Map 486 typedef internal::traits<PermutationWrapper> Traits; typedef in class:Eigen::PermutationWrapper 624 typedef internal::traits<PermutationType> Traits; typedef in class:Eigen::Transpose [all...] |
H A D | Ref.h | 190 typedef internal::traits<Ref> Traits; typedef in class:Eigen::Ref 200 typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0) 206 typename internal::enable_if<bool(internal::is_lvalue<Derived>::value&&bool(Traits::template match<Derived>::MatchAtCompileTime)),Derived>::type* = 0, 224 typedef internal::traits<Ref> Traits; typedef in class:Eigen::Ref 236 construct(expr.derived(), typename Traits::template match<Derived>::type());
|
H A D | Transpositions.h | 51 typedef internal::traits<Derived> Traits; typedef in class:Eigen::TranspositionsBase 55 typedef typename Traits::IndicesType IndicesType; 158 typedef internal::traits<Transpositions> Traits; typedef in class:Eigen::Transpositions 162 typedef typename Traits::IndicesType IndicesType; 230 typedef internal::traits<Map> Traits; typedef in class:Eigen::Map 234 typedef typename Traits::IndicesType IndicesType; 287 typedef internal::traits<TranspositionsWrapper> Traits; typedef in class:Eigen::TranspositionsWrapper 291 typedef typename Traits::IndicesType IndicesType;
|
/external/eigen/Eigen/src/Core/products/ |
H A D | GeneralBlockPanelKernel.h | 85 typedef gebp_traits<LhsScalar,RhsScalar> Traits; typedef 87 kdiv = KcFactor * 2 * Traits::nr 88 * Traits::RhsProgress * sizeof(RhsScalar), 516 typedef gebp_traits<LhsScalar,RhsScalar,ConjugateLhs,ConjugateRhs> Traits; typedef in struct:Eigen::internal::gebp_kernel 517 typedef typename Traits::ResScalar ResScalar; 518 typedef typename Traits::LhsPacket LhsPacket; 519 typedef typename Traits::RhsPacket RhsPacket; 520 typedef typename Traits::ResPacket ResPacket; 521 typedef typename Traits::AccPacket AccPacket; 524 Vectorizable = Traits [all...] |
H A D | GeneralMatrixMatrix.h | 66 typedef gebp_traits<LhsScalar,RhsScalar> Traits; typedef 72 gemm_pack_lhs<LhsScalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs; 73 gemm_pack_rhs<RhsScalar, Index, Traits::nr, RhsStorageOrder> pack_rhs; 74 gebp_kernel<LhsScalar, RhsScalar, Index, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp; 84 std::size_t sizeW = kc*Traits::WorkSpaceFactor; 155 std::size_t sizeW = kc*Traits::WorkSpaceFactor; 282 typedef gebp_traits<LhsScalar,RhsScalar> Traits; typedef in class:Eigen::internal::gemm_blocking_space 286 SizeW = MaxDepth * Traits 322 typedef gebp_traits<LhsScalar,RhsScalar> Traits; typedef in class:Eigen::internal::gemm_blocking_space [all...] |
H A D | GeneralMatrixMatrixTriangular.h | 66 typedef gebp_traits<LhsScalar,RhsScalar> Traits; typedef 73 if(mc > Traits::nr) 74 mc = (mc/Traits::nr)*Traits::nr; 76 std::size_t sizeW = kc*Traits::WorkSpaceFactor; 82 gemm_pack_lhs<LhsScalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs; 83 gemm_pack_rhs<RhsScalar, Index, Traits::nr, RhsStorageOrder> pack_rhs; 84 gebp_kernel <LhsScalar, RhsScalar, Index, Traits::mr, Traits 133 typedef gebp_traits<LhsScalar,RhsScalar,ConjLhs,ConjRhs> Traits; typedef in struct:Eigen::internal::tribb_kernel [all...] |
H A D | SelfadjointMatrixMatrix.h | 255 typedef gebp_traits<Scalar,Scalar> Traits; typedef 264 std::size_t sizeW = kc*Traits::WorkSpaceFactor; 270 gebp_kernel<Scalar, Scalar, Index, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel; 271 symm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs; 272 gemm_pack_rhs<Scalar, Index, Traits::nr,RhsStorageOrder> pack_rhs; 273 gemm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder==RowMajor?ColMajor:RowMajor, true> pack_lhs_transposed; 308 gemm_pack_lhs<Scalar, Index, Traits 345 typedef gebp_traits<Scalar,Scalar> Traits; typedef [all...] |
H A D | TriangularMatrixMatrix.h | 87 typedef gebp_traits<Scalar,Scalar> Traits; typedef in struct:Eigen::internal::product_triangular_matrix_matrix 89 SmallPanelWidth = 2 * EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr), 128 std::size_t sizeW = kc*Traits::WorkSpaceFactor; 141 gebp_kernel<Scalar, Scalar, Index, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel; 142 gemm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs; 143 gemm_pack_rhs<Scalar, Index, Traits::nr,RhsStorageOrder> pack_rhs; 211 gemm_pack_lhs<Scalar, Index, Traits 228 typedef gebp_traits<Scalar,Scalar> Traits; typedef in struct:Eigen::internal::product_triangular_matrix_matrix [all...] |
H A D | TriangularSolverMatrix.h | 58 typedef gebp_traits<Scalar,Scalar> Traits; typedef 60 SmallPanelWidth = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr), 69 std::size_t sizeW = kc*Traits::WorkSpaceFactor; 76 gebp_kernel<Scalar, Scalar, Index, Traits::mr, Traits::nr, Conjugate, false> gebp_kernel; 77 gemm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, TriStorageOrder> pack_lhs; 78 gemm_pack_rhs<Scalar, Index, Traits::nr, ColMajor, false, true> pack_rhs; 85 subcols = std::max<Index>((subcols/Traits 206 typedef gebp_traits<Scalar,Scalar> Traits; typedef [all...] |
/external/eigen/Eigen/src/PardisoSupport/ |
H A D | PardisoSupport.h | 101 typedef internal::pardiso_traits<Derived> Traits; typedef in class:Eigen::PardisoImpl 103 typedef typename Traits::MatrixType MatrixType; 104 typedef typename Traits::Scalar Scalar; 105 typedef typename Traits::RealScalar RealScalar; 106 typedef typename Traits::Index Index;
|
/external/eigen/Eigen/src/SparseCholesky/ |
H A D | SimplicialCholesky.h | 317 typedef internal::traits<SimplicialLLT> Traits; typedef in class:Eigen::SimplicialLLT 318 typedef typename Traits::MatrixL MatrixL; 319 typedef typename Traits::MatrixU MatrixU; 330 return Traits::getL(Base::m_matrix); 336 return Traits::getU(Base::m_matrix); 406 typedef internal::traits<SimplicialLDLT> Traits; typedef in class:Eigen::SimplicialLDLT 407 typedef typename Traits::MatrixL MatrixL; 408 typedef typename Traits::MatrixU MatrixU; 425 return Traits::getL(Base::m_matrix); 431 return Traits 488 typedef internal::traits<SimplicialCholesky> Traits; typedef in class:Eigen::SimplicialCholesky [all...] |
/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseDenseProduct.h | 80 typedef internal::traits<SparseDenseOuterProduct> Traits; typedef in class:Eigen::SparseDenseOuterProduct 84 typedef typename Traits::LhsNested LhsNested; 85 typedef typename Traits::RhsNested RhsNested; 86 typedef typename Traits::_LhsNested _LhsNested; 87 typedef typename Traits::_RhsNested _RhsNested; 140 typename Traits::_RhsNested::InnerIterator it(rhs, outer);
|
/external/eigen/Eigen/src/SparseLU/ |
H A D | SparseLUImpl.h | 42 template <typename Traits> 46 IndexVector& xplore, GlobalLU_t& glu, Index& nextl_col, Index krow, Traits& traits);
|