| /external/swiftshader/src/Device/ |
| D | Vector.hpp | 24 struct Vector struct
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;
53 Vector operator-() const;
55 Vector &operator+=(const Vector &v);
[all …]
|
| D | Vector.cpp | 22 Vector Vector::operator+() const in operator +()
27 Vector Vector::operator-() const in operator -()
29 return Vector(-x, -y, -z); in operator -()
32 Vector &Vector::operator+=(const Vector &v) in operator +=()
41 Vector &Vector::operator-=(const Vector &v) in operator -=()
50 Vector &Vector::operator*=(float s) in operator *=()
59 Vector &Vector::operator/=(float s) in operator /=()
66 bool operator==(const Vector &U, const Vector &v) in operator ==()
74 bool operator!=(const Vector &U, const Vector &v) in operator !=()
82 bool operator>(const Vector &u, const Vector &v) in operator >()
[all …]
|
| /external/swiftshader/src/Renderer/ |
| D | Vector.hpp | 24 struct Vector struct
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;
53 Vector operator-() const;
55 Vector &operator+=(const Vector &v);
[all …]
|
| D | Vector.cpp | 22 Vector Vector::operator+() const in operator +()
27 Vector Vector::operator-() const in operator -()
29 return Vector(-x, -y, -z); in operator -()
32 Vector &Vector::operator+=(const Vector &v) in operator +=()
41 Vector &Vector::operator-=(const Vector &v) in operator -=()
50 Vector &Vector::operator*=(float s) in operator *=()
59 Vector &Vector::operator/=(float s) in operator /=()
66 bool operator==(const Vector &U, const Vector &v) in operator ==()
74 bool operator!=(const Vector &U, const Vector &v) in operator !=()
82 bool operator>(const Vector &u, const Vector &v) in operator >()
[all …]
|
| /external/libaom/libaom/third_party/vector/ |
| D | vector.h | 44 typedef struct Vector { struct
50 } Vector; typedef
60 int aom_vector_setup(Vector *vector, size_t capacity, size_t element_size);
63 int aom_vector_copy(Vector *destination, Vector *source);
66 int aom_vector_copy_assign(Vector *destination, Vector *source);
69 int aom_vector_move(Vector *destination, Vector *source);
72 int aom_vector_move_assign(Vector *destination, Vector *source);
74 int aom_vector_swap(Vector *destination, Vector *source);
77 int aom_vector_destroy(Vector *vector);
80 int aom_vector_push_back(Vector *vector, void *element);
[all …]
|
| D | vector.c | 31 int aom_vector_setup(Vector *vector, size_t capacity, size_t element_size) { in aom_vector_setup()
44 int aom_vector_copy(Vector *destination, Vector *source) { in aom_vector_copy()
69 int aom_vector_copy_assign(Vector *destination, Vector *source) { in aom_vector_copy_assign()
85 int aom_vector_move(Vector *destination, Vector *source) { in aom_vector_move()
98 int aom_vector_move_assign(Vector *destination, Vector *source) { in aom_vector_move_assign()
103 int aom_vector_swap(Vector *destination, Vector *source) { in aom_vector_swap()
127 int aom_vector_destroy(Vector *vector) { in aom_vector_destroy()
139 int aom_vector_push_back(Vector *vector, void *element) { in aom_vector_push_back()
156 int aom_vector_push_front(Vector *vector, void *element) { in aom_vector_push_front()
160 int aom_vector_insert(Vector *vector, size_t index, void *element) { in aom_vector_insert()
[all …]
|
| /external/deqp/framework/common/ |
| D | tcuVector.hpp | 40 explicit VecAccess (Vector<T, VecSize>& v, int x, int y);
41 explicit VecAccess (Vector<T, VecSize>& v, int x, int y, int z);
42 explicit VecAccess (Vector<T, VecSize>& v, int x, int y, int z, int w);
44 VecAccess& operator= (const Vector<T, Size>& v);
46 operator Vector<T, Size> (void) const;
49 Vector<T, VecSize>& m_vector;
54 VecAccess<T, VecSize, Size>::VecAccess (Vector<T, VecSize>& v, int x, int y) in VecAccess()
63 VecAccess<T, VecSize, Size>::VecAccess (Vector<T, VecSize>& v, int x, int y, int z) in VecAccess()
73 VecAccess<T, VecSize, Size>::VecAccess (Vector<T, VecSize>& v, int x, int y, int z, int w) in VecAccess()
84 VecAccess<T, VecSize, Size>& VecAccess<T, VecSize, Size>::operator= (const Vector<T, Size>& v) in operator =()
[all …]
|
| D | tcuVectorType.hpp | 36 class Vector;
38 typedef Vector<float, 1> Vec1;
39 typedef Vector<float, 2> Vec2;
40 typedef Vector<float, 3> Vec3;
41 typedef Vector<float, 4> Vec4;
43 typedef Vector<int, 1> IVec1;
44 typedef Vector<int, 2> IVec2;
45 typedef Vector<int, 3> IVec3;
46 typedef Vector<int, 4> IVec4;
48 typedef Vector<deUint32, 1> UVec1;
[all …]
|
| D | tcuVectorUtil.hpp | 126 inline T dot (const Vector<T, Size>& a, const Vector<T, Size>& b) in dot()
135 inline T lengthSquared (const Vector<T, Size>& a) in lengthSquared()
144 …e::meta::EnableIf<T, de::meta::TypesSame<T, double>::Value>::Type length (const Vector<T, Size>& a) in length()
150 …de::meta::EnableIf<T, de::meta::TypesSame<T, float>::Value>::Type length (const Vector<T, Size>& a) in length()
156 inline T distance (const Vector<T, Size>& a, const Vector<T, Size>& b) in distance()
162 inline Vector<T, Size> cross (const Vector<T, Size>& a, const Vector<T, Size>& b) in cross()
165 return Vector<T, Size>( in cross()
172 inline Vector<T, Size> normalize (const Vector<T, Size>& a) in normalize()
175 Vector<T, Size> res; in normalize()
182 inline Vector<T, Size> faceForward (const Vector<T, Size>& n, const Vector<T, Size>& i, const Vecto… in faceForward()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| D | MapVector.h | 40 VectorType Vector; variable
58 return std::move(Vector); in takeVector()
61 size_type size() const { return Vector.size(); } in size()
67 Vector.reserve(NumEntries); in reserve()
70 iterator begin() { return Vector.begin(); } in begin()
71 const_iterator begin() const { return Vector.begin(); } in begin()
72 iterator end() { return Vector.end(); } in end()
73 const_iterator end() const { return Vector.end(); } in end()
75 reverse_iterator rbegin() { return Vector.rbegin(); } in rbegin()
76 const_reverse_iterator rbegin() const { return Vector.rbegin(); } in rbegin()
[all …]
|
| D | UniqueVector.h | 36 VectorType Vector; variable
49 Val = static_cast<unsigned>(Vector.size()) + 1; in insert()
52 Vector.push_back(Entry); in insert()
72 return Vector[ID - 1];
76 iterator begin() { return Vector.begin(); } in begin()
79 const_iterator begin() const { return Vector.begin(); } in begin()
82 iterator end() { return Vector.end(); } in end()
85 const_iterator end() const { return Vector.end(); } in end()
88 size_t size() const { return Vector.size(); } in size()
91 bool empty() const { return Vector.empty(); } in empty()
[all …]
|
| D | SmallSet.h | 139 SmallVector<T, N> Vector; variable
157 return Vector.empty() && Set.empty(); in empty()
161 return isSmall() ? Vector.size() : Set.size(); in size()
168 return vfind(V) == Vector.end() ? 0 : 1; in count()
186 if (I != Vector.end()) // Don't reinsert if it already exists. in insert()
188 if (Vector.size() < N) { in insert()
189 Vector.push_back(V); in insert()
194 while (!Vector.empty()) { in insert()
195 Set.insert(Vector.back()); in insert()
196 Vector.pop_back(); in insert()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | MapVector.h | 36 VectorType Vector; variable
44 size_type size() const { return Vector.size(); } in size()
46 iterator begin() { return Vector.begin(); } in begin()
47 const_iterator begin() const { return Vector.begin(); } in begin()
48 iterator end() { return Vector.end(); } in end()
49 const_iterator end() const { return Vector.end(); } in end()
51 reverse_iterator rbegin() { return Vector.rbegin(); } in rbegin()
52 const_reverse_iterator rbegin() const { return Vector.rbegin(); } in rbegin()
53 reverse_iterator rend() { return Vector.rend(); } in rend()
54 const_reverse_iterator rend() const { return Vector.rend(); } in rend()
[all …]
|
| D | SmallSet.h | 36 SmallVector<T, N> Vector; variable
51 return Vector.empty() && Set.empty(); in empty()
55 return isSmall() ? Vector.size() : Set.size(); in size()
62 return vfind(V) == Vector.end() ? 0 : 1; in count()
80 if (I != Vector.end()) // Don't reinsert if it already exists. in insert()
82 if (Vector.size() < N) { in insert()
83 Vector.push_back(V); in insert()
88 while (!Vector.empty()) { in insert()
89 Set.insert(Vector.back()); in insert()
90 Vector.pop_back(); in insert()
[all …]
|
| D | UniqueVector.h | 37 VectorType Vector; variable
50 Val = static_cast<unsigned>(Vector.size()) + 1; in insert()
53 Vector.push_back(Entry); in insert()
74 return Vector[ID - 1];
78 iterator begin() { return Vector.begin(); } in begin()
81 const_iterator begin() const { return Vector.begin(); } in begin()
84 iterator end() { return Vector.end(); } in end()
87 const_iterator end() const { return Vector.end(); } in end()
91 size_t size() const { return Vector.size(); } in size()
95 bool empty() const { return Vector.empty(); } in empty()
[all …]
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | BlotMapVector.h | 24 VectorTy Vector; variable
29 iterator begin() { return Vector.begin(); } in begin()
30 iterator end() { return Vector.end(); } in end()
31 const_iterator begin() const { return Vector.begin(); } in begin()
32 const_iterator end() const { return Vector.end(); } in end()
36 assert(Vector.size() >= Map.size()); // May differ due to blotting. in ~BlotMapVector()
39 assert(I->second < Vector.size()); in ~BlotMapVector()
40 assert(Vector[I->second].first == I->first); in ~BlotMapVector()
42 for (typename VectorTy::const_iterator I = Vector.begin(), E = Vector.end(); in ~BlotMapVector()
45 Map[I->first] == size_t(I - Vector.begin()))); in ~BlotMapVector()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/ObjCARC/ |
| D | BlotMapVector.h | 30 VectorTy Vector; variable
35 assert(Vector.size() >= Map.size()); // May differ due to blotting. in ~BlotMapVector()
38 assert(I->second < Vector.size()); in ~BlotMapVector()
39 assert(Vector[I->second].first == I->first); in ~BlotMapVector()
41 for (typename VectorTy::const_iterator I = Vector.begin(), E = Vector.end(); in ~BlotMapVector()
44 Map[I->first] == size_t(I - Vector.begin()))); in ~BlotMapVector()
51 iterator begin() { return Vector.begin(); } in begin()
52 iterator end() { return Vector.end(); } in end()
53 const_iterator begin() const { return Vector.begin(); } in begin()
54 const_iterator end() const { return Vector.end(); } in end()
[all …]
|
| /external/v8/src/ |
| D | vector.h | 21 class Vector {
23 constexpr Vector() : start_(nullptr), length_(0) {} in Vector() function
25 Vector(T* data, size_t length) : start_(data), length_(length) { in Vector() function
30 explicit constexpr Vector(T (&arr)[N]) : start_(arr), length_(N) {} in Vector() function
32 static Vector<T> New(int length) { in New()
33 return Vector<T>(NewArray<T>(length), length); in New()
38 Vector<T> SubVector(size_t from, size_t to) const { in SubVector()
41 return Vector<T>(start() + from, to - from); in SubVector()
79 Vector<T> Clone() const { in Clone()
82 return Vector<T>(result, length_); in Clone()
[all …]
|
| D | collector.h | 30 current_chunk_ = Vector<T>::New(initial_capacity);
55 inline Vector<T> AddBlock(int size, T initial_value) { in AddBlock()
66 return Vector<T>(position, size); in AddBlock()
73 inline Vector<T> AddBlock(Vector<const T> source) { in AddBlock()
83 return Vector<T>(position, source.length()); in AddBlock()
87 void WriteTo(Vector<T> destination) { in WriteTo()
90 for (const Vector<T>& chunk : chunks_) { in WriteTo()
106 Vector<T> ToVector() { in ToVector()
107 Vector<T> new_store = Vector<T>::New(size_); in ToVector()
127 std::vector<Vector<T>> chunks_;
[all …]
|
| /external/google-fruit/include/fruit/impl/meta/ |
| D | vector.h | 33 struct Vector {}; struct
42 using type = Vector<Types...>;
51 struct apply<Vector<Int<ns>...>> {
52 using type = Vector<Int<ns>..., Int<sizeof...(ns) + ns>...>;
61 struct apply<Vector<Int<ns>...>> {
62 using type = Vector<Int<ns>..., Int<sizeof...(ns)>, Int<sizeof...(ns) + 1 + ns>...>;
76 using type = Vector<>;
81 using type = Vector<Int<0>>;
97 struct apply<T, Vector<Ts...>> {
116 struct apply<Vector<Ts...>, V2> {
[all …]
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | SmallSet.h | 35 SmallVector<T, N> Vector; variable
42 bool empty() const { return Vector.empty() && Set.empty(); } in empty()
44 return isSmall() ? Vector.size() : Set.size(); in size()
51 return vfind(V) != Vector.end(); in count()
63 if (I != Vector.end()) // Don't reinsert if it already exists. in insert()
65 if (Vector.size() < N) { in insert()
66 Vector.push_back(V); in insert()
71 while (!Vector.empty()) { in insert()
72 Set.insert(Vector.back()); in insert()
73 Vector.pop_back(); in insert()
[all …]
|
| /external/eigen/Eigen/src/Core/ |
| D | ConditionEstimator.h | 17 template <typename Vector, typename RealVector, bool IsComplex>
19 static inline Vector run(const Vector& v) { in run()
21 return (v_abs.array() == static_cast<typename Vector::RealScalar>(0)) in run()
22 .select(Vector::Ones(v.size()), v.cwiseQuotient(v_abs)); in run()
27 template <typename Vector>
28 struct rcond_compute_sign<Vector, Vector, false> {
29 static inline Vector run(const Vector& v) {
30 return (v.array() < static_cast<typename Vector::RealScalar>(0))
31 .select(-Vector::Ones(v.size()), Vector::Ones(v.size()));
61 typedef typename internal::plain_col_type<MatrixType>::type Vector;
[all …]
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | SmallSet.h | 40 SmallVector<T, N> Vector; variable
56 return Vector.empty() && Set.empty(); in empty()
60 return isSmall() ? Vector.size() : Set.size(); in size()
67 return vfind(V) == Vector.end() ? 0 : 1; in count()
85 if (I != Vector.end()) // Don't reinsert if it already exists. in insert()
87 if (Vector.size() < N) { in insert()
88 Vector.push_back(V); in insert()
93 while (!Vector.empty()) { in insert()
94 Set.insert(Vector.back()); in insert()
95 Vector.pop_back(); in insert()
[all …]
|
| /external/llvm/include/llvm/IR/ |
| D | IntrinsicsAArch64.td | 160 // Vector Add Across Lanes
165 // Vector Long Add Across Lanes
169 // Vector Halving Add
173 // Vector Rounding Halving Add
177 // Vector Saturating Add
183 // Vector Add High-Half
188 // Vector Rounding Add High-Half
191 // Vector Saturating Doubling Multiply High
194 // Vector Saturating Rounding Doubling Multiply High
197 // Vector Polynominal Multiply
[all …]
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Math.h | 24 class Vector {
25 friend hash_code hash_value(const Vector &);
29 explicit Vector(unsigned Length) in Vector() function
36 Vector(unsigned Length, PBQPNum InitVal) in Vector() function
45 Vector(const Vector &V) in Vector() function
53 Vector(Vector &&V) in Vector() function
60 ~Vector() { in ~Vector()
66 Vector& operator=(const Vector &V) {
77 Vector& operator=(Vector &&V) {
87 bool operator==(const Vector &V) const {
[all …]
|