Home
last modified time | relevance | path

Searched refs:list1 (Results 1 – 25 of 138) sorted by relevance

123456

/third_party/flutter/skia/tests/
DLListTest.cpp161 ElList list1; in test_tllist() local
168 REPORTER_ASSERT(reporter, list1.isEmpty()); in test_tllist()
169 REPORTER_ASSERT(reporter, nullptr == iter1.init(list1, Iter::kHead_IterStart)); in test_tllist()
170 REPORTER_ASSERT(reporter, nullptr == iter1.init(list1, Iter::kTail_IterStart)); in test_tllist()
172 list1.popHead(); in test_tllist()
173 list1.popTail(); in test_tllist()
174 REPORTER_ASSERT(reporter, list1.isEmpty()); in test_tllist()
175 REPORTER_ASSERT(reporter, list1 == list2); in test_tllist()
178 list1.addToHead(ListElement(1)); in test_tllist()
180 iter1.init(list1, Iter::kHead_IterStart); in test_tllist()
[all …]
/third_party/protobuf/java/compatibility_tests/v2.5.0/tests/src/main/java/com/google/protobuf/test/
DLazyStringArrayListTest.java124 LazyStringArrayList list1 = new LazyStringArrayList(); in testCopyConstructorCopiesByReference() local
125 list1.add(STRING_A); in testCopyConstructorCopiesByReference()
126 list1.add(BYTE_STRING_B); in testCopyConstructorCopiesByReference()
127 list1.add(BYTE_STRING_C); in testCopyConstructorCopiesByReference()
129 LazyStringArrayList list2 = new LazyStringArrayList(list1); in testCopyConstructorCopiesByReference()
137 List<String> list1 = new ArrayList<String>(); in testListCopyConstructor() local
138 list1.add(STRING_A); in testListCopyConstructor()
139 list1.add(STRING_B); in testListCopyConstructor()
140 list1.add(STRING_C); in testListCopyConstructor()
142 LazyStringArrayList list2 = new LazyStringArrayList(list1); in testListCopyConstructor()
[all …]
/third_party/boost/libs/container/test/
Dslist_test.cpp104 …slist<int> list1; list1.push_front(3); list1.push_front(2); list1.push_front(1); list1.push_front(… in test_for_splice() local
109 list2.splice(list2.begin(), list1, ++list1.begin()); in test_for_splice()
111 if (!(expected1 == list1 && expected2 == list2)) in test_for_splice()
115 …slist<int> list1; list1.push_front(3); list1.push_front(2); list1.push_front(1); list1.push_front(… in test_for_splice() local
120 list2.splice(list2.begin(), list1, list1.begin(), list1.end()); in test_for_splice()
122 if (!(expected1 == list1 && expected2 == list2)) in test_for_splice()
/third_party/typescript/tests/baselines/reference/
DobjectTypeWithRecursiveWrappedProperty2.types14 var list1 = new List<number>();
15 >list1 : List<number>
29 list1 = list2; // ok
30 >list1 = list2 : List<number>
31 >list1 : List<number>
34 list1 = list3; // error
35 >list1 = list3 : List<string>
36 >list1 : List<number>
DobjectTypeWithRecursiveWrappedProperty.types14 var list1 = new List<number>();
15 >list1 : List<number>
29 list1 = list2; // ok
30 >list1 = list2 : List<number>
31 >list1 : List<number>
34 list1 = list3; // error
35 >list1 = list3 : List<string>
36 >list1 : List<number>
DobjectTypeWithRecursiveWrappedProperty.symbols19 var list1 = new List<number>();
20 >list1 : Symbol(list1, Decl(objectTypeWithRecursiveWrappedProperty.ts, 7, 3))
31 list1 = list2; // ok
32 >list1 : Symbol(list1, Decl(objectTypeWithRecursiveWrappedProperty.ts, 7, 3))
35 list1 = list3; // error
36 >list1 : Symbol(list1, Decl(objectTypeWithRecursiveWrappedProperty.ts, 7, 3))
DobjectTypeWithRecursiveWrappedProperty2.symbols19 var list1 = new List<number>();
20 >list1 : Symbol(list1, Decl(objectTypeWithRecursiveWrappedProperty2.ts, 7, 3))
31 list1 = list2; // ok
32 >list1 : Symbol(list1, Decl(objectTypeWithRecursiveWrappedProperty2.ts, 7, 3))
35 list1 = list3; // error
36 >list1 : Symbol(list1, Decl(objectTypeWithRecursiveWrappedProperty2.ts, 7, 3))
DobjectTypeWithRecursiveWrappedProperty2.js9 var list1 = new List<number>();
13 list1 = list2; // ok
14 list1 = list3; // error
23 var list1 = new List(); variable
26 list1 = list2; // ok
27 list1 = list3; // error
DobjectTypeWithRecursiveWrappedProperty.js9 var list1 = new List<number>();
13 list1 = list2; // ok
14 list1 = list3; // error
23 var list1 = new List(); variable
26 list1 = list2; // ok
27 list1 = list3; // error
DobjectTypeWithRecursiveWrappedPropertyCheckedNominally.js14 var list1 = new List<number>();
20 list1 = myList1; // error, not nominally equal
21 list1 = myList2; // error, type mismatch
67 var list1 = new List(); variable
71 list1 = myList1; // error, not nominally equal
72 list1 = myList2; // error, type mismatch
DobjectTypeWithRecursiveWrappedPropertyCheckedNominally.types24 var list1 = new List<number>();
25 >list1 : List<number>
44 list1 = myList1; // error, not nominally equal
45 >list1 = myList1 : MyList<number>
46 >list1 : List<number>
49 list1 = myList2; // error, type mismatch
50 >list1 = myList2 : MyList<string>
51 >list1 : List<number>
/third_party/gstreamer/gstreamer/tests/check/gst/
Dgsttagsetter.c88 GstTagList *list1, *list2; in GST_START_TEST() local
96 list1 = gst_tag_list_new_empty (); in GST_START_TEST()
97 gst_tag_list_add (list1, GST_TAG_MERGE_APPEND, GST_TAG_ARTIST, "artist1", in GST_START_TEST()
99 gst_tag_setter_merge_tags (setter, list1, GST_TAG_MERGE_APPEND); in GST_START_TEST()
111 gst_tag_setter_merge_tags (setter, list1, GST_TAG_MERGE_REPLACE_ALL); in GST_START_TEST()
119 gst_tag_list_unref (list1); in GST_START_TEST()
135 GstTagList *list1, *list2, *merged; in GST_START_TEST() local
141 list1 = gst_tag_list_new_empty (); in GST_START_TEST()
150 gst_tag_list_add (list1, GST_TAG_MERGE_APPEND, GST_TAG_ARTIST, in GST_START_TEST()
158 gst_tag_setter_merge_tags (setter, list1, GST_TAG_MERGE_APPEND); in GST_START_TEST()
[all …]
/third_party/protobuf/js/experimental/runtime/kernel/
Dkernel_repeated_test.js79 const list1 = accessor.getRepeatedBoolIterable(1); constant
81 expect(list1).not.toBe(list2);
98 const list1 = accessor.getRepeatedBoolIterable(1); constant
100 expect(list1).not.toBe(list2);
179 const list1 = accessor.getRepeatedBoolIterable(1); constant
181 expect(list1).not.toBe(list2);
566 const list1 = accessor.getRepeatedDoubleIterable(1); constant
569 expect(list1).not.toBe(list2);
591 const list1 = accessor.getRepeatedDoubleIterable(1); constant
594 expect(list1).not.toBe(list2);
[all …]
/third_party/spirv-tools/test/util/
Dilist_test.cpp257 TestList list1 = BuildList(nodes, 6); in TEST() local
260 TestList::iterator insertion_point = list1.begin(); in TEST()
265 for (auto i = list1.begin(); i != list1.end(); ++i) { in TEST()
275 TestList list1 = BuildList(nodes, 6); in TEST() local
278 TestList::iterator insertion_point = list1.begin(); in TEST()
282 for (auto i = list1.begin(); i != list1.end(); ++i) { in TEST()
292 TestList list1 = BuildList(nodes, 6); in TEST() local
295 TestList::iterator insertion_point = list1.end(); in TEST()
299 for (auto i = list1.begin(); i != list1.end(); ++i) { in TEST()
309 TestList list1 = BuildList(nodes, 6); in TEST() local
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/util/
Dilist_test.cpp257 TestList list1 = BuildList(nodes, 6); in TEST() local
260 TestList::iterator insertion_point = list1.begin(); in TEST()
265 for (auto i = list1.begin(); i != list1.end(); ++i) { in TEST()
275 TestList list1 = BuildList(nodes, 6); in TEST() local
278 TestList::iterator insertion_point = list1.begin(); in TEST()
282 for (auto i = list1.begin(); i != list1.end(); ++i) { in TEST()
292 TestList list1 = BuildList(nodes, 6); in TEST() local
295 TestList::iterator insertion_point = list1.end(); in TEST()
299 for (auto i = list1.begin(); i != list1.end(); ++i) { in TEST()
309 TestList list1 = BuildList(nodes, 6); in TEST() local
[all …]
/third_party/skia/third_party/externals/spirv-tools/test/util/
Dilist_test.cpp257 TestList list1 = BuildList(nodes, 6); in TEST() local
260 TestList::iterator insertion_point = list1.begin(); in TEST()
265 for (auto i = list1.begin(); i != list1.end(); ++i) { in TEST()
275 TestList list1 = BuildList(nodes, 6); in TEST() local
278 TestList::iterator insertion_point = list1.begin(); in TEST()
282 for (auto i = list1.begin(); i != list1.end(); ++i) { in TEST()
292 TestList list1 = BuildList(nodes, 6); in TEST() local
295 TestList::iterator insertion_point = list1.end(); in TEST()
299 for (auto i = list1.begin(); i != list1.end(); ++i) { in TEST()
309 TestList list1 = BuildList(nodes, 6); in TEST() local
[all …]
/third_party/curl/tests/unit/
Dunit1396.c51 const struct test list1[]={ variable
84 for(i = 0; list1[i].in; i++) {
87 list1[i].in, list1[i].inlen,
91 fail_unless(outlen == list1[i].outlen, "wrong output length returned");
92 fail_unless(!memcmp(out, list1[i].out, list1[i].outlen),
/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
DLazyStringArrayListTest.java139 LazyStringArrayList list1 = new LazyStringArrayList(); in testCopyConstructorCopiesByReference() local
140 list1.add(STRING_A); in testCopyConstructorCopiesByReference()
141 list1.add(BYTE_STRING_B); in testCopyConstructorCopiesByReference()
142 list1.add(BYTE_STRING_C); in testCopyConstructorCopiesByReference()
144 LazyStringArrayList list2 = new LazyStringArrayList(list1); in testCopyConstructorCopiesByReference()
152 List<String> list1 = new ArrayList<String>(); in testListCopyConstructor() local
153 list1.add(STRING_A); in testListCopyConstructor()
154 list1.add(STRING_B); in testListCopyConstructor()
155 list1.add(STRING_C); in testListCopyConstructor()
157 LazyStringArrayList list2 = new LazyStringArrayList(list1); in testListCopyConstructor()
[all …]
/third_party/glib/gio/
Dgunixvolumemonitor.c240 diff_sorted_lists (GList *list1, in diff_sorted_lists() argument
250 while (list1 != NULL && in diff_sorted_lists()
253 order = (*compare) (list1->data, list2->data); in diff_sorted_lists()
256 *removed = g_list_prepend (*removed, list1->data); in diff_sorted_lists()
257 list1 = list1->next; in diff_sorted_lists()
266 list1 = list1->next; in diff_sorted_lists()
271 while (list1 != NULL) in diff_sorted_lists()
273 *removed = g_list_prepend (*removed, list1->data); in diff_sorted_lists()
274 list1 = list1->next; in diff_sorted_lists()
/third_party/musl/libc-test/src/functionalext/supplement/misc/
Dforkpty.c34 char list1[2]; in forkpty_0100() local
51 fread(list1, sizeof(list1), 1, fp1); in forkpty_0100()
53 EXPECT_EQ("forkpty_0100", list1[0], '1'); in forkpty_0100()
/third_party/musl/libc-test/src/functionalext/supplement/process/
Dfork.c33 char list1[2]; in fork_0100() local
50 fread(list1, sizeof(list1), 1, fp1); in fork_0100()
52 EXPECT_EQ("fork_0100", list1[0], '1'); in fork_0100()
/third_party/typescript/tests/cases/conformance/types/typeRelationships/recursiveTypes/
DobjectTypeWithRecursiveWrappedProperty.ts8 var list1 = new List<number>(); variable
12 list1 = list2; // ok
13 list1 = list3; // error
DobjectTypeWithRecursiveWrappedProperty2.ts8 var list1 = new List<number>(); variable
12 list1 = list2; // ok
13 list1 = list3; // error
/third_party/gettext/gettext-tools/src/
Dformat-lisp.c135 static bool equal_list (const struct format_arg_list *list1,
138 (struct format_arg_list *list1,
143 (struct format_arg_list *list1,
301 equal_list (const struct format_arg_list *list1, in equal_list() argument
306 VERIFY_LIST (list1); in equal_list()
309 n = list1->initial.count; in equal_list()
314 const struct format_arg * e1 = &list1->initial.element[i]; in equal_list()
321 n = list1->repeated.count; in equal_list()
326 const struct format_arg * e1 = &list1->repeated.element[i]; in equal_list()
1114 make_intersected_list (struct format_arg_list *list1, in make_intersected_list() argument
[all …]
Dformat-scheme.c137 static bool equal_list (const struct format_arg_list *list1,
140 (struct format_arg_list *list1,
145 (struct format_arg_list *list1,
303 equal_list (const struct format_arg_list *list1, in equal_list() argument
308 VERIFY_LIST (list1); in equal_list()
311 n = list1->initial.count; in equal_list()
316 const struct format_arg * e1 = &list1->initial.element[i]; in equal_list()
323 n = list1->repeated.count; in equal_list()
328 const struct format_arg * e1 = &list1->repeated.element[i]; in equal_list()
1126 make_intersected_list (struct format_arg_list *list1, in make_intersected_list() argument
[all …]

123456