| /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}}
|
| literal-type.cpp | 11 typedef int Vector __attribute__((vector_size(16)));
13 static_assert(__is_literal(Vector), "fail");
|
| implicit-member-functions.cpp | 98 template<typename K> struct Vector {
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
|
| /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;
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 1 //===------ Math.h - PBQP Vector and Matrix classes -------------*- C++ -*-===//
21 /// \brief PBQP Vector class.
22 class Vector {
26 /// \brief Construct a PBQP vector of the given size.
27 explicit Vector(unsigned Length)
29 // llvm::dbgs() << "Constructing PBQP::Vector "
33 /// \brief Construct a PBQP vector with initializer.
34 Vector(unsigned Length, PBQPNum InitVal)
36 // llvm::dbgs() << "Constructing PBQP::Vector "
42 /// \brief Copy construct a PBQP vector
[all...] |
| /external/chromium_org/tools/json_schema_compiler/test/ |
| test_util.h | 18 std::vector<T> Vector(const T& a) {
19 std::vector<T> arr;
24 std::vector<T> Vector(const T& a, const T& b) {
25 std::vector<T> arr = Vector(a);
30 std::vector<T> Vector(const T& a, const T& b, const T& c) {
31 std::vector<T> arr = Vector(a, b)
[all...] |
| /external/chromium_org/v8/src/ |
| vector.h | 20 class Vector {
22 Vector() : start_(NULL), length_(0) {}
23 Vector(T* data, int length) : start_(data), length_(length) {
27 static Vector<T> New(int length) {
28 return Vector<T>(NewArray<T>(length), length);
31 // Returns a vector using the same backing storage as this one,
33 Vector<T> SubVector(int from, int to) {
37 return Vector<T>(start() + from, to - from);
40 // Returns the length of the vector.
43 // Returns whether or not the vector is empty
[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/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/ceres-solver/include/ceres/internal/ |
| eigen.h | 38 typedef Eigen::Matrix<double, Eigen::Dynamic, 1> Vector;
43 typedef Eigen::Map<Vector> VectorRef;
45 typedef Eigen::Map<const Vector> ConstVectorRef;
75 Vector;
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| DOMStringList.h | 33 #include "wtf/Vector.h"
57 operator const Vector<String>&() const { return m_strings; }
67 Vector<String> m_strings;
|
| /external/clang/test/Modules/Inputs/ |
| templates-right.h | 3 template<typename T> class Vector {
|
| /external/clang/test/Parser/ |
| cxx0x-for-range.cpp | 33 struct Vector {
45 Vector v;
|
| /external/llvm/include/llvm/ADT/ |
| SmallSet.h | 35 SmallVector<T, N> Vector;
44 return Vector.empty() && Set.empty();
48 return isSmall() ? Vector.size() : Set.size();
55 return vfind(V) == Vector.end() ? 0 : 1;
68 if (I != Vector.end()) // Don't reinsert if it already exists.
70 if (Vector.size() < N) {
71 Vector.push_back(V);
75 // Otherwise, grow from vector to set.
76 while (!Vector.empty()) {
77 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
26 typedef typename std::vector<T> VectorType;
34 // 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...] |
| /system/core/libpixelflinger/codeflinger/tinyutils/ |
| Vector.h | 36 * The main templated vector class ensuring type safety
42 class Vector : private VectorImpl
51 Vector();
52 Vector(const Vector<TYPE>& rhs);
53 virtual ~Vector();
56 const Vector<TYPE>& operator = (const Vector<TYPE>& rhs) const;
57 Vector<TYPE>& operator = (const Vector<TYPE>& rhs);
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_packetmath.cpp | 87 typedef Matrix<Scalar, PacketSize, 1> Vector;
|
| gsl_helper.h | 27 typedef gsl_vector* Vector;
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;
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/common/ |
| Geometry.js | 44 WebInspector.Geometry.Vector = function(x, y, z)
51 WebInspector.Geometry.Vector.prototype = {
98 * @param {!WebInspector.Geometry.Vector} u
99 * @param {!WebInspector.Geometry.Vector} v
108 * @param {!WebInspector.Geometry.Vector} u
109 * @param {!WebInspector.Geometry.Vector} v
110 * @return {!WebInspector.Geometry.Vector}
117 return new WebInspector.Geometry.Vector(x, y, z);
121 * @param {!WebInspector.Geometry.Vector} u
122 * @param {!WebInspector.Geometry.Vector}
[all...] |
| /external/deqp/framework/common/ |
| tcuVector.hpp | 23 * \brief Generic vector template.
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)
63 VecAccess<T, VecSize, Size>::VecAccess (Vector<T, VecSize>& v, int x, int y, int z)
73 VecAccess<T, VecSize, Size>::VecAccess (Vector<T, VecSize>& v, int x, int y, int z, int w
[all...] |
| /external/chromium_org/base/containers/ |
| stack_container_unittest.cc | 35 TEST(StackContainer, Vector) {
67 // Copying the small vector to another should use the same allocator and use
70 std::vector<int, StackAllocator<int, stack_size> > other(vect.container());
79 typedef StackVector<scoped_refptr<Dummy>, 2> Vector;
80 typedef Vector::ContainerType Container;
81 Vector vect;
|
| /external/chromium_org/cc/resources/ |
| image_copy_raster_worker_pool.h | 8 #include <vector>
65 typedef std::vector<RasterTaskState> Vector;
87 RasterTaskState::Vector raster_task_states_;
100 // Task graph used when scheduling tasks and vector used to gather
103 Task::Vector completed_tasks_;
|
| /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
| utils.h | 137 // This is a simplified version of V8's Vector class.
139 class Vector {
141 Vector() : start_(NULL), length_(0) {}
142 Vector(T* data, int length) : start_(data), length_(length) {
146 // Returns a vector using the same backing storage as this one,
148 Vector<T> SubVector(int from, int to) {
152 return Vector<T>(start() + from, to - from);
155 // Returns the length of the vector.
158 // Returns whether or not the vector is empty.
161 // Returns the pointer to the start of the data in the vector
[all...] |
