| /external/clang/test/CodeGenCXX/ |
| noinline-template.cpp | 6 // CHECK: define linkonce_odr void @_ZN6VectorIiE13growStorageByEv(%struct.Vector* %this) nounwind noinline
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 {
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/clang/test/SemaCXX/ |
| for-range-unused.cpp | 6 struct Vector {
19 Vector<int> vector; local
20 vector.doIt();
|
| literal-type.cpp | 11 typedef int Vector __attribute__((vector_size(16)));
13 static_assert(__is_literal(Vector), "fail");
|
| /external/chromium/base/ |
| stack_container_unittest.cc | 32 TEST(StackContainer, Vector) {
64 // Copying the small vector to another should use the same allocator and use
67 std::vector<int, StackAllocator<int, stack_size> > other(vect.container());
76 typedef StackVector<scoped_refptr<Dummy>, 2> Vector;
77 typedef Vector::ContainerType Container;
78 Vector vect;
|
| /external/clang/test/Modules/Inputs/ |
| redecl-merge-right.h | 82 template<typename T> class Vector {
|
| /external/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/webkit/Source/WebKit/chromium/src/ |
| WebIDBKeyPath.cpp | 34 #include <wtf/Vector.h>
42 WTF::Vector<IDBKeyPathElement> idbElements;
48 WebIDBKeyPath::WebIDBKeyPath(const WTF::Vector<IDBKeyPathElement>& elements, int parseError)
49 : m_private(new WTF::Vector<IDBKeyPathElement>(elements))
62 m_private.reset(new WTF::Vector<IDBKeyPathElement>(keyPath));
70 WebIDBKeyPath::operator const WTF::Vector<IDBKeyPathElement, 0>&() const
|
| /system/core/libpixelflinger/tinyutils/ |
| Vector.h | 2 * vector.h
27 * The main templated vector class ensuring type safety
33 class Vector : private VectorImpl
42 Vector();
43 Vector(const Vector<TYPE>& rhs);
44 virtual ~Vector();
47 const Vector<TYPE>& operator = (const Vector<TYPE>& rhs) const;
48 Vector<TYPE>& operator = (const Vector<TYPE>& rhs);
[all...] |
| /external/clang/include/clang/AST/ |
| DeclContextInternals.h | 33 /// DeclsTy - When in vector form, this is what the Data pointer points to.
37 /// or a pointer to a vector.
49 // If this is a vector-form, free the vector.
50 if (DeclsTy *Vector = getAsVector())
51 delete Vector;
55 if (DeclsTy *Vector = getAsVector())
56 delete Vector;
116 assert(getAsVector() && "Must have a vector at this point");
117 DeclsTy &Vector = *getAsVector()
[all...] |
| APValue.h | 37 /// [Vector: N * APValue], [Array: N * APValue]
49 Vector,
181 bool isVector() const { return Kind == Vector; }
411 Kind = Vector;
|
| /frameworks/native/include/utils/ |
| 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 explicit Vector(const SortedVector<TYPE>& rhs);
54 virtual ~Vector();
57 const Vector<TYPE>& operator = (const Vector<TYPE>& rhs) const;
58 Vector<TYPE>& operator = (const Vector<TYPE>& rhs);
[all...] |
| /external/chromium/testing/gtest/test/ |
| gtest-typed-test_test.cc | 33 #include <vector>
60 // We used to use std::list here, but switched to std::vector since
62 typedef std::vector<T> Vector;
104 typename TestFixture::Vector empty;
319 typedef Types<std::vector<double>, std::set<char> > MyContainers;
|
| /external/gtest/test/ |
| gtest-typed-test_test.cc | 33 #include <vector>
60 // We used to use std::list here, but switched to std::vector since
62 typedef std::vector<T> Vector;
104 typename TestFixture::Vector empty;
319 typedef Types<std::vector<double>, std::set<char> > MyContainers;
|
| /external/protobuf/gtest/test/ |
| gtest-typed-test_test.cc | 33 #include <vector>
60 // We used to use std::list here, but switched to std::vector since
62 typedef std::vector<T> Vector;
104 typename TestFixture::Vector empty;
319 typedef Types<std::vector<double>, std::set<char> > MyContainers;
|
| /external/valgrind/unittest/ |
| linear_solver.h | 1 class Vector {
2 std::vector<double> k;
5 explicit Vector(int size): k(size) {
23 inline Vector operator+ (const Vector & other) const {
25 Vector ret(N);
31 inline Vector operator- (const Vector & other) const {
33 Vector ret(N);
39 inline Vector operator* (double factor) const
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| Vector.h | 493 class Vector {
505 Vector()
510 explicit Vector(size_t size)
518 ~Vector()
523 Vector(const Vector&);
525 Vector(const Vector<T, otherCapacity>&);
527 Vector& operator=(const Vector&)
[all...] |
| /external/clang/test/PCH/ |
| cxx-templates.h | 198 template<typename T, int inlineCapacity = 0> class Vector { };
202 static String adopt(Vector<char, inlineCapacity>&);
206 inline bool equalIgnoringNullity(const Vector<char, inlineCapacity>& a, const String& b) { return false; }
|
| /external/v8/src/ |
| utils.h | 336 class Vector {
338 Vector() : start_(NULL), length_(0) {}
339 Vector(T* data, int length) : start_(data), length_(length) {
343 static Vector<T> New(int length) {
344 return Vector<T>(NewArray<T>(length), length);
347 // Returns a vector using the same backing storage as this one,
349 Vector<T> SubVector(int from, int to) {
353 return Vector<T>(start() + from, to - from);
356 // Returns the length of the vector.
359 // Returns whether or not the vector is empty
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Vector.java | 26 * Vector is an implementation of {@link List}, backed by an array and synchronized.
39 public class Vector<E> extends AbstractList<E> implements List<E>,
45 * The number of elements or the size of the vector.
50 * The elements of the vector.
55 * How many elements should be added to the vector when it is detected that
64 * Constructs a new vector using the default capacity.
66 public Vector() {
71 * Constructs a new vector using the specified capacity.
74 * the initial capacity of the new vector.
78 public Vector(int capacity)
261 Vector<E> vector = (Vector<E>) super.clone(); local
[all...] |
| /external/clang/test/Parser/ |
| cxx-altivec.cpp | 25 vector char v_c;
26 vector signed char v_sc;
27 vector unsigned char v_uc;
28 vector short v_s;
29 vector signed short v_ss;
30 vector unsigned short v_us;
31 vector short int v_si;
32 vector signed short int v_ssi;
33 vector unsigned short int v_usi;
34 vector int v_i
[all...] |
| /external/protobuf/gtest/src/ |
| gtest-internal-inl.h | 242 // Vector is an ordered container that supports random access to the
245 // We cannot use std::vector, as Visual C++ 7.1's implementation of
252 class Vector {
254 // Creates an empty Vector.
255 Vector() : elements_(NULL), capacity_(0), size_(0) {}
258 virtual ~Vector() { Clear(); }
260 // Clears the Vector.
276 // Adds an element to the end of the Vector. A copy of the element
278 // Vector. Changes made to the element in the Vector doesn't affec
[all...] |
