/external/clang/test/SemaCXX/ |
H A D | cxx-altivec.cpp | 3 struct Vector { struct
|
H A D | for-range-unused.cpp | 6 struct Vector { struct 19 Vector<int> vector;
|
H A D | implicit-member-functions.cpp | 98 template<typename K> struct Vector { struct in namespace:Recursion 99 Vector(const Line<K> &l); 103 Vector<K> v; 107 pair<Point<K>, Vector<K>> x; 113 // on Vector's constructors, which requires declaring all of Line's
|
H A D | literal-type.cpp | 11 typedef int Vector __attribute__((vector_size(16))); typedef 13 static_assert(__is_literal(Vector), "fail");
|
/external/clang/test/CodeGenCXX/ |
H A D | noinline-template.cpp | 6 // CHECK: define linkonce_odr {{.*}}void @_ZN6VectorIiE13growStorageByEv(%struct.Vector* %this) [[NI:#[0-9]+]] 8 template <class Ty> struct Vector { struct 11 template <class T> __attribute__((noinline)) void Vector<T>::growStorageBy() { 14 Vector<int> strs;
|
/external/clang/test/Index/ |
H A D | file-refs.c | 14 } Vector; typedef in typeref:struct:__anon2140 16 int vector_get_x(Vector v) { 47 // CHECK-NEXT: TypeRef=Vector:14:3 48 // CHECK-NEXT: TypedefDecl=Vector:14:3 (Definition) =[14:3 - 14:9] 49 // CHECK-NEXT: TypeRef=Vector:14:3 =[16:18 - 16:24]
|
H A D | targeted-top.h | 17 } Vector; typedef in typeref:struct:__anon2175 19 static inline int vector_get_x(Vector v) {
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Math.h | 1 //===------ Math.h - PBQP Vector and Matrix classes -------------*- C++ -*-===// 23 /// \brief PBQP Vector class. 24 class Vector { class in namespace:llvm::PBQP 25 friend hash_code hash_value(const Vector &); 29 explicit Vector(unsigned Length) function in class:llvm::PBQP::Vector 31 // llvm::dbgs() << "Constructing PBQP::Vector " 36 Vector(unsigned Length, PBQPNum InitVal) function in class:llvm::PBQP::Vector 38 // llvm::dbgs() << "Constructing PBQP::Vector " 45 Vector(const Vector function in class:llvm::PBQP::Vector 53 Vector(Vector &&V) function in class:llvm::PBQP::Vector [all...] |
/external/compiler-rt/lib/tsan/rtl/ |
H A D | tsan_vector.h | 25 class Vector { class in namespace:__tsan 27 explicit Vector(MBlockType typ) function in class:__tsan::Vector 34 ~Vector() { 122 Vector(const Vector&); 123 void operator=(const Vector&);
|
/external/ceres-solver/include/ceres/internal/ |
H A D | eigen.h | 38 typedef Eigen::Matrix<double, Eigen::Dynamic, 1> Vector; typedef in namespace:ceres 43 typedef Eigen::Map<Vector> VectorRef; 45 typedef Eigen::Map<const Vector> ConstVectorRef; 75 Vector; typedef in struct:ceres::EigenTypes
|
/external/clang/test/Modules/Inputs/ |
H A D | templates-right.h | 3 template<typename T> class Vector { class
|
/external/clang/test/Parser/ |
H A D | cxx0x-for-range.cpp | 33 struct Vector { struct in namespace:PR19176 45 Vector v;
|
/external/llvm/lib/Target/XCore/ |
H A D | XCoreTargetTransformInfo.h | 62 unsigned getNumberOfRegisters(bool Vector) { argument 63 if (Vector) {
|
/external/v8/src/ |
H A D | vector.h | 20 class Vector { class in namespace:v8::internal 22 Vector() : start_(NULL), length_(0) {} function in class:v8::internal::Vector 23 Vector(T* data, int length) : start_(data), length_(length) { function in class:v8::internal::Vector 27 static Vector<T> New(int length) { 28 return Vector<T>(NewArray<T>(length), length); 33 Vector<T> SubVector(int from, int to) { 37 return Vector<T>(start() + from, to - from); 62 Vector<T> Clone() const { 65 return Vector<T>(result, length_); 89 inline Vector< [all...] |
/external/deqp/framework/common/ |
H A D | tcuMatrixUtil.hpp | 34 Matrix<T, Size+1, Size+1> translationMatrix (const Vector<T, Size>& translation); 38 Matrix<float, 2, 2> shearMatrix (const Vector<float, 2>& shear); 49 inline Matrix<T, Len+1, Len+1> translationMatrix (const Vector<T, Len>& translation) argument 71 inline Matrix<float, 2, 2> shearMatrix (const Vector<float, 2>& shear) argument
|
H A D | tcuTexVerifierUtil.hpp | 40 inline Vector<float, Size> computeFloatingPointError (const Vector<float, Size>& value, const Vector<deInt32, Size>& numAccurateBits) argument 42 Vector<float, Size> res; 49 inline Vector<float, Size> computeFixedPointError (const Vector<deInt32, Size>& numAccurateBits) argument 51 Vector<float, Size> res;
|
/external/llvm/include/llvm/ADT/ |
H A D | SmallSet.h | 36 SmallVector<T, N> Vector; member in class:llvm::SmallSet 45 return Vector.empty() && Set.empty(); 49 return isSmall() ? Vector.size() : Set.size(); 56 return vfind(V) == Vector.end() ? 0 : 1; 74 if (I != Vector.end()) // Don't reinsert if it already exists. 76 if (Vector.size() < N) { 77 Vector.push_back(V); 82 while (!Vector.empty()) { 83 Set.insert(Vector.back()); 84 Vector [all...] |
H A D | UniqueVector.h | 34 // Vector - ID ordered vector of entries. Entries can be indexed by ID - 1. 36 VectorType Vector; member in class:llvm::UniqueVector 49 Val = static_cast<unsigned>(Vector.size()) + 1; 52 Vector.push_back(Entry); 73 return Vector[ID - 1]; 77 iterator begin() { return Vector.begin(); } 80 const_iterator begin() const { return Vector.begin(); } 83 iterator end() { return Vector.end(); } 86 const_iterator end() const { return Vector.end(); } 90 size_t size() const { return Vector [all...] |
/external/llvm/lib/Target/ARM/ |
H A D | ARMTargetTransformInfo.h | 74 /// \name Vector TTI Implementations 77 unsigned getNumberOfRegisters(bool Vector) { argument 78 if (Vector) { 89 unsigned getRegisterBitWidth(bool Vector) { argument 90 if (Vector) {
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | BasicPreconditioners.h | 36 typedef Matrix<Scalar,Dynamic,1> Vector; typedef in class:Eigen::DiagonalPreconditioner 37 typedef typename Vector::Index Index; 99 Vector m_invdiag;
|
/external/eigen/test/eigen2/ |
H A D | eigen2_packetmath.cpp | 87 typedef Matrix<Scalar, PacketSize, 1> Vector; typedef
|
H A D | gsl_helper.h | 27 typedef gsl_vector* Vector; typedef in struct:Eigen::GslTraits 29 static Vector createVector(int size) { return gsl_vector_alloc(size); } 31 static void free(Vector& m) { gsl_vector_free(m); m=0; } 32 static void prod(const Matrix& m, const Vector& v, Vector& x) { gsl_blas_dgemv(CblasNoTrans,1,m,v,0,x); } 34 static void cholesky_solve(const Matrix& m, const Vector& b, Vector& x) { gsl_linalg_cholesky_solve(m,b,x); } 35 static void eigen_symm(const Matrix& m, Vector& eval, Matrix& evec) 45 static void eigen_symm_gen(const Matrix& m, const Matrix& _b, Vector& eval, Matrix& evec) 62 typedef gsl_vector_complex* Vector; typedef in struct:Eigen::GslTraits [all...] |
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 19 typedef Matrix<Scalar,Dynamic,1> Vector; typedef in class:Eigen::IncompleteLU 20 typedef typename Vector::Index Index; 42 Vector diag(size);
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64TargetTransformInfo.h | 92 /// \name Vector TTI Implementations 95 unsigned getNumberOfRegisters(bool Vector) { argument 96 if (Vector) { 104 unsigned getRegisterBitWidth(bool Vector) { argument 105 if (Vector) {
|
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | BlotMapVector.h | 18 /// Map keys to indices in Vector. 24 VectorTy Vector; member in class:llvm::BlotMapVector 29 iterator begin() { return Vector.begin(); } 30 iterator end() { return Vector.end(); } 31 const_iterator begin() const { return Vector.begin(); } 32 const_iterator end() const { return Vector.end(); } 36 assert(Vector.size() >= Map.size()); // May differ due to blotting. 39 assert(I->second < Vector.size()); 40 assert(Vector[I->second].first == I->first); 42 for (typename VectorTy::const_iterator I = Vector [all...] |