Home
last modified time | relevance | path

Searched refs:list1 (Results 1 - 25 of 36) sorted by relevance

12

/third_party/protobuf/java/compatibility_tests/v2.5.0/tests/src/main/java/com/google/protobuf/test/
H A DLazyStringArrayListTest.java124 LazyStringArrayList list1 = new LazyStringArrayList(); in testCopyConstructorCopiesByReference()
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()
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/skia/third_party/externals/spirv-tools/test/util/
H A 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 in TEST()
309 TestList list1 = BuildList(nodes, 6); TEST() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/util/
H A 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 in TEST()
309 TestList list1 = BuildList(nodes, 6); TEST() local
[all...]
/third_party/spirv-tools/test/util/
H A 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 in TEST()
309 TestList list1 = BuildList(nodes, 6); TEST() local
[all...]
/third_party/curl/tests/unit/
H A Dunit1396.c53 const struct test list1[]={ variable
86 for(i = 0; list1[i].in; i++) {
89 list1[i].in, list1[i].inlen,
93 fail_unless(outlen == list1[i].outlen, "wrong output length returned");
94 fail_unless(!memcmp(out, list1[i].out, list1[i].outlen),
/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
H A DLazyStringArrayListTest.java139 LazyStringArrayList list1 = new LazyStringArrayList(); in testCopyConstructorCopiesByReference()
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()
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...]
H A DFloatArrayListTest.java332 FloatArrayList list1 = new FloatArrayList(); in testEquals()
335 list1.addFloat(Float.intBitsToFloat(0xff800001)); in testEquals()
337 assertEquals(list1, list2); in testEquals()
H A DDoubleArrayListTest.java332 DoubleArrayList list1 = new DoubleArrayList(); in testEquals()
335 list1.addDouble(Double.longBitsToDouble(0x7ff0000000000001L)); in testEquals()
337 assertEquals(list1, list2); in testEquals()
H A DIntArrayListTest.java332 IntArrayList list1 = new IntArrayList(); in testEquals()
335 assertEquals(list1, list2); in testEquals()
H A DBooleanArrayListTest.java334 BooleanArrayList list1 = new BooleanArrayList(); in testEquals()
337 assertEquals(list1, list2); in testEquals()
/third_party/protobuf/js/experimental/runtime/kernel/
H A Dkernel_repeated_test.js79 const list1 = accessor.getRepeatedBoolIterable(1);
81 expect(list1).not.toBe(list2);
98 const list1 = accessor.getRepeatedBoolIterable(1);
100 expect(list1).not.toBe(list2);
179 const list1 = accessor.getRepeatedBoolIterable(1);
181 expect(list1).not.toBe(list2);
566 const list1 = accessor.getRepeatedDoubleIterable(1);
569 expect(list1).not.toBe(list2);
591 const list1 = accessor.getRepeatedDoubleIterable(1);
594 expect(list1)
[all...]
/third_party/typescript/tests/baselines/reference/
H A 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();
71 list1 = myList1; // error, not nominally equal
72 list1 = myList2; // error, type mismatch
/third_party/musl/libc-test/src/functionalext/supplement/misc/
H A Dforkpty.c34 char list1[2]; in forkpty_0100() local
52 fread(list1, sizeof(list1), 1, fp1); in forkpty_0100()
54 EXPECT_EQ("forkpty_0100", list1[0], '1'); in forkpty_0100()
/third_party/musl/libc-test/src/functionalext/supplement/process/
H A Dfork.c34 char list1[2]; in fork_0100() local
65 fread(list1, sizeof(list1), 1, fp1); in fork_0100()
67 EXPECT_EQ("fork_0100", list1[0], '1'); in fork_0100()
/third_party/node/deps/openssl/openssl/crypto/
H A Dparams_dup.c149 const OSSL_PARAM *list1[OSSL_PARAM_MERGE_LIST_MAX + 1]; in OSSL_PARAM_merge() local
160 /* Copy p1 to list1 */ in OSSL_PARAM_merge()
163 list1[list1_sz++] = p; in OSSL_PARAM_merge()
165 list1[list1_sz] = NULL; in OSSL_PARAM_merge()
177 qsort(list1, list1_sz, sizeof(OSSL_PARAM *), compare_params); in OSSL_PARAM_merge()
187 p1cur = list1; in OSSL_PARAM_merge()
190 /* If list1 is finished just tack list2 onto the end */ in OSSL_PARAM_merge()
198 /* If list2 is finished just tack list1 onto the end */ in OSSL_PARAM_merge()
209 /* If the keys are the same then throw away the list1 element */ in OSSL_PARAM_merge()
/third_party/openssl/crypto/
H A Dparams_dup.c149 const OSSL_PARAM *list1[OSSL_PARAM_MERGE_LIST_MAX + 1]; in OSSL_PARAM_merge() local
160 /* Copy p1 to list1 */ in OSSL_PARAM_merge()
163 list1[list1_sz++] = p; in OSSL_PARAM_merge()
165 list1[list1_sz] = NULL; in OSSL_PARAM_merge()
177 qsort(list1, list1_sz, sizeof(OSSL_PARAM *), compare_params); in OSSL_PARAM_merge()
187 p1cur = list1; in OSSL_PARAM_merge()
190 /* If list1 is finished just tack list2 onto the end */ in OSSL_PARAM_merge()
198 /* If list2 is finished just tack list1 onto the end */ in OSSL_PARAM_merge()
209 /* If the keys are the same then throw away the list1 element */ in OSSL_PARAM_merge()
/third_party/ffmpeg/libavcodec/
H A Dh264_mc_template.c49 int list0, int list1) in mc_part()
51 if ((sl->pwt.use_weight == 2 && list0 && list1 && in mc_part()
57 weight_avg[1], list0, list1, PIXEL_SHIFT, CHROMA_IDC); in mc_part()
61 chroma_avg, list0, list1, PIXEL_SHIFT, CHROMA_IDC); in mc_part()
37 mc_part(const H264Context *h, H264SliceContext *sl, int n, int square, int height, int delta, uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr, int x_offset, int y_offset, const qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put, const qpel_mc_func *qpix_avg, h264_chroma_mc_func chroma_avg, const h264_weight_func *weight_op, const h264_biweight_func *weight_avg, int list0, int list1) mc_part() argument
H A Dh264_mb.c55 int list1, int *nrefs) in get_lowest_part_y()
77 if (list1) { in get_lowest_part_y()
331 int list0, int list1, in mc_part_std()
361 if (list1) { in mc_part_std()
381 int list0, int list1, in mc_part_weighted()
405 if (list0 && list1) { in mc_part_weighted()
457 int list = list1 ? 1 : 0; in mc_part_weighted()
52 get_lowest_part_y(const H264Context *h, H264SliceContext *sl, int16_t refs[2][48], int n, int height, int y_offset, int list0, int list1, int *nrefs) get_lowest_part_y() argument
321 mc_part_std(const H264Context *h, H264SliceContext *sl, int n, int square, int height, int delta, uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr, int x_offset, int y_offset, const qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put, const qpel_mc_func *qpix_avg, h264_chroma_mc_func chroma_avg, int list0, int list1, int pixel_shift, int chroma_idc) mc_part_std() argument
369 mc_part_weighted(const H264Context *h, H264SliceContext *sl, int n, int square, int height, int delta, uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr, int x_offset, int y_offset, const qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put, h264_weight_func luma_weight_op, h264_weight_func chroma_weight_op, h264_biweight_func luma_weight_avg, h264_biweight_func chroma_weight_avg, int list0, int list1, int pixel_shift, int chroma_idc) mc_part_weighted() argument
/third_party/skia/third_party/externals/spirv-tools/test/fuzz/
H A Dfuzzer_pass_add_opphi_synonyms_test.cpp58 bool ListsHaveTheSameElements(const std::vector<T>& list1, in ListsHaveTheSameElements() argument
60 auto sorted1 = list1; in ListsHaveTheSameElements()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/fuzz/
H A Dfuzzer_pass_add_opphi_synonyms_test.cpp58 bool ListsHaveTheSameElements(const std::vector<T>& list1, in ListsHaveTheSameElements() argument
60 auto sorted1 = list1; in ListsHaveTheSameElements()
/third_party/spirv-tools/test/fuzz/
H A Dfuzzer_pass_add_opphi_synonyms_test.cpp58 bool ListsHaveTheSameElements(const std::vector<T>& list1, in ListsHaveTheSameElements() argument
60 auto sorted1 = list1; in ListsHaveTheSameElements()
/third_party/python/Lib/test/
H A Dtest_list.py216 list1.clear()
224 list1 = [X()]
226 self.assertTrue(list1 == list2)
H A Dtest_heapq.py457 list1.clear()
460 list1, list2 = [], []
462 self.module.heappush(list1, h(0))
465 self.assertRaises((IndexError, RuntimeError), self.module.heappush, list1, g(1))
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DAbstractMessage.java245 List list1 = (List) value1; in compareFields()
247 if (list1.size() != list2.size()) { in compareFields()
250 for (int i = 0; i < list1.size(); i++) { in compareFields()
251 if (!compareBytes(list1.get(i), list2.get(i))) { in compareFields()
/third_party/ffmpeg/libavformat/
H A Damvenc.c267 int64_t list1; in amv_write_header() local
271 list1 = amv_start_tag(pb, "LIST"); in amv_write_header()
290 amv_end_tag(pb, list1); in amv_write_header()

Completed in 14 milliseconds

12