| /external/clang/test/SemaCXX/ |
| cxx-altivec.cpp | 3 struct Vector {
|
| for-range-unused.cpp | 6 struct Vector {
19 Vector<int> vector; local
20 vector.doIt(); // expected-note {{here}}
|
| /external/clang/test/CodeGenCXX/ |
| noinline-template.cpp | 6 // CHECK: define linkonce_odr {{.*}}void @_ZN6VectorIiE13growStorageByEv(%struct.Vector* %this) [[NI:#[0-9]+]]
8 template <class Ty> struct Vector {
11 template <class T> __attribute__((noinline)) void Vector<T>::growStorageBy() {
14 Vector<int> strs;
|
| sanitize-dtor-fn-attribute.cpp | 7 template <class T> class Vector {
10 ~Vector() {}
14 Vector<int> v;
|
| sanitize-dtor-repress-aliasing.cpp | 6 class Vector {
9 ~Vector() {}
15 Vector<int> v;
|
| sanitize-dtor-nontrivial-virtual-base.cpp | 5 class Vector {
8 ~Vector() {
35 Vector<int> v;
46 // Derived: int, Vector, Base, VirtualBase
71 // poison int, ignore vector, poison int
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| Math.h | 1 //===------ Math.h - PBQP Vector and Matrix classes -------------*- C++ -*-===//
21 /// \brief PBQP Vector class.
22 class Vector {
25 /// \brief Construct a PBQP vector of the given size.
26 explicit Vector(unsigned length) :
30 /// \brief Construct a PBQP vector with initializer.
31 Vector(unsigned length, PBQPNum initVal) :
36 /// \brief Copy construct a PBQP vector.
37 Vector(const Vector &v)
[all...] |
| /external/clang/test/Index/ |
| file-refs.c | 14 } Vector;
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]
|
| targeted-top.h | 17 } Vector;
19 static inline int vector_get_x(Vector v) {
|
| /external/libcxx/test/std/containers/sequences/array/ |
| compare.fail.cpp | 21 #include <vector>
32 typedef std::vector<typename Array::value_type> Vector;
33 const Vector LHSV(LHS.begin(), LHS.end());
34 const Vector RHSV(RHS.begin(), RHS.end());
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 1 //===- Math.h - PBQP Vector and Matrix classes ------------------*- C++ -*-===//
25 /// PBQP Vector class.
26 class Vector {
27 friend hash_code hash_value(const Vector &);
30 /// Construct a PBQP vector of the given size.
31 explicit Vector(unsigned Length)
34 /// Construct a PBQP vector with initializer.
35 Vector(unsigned Length, PBQPNum InitVal)
40 /// Copy construct a PBQP vector.
41 Vector(const Vector &V
[all...] |
| /external/compiler-rt/test/msan/ |
| dtor-trivial-class-members.cc | 12 class Vector {
15 ~Vector() {
23 Vector<int> derived_v1;
24 Vector<int> derived_v2;
|
| dtor-trivial.cpp | 15 template <class T> class Vector {
18 ~Vector() {}
23 Vector<int> v;
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 1 //===------ Math.h - PBQP Vector and Matrix classes -------------*- C++ -*-===//
23 /// \brief PBQP Vector class.
24 class Vector {
25 friend hash_code hash_value(const Vector &);
28 /// \brief Construct a PBQP vector of the given size.
29 explicit Vector(unsigned Length)
31 // llvm::dbgs() << "Constructing PBQP::Vector "
35 /// \brief Construct a PBQP vector with initializer.
36 Vector(unsigned Length, PBQPNum InitVal)
38 // llvm::dbgs() << "Constructing PBQP::Vector "
[all...] |
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_vector.h | 14 // Low-fat STL-like vector container.
25 class Vector {
27 explicit Vector(MBlockType typ)
34 ~Vector() {
122 Vector(const Vector&);
123 void operator=(const Vector&);
|
| /external/clang/test/Parser/ |
| cxx0x-for-range.cpp | 33 struct Vector {
45 Vector v;
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 23 typedef Matrix<Scalar,Dynamic,1> Vector;
24 typedef typename Vector::Index Index;
46 Vector diag(size);
|
| /external/flatbuffers/python/flatbuffers/ |
| table.py | 57 """VectorLen retrieves the length of the vector whose offset is stored
66 def Vector(self, off):
67 """Vector retrieves the start of data of the vector whose offset is
73 # data starts after metadata containing the vector length
106 GetVectorAsNumpy returns the vector that starts at `Vector(off)`
111 offset = self.Vector(off)
|
| /external/llvm/include/llvm/ADT/ |
| SmallSet.h | 36 SmallVector<T, N> Vector;
51 return Vector.empty() && Set.empty();
55 return isSmall() ? Vector.size() : Set.size();
62 return vfind(V) == Vector.end() ? 0 : 1;
80 if (I != Vector.end()) // Don't reinsert if it already exists.
82 if (Vector.size() < N) {
83 Vector.push_back(V);
87 // Otherwise, grow from vector to set.
88 while (!Vector.empty()) {
89 Set.insert(Vector.back())
[all...] |
| /external/swiftshader/src/Device/ |
| Vector.hpp | 24 struct Vector
26 Vector();
27 Vector(const int i);
28 Vector(const Vector &v);
29 Vector(const Point &p);
30 Vector(float v_x, float v_y, float v_z);
32 Vector &operator=(const Vector &v);
52 Vector operator+() const
[all...] |
| /external/swiftshader/src/Renderer/ |
| Vector.hpp | 24 struct Vector
26 Vector();
27 Vector(const int i);
28 Vector(const Vector &v);
29 Vector(const Point &p);
30 Vector(float v_x, float v_y, float v_z);
32 Vector &operator=(const Vector &v);
52 Vector operator+() const
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| SmallSet.h | 35 SmallVector<T, N> Vector;
42 bool empty() const { return Vector.empty() && Set.empty(); }
44 return isSmall() ? Vector.size() : Set.size();
51 return vfind(V) != Vector.end();
63 if (I != Vector.end()) // Don't reinsert if it already exists.
65 if (Vector.size() < N) {
66 Vector.push_back(V);
70 // Otherwise, grow from vector to set.
71 while (!Vector.empty()) {
72 Set.insert(Vector.back())
[all...] |
| UniqueVector.h | 15 #include <vector>
21 /// unique entry that is added. T is the type of entries in the vector. This
29 // Vector - ID ordered vector of entries. Entries can be indexed by ID - 1.
31 std::vector<T> Vector;
34 /// insert - Append entry to the vector if it doesn't already exist. Returns
44 Val = static_cast<unsigned>(Vector.size()) + 1;
46 // Insert in vector.
47 Vector.push_back(Entry)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| UniqueVector.h | 16 #include <vector>
22 /// unique entry that is added. T is the type of entries in the vector. This
27 using VectorType = typename std::vector<T>;
35 // Vector - ID ordered vector of entries. Entries can be indexed by ID - 1.
36 VectorType Vector;
39 /// insert - Append entry to the vector if it doesn't already exist. Returns
49 Val = static_cast<unsigned>(Vector.size()) + 1;
51 // Insert in vector.
52 Vector.push_back(Entry)
[all...] |
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| SmallSet.h | 40 SmallVector<T, N> Vector;
56 return Vector.empty() && Set.empty();
60 return isSmall() ? Vector.size() : Set.size();
67 return vfind(V) == Vector.end() ? 0 : 1;
85 if (I != Vector.end()) // Don't reinsert if it already exists.
87 if (Vector.size() < N) {
88 Vector.push_back(V);
92 // Otherwise, grow from vector to set.
93 while (!Vector.empty()) {
94 Set.insert(Vector.back())
[all...] |
