Searched defs:set2 (Results 1 - 25 of 28) sorted by relevance

12

/external/google-breakpad/src/client/linux/minidump_writer/
H A Dcpu_set_unittest.cc126 CpuSet set2; local
127 ASSERT_TRUE(set2.ParseSysFile(file2.GetFd()));
128 ASSERT_EQ(9, set2.GetCount());
130 set1.IntersectWith(set2);
132 ASSERT_EQ(9, set2.GetCount());
155 CpuSet set2; local
156 ASSERT_TRUE(set2.ParseSysFile(file2.GetFd()));
157 ASSERT_EQ(20, set2.GetCount());
159 set1.IntersectWith(set2);
162 ASSERT_EQ(20, set2
[all...]
/external/skia/tests/
H A DGrOrderedSetTest.cpp126 Set2 set2; local
128 set2.insert("ape");
129 set2.insert(char1);
130 set2.insert(char2);
131 set2.insert(char3);
132 set2.insert("ant");
133 set2.insert("cat");
135 REPORTER_ASSERT(reporter, set2.count() == 4);
136 REPORTER_ASSERT(reporter, set2.find("dog") == set2
[all...]
H A DTextBlobTest.cpp30 RunDef set2[] = { local
33 RunBuilderTest(reporter, builder, set2, SK_ARRAY_COUNT(set2), set2, SK_ARRAY_COUNT(set2));
/external/smali/util/src/main/java/org/jf/util/
H A DCollectionUtils.java193 @Nonnull Collection<? extends T> set2) {
194 int res = Ints.compare(set1.size(), set2.size());
198 SortedSet<? extends T> sortedSet2 = toNaturalSortedSet(set2);
200 Iterator<? extends T> elements2 = set2.iterator();
215 SortedSet<? extends T> set2 = toSortedSet(elementComparator, list2);
217 Iterator<? extends T> elements2 = set2.iterator();
192 compareAsSet(@onnull Collection<? extends T> set1, @Nonnull Collection<? extends T> set2) argument
/external/v8/test/cctest/
H A Dtest-unique.cc268 UniqueSet<T>* set1, UniqueSet<T>* set2, bool expected) {
270 CHECK(set2->Equals(set2));
271 CHECK(expected == set1->Equals(set2));
272 CHECK(expected == set2->Equals(set1));
284 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
286 CHECK_SETS(set1, set2, true);
290 CHECK_SETS(set1, set2, false);
292 set2->Add(A, &zone);
294 CHECK_SETS(set1, set2, tru
267 CHECK_SETS( UniqueSet<T>* set1, UniqueSet<T>* set2, bool expected) argument
322 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
357 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
407 UniqueSet<String>* set2 = MakeSet(&zone, j, elements); local
423 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
471 UniqueSet<String>* set2 = MakeSet(&zone, j, elements); local
491 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
539 UniqueSet<String>* set2 = MakeSet(&zone, j, elements); local
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/
H A DFeatureUtil.java296 Set<? extends T> set1, Set<? extends T> set2) {
297 return intersection(new Set[] {set1, set2});
295 intersection( Set<? extends T> set1, Set<? extends T> set2) argument
/external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/test/
H A DTestBoilerplate.java138 public static boolean verifySetsIdentical(AbstractTestLog here, UnicodeSet set1, UnicodeSet set2) { argument
139 if (set1.equals(set2)) return true;
142 here.errln(new UnicodeSet(set1).removeAll(set2).toPattern(true));
144 here.errln(new UnicodeSet(set2).removeAll(set1).toPattern(true));
/external/toybox/toys/pending/
H A Dtr.c36 static void map_translation(char *set1 , char *set2) argument
47 TT.map[set2[k]] = TT.map[set2[k]]|0x200;
50 while (!(toys.optflags & FLAG_d) && set2 && TT.len1--) { //ignore set2 if -d present
51 TT.map[set1[i]] = ((TT.map[set1[i]] & 0xFF00) | set2[k]);
52 if (set2[k + 1]) k++;
211 static void print_map(char *set1, char *set2) argument
252 char *set1, *set2 = NULL; local
260 if (toys.optargs[1][0] == '\0') error_exit("set2 ca
[all...]
/external/valgrind/none/tests/ppc32/
H A Dpower5+_round.c89 double set2[] = { 0.9, 0.1, -0.1, -0.9, 1e-40, -1e-40 }; local
111 DO_TEST(frin, set2, frin2, frin2rf);
113 DO_TEST(friz, set2, friz2, friz2rf);
115 DO_TEST(frip, set2, frip2, frip2rf);
117 DO_TEST(frim, set2, frim2, frim2rf);
125 double set2[] = local
137 DO_TEST(frsp, set2, frsp2, fprf2);
/external/icu/icu4c/source/test/intltest/
H A Ducdtest.cpp336 UnicodeSet set1, set2; local
342 set2.add(start);
346 if (set1!=set2) {
351 //compareUSets(set1, set2,
H A Dusettest.cpp317 // set1 and set2 used to be built with the obsolete constructor taking
326 UnicodeSet *set2=new UnicodeSet(UNICODE_STRING_SIMPLE("\\p{Decimal Number}"), status); //Number, Decimal digit local
336 if (*set2 != *set2a) {
344 if(*set1 != *set1copy || *set1 == *set2 ||
353 UnicodeSet set2equal=*set2;
354 if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 ||
361 UnicodeSet *set2clone=(UnicodeSet*)set2->clone();
363 *set2clone != *set2 || *set2clone == *set1copy || *set2clone != set2equal ||
370 set2->hashCode() != set2equal.hashCode() || set2
437 UnicodeSet set2; local
[all...]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DRow.java69 public Row<C0, C1, C2, C3, C4> set2(C2 item) { method in class:Row
/external/jmonkeyengine/engine/src/core/com/jme3/math/
H A DTriangle.java154 public void set2(Vector3f v) { method in class:Triangle
/external/valgrind/cachegrind/
H A Dcg_sim.c148 UInt set2 = block2 & c->sets_min_1; local
153 cachesim_setref_is_miss(c, set2, tag2);
156 return cachesim_setref_is_miss(c, set2, tag2);
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DSets.java527 * {@code set1}, then over each element of {@code set2}, in order, that is not
530 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
544 final Set<? extends E> set1, final Set<? extends E> set2) {
546 checkNotNull(set2, "set2");
548 final Set<? extends E> set2minus1 = difference(set2, set1);
555 return set1.isEmpty() && set2.isEmpty();
562 return set1.contains(object) || set2.contains(object);
566 set.addAll(set2);
571 .addAll(set1).addAll(set2)
543 union( final Set<? extends E> set1, final Set<? extends E> set2) argument
602 intersection( final Set<E> set1, final Set<?> set2) argument
639 difference( final Set<E> set1, final Set<?> set2) argument
673 symmetricDifference( Set<? extends E> set1, Set<? extends E> set2) argument
[all...]
/external/icu/icu4c/source/test/cintltst/
H A Dusettest.c82 USet* set2; local
178 set2 = uset_open(1, 1);
179 uset_clear(set2);
182 uset_applyPropertyAlias(set2, PAT_lb, PAT_lb_LEN, VAL_SP, VAL_SP_LEN, &ec);
183 expect(set2, " ", "abcdefghi{bc}", NULL);
186 uset_set(set2, 0x0061, 0x0063);
191 if (uset_containsSome(set, set2)) {
192 log_err("set should not contain some of set2 yet\n");
194 uset_complementAll(set, set2);
195 if (!uset_containsSome(set, set2)) {
[all...]
H A Dcucdtst.c3094 USet *set1, *set2, *set3, *set4; local
3143 set2=uset_openPattern(dashPattern, 8, &errorCode);
3148 showAMinusB(set1, set2, "[:Hyphen:]", "[:Dash:]", FALSE);
3158 showAIntersectB(set3, set2, "[:Cf:]", "[:Dash:]", TRUE);
3165 uset_close(set2);
3214 set2=uset_openPattern(mathPattern, 8, &errorCode);
3217 uset_retainAll(set2, set1); /* [math blocks]&[:Math:] */
3220 compareUSets(set1, set2,
3227 uset_close(set2);
3233 set2
[all...]
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/timezone/
H A DTimeZoneTest.java842 private void checkContainsAll(Set<String> set1, String name1, Set<String> set2, String name2) { argument
843 if (!set1.containsAll(set2)) {
845 for (String s : set2) {
/external/guava/guava/src/com/google/common/collect/
H A DSets.java660 * {@code set1}, then over each element of {@code set2}, in order, that is not
663 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
677 final Set<? extends E> set1, final Set<? extends E> set2) {
679 checkNotNull(set2, "set2");
681 final Set<? extends E> set2minus1 = difference(set2, set1);
688 return set1.isEmpty() && set2.isEmpty();
695 return set1.contains(object) || set2.contains(object);
699 set.addAll(set2);
704 .addAll(set1).addAll(set2)
676 union( final Set<? extends E> set1, final Set<? extends E> set2) argument
735 intersection( final Set<E> set1, final Set<?> set2) argument
772 difference( final Set<E> set1, final Set<?> set2) argument
806 symmetricDifference( Set<? extends E> set1, Set<? extends E> set2) argument
[all...]
/external/icu/icu4c/source/common/
H A Duset.cpp179 uset_containsAll(const USet* set1, const USet* set2) { argument
180 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2);
191 uset_containsNone(const USet* set1, const USet* set2) { argument
192 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2);
196 uset_containsSome(const USet* set1, const USet* set2) { argument
197 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2);
221 uset_equals(const USet* set1, const USet* set2) { argument
222 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2;
/external/clang/test/Misc/
H A Ddiag-template-diffing.cpp71 void set2(I2<int, int>) {}; function
73 set2(I2<double, int, int>());
75 // CHECK-ELIDE-NOTREE: no matching function for call to 'set2'
77 // CHECK-NOELIDE-NOTREE: no matching function for call to 'set2'
79 // CHECK-ELIDE-TREE: no matching function for call to 'set2'
85 // CHECK-NOELIDE-TREE: no matching function for call to 'set2'
/external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/util/
H A DBagFormatter.java73 * @param set2 second set
80 UnicodeSet set2) {
83 showSetDifferences(new PrintWriter(result),name1,set1,name2,set2);
92 Collection set2) {
95 showSetDifferences(new PrintWriter(result), name1, set1, name2, set2);
105 UnicodeSet set2) {
106 showSetDifferences(pw, name1, set1, name2, set2, -1);
113 * @param set2 second set
120 UnicodeSet set2,
129 temp = new UnicodeSet(set1).removeAll(set2);
76 showSetDifferences( String name1, UnicodeSet set1, String name2, UnicodeSet set2) argument
88 showSetDifferences( String name1, Collection set1, String name2, Collection set2) argument
100 showSetDifferences( PrintWriter pw, String name1, UnicodeSet set1, String name2, UnicodeSet set2) argument
115 showSetDifferences( PrintWriter pw, String name1, UnicodeSet set1, String name2, UnicodeSet set2, int flags) argument
154 showSetDifferences( PrintWriter pw, String name1, Collection set1, String name2, Collection set2) argument
[all...]
/external/valgrind/callgrind/
H A Dsim.c299 UInt set2 = block2 & c->sets_min_1; local
304 CacheResult res2 = cachesim_setref(c, set2, tag2);
396 UInt set2 = ((a+size-1) >> c->line_size_bits) & (c->sets_min_1); local
400 if (set1 == set2)
405 else if (((set1 + 1) & (c->sets_min_1)) == set2) {
410 CacheResult res2 = cachesim_setref_wb(c, ref, set2, tag2);
416 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);
690 UInt set2 = ((a+size-1) >> L.line_size_bits) & (L.sets_min_1); \
698 L.name, a, size, set1, set2); \
701 if (set1 == set2) { \
[all...]
/external/pcre/dist/
H A Dpcre_compile.c3080 const pcre_uint8 *set1, *set2, *set_end; local
3233 set2 = (pcre_uint8 *)
3248 set2 = (pcre_uint8 *)(xclass_flags + 1);
3256 set2 = (pcre_uint8 *)(cd->cbits + cbit_digit);
3263 set2 = (pcre_uint8 *)(cd->cbits + cbit_space);
3270 set2 = (pcre_uint8 *)(cd->cbits + cbit_word);
3284 if ((*set1++ & ~(*set2++)) != 0) return FALSE;
3292 if ((*set1++ & *set2++) != 0) return FALSE;
/external/libxml2/
H A Dxpath.c3929 * @set2: the second NodeSet
3930 * @hasSet2NsNodes: 1 if set2 contains namespaces nodes
3932 * Merges two nodesets, all nodes from @set2 are added to @set1
3933 * if @set1 is NULL, a new set is created and copied from @set2.
3934 * Checks for duplicate nodes. Clears set2.
3939 xmlXPathNodeSetMergeAndClear(xmlNodeSetPtr set1, xmlNodeSetPtr set2, argument
3945 * just assigned to set1, since set2 is cleared anyway.
3947 set1 = xmlXPathNodeSetCreateSize(set2->nodeNr);
3950 if (set2->nodeNr != 0) {
3951 memcpy(set1->nodeTab, set2
4052 xmlXPathNodeSetMergeAndClearNoDupls(xmlNodeSetPtr set1, xmlNodeSetPtr set2, int hasNullEntries) argument
[all...]

Completed in 1465 milliseconds

12