| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| bug054.go | 12 type Vector struct {
16 func (v *Vector) At(i int) Element {
22 fields *Vector;
30 v := new(Vector);
|
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| bug027.go | 14 type Vector struct {
19 func New() *Vector {
20 v := new(Vector)
26 func (v *Vector) At(i int) Element {
30 func (v *Vector) Insert(e Element) {
|
| bug054.go | 12 type Vector struct {
16 func (v *Vector) At(i int) Element {
22 fields *Vector;
30 v := new(Vector);
|
| /external/clang/test/CodeGenCXX/ |
| 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/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...] |
| /system/nvram/messages/include/nvram/messages/ |
| vector.h | 32 // A bare-bones dynamically-sized array container, similar to std::vector.
35 // standard library is not available. Prefer std::vector wherever possible.
36 template <typename ElementType> class Vector {
38 Vector() = default;
39 ~Vector() {
49 // Vector is not copyable as this would require memory allocations that may
50 // fail. However, Vector supports move semantics.
51 Vector(const Vector<ElementType>& other) = delete;
52 Vector<ElementType>& operator=(const Vector<ElementType>& other) = delete
[all...] |
| /external/libcxx/test/std/containers/sequences/array/ |
| compare.pass.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/v8/src/ |
| vector.h | 20 class Vector {
22 Vector() : start_(NULL), length_(0) {}
23 Vector(T* data, int length) : start_(data), length_(length) {
28 explicit Vector(T (&arr)[N]) : start_(arr), length_(N) {}
30 static Vector<T> New(int length) {
31 return Vector<T>(NewArray<T>(length), length);
34 // Returns a vector using the same backing storage as this one,
36 Vector<T> SubVector(int from, int to) const {
40 return Vector<T>(start() + from, to - from);
43 // Returns the length of the vector
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/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)
32 /// \brief Construct a PBQP vector with initializer.
33 Vector(unsigned Length, PBQPNum InitVal)
38 /// \brief Copy construct a PBQP vector.
39 Vector(const Vector &V
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/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)
32 /// \brief Construct a PBQP vector with initializer.
33 Vector(unsigned Length, PBQPNum InitVal)
38 /// \brief Copy construct a PBQP vector.
39 Vector(const Vector &V
[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/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-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...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| SmallSet.h | 40 SmallVector<T, N> Vector;
57 return Vector.empty() && Set.empty();
61 return isSmall() ? Vector.size() : Set.size();
68 return vfind(V) == Vector.end() ? 0 : 1;
86 if (I != Vector.end()) // Don't reinsert if it already exists.
88 if (Vector.size() < N) {
89 Vector.push_back(V);
93 // Otherwise, grow from vector to set.
94 while (!Vector.empty()) {
95 Set.insert(Vector.back())
[all...] |
| 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...] |
