Home
last modified time | relevance | path

Searched full:list (Results 1 – 25 of 30585) sorted by relevance

12345678910>>...1224

/external/pytorch/aten/src/ATen/core/
DList_test.cpp1 #include <ATen/core/List.h>
8 List<string> list; in TEST() local
9 EXPECT_TRUE(list.empty()); in TEST()
13 List<string> list({"3"}); in TEST() local
14 EXPECT_FALSE(list.empty()); in TEST()
18 List<string> list; in TEST() local
19 EXPECT_EQ(0, list.size()); in TEST()
23 List<string> list({"3", "4"}); in TEST() local
24 EXPECT_EQ(2, list.size()); in TEST()
28 List<string> list({"3", "4"}); in TEST() local
[all …]
DList_inl.h12 List<T>::List(c10::intrusive_ptr<c10::detail::ListImpl>&& elements) in List() function
16 List<T>::List(const c10::intrusive_ptr<c10::detail::ListImpl>& elements) in List() function
20 List<T>::List() in List() function
21 : List(make_intrusive<c10::detail::ListImpl>( in List()
24 …static_assert(!std::is_same<T, IValue>::value, "This constructor is not valid for List<IValue>. Pl… in List()
28 List<T>::List(ArrayRef<T> values) in List() function
29 : List(make_intrusive<c10::detail::ListImpl>( in List()
32 …static_assert(!std::is_same<T, IValue>::value, "This constructor is not valid for List<IValue>. Pl… in List()
33 impl_->list.reserve(values.size()); in List()
35 impl_->list.push_back(element); in List()
[all …]
/external/pigweed/pw_containers/
Dintrusive_list_test.cc58 using List = IntrusiveList<Item>; typedef
60 // Test that a list of items derived from a different Item class can be created.
72 List list({}); in TEST() local
73 EXPECT_TRUE(list.empty()); in TEST()
78 List list({&one}); in TEST() local
80 EXPECT_EQ(&one, &list.front()); in TEST()
81 list.clear(); in TEST()
89 List list({&one, &two, &thr}); in TEST() local
90 auto it = list.begin(); in TEST()
94 EXPECT_EQ(list.end(), it); in TEST()
[all …]
Dintrusive_forward_list_test.cc59 using List = IntrusiveForwardList<Item>; typedef
61 // Test that a list of items derived from a different Item class can be created.
73 List list({}); in TEST() local
74 EXPECT_TRUE(list.empty()); in TEST()
79 List list({&one}); in TEST() local
81 EXPECT_EQ(&one, &list.front()); in TEST()
82 list.clear(); in TEST()
90 List list({&one, &two, &thr}); in TEST() local
91 auto it = list.begin(); in TEST()
95 EXPECT_EQ(list.end(), it); in TEST()
[all …]
/external/openthread/tests/unit/
Dtest_linked_list.cpp8 * notice, this list of conditions and the following disclaimer.
10 * notice, this list of conditions and the following disclaimer in the
88 // This function verifies the content of the linked list matches a given list of entries.
102 VerifyOrQuit(argEntry != nullptr, "List contains more entries than expected"); in VerifyLinkedListContent()
103 VerifyOrQuit(argEntry == &entry, "List does not contain the same entry"); in VerifyLinkedListContent()
109 VerifyOrQuit(prev == argPrev, "List::Find() returned prev entry is incorrect"); in VerifyLinkedListContent()
112 VerifyOrQuit(prev == argPrev, "List::FindMatching() returned prev entry is incorrect"); in VerifyLinkedListContent()
115 VerifyOrQuit(prev == argPrev, "List::FindMatching() returned prev entry is incorrect"); in VerifyLinkedListContent()
123 VerifyOrQuit(argEntry == nullptr, "List contains less entries than expected"); in VerifyLinkedListContent()
139 LinkedList<Entry> list; in TestLinkedList() local
[all …]
/external/guava/android/guava-tests/test/com/google/common/collect/
DListsTest.java46 import java.util.List;
86 private static final List<Integer> SOME_LIST = Lists.newArrayList(1, 2, 3, 4);
88 private static final List<Integer> SOME_SEQUENTIAL_LIST = Lists.newLinkedList(asList(1, 2, 3, 4));
90 private static final List<String> SOME_STRING_LIST = asList("1", "2", "3", "4");
113 protected List<String> create(String[] elements) { in suite()
131 protected List<String> create(String[] elements) { in suite()
150 protected List<String> create(String[] elements) { in suite()
151 List<String> fromList = Lists.newArrayList(); in suite()
170 protected List<String> create(String[] elements) { in suite()
171 List<String> fromList = Lists.newLinkedList(); in suite()
[all …]
/external/guava/guava-tests/test/com/google/common/collect/
DListsTest.java46 import java.util.List;
86 private static final List<Integer> SOME_LIST = Lists.newArrayList(1, 2, 3, 4);
88 private static final List<Integer> SOME_SEQUENTIAL_LIST = Lists.newLinkedList(asList(1, 2, 3, 4));
90 private static final List<String> SOME_STRING_LIST = asList("1", "2", "3", "4");
113 protected List<String> create(String[] elements) { in suite()
131 protected List<String> create(String[] elements) { in suite()
150 protected List<String> create(String[] elements) { in suite()
151 List<String> fromList = Lists.newArrayList(); in suite()
170 protected List<String> create(String[] elements) { in suite()
171 List<String> fromList = Lists.newLinkedList(); in suite()
[all …]
/external/crosvm/swap/src/
Dpresent_list.rs11 /// TODO(b/262379173): Use bit vector to represent the list instead of boolean vector.
14 list: Vec<bool>, field
21 /// Allocates the list of state.
28 list: vec![false; num_of_pages], in new()
37 /// * `idx` - the index in the list.
39 self.list.get(idx) in get()
77 if let Some(list) = self.list.get_mut(idx_range) { in update()
78 for v in list { in update()
87 /// Returns the first range of indices of consecutive pages present in the list.
101 self.min_possible_idx = self.list.len(); in first_data_range()
[all …]
/external/cronet/tot/third_party/llvm-libc/src/cmake/modules/
DLLVMLibCCompileOptionRules.cmake14 list(APPEND compile_options "-mavx2")
15 list(APPEND compile_options "-mfma")
17 list(APPEND compile_options "-D__LIBC_RISCV_USE_FMA")
25 list(APPEND compile_options "-msse4.2")
28 list(APPEND compile_options
32 list(APPEND compile_options "-D__LIBC_USE_BUILTIN_ROUND")
35 list(APPEND compile_options "-D__LIBC_USE_BUILTIN_ROUNDEVEN")
39 list(APPEND compile_options "-D__LIBC_EXPLICIT_SIMD_OPT")
42 list(APPEND compile_options "-D__LIBC_MISC_MATH_BASIC_OPS_OPT")
44 list(APPEND compile_options "-D__LIBC_USE_BUILTIN_FMAX_FMIN")
[all …]
/external/cronet/stable/third_party/llvm-libc/src/cmake/modules/
DLLVMLibCCompileOptionRules.cmake14 list(APPEND compile_options "-mavx2")
15 list(APPEND compile_options "-mfma")
17 list(APPEND compile_options "-D__LIBC_RISCV_USE_FMA")
25 list(APPEND compile_options "-msse4.2")
28 list(APPEND compile_options
32 list(APPEND compile_options "-D__LIBC_USE_BUILTIN_ROUND")
35 list(APPEND compile_options "-D__LIBC_USE_BUILTIN_ROUNDEVEN")
39 list(APPEND compile_options "-D__LIBC_EXPLICIT_SIMD_OPT")
42 list(APPEND compile_options "-D__LIBC_MISC_MATH_BASIC_OPS_OPT")
44 list(APPEND compile_options "-D__LIBC_USE_BUILTIN_FMAX_FMIN")
[all …]
/external/trusty/lk/include/shared/lk/
Dlist.h39 #define LIST_INITIAL_VALUE(list) { &(list), &(list) } argument
42 static inline void list_initialize(struct list_node *list) in list_initialize() argument
44 list->prev = list->next = list; in list_initialize()
60 static inline void list_add_head(struct list_node *list, struct list_node *item) in list_add_head() argument
62 item->next = list->next; in list_add_head()
63 item->prev = list; in list_add_head()
64 list->next->prev = item; in list_add_head()
65 list->next = item; in list_add_head()
70 static inline void list_add_tail(struct list_node *list, struct list_node *item) in list_add_tail() argument
72 item->prev = list->prev; in list_add_tail()
[all …]
/external/trusty/lk/hosttests/listtest/
Dlist_test.cpp24 #include <lk/list.h>
29 * CheckListArray - check that a list contains specific items.
30 * @list: The list to check.
33 * @list.
35 * Check that @list contains the all the entries in @items, in the same order,
39 static void CheckListArray(struct list_node *list, struct list_node *items[], in CheckListArray() argument
45 EXPECT_EQ(list_peek_head(list), head_item) << "List has wrong head"; in CheckListArray()
48 EXPECT_EQ(list_peek_tail(list), tail_item) << "List has wrong tail"; in CheckListArray()
50 list_for_every(list, node) { in CheckListArray()
51 ASSERT_GT(count, i) << "List has more items than expected"; in CheckListArray()
[all …]
/external/wmediumd/wmediumd/
Dlist.h19 * Simple doubly linked list implementation.
39 * @list: list_head structure to be initialized.
41 * Initializes the list_head to point to itself. If it is a list header,
42 * the result is an empty list.
44 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
46 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
47 list->prev = list; in INIT_LIST_HEAD()
64 * This is only for internal list manipulation where we know
83 * @head: list head to add it after
97 * @head: list head to add it before
[all …]
/external/libchrome/base/containers/
Dlinked_list_unittest.cc46 // Checks that when iterating |list| (either from head to tail, or from
49 void ExpectListContentsForDirection(const LinkedList<Node>& list, in ExpectListContentsForDirection() argument
52 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); in ExpectListContentsForDirection()
53 node != list.end(); in ExpectListContentsForDirection()
63 void ExpectListContents(const LinkedList<Node>& list, in ExpectListContents() argument
68 ExpectListContentsForDirection(list, num_nodes, node_ids, true); in ExpectListContents()
72 ExpectListContentsForDirection(list, num_nodes, node_ids, false); in ExpectListContents()
77 LinkedList<Node> list; in TEST() local
78 EXPECT_EQ(list.end(), list.head()); in TEST()
79 EXPECT_EQ(list.end(), list.tail()); in TEST()
[all …]
/external/cronet/tot/base/containers/
Dlinked_list_unittest.cc48 // Checks that when iterating |list| (either from head to tail, or from
50 void ExpectListContentsForDirection(const LinkedList<Node>& list, in ExpectListContentsForDirection() argument
54 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); in ExpectListContentsForDirection()
55 node != list.end(); in ExpectListContentsForDirection()
65 void ExpectListContents(const LinkedList<Node>& list, in ExpectListContents() argument
69 ExpectListContentsForDirection(list, node_ids, true); in ExpectListContents()
73 ExpectListContentsForDirection(list, node_ids, false); in ExpectListContents()
78 LinkedList<Node> list; in TEST() local
79 EXPECT_EQ(list.end(), list.head()); in TEST()
80 EXPECT_EQ(list.end(), list.tail()); in TEST()
[all …]
/external/cronet/stable/base/containers/
Dlinked_list_unittest.cc48 // Checks that when iterating |list| (either from head to tail, or from
50 void ExpectListContentsForDirection(const LinkedList<Node>& list, in ExpectListContentsForDirection() argument
54 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); in ExpectListContentsForDirection()
55 node != list.end(); in ExpectListContentsForDirection()
65 void ExpectListContents(const LinkedList<Node>& list, in ExpectListContents() argument
69 ExpectListContentsForDirection(list, node_ids, true); in ExpectListContents()
73 ExpectListContentsForDirection(list, node_ids, false); in ExpectListContents()
78 LinkedList<Node> list; in TEST() local
79 EXPECT_EQ(list.end(), list.head()); in TEST()
80 EXPECT_EQ(list.end(), list.tail()); in TEST()
[all …]
/external/cronet/stable/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
DProtobufArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
38 import java.util.List;
48 private ProtobufArrayList<Integer> list; field in ProtobufArrayListTest
52 list = new ProtobufArrayList<Integer>(); in setUp()
64 list.addAll(asList(1, 2, 3, 4)); in testModificationWithIteration()
65 Iterator<Integer> iterator = list.iterator(); in testModificationWithIteration()
66 assertEquals(4, list.size()); in testModificationWithIteration()
67 assertEquals(1, (int) list.get(0)); in testModificationWithIteration()
70 list.remove(0); in testModificationWithIteration()
[all …]
/external/cronet/tot/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
DProtobufArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
38 import java.util.List;
48 private ProtobufArrayList<Integer> list; field in ProtobufArrayListTest
52 list = new ProtobufArrayList<Integer>(); in setUp()
64 list.addAll(asList(1, 2, 3, 4)); in testModificationWithIteration()
65 Iterator<Integer> iterator = list.iterator(); in testModificationWithIteration()
66 assertEquals(4, list.size()); in testModificationWithIteration()
67 assertEquals(1, (int) list.get(0)); in testModificationWithIteration()
70 list.remove(0); in testModificationWithIteration()
[all …]
/external/protobuf/java/core/src/test/java/com/google/protobuf/
DProtobufArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
38 import java.util.List;
48 private ProtobufArrayList<Integer> list; field in ProtobufArrayListTest
52 list = new ProtobufArrayList<Integer>(); in setUp()
64 list.addAll(asList(1, 2, 3, 4)); in testModificationWithIteration()
65 Iterator<Integer> iterator = list.iterator(); in testModificationWithIteration()
66 assertEquals(4, list.size()); in testModificationWithIteration()
67 assertEquals(1, (int) list.get(0)); in testModificationWithIteration()
70 list.remove(0); in testModificationWithIteration()
[all …]
/external/kmod/libkmod/
Dlibkmod-list.c26 * SECTION:libkmod-list
27 * @short_description: general purpose list
38 static inline void list_node_append(struct list_node *list, in list_node_append() argument
41 if (list == NULL) { in list_node_append()
46 node->prev = list->prev; in list_node_append()
47 list->prev->next = node; in list_node_append()
48 list->prev = node; in list_node_append()
49 node->next = list; in list_node_append()
63 static inline void list_node_insert_after(struct list_node *list, in list_node_insert_after() argument
66 if (list == NULL) { in list_node_insert_after()
[all …]
/external/python/cpython3/Doc/c-api/
Dlist.rst5 List Objects
8 .. index:: pair: object; list
13 This subtype of :c:type:`PyObject` represents a Python list object.
18 This instance of :c:type:`PyTypeObject` represents the Python list type.
19 This is the same object as :class:`list` in the Python layer.
24 Return true if *p* is a list object or an instance of a subtype of the list
30 Return true if *p* is a list object, but not an instance of a subtype of
31 the list type. This function always succeeds.
36 Return a new list of length *len* on success, or ``NULL`` on failure.
40 If *len* is greater than zero, the returned list object's items are
[all …]
/external/icu/libicu/ndk_headers/unicode/
Duscript.h54 * \xrefitem stable "Stable" "Stable List" ICU 2.2
64 /** \xrefitem stable "Stable" "Stable List" ICU 2.2 */
66 /** \xrefitem stable "Stable" "Stable List" ICU 2.2 */
68 /** \xrefitem stable "Stable" "Stable List" ICU 2.2 */
70 /** \xrefitem stable "Stable" "Stable List" ICU 2.2 */
72 /** \xrefitem stable "Stable" "Stable List" ICU 2.2 */
74 /** \xrefitem stable "Stable" "Stable List" ICU 2.2 */
76 /** \xrefitem stable "Stable" "Stable List" ICU 2.2 */
78 /** \xrefitem stable "Stable" "Stable List" ICU 2.2 */
80 /** \xrefitem stable "Stable" "Stable List" ICU 2.2 */
[all …]
/external/ksp/test-utils/testData/api/
DjavaWildcards2.kt25 // starList : List<Any?>
26 // typeArgList : List<R>
27 // numberList : List<Number>
28 // stringList : List<String>
29 // enumList : List<MyEnum>
30 // jvmWildcard : List<out [@kotlin.jvm.JvmWildcard] String>
31 // suppressJvmWildcard : List<[@kotlin.jvm.JvmSuppressWildcards] Number>
39 // propWithFinalGeneric : List<String>
40 // propWithFinalGeneric.getter() : List<String>
41 // <set-?> : List<String>
[all …]
/external/gson/gson/src/test/java/com/google/gson/
DJsonArrayAsListTest.java13 import java.util.List;
25 List<JsonElement> list = a.asList(); in testGet() local
26 assertEquals(new JsonPrimitive(1), list.get(0)); in testGet()
29 list.get(-1); in testGet()
35 list.get(2); in testGet()
41 assertEquals(JsonNull.INSTANCE, list.get(1)); in testGet()
49 List<JsonElement> list = a.asList(); in testSize() local
50 assertEquals(1, list.size()); in testSize()
51 list.add(new JsonPrimitive(2)); in testSize()
52 assertEquals(2, list.size()); in testSize()
[all …]
/external/llvm/unittests/ADT/
DilistTest.cpp30 ilist<Node> List; in TEST() local
31 List.push_back(Node(1)); in TEST()
32 EXPECT_EQ(1, List.back().Value); in TEST()
33 EXPECT_EQ(nullptr, List.getPrevNode(List.back())); in TEST()
34 EXPECT_EQ(nullptr, List.getNextNode(List.back())); in TEST()
36 List.push_back(Node(2)); in TEST()
37 EXPECT_EQ(2, List.back().Value); in TEST()
38 EXPECT_EQ(2, List.getNextNode(List.front())->Value); in TEST()
39 EXPECT_EQ(1, List.getPrevNode(List.back())->Value); in TEST()
41 const ilist<Node> &ConstList = List; in TEST()
[all …]

12345678910>>...1224