Searched refs:set2 (Results 1 - 25 of 75) sorted by relevance

123

/external/testng/src/test/java/test/tmp/
H A DAssertEqualsTest.java42 Set set2 = new HashSet();
45 set2.add(5);
48 set2.add(6);
51 set2.add(1);
54 set2.add(9);
57 System.out.println("set2 is:" + set2.toString());
59 System.out.println("is set1 equals set2 :" + set1.equals(set2));
62 Assert.assertEquals(set1, set2, "set
[all...]
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/types/
H A DSetTagTest.java39 Set<String> set2 = (Set<String>) map.get("baseball teams");
40 assertEquals(3, set2.size());
41 assertTrue(set2.contains("Boston Red Sox"));
42 assertTrue(set2.contains("Detroit Tigers"));
43 assertTrue(set2.contains("New York Yankees"));
/external/skia/tests/
H A DBitSetTest.cpp56 SkBitSet set2(1);
61 REPORTER_ASSERT(reporter, set2 == set3);
62 REPORTER_ASSERT(reporter, set2 != set4);
63 REPORTER_ASSERT(reporter, set2 != set5);
65 set2.setBit(0, true);
66 REPORTER_ASSERT(reporter, set2 != set5);
68 REPORTER_ASSERT(reporter, set2 != set5);
69 REPORTER_ASSERT(reporter, set2 != set3);
71 REPORTER_ASSERT(reporter, set2 == set3);
73 set3 = set2;
[all...]
/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/opencv3/modules/shape/src/
H A Dhaus_dis.cpp101 static float _apply(const Mat &set1, const Mat &set2, int distType, double propRank) argument
104 Mat disMat(set1.cols, set2.cols, CV_32F);
111 Point2f diff = set1.at<Point2f>(0,r)-set2.at<Point2f>(0,c);
131 Mat set1=contour1.getMat(), set2=contour2.getMat(); local
134 if (set2.type() != CV_32F)
135 set2.convertTo(set2, CV_32F);
137 CV_Assert((set2.channels()==2) && (set2.cols>0));
138 return std::max( _apply(set1, set2, distanceFla
[all...]
/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/opencv3/modules/stitching/src/
H A Dutil.cpp74 int DisjointSets::mergeSets(int set1, int set2) argument
76 if (rank_[set1] < rank_[set2])
78 parent[set1] = set2;
79 size[set2] += size[set1];
80 return set2;
82 if (rank_[set2] < rank_[set1])
84 parent[set2] = set1;
85 size[set1] += size[set2];
88 parent[set1] = set2;
89 rank_[set2]
[all...]
/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/testng/src/test/java/test/asserttests/
H A DAssertTest.java61 Set<Integer> set2 = Sets.newHashSet();
64 set2.add(1);
67 set2.add(3);
70 set2.add(2);
72 Assert.assertEquals(set1, set2);
73 Assert.assertEquals(set2, set1);
/external/opencv3/modules/cudaimgproc/src/
H A Dmssegmentation.cpp63 int merge(int set1, int set2);
160 inline int DjSets::merge(int set1, int set2) argument
162 if (rank[set1] < rank[set2])
164 parent[set1] = set2;
165 size[set2] += size[set1];
166 return set2;
168 if (rank[set2] < rank[set1])
170 parent[set2] = set1;
171 size[set1] += size[set2];
174 parent[set1] = set2;
[all...]
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue73/
H A DRecursiveSetTest.java30 Set<Object> set2 = new HashSet<Object>();
31 set1.add(set2);
32 set2.add(set1);
/external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/
H A DOptimum.java52 void set2(int newPrice, int optCur, int back) { method in class:Optimum
/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/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...]
/external/guava/guava/src/com/google/common/collect/
H A DSets.java563 * {@code set1}, then over each element of {@code set2}, in order, that is not
566 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
580 final Set<? extends E> set1, final Set<? extends E> set2) {
582 checkNotNull(set2, "set2");
584 final Set<? extends E> set2minus1 = difference(set2, set1);
591 return set1.isEmpty() && set2.isEmpty();
598 return set1.contains(object) || set2.contains(object);
602 set.addAll(set2);
607 .addAll(set1).addAll(set2)
579 union( final Set<? extends E> set1, final Set<? extends E> set2) argument
638 intersection( final Set<E> set1, final Set<?> set2) argument
675 difference( final Set<E> set1, final Set<?> set2) argument
709 symmetricDifference( Set<? extends E> set1, Set<? extends E> set2) argument
[all...]
/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/android_icu4j/src/main/tests/android/icu/dev/test/lang/
H A DUnicodeSetTest.java496 UnicodeSet set2 = new UnicodeSet();
497 expectPattern(set2, "[f-ky-za-bc[vw]]", "acfkvwyz");
498 set.removeAll(set2);
503 expectPattern(set2, "[hitoshinamekatajamesanderson]", "aadehkmort");
504 set.addAll(set2);
509 expectPattern(set2, "[jackiemclean]", "aacceein");
510 set.addAll(set2);
524 UnicodeSet set2 = new UnicodeSet("[i-o]");
525 set.addAll(set2);
529 set2
[all...]
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/
H A DUnicodeSetTest.java492 UnicodeSet set2 = new UnicodeSet();
493 expectPattern(set2, "[f-ky-za-bc[vw]]", "acfkvwyz");
494 set.removeAll(set2);
499 expectPattern(set2, "[hitoshinamekatajamesanderson]", "aadehkmort");
500 set.addAll(set2);
505 expectPattern(set2, "[jackiemclean]", "aacceein");
506 set.addAll(set2);
520 UnicodeSet set2 = new UnicodeSet("[i-o]");
521 set.addAll(set2);
525 set2
[all...]
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/
H A DTestBoilerplate.java139 public static boolean verifySetsIdentical(AbstractTestLog here, UnicodeSet set1, UnicodeSet set2) { argument
140 if (set1.equals(set2)) return true;
143 here.errln(new UnicodeSet(set1).removeAll(set2).toPattern(true));
145 here.errln(new UnicodeSet(set2).removeAll(set1).toPattern(true));
/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/opencv3/modules/calib3d/test/
H A Dtest_cornerssubpix.cpp65 int calcDistance(const vector<Point2f>& set1, const vector<Point2f>& set2, double& mean_dist) argument
67 if(set1.size() != set2.size())
79 for(int j = 0; j < (int)set2.size(); j++)
81 double dist = norm(set1[i] - set2[j]);
97 // there are two points in set1 corresponding to the same point in set2
/external/valgrind/coregrind/
H A Dpub_core_libcsignal.h52 const vki_sigset_t* set2 );
/external/icu/android_icu4j/src/main/tests/android/icu/dev/util/
H A DBagFormatter.java74 * @param set2 second set
81 UnicodeSet set2) {
84 showSetDifferences(new PrintWriter(result),name1,set1,name2,set2);
93 Collection set2) {
96 showSetDifferences(new PrintWriter(result), name1, set1, name2, set2);
106 UnicodeSet set2) {
107 showSetDifferences(pw, name1, set1, name2, set2, -1);
114 * @param set2 second set
121 UnicodeSet set2,
130 temp = new UnicodeSet(set1).removeAll(set2);
77 showSetDifferences( String name1, UnicodeSet set1, String name2, UnicodeSet set2) argument
89 showSetDifferences( String name1, Collection set1, String name2, Collection set2) argument
101 showSetDifferences( PrintWriter pw, String name1, UnicodeSet set1, String name2, UnicodeSet set2) argument
116 showSetDifferences( PrintWriter pw, String name1, UnicodeSet set1, String name2, UnicodeSet set2, int flags) argument
155 showSetDifferences( PrintWriter pw, String name1, Collection set1, String name2, Collection set2) argument
[all...]
/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...]

Completed in 2095 milliseconds

123