| /external/pigweed/pw_containers/ |
| D | intrusive_list_test.cc | 47 IntrusiveList<TestItem> list({}); in TEST() local
48 EXPECT_TRUE(list.empty()); in TEST()
53 IntrusiveList<TestItem> list({&one}); in TEST() local
55 EXPECT_EQ(&one, &list.front()); in TEST()
63 IntrusiveList<TestItem> list({&one, &two, &thr}); in TEST() local
64 auto it = list.begin(); in TEST()
68 EXPECT_EQ(list.end(), it); in TEST()
73 IntrusiveList<TestItem> list(array.begin(), array.end()); in TEST() local
75 EXPECT_TRUE(list.empty()); in TEST()
80 IntrusiveList<TestItem> list(array.begin(), array.end()); in TEST() local
[all …]
|
| /external/openthread/tests/unit/ |
| D | test_linked_list.cpp | 8 * notice, this list of conditions and the following disclaimer.
10 * notice, this list of conditions and the following disclaimer in the
87 // This function verifies the content of the linked list matches a given list of entries.
101 VerifyOrQuit(argEntry != nullptr, "List contains more entries than expected"); in VerifyLinkedListContent()
102 VerifyOrQuit(argEntry == &entry, "List does not contain the same entry"); in VerifyLinkedListContent()
108 VerifyOrQuit(prev == argPrev, "List::Find() returned prev entry is incorrect"); in VerifyLinkedListContent()
111 VerifyOrQuit(prev == argPrev, "List::FindMatching() returned prev entry is incorrect"); in VerifyLinkedListContent()
114 VerifyOrQuit(prev == argPrev, "List::FindMatching() returned prev entry is incorrect"); in VerifyLinkedListContent()
122 VerifyOrQuit(argEntry == nullptr, "List contains less entries than expected"); in VerifyLinkedListContent()
138 LinkedList<Entry> list; in TestLinkedList() local
[all …]
|
| /external/crosvm/swap/src/ |
| D | present_list.rs | 11 /// 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()
33 /// Returns the length of the list.
35 self.list.len() in len()
42 /// * `idx` - the index in the list.
44 self.list.get(idx) in get()
82 if let Some(list) = self.list.get_mut(idx_range) { in update()
83 for v in list { in update()
[all …]
|
| /external/guava/android/guava-tests/test/com/google/common/collect/ |
| D | ListsTest.java | 45 import java.util.List;
84 private static final List<Integer> SOME_LIST = Lists.newArrayList(1, 2, 3, 4);
86 private static final List<Integer> SOME_SEQUENTIAL_LIST = Lists.newLinkedList(asList(1, 2, 3, 4));
88 private static final List<String> SOME_STRING_LIST = asList("1", "2", "3", "4");
110 protected List<String> create(String[] elements) { in suite()
128 protected List<String> create(String[] elements) { in suite()
147 protected List<String> create(String[] elements) { in suite()
148 List<String> fromList = Lists.newArrayList(); in suite()
167 protected List<String> create(String[] elements) { in suite()
168 List<String> fromList = Lists.newLinkedList(); in suite()
[all …]
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | ListsTest.java | 45 import java.util.List;
84 private static final List<Integer> SOME_LIST = Lists.newArrayList(1, 2, 3, 4);
86 private static final List<Integer> SOME_SEQUENTIAL_LIST = Lists.newLinkedList(asList(1, 2, 3, 4));
88 private static final List<String> SOME_STRING_LIST = asList("1", "2", "3", "4");
110 protected List<String> create(String[] elements) { in suite()
128 protected List<String> create(String[] elements) { in suite()
147 protected List<String> create(String[] elements) { in suite()
148 List<String> fromList = Lists.newArrayList(); in suite()
167 protected List<String> create(String[] elements) { in suite()
168 List<String> fromList = Lists.newLinkedList(); in suite()
[all …]
|
| /external/wmediumd/wmediumd/ |
| D | list.h | 19 * 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/ |
| D | linked_list_unittest.cc | 46 // 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/third_party/protobuf/java/core/src/test/java/com/google/protobuf/ |
| D | ProtobufArrayListTest.java | 10 // 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 …]
|
| D | LazyStringArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
41 import java.util.List;
60 LazyStringArrayList list = new LazyStringArrayList(); in testJustStrings() local
61 list.add(STRING_A); in testJustStrings()
62 list.add(STRING_B); in testJustStrings()
63 list.add(STRING_C); in testJustStrings()
65 assertThat(list).hasSize(3); in testJustStrings()
66 assertThat(list.get(0)).isSameInstanceAs(STRING_A); in testJustStrings()
67 assertThat(list.get(1)).isSameInstanceAs(STRING_B); in testJustStrings()
[all …]
|
| /external/protobuf/java/core/src/test/java/com/google/protobuf/ |
| D | ProtobufArrayListTest.java | 10 // 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 …]
|
| D | LazyStringArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
41 import java.util.List;
60 LazyStringArrayList list = new LazyStringArrayList(); in testJustStrings() local
61 list.add(STRING_A); in testJustStrings()
62 list.add(STRING_B); in testJustStrings()
63 list.add(STRING_C); in testJustStrings()
65 assertThat(list).hasSize(3); in testJustStrings()
66 assertThat(list.get(0)).isSameInstanceAs(STRING_A); in testJustStrings()
67 assertThat(list.get(1)).isSameInstanceAs(STRING_B); in testJustStrings()
[all …]
|
| /external/icu/libicu/ndk_headers/unicode/ |
| D | uscript.h | 54 * \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/kmod/libkmod/ |
| D | libkmod-list.c | 26 * 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/mesa3d/src/util/ |
| D | simple_list.h | 5 * Intended to work with a list sentinal which is created as an empty
6 * list. Insert & delete are O(1).
50 * Remove an element from list.
62 * Insert an element to the list head.
64 * \param list list.
67 #define insert_at_head(list, elem) \ argument
69 (elem)->prev = list; \
70 (elem)->next = (list)->next; \
71 (list)->next->prev = elem; \
72 (list)->next = elem; \
[all …]
|
| /external/gson/gson/src/test/java/com/google/gson/ |
| D | JsonArrayAsListTest.java | 13 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/cronet/base/containers/ |
| D | linked_list_unittest.cc | 47 // Checks that when iterating |list| (either from head to tail, or from
50 void ExpectListContentsForDirection(const LinkedList<Node>& list, in ExpectListContentsForDirection() argument
53 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); in ExpectListContentsForDirection()
54 node != list.end(); in ExpectListContentsForDirection()
64 void ExpectListContents(const LinkedList<Node>& list, in ExpectListContents() argument
69 ExpectListContentsForDirection(list, num_nodes, node_ids, true); in ExpectListContents()
73 ExpectListContentsForDirection(list, num_nodes, 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/google-breakpad/src/third_party/libdisasm/swig/ |
| D | libdisasm.i | 124 x86_op_list *list = (x86_op_list *) in x86_op_list_new() local
126 list->count = 0; in x86_op_list_new()
127 return list; in x86_op_list_new()
130 void x86_op_list_free(x86_op_list *list) { in x86_op_list_free() argument
133 node = list->head; in x86_op_list_free()
141 free( list ); in x86_op_list_free()
144 x86_op_list_node * x86_op_list_first(x86_op_list *list) { in x86_op_list_first() argument
145 return list->head; in x86_op_list_first()
148 x86_op_list_node * x86_op_list_last(x86_op_list *list) { in x86_op_list_last() argument
149 return list->tail; in x86_op_list_last()
[all …]
|
| /external/llvm/unittests/ADT/ |
| D | ilistTest.cpp | 30 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 …]
|
| /external/javaparser/javaparser-core-testing/src/test/java/com/github/javaparser/utils/ |
| D | VisitorListTest.java | 30 import java.util.List;
42 List<CompilationUnit> list = new ArrayList<>(); in visitorAddAll() local
43 list.add(parse("class X{}")); in visitorAddAll()
44 list.add(parse("class X{}")); in visitorAddAll()
47 vList.addAll(list); in visitorAddAll()
48 for (int i = 0; i < list.size(); i++) in visitorAddAll()
49 assertEquals(list.get(i), vList.get(i)); in visitorAddAll()
54 List<CompilationUnit> list = new ArrayList<>(); in visitorAddAllAtIndex() local
55 list.add(parse("class X{}")); in visitorAddAllAtIndex()
56 list.add(parse("class Y{}")); in visitorAddAllAtIndex()
[all …]
|
| /external/smali/util/src/test/java/org/jf/util/ |
| D | LinearSearchTest.java | 10 * notice, this list of conditions and the following disclaimer.
12 * copyright notice, this list of conditions and the following disclaimer
39 import java.util.List;
44 List<Integer> list = Lists.newArrayList(0, 1, 3, 4); in testLinearSearch() local
46 doTest(list, 5, 10); in testLinearSearch()
47 doTest(list, 5, 4); in testLinearSearch()
48 doTest(list, 5, 3); in testLinearSearch()
49 doTest(list, 5, 2); in testLinearSearch()
50 doTest(list, 5, 1); in testLinearSearch()
51 doTest(list, 5, 0); in testLinearSearch()
[all …]
|
| /external/google-smali/util/src/test/java/com/android/tools/smali/util/ |
| D | LinearSearchTest.java | 9 * notice, this list of conditions and the following disclaimer.
11 * copyright notice, this list of conditions and the following disclaimer
39 import java.util.List;
44 List<Integer> list = Lists.newArrayList(0, 1, 3, 4); in testLinearSearch() local
46 doTest(list, 5, 10); in testLinearSearch()
47 doTest(list, 5, 4); in testLinearSearch()
48 doTest(list, 5, 3); in testLinearSearch()
49 doTest(list, 5, 2); in testLinearSearch()
50 doTest(list, 5, 1); in testLinearSearch()
51 doTest(list, 5, 0); in testLinearSearch()
[all …]
|
| /external/protobuf/csharp/compatibility_tests/v3.0.0/src/Google.Protobuf.Test/Collections/ |
| D | RepeatedFieldTest.cs | 11 // notice, this list of conditions and the following disclaimer.
13 // copyright notice, this list of conditions and the following disclaimer
50 var list = new RepeatedField<string>(); in NullValuesRejected()
51 Assert.Throws<ArgumentNullException>(() => list.Add((string)null)); in NullValuesRejected()
52 Assert.Throws<ArgumentNullException>(() => list.Add((IEnumerable<string>)null)); in NullValuesRejected()
53 Assert.Throws<ArgumentNullException>(() => list.Add((RepeatedField<string>)null)); in NullValuesRejected()
54 Assert.Throws<ArgumentNullException>(() => list.Contains(null)); in NullValuesRejected()
55 Assert.Throws<ArgumentNullException>(() => list.IndexOf(null)); in NullValuesRejected()
61 var list = new RepeatedField<string>(); in Add_SingleItem()
62 list.Add("foo"); in Add_SingleItem()
[all …]
|
| /external/cronet/third_party/protobuf/csharp/compatibility_tests/v3.0.0/src/Google.Protobuf.Test/Collections/ |
| D | RepeatedFieldTest.cs | 11 // notice, this list of conditions and the following disclaimer.
13 // copyright notice, this list of conditions and the following disclaimer
50 var list = new RepeatedField<string>(); in NullValuesRejected()
51 Assert.Throws<ArgumentNullException>(() => list.Add((string)null)); in NullValuesRejected()
52 Assert.Throws<ArgumentNullException>(() => list.Add((IEnumerable<string>)null)); in NullValuesRejected()
53 Assert.Throws<ArgumentNullException>(() => list.Add((RepeatedField<string>)null)); in NullValuesRejected()
54 Assert.Throws<ArgumentNullException>(() => list.Contains(null)); in NullValuesRejected()
55 Assert.Throws<ArgumentNullException>(() => list.IndexOf(null)); in NullValuesRejected()
61 var list = new RepeatedField<string>(); in Add_SingleItem()
62 list.Add("foo"); in Add_SingleItem()
[all …]
|
| /external/protobuf/java/core/src/main/java/com/google/protobuf/ |
| D | ListFieldSchema.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
36 import java.util.List;
39 * Utility class that aids in properly manipulating list fields for either the lite or full runtime.
49 abstract <L> List<L> mutableListAt(Object msg, long offset); in mutableListAt()
70 <L> List<L> mutableListAt(Object message, long offset) { in mutableListAt()
76 List<?> list = (List<?>) UnsafeUtil.getObject(message, offset); in makeImmutableListAt() local
78 if (list instanceof LazyStringList) { in makeImmutableListAt()
79 immutable = ((LazyStringList) list).getUnmodifiableView(); in makeImmutableListAt()
80 } else if (UNMODIFIABLE_LIST_CLASS.isAssignableFrom(list.getClass())) { in makeImmutableListAt()
[all …]
|
| /external/cronet/third_party/protobuf/java/core/src/main/java/com/google/protobuf/ |
| D | ListFieldSchema.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
36 import java.util.List;
39 * Utility class that aids in properly manipulating list fields for either the lite or full runtime.
49 abstract <L> List<L> mutableListAt(Object msg, long offset); in mutableListAt()
70 <L> List<L> mutableListAt(Object message, long offset) { in mutableListAt()
76 List<?> list = (List<?>) UnsafeUtil.getObject(message, offset); in makeImmutableListAt() local
78 if (list instanceof LazyStringList) { in makeImmutableListAt()
79 immutable = ((LazyStringList) list).getUnmodifiableView(); in makeImmutableListAt()
80 } else if (UNMODIFIABLE_LIST_CLASS.isAssignableFrom(list.getClass())) { in makeImmutableListAt()
[all …]
|