Searched defs:List (Results 1 - 25 of 40) sorted by relevance

12

/external/llvm/unittests/ADT/
H A DilistTest.cpp27 ilist<Node> List; local
28 List.push_back(Node(1));
29 EXPECT_EQ(1, List.back().Value);
30 EXPECT_EQ(0, List.back().getPrevNode());
31 EXPECT_EQ(0, List.back().getNextNode());
33 List.push_back(Node(2));
34 EXPECT_EQ(2, List.back().Value);
35 EXPECT_EQ(2, List.front().getNextNode()->Value);
36 EXPECT_EQ(1, List.back().getPrevNode()->Value);
38 const ilist<Node> &ConstList = List;
[all...]
/external/clang/test/CodeGenCXX/
H A Dconstructor-template.cpp22 template <typename T> class List { class
24 List(){ } // List<BinomialNode<int>*>::List() remains undefined. function in class:List
25 ~List() {}
39 List<BinomialNode<T>*> nodes;
/external/v8/src/
H A Dlist.h46 // template <typename T, class P = FreeStoreAllocationPolicy> class List;
48 class List { class in namespace:v8::internal
51 List() { Initialize(0); } function in class:v8::internal::List
52 INLINE(explicit List(int capacity)) { Initialize(capacity); }
53 INLINE(~List()) { DeleteData(data_); }
92 void AddAll(const List<T, P>& other);
149 // List must be full already.
159 DISALLOW_COPY_AND_ASSIGN(List);
H A Dlist-inl.h38 void List<T, P>::Add(const T& element) {
42 List<T, P>::ResizeAdd(element);
48 void List<T, P>::AddAll(const List<T, P>& other) { argument
61 void List<T, P>::ResizeAdd(const T& element) {
67 void List<T, P>::ResizeAddInternal(const T& element) {
81 void List<T, P>::Resize(int new_capacity) {
82 T* new_data = List<T, P>::NewData(new_capacity);
84 List<T, P>::DeleteData(data_);
91 Vector<T> List<
[all...]
H A Dv8threads.h40 enum List {FREE_LIST, IN_USE_LIST}; enum in class:v8::internal::ThreadState
42 void LinkInto(List list);
/external/clang/test/CodeGen/
H A Dtypes.c25 struct List { struct
30 struct List returned;
33 void test3(struct List a) {
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineWorklist.h53 void AddInitialGroup(Instruction *const *List, unsigned NumEntries) { argument
59 Instruction *I = List[NumEntries-1];
/external/opencv/cvaux/src/
H A Dcvfacedetection.cpp69 m_pFaceList = new List();
244 m_pFaceList = new List();
427 //List Class
456 List::List() function in class:List
461 }//List::List()
463 List::~List()
471 }//List
[all...]
H A D_cvfacedetection.h310 class List class
313 List();
315 virtual ~List();
321 };//class List
344 List * m_pFaceList;
/external/gtest/test/
H A Dgtest-typed-test_test.cc60 typedef std::list<T> List; typedef in class:CommonTest
102 typename TestFixture::List empty;
/external/llvm/include/llvm/CodeGen/
H A DMachinePassRegistry.h87 MachinePassRegistryNode *List; // List of registry nodes. member in class:llvm::MachinePassRegistry
98 MachinePassRegistryNode *getList() { return List; }
/external/llvm/lib/CodeGen/
H A DMachineRegisterInfo.cpp126 MachineOperand *List = VRegInfo[Reg].second; local
127 if (!List) continue;
129 List->Contents.Reg.Prev = &VRegInfo[Reg].second;
/external/chromium/net/disk_cache/
H A Drankings.h54 enum List { enum in class:disk_cache::Rankings
55 NO_USE = 0, // List of entries that have not been reused.
56 LOW_USE, // List of entries with low reuse.
57 HIGH_USE, // List of entries with high reuse.
59 DELETED, // List of recently deleted or doomed entries.
99 List list; // Which entry was returned to the user.
113 void Insert(CacheRankingsBlock* node, bool modified, List list);
120 void Remove(CacheRankingsBlock* node, List list, bool strict);
123 void UpdateRank(CacheRankingsBlock* node, bool modified, List list);
126 CacheRankingsBlock* GetNext(CacheRankingsBlock* node, List lis
[all...]
/external/clang/include/clang/Lex/
H A DMacroInfo.h173 void setArgumentList(IdentifierInfo* const *List, unsigned NumArgs, argument
182 ArgumentList[i] = List[i];
/external/clang/lib/ARCMigrate/
H A DInternals.h24 ListTy List; member in class:clang::arcmt::CapturedDiagList
27 void push_back(const StoredDiagnostic &diag) { List.push_back(diag); }
37 iterator begin() const { return List.begin(); }
38 iterator end() const { return List.end(); }
/external/clang/lib/AST/
H A DTemplateBase.cpp534 const TemplateArgumentListInfo &List) {
536 ASTTemplateArgumentListInfo::sizeFor(List);
539 TAI->initializeFrom(List);
533 Create(ASTContext &C, const TemplateArgumentListInfo &List) argument
/external/clang/test/CXX/temp/temp.decls/temp.variadic/
H A Dmetafunctions.cpp136 struct List { struct in namespace:ListMath
143 struct ListI : public List<int, V...> {
/external/guava/src/com/google/common/collect/
H A DImmutableMap.java25 import java.util.List;
160 final List<Entry<K, V>> entries = Lists.newArrayList();
203 List<Entry<K, V>> entries) {
202 fromEntryList( List<Entry<K, V>> entries) argument
/external/llvm/include/llvm/
H A DUse.h133 void addToList(Use **List) { argument
134 Next = *List;
136 setPrev(List);
137 *List = this;
/external/llvm/lib/VMCore/
H A DValue.cpp418 /// List is known to point into the existing use list.
419 void ValueHandleBase::AddToExistingUseList(ValueHandleBase **List) { argument
420 assert(List && "Handle list is null?");
423 Next = *List;
424 *List = this;
425 setPrevPtr(List);
432 void ValueHandleBase::AddToExistingUseListAfter(ValueHandleBase *List) { argument
433 assert(List && "Must insert after existing node");
435 Next = List->Next;
436 setPrevPtr(&List
[all...]
/external/chromium/sdch/open-vcdiff/src/gtest/src/
H A Dgtest-internal-inl.h137 // List is a simple singly-linked list container.
149 // Forward declare List
151 class List;
158 friend class List<E>;
166 // friend class List we can create a ListNode object.
190 // List is a simple singly-linked list container.
192 class List { class in namespace:testing::internal
196 List() : head_(NULL), last_(NULL), size_(0) {} function in class:testing::internal::List
199 virtual ~List();
374 // We disallow copying List
[all...]
/external/chromium/chrome/browser/extensions/
H A Dextension_menu_manager.h34 typedef std::vector<ExtensionMenuItem*> List; typedef in class:ExtensionMenuItem
113 const List& children() { return children_; }
188 List children_;
211 const ExtensionMenuItem::List* MenuItems(const std::string& extension_id);
273 typedef std::map<std::string, ExtensionMenuItem::List> MenuItemMap;
/external/clang/utils/TableGen/
H A DClangAttrEmitter.cpp24 ListInit *List = R.getValueAsListInit(FieldName); local
25 assert (List && "Got a null ListInit");
28 Strings.reserve(List->getSize());
30 for (ListInit::const_iterator i = List->begin(), e = List->end();
/external/llvm/lib/TableGen/
H A DTGLexer.h45 Bit, Bits, Class, Code, Dag, Def, Defm, Field, In, Int, Let, List, enumerator in enum:llvm::tgtok::TokKind
/external/gtest/src/
H A Dgtest-internal-inl.h199 // List is a simple singly-linked list container.
211 // Forward declare List
213 class List;
220 friend class List<E>;
228 // friend class List we can create a ListNode object.
252 // List is a simple singly-linked list container.
254 class List { class in namespace:testing::internal
258 List() : head_(NULL), last_(NULL), size_(0) {} function in class:testing::internal::List
261 virtual ~List();
436 // We disallow copying List
[all...]

Completed in 1009 milliseconds

12