| /prebuilts/clang/host/darwin-x86/clang-4479392/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/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...] |
| /prebuilts/clang/host/linux-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/linux-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...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/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...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/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...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/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...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/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...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/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...] |
| /external/compiler-rt/test/msan/ |
| dtor-multiple-inheritance-nontrivial-class-members.cc | 10 template <class T> class Vector {
13 ~Vector() {
20 Vector<int> virtual_v;
59 Vector<int> base_v;
63 Vector<int> *derived_v1_ptr;
64 Vector<int> *derived_v2_ptr;
68 Base(int *derived_a, Vector<int> *derived_v1, Vector<int> *derived_v2,
94 Vector<int> derived_v1;
95 Vector<int> derived_v2
[all...] |
| /device/linaro/bootloader/edk2/Omap35xxPkg/InterruptDxe/ |
| HardwareInterrupt.c | 89 // This vector has been programmed as FIQ so we can't use it for IRQ
263 UINT32 Vector;
266 Vector = MmioRead32 (INTCPS_SIR_IRQ) & INTCPS_SIR_IRQ_MASK;
272 InterruptHandler = gRegisteredInterruptHandlers[Vector];
275 InterruptHandler (Vector, SystemContext);
|
