Searched defs:set1 (Results 1 - 25 of 57) sorted by relevance

123

/external/google-breakpad/src/client/linux/minidump_writer/
H A Dcpu_set_unittest.cc120 CpuSet set1; local
121 ASSERT_TRUE(set1.ParseSysFile(file1.GetFd()));
122 ASSERT_EQ(11, set1.GetCount());
130 set1.IntersectWith(set2);
131 ASSERT_EQ(4, set1.GetCount());
138 CpuSet set1; local
139 ASSERT_TRUE(set1.ParseSysFile(file1.GetFd()));
140 ASSERT_EQ(11, set1.GetCount());
142 set1.IntersectWith(set1);
149 CpuSet set1; local
[all...]
/external/eigen/bench/
H A Dsparse_randomsetter.cpp51 SetterType* set1 = new SetterType(sm1); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
57 << " nnz=" << set1->nonZeros() << std::flush;
61 t.reset(); t.start(); delete set1; t.stop();
94 // RandomSetter<EigenSparseMatrix,GnuHashMapTraits,Bits> set1(sm1);
97 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
100 // << " nnz=" << set1.nonZeros() << "\n";getchar();
103 // RandomSetter<EigenSparseMatrix,GoogleDenseHashMapTraits,Bits> set1(sm1);
106 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
109 // << " nnz=" << set1
[all...]
/external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/
H A DOptimum.java42 void set1(int newPrice, int optCur, int back) { method in class:Optimum
/external/smali/util/src/main/java/org/jf/util/
H A DCollectionUtils.java192 public static <T extends Comparable<T>> int compareAsSet(@Nonnull Collection<? extends T> set1, argument
194 int res = Ints.compare(set1.size(), set2.size());
197 SortedSet<? extends T> sortedSet1 = toNaturalSortedSet(set1);
201 for (T element1: set1) {
214 SortedSet<? extends T> set1 = toSortedSet(elementComparator, list1);
218 for (T element1: set1) {
/external/v8/test/cctest/
H A Dtest-unique.cc268 UniqueSet<T>* set1, UniqueSet<T>* set2, bool expected) {
269 CHECK(set1->Equals(set1));
271 CHECK(expected == set1->Equals(set2));
272 CHECK(expected == set2->Equals(set1));
283 UniqueSet<String>* set1 = new(&zone) UniqueSet<String>(); local
286 CHECK_SETS(set1, set2, true);
288 set1->Add(A, &zone);
290 CHECK_SETS(set1, set2, false);
294 CHECK_SETS(set1, set
267 CHECK_SETS( UniqueSet<T>* set1, UniqueSet<T>* set2, bool expected) argument
321 UniqueSet<String>* set1 = new(&zone) UniqueSet<String>(); local
356 UniqueSet<String>* set1 = new(&zone) UniqueSet<String>(); local
406 UniqueSet<String>* set1 = MakeSet(&zone, i, elements); local
422 UniqueSet<String>* set1 = new(&zone) UniqueSet<String>(); local
470 UniqueSet<String>* set1 = MakeSet(&zone, i, elements); local
490 UniqueSet<String>* set1 = new(&zone) UniqueSet<String>(); local
538 UniqueSet<String>* set1 = MakeSet(&zone, i, 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/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/icu4c/source/test/intltest/
H A Dtrnserr.cpp181 UnicodeSet *set1 = new UnicodeSet(badPattern, status); local
185 delete set1;
H A Ducdtest.cpp336 UnicodeSet set1, set2; local
337 if (nfcImpl->getCanonStartSet(0x49, set1)) {
346 if (set1!=set2) {
351 //compareUSets(set1, set2,
/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/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
132 if (set1.type() != CV_32F)
133 set1.convertTo(set1, CV_32F);
136 CV_Assert((set1.channels()==2) && (set1.cols>0));
138 return std::max( _apply(set1, set
[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];
82 if (rank_[set2] < rank_[set1])
84 parent[set2] = set1;
85 size[set1] += size[set2];
86 return set1;
88 parent[set1] = set2;
90 size[set2] += size[set1];
[all...]
/external/toybox/toys/pending/
H A Dtr.c36 static void map_translation(char *set1 , char *set2)
41 for (; i; i--, k++) TT.map[set1[k]] = set1[k]|0x100; //set delete bit
45 TT.map[set1[k]] = TT.map[set1[k]]|0x200;
51 TT.map[set1[i]] = ((TT.map[set1[i]] & 0xFF00) | set2[k]);
211 static void print_map(char *set1, char *set2) argument
252 char *set1, *set2 = NULL; local
257 set1
[all...]
/external/valgrind/none/tests/ppc32/
H A Dpower5+_round.c122 double set1[] = { inf, 0.9, 0.1, 0, neg0, -0.1, -0.9, -inf, nan }; local
136 DO_TEST(frsp, set1, frsp1, fprf1);
/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DRow.java67 public Row<C0, C1, C2, C3, C4> set1(C1 item) { method in class:Row
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DRow.java63 public Row<C0, C1, C2, C3, C4> set1(C1 item) { method in class:Row
/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())
74 for(size_t i = 0; i < set1.size(); i++)
81 double dist = norm(set1[i] - set2[j]);
97 // there are two points in set1 corresponding to the same point in set2
107 mean_dist = sqrt(sum_dist/set1.size());
108 // printf("sum_dist = %f, set1.size() = %d, mean_dist = %f\n", sum_dist, (int)set1.size(), mean_dist);
/external/skia/tests/
H A DTextBlobTest.cpp25 RunDef set1[] = { local
28 RunBuilderTest(reporter, builder, set1, SK_ARRAY_COUNT(set1), set1, SK_ARRAY_COUNT(set1));
/external/valgrind/cachegrind/
H A Dcg_sim.c131 UInt set1 = block1 & c->sets_min_1; local
144 return cachesim_setref_is_miss(c, set1, tag1);
152 if (cachesim_setref_is_miss(c, set1, tag1)) {
/external/valgrind/coregrind/
H A Dm_libcsignal.c122 Bool VG_(iseqsigset)( const vki_sigset_t* set1, const vki_sigset_t* set2 ) argument
125 vg_assert(set1 != NULL && set2 != NULL);
129 if (set1->sig[i] != set2->sig[i]) return False;
134 if ((set1->sig[i] & mask) != (set2->sig[i] & mask)) return False;
/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
528 * contained in {@code set1}.
530 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
534 * <p><b>Note:</b> The returned view performs better when {@code set1} is the
544 final Set<? extends E> set1, final Set<? extends E> set2) {
545 checkNotNull(set1, "set1");
548 final Set<? extends E> set2minus1 = difference(set2, set1);
552 return set1.size() + set2minus1.size();
555 return set1
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/timezone/
H A DTimeZoneTest.java857 private void checkContainsAll(Set<String> set1, String name1, Set<String> set2, String name2) { argument
858 if (!set1.containsAll(set2)) {
861 if (!set1.contains(s)) {
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/timezone/
H A DTimeZoneTest.java853 private void checkContainsAll(Set<String> set1, String name1, Set<String> set2, String name2) { argument
854 if (!set1.containsAll(set2)) {
857 if (!set1.contains(s)) {
/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];
168 if (rank[set2] < rank[set1])
170 parent[set2] = set1;
171 size[set1] += size[set2];
172 return set1;
174 parent[set1]
[all...]
/external/webrtc/webrtc/modules/desktop_capture/
H A Ddesktop_region.cc226 void DesktopRegion::IntersectRows(const RowSpanSet& set1, argument
229 RowSpanSet::const_iterator it1 = set1.begin();
230 RowSpanSet::const_iterator end1 = set1.end();

Completed in 1097 milliseconds

123