/external/python/cpython3/Lib/idlelib/idle_test/ |
H A D | test_calltips.py | 48 class List(list): "List() doc" class in function:Get_signatureTest.test_builtins 55 if List.__doc__ is not None: 56 gtest(List, List.__doc__) 64 gtest(List.append, append_doc)
|
/external/python/cpython3/Lib/test/ |
H A D | test_bisect.py | 227 class List(list): class in function:TestInsort.test_listDerived 232 lst = List()
|
/external/swiftshader/third_party/LLVM/include/llvm/ |
H A D | Use.h | 133 void addToList(Use **List) { argument 134 Next = *List; 136 setPrev(List); 137 *List = this;
|
/external/swiftshader/third_party/LLVM/lib/VMCore/ |
H A D | Value.cpp | 418 /// 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/v8/src/ast/ |
H A D | variables.h | 123 typedef ThreadedList<Variable> List; typedef in class:v8::internal::final 154 friend List;
|
/external/v8/src/ |
H A D | list-inl.h | 19 void List<T, P>::Add(const T& element, P alloc) { 23 List<T, P>::ResizeAdd(element, alloc); 29 void List<T, P>::AddAll(const List<T, P>& other, P alloc) { argument 35 void List<T, P>::AddAll(const Vector<T>& other, P alloc) { 50 void List<T, P>::ResizeAdd(const T& element, P alloc) { 56 void List<T, P>::ResizeAddInternal(const T& element, P alloc) { 70 void List<T, P>::Resize(int new_capacity, P alloc) { 74 List<T, P>::DeleteData(data_); 81 Vector<T> List< [all...] |
/external/v8/src/zone/ |
H A D | zone.h | 152 class ZoneList final : public List<T, ZoneAllocationPolicy> { 157 : List<T, ZoneAllocationPolicy>(capacity, ZoneAllocationPolicy(zone)) {} 161 : List<T, ZoneAllocationPolicy>(static_cast<int>(list.size()), 170 : List<T, ZoneAllocationPolicy>(other.length(), 178 List<T, ZoneAllocationPolicy>::Add(element, ZoneAllocationPolicy(zone)); 180 void AddAll(const List<T, ZoneAllocationPolicy>& other, Zone* zone) { argument 181 List<T, ZoneAllocationPolicy>::AddAll(other, ZoneAllocationPolicy(zone)); 184 List<T, ZoneAllocationPolicy>::AddAll(other, ZoneAllocationPolicy(zone)); 187 List<T, ZoneAllocationPolicy>::InsertAt(index, element, 191 return List< [all...] |
/external/autotest/client/common_lib/cros/ |
H A D | textfsm.py | 175 class List(OptionBase): class in class:TextFSMOptions 522 values: (str), List of FSMVariables. 852 List of Lists.
|
/external/autotest/client/cros/cellular/ |
H A D | pseudo_modem.py | 538 def List(self, *args, **kwargs): member in class:Modem 539 logging.info('Modem.Messaging: List: %s',
|
/external/googletest/googletest/test/ |
H A D | gtest-port_test.cc | 1181 static std::vector<DestructorCall*>& List() { return *list_; } function in class:testing::internal::DestructorCall 1211 // We never access DestructorCall::List() concurrently, so we don't need 1213 DestructorCall::List()[index_]->ReportDestroyed(); 1218 DestructorCall::List().push_back(new DestructorCall); 1219 return DestructorCall::List().size() - 1; 1239 ASSERT_EQ(0U, DestructorCall::List().size()); 1243 ASSERT_EQ(1U, DestructorCall::List().size()); 1244 ASSERT_FALSE(DestructorCall::List()[0]->CheckDestroyed()); 1248 ASSERT_EQ(1U, DestructorCall::List().size()); 1249 EXPECT_TRUE(DestructorCall::List()[ [all...] |
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | TableCollectionTest.java | 31 import java.util.List; 126 public List<Cell<String, Integer, Character>> order( argument 127 List<Cell<String, Integer, Character>> insertionOrder) {
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | TableCollectionTest.java | 46 import java.util.List; 156 @Override public List<String> order(List<String> insertionOrder) { 184 @Override public List<String> order(List<String> insertionOrder) { 227 @Override public List<String> order(List<String> insertionOrder) { 254 @Override public List<String> order(List<String> insertionOrder) { 266 List<Intege 638 order( List<Cell<String, Integer, Character>> insertionOrder) argument [all...] |
/external/llvm/include/llvm/Support/ |
H A D | ScopedPrinter.h | 207 template <typename T> void printList(StringRef Label, const T &List) { argument 210 for (const auto &Item : List) { 220 void printList(StringRef Label, const T &List, const U &Printer) { argument 223 for (const auto &Item : List) { 232 template <typename T> void printHexList(StringRef Label, const T &List) { argument 235 for (const auto &Item : List) {
|
H A D | Error.h | 505 ErrorList &List = static_cast<ErrorList &>(*Payload); local 507 for (auto &P : List.Payloads)
|
/external/llvm/lib/TableGen/ |
H A D | TGLexer.h | 46 Bit, Bits, Class, Code, Dag, Def, Foreach, Defm, Field, In, Int, Let, List, enumerator in enum:llvm::tgtok::TokKind
|
/external/llvm/lib/Target/X86/ |
H A D | X86OptimizeLEAs.cpp | 238 /// \brief Choose the best \p LEA instruction from the \p List to replace 242 bool chooseBestLEA(const SmallVectorImpl<MachineInstr *> &List, 296 // Find the best LEA instruction in the List to replace address recalculation in 305 bool OptimizeLEAPass::chooseBestLEA(const SmallVectorImpl<MachineInstr *> &List, argument 317 for (auto DefMI : List) { 543 auto &List = E.second; local 546 auto I1 = List.begin(); 547 while (I1 != List.end()) { 550 while (I2 != List.end()) { 604 I2 = List [all...] |
/external/llvm/utils/TableGen/ |
H A D | CodeGenMapTable.cpp | 110 // List of fields/attributes that need to be same across all the 114 // List of fields/attributes that are constant across all the instruction 122 // List of values for the fields/attributes listed in 'ColFields', one for 515 ListInit *List = CurMap->getValueAsListInit("ValueCols"); local 517 unsigned ListSize = List->size(); 520 ListInit *ListJ = dyn_cast<ListInit>(List->getElement(j));
|
/external/swiftshader/third_party/LLVM/lib/TableGen/ |
H A D | TGLexer.h | 44 Bit, Bits, Class, Code, Dag, Def, Defm, Field, In, Int, Let, List, enumerator in enum:llvm::tgtok::TokKind
|
/external/v8/testing/gtest/test/ |
H A D | gtest-port_test.cc | 1181 static std::vector<DestructorCall*>& List() { return *list_; } function in class:testing::internal::DestructorCall 1211 // We never access DestructorCall::List() concurrently, so we don't need 1213 DestructorCall::List()[index_]->ReportDestroyed(); 1218 DestructorCall::List().push_back(new DestructorCall); 1219 return DestructorCall::List().size() - 1; 1239 ASSERT_EQ(0U, DestructorCall::List().size()); 1243 ASSERT_EQ(1U, DestructorCall::List().size()); 1244 ASSERT_FALSE(DestructorCall::List()[0]->CheckDestroyed()); 1248 ASSERT_EQ(1U, DestructorCall::List().size()); 1249 EXPECT_TRUE(DestructorCall::List()[ [all...] |
/external/vulkan-validation-layers/tests/gtest-1.7.0/test/ |
H A D | gtest-port_test.cc | 1186 static std::vector<DestructorCall*>& List() { return *list_; } function in class:testing::internal::DestructorCall 1216 // We never access DestructorCall::List() concurrently, so we don't need 1218 DestructorCall::List()[index_]->ReportDestroyed(); 1223 DestructorCall::List().push_back(new DestructorCall); 1224 return DestructorCall::List().size() - 1; 1246 ASSERT_EQ(1U, DestructorCall::List().size()); 1247 ASSERT_FALSE(DestructorCall::List()[0]->CheckDestroyed()); 1251 ASSERT_EQ(2U, DestructorCall::List().size()); 1252 ASSERT_FALSE(DestructorCall::List()[0]->CheckDestroyed()); 1253 ASSERT_FALSE(DestructorCall::List()[ [all...] |
/external/clang/include/clang/Lex/ |
H A D | MacroInfo.h | 161 void setArgumentList(ArrayRef<IdentifierInfo *> List, argument 165 if (List.empty()) 168 NumArguments = List.size(); 169 ArgumentList = PPAllocator.Allocate<IdentifierInfo *>(List.size()); 170 std::copy(List.begin(), List.end(), ArgumentList);
|
/external/guava/guava-tests/test/com/google/common/reflect/ |
H A D | TypeTokenResolutionTest.java | 32 import java.util.List; 74 Foo<String[], List<int[]>> foo = new Foo<String[], List<int[]>>() {}; 76 assertEquals(List.class, foo.getClassB()); 78 assertEquals(List[].class, foo.getArrayClassB()); 130 private interface StringListPredicate extends Predicate<List<String>> {} 137 Predicate<List<String>>, StringListPredicate {} 148 assertEquals(new TypeToken<List<String>>() {}.getType(), 413 new Holder<List<int[][]>[]>() {}.getContentType(); 416 assertEquals(List 430 withMutualRecursiveBound( List<Map<K, V>> list) argument [all...] |
/external/libmojo/third_party/jinja2/ |
H A D | nodes.py | 484 class List(Literal): class in inherits:Literal
|
/external/llvm/include/llvm/ADT/ |
H A D | StringMap.h | 234 StringMap(std::initializer_list<std::pair<StringRef, ValueTy>> List) argument 235 : StringMapImpl(List.size(), static_cast<unsigned>(sizeof(MapEntryTy))) { 236 for (const auto &P : List) {
|
/external/llvm/lib/Bitcode/Writer/ |
H A D | ValueEnumerator.cpp | 145 SmallVector<Entry, 64> List; local 149 List.push_back(std::make_pair(&U, List.size())); 151 if (List.size() < 2) 156 std::sort(List.begin(), List.end(), [&](const Entry &L, const Entry &R) { 197 List.begin(), List.end(), 203 Stack.emplace_back(V, F, List.size()); 204 assert(List [all...] |