| /external/skia/tests/ |
| BitSetTest.cpp | 56 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/stlport/test/eh/ |
| test.cpp | 18 std::set<int> set1, set2; local
26 set2.insert(1);
27 set2.insert(1);
31 printElements(set2, "set2 : ");
|
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| MediaSetUtils.java | 53 public int compare(MediaSet set1, MediaSet set2) {
54 int result = set1.getName().compareToIgnoreCase(set2.getName());
56 return set1.getPath().toString().compareTo(set2.getPath().toString());
|
| /external/chromium/chrome/browser/sync/sessions/ |
| session_state.cc | 239 vector<syncable::Id>* set2 = id_to_conflict_set_[id2]; local
241 if (0 == set1 && 0 == set2) {
253 rv = set2;
255 } else if (0 == set2) {
259 } else if (set1 == set2) {
267 for (i = set2->begin() ; i != set2->end() ; ++i) {
271 rv->insert(rv->end(), set2->begin(), set2->end());
272 conflict_sets_.erase(set2);
[all...] |
| /external/valgrind/main/cachegrind/ |
| cg_sim.c | 102 UInt set2 = ((a+size-1) >> L.line_size_bits) & (L.sets_min_1); \
110 if (set1 == set2) { \
142 } else if (((set1 + 1) & (L.sets_min_1)) == set2) { \
162 set = &(L.tags[set2 * L.assoc]); \
185 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);\
|
| /external/valgrind/main/none/tests/ppc32/ |
| power5+_round.c | 92 double set2[] = { 0.9, 0.1, -0.1, -0.9, 1e-40, -1e-40 }; local
125 DO_TEST(frin, set2, frin2, frin2rf);
127 DO_TEST(friz, set2, friz2, friz2rf);
129 DO_TEST(frip, set2, frip2, frip2rf);
131 DO_TEST(frim, set2, frim2, frim2rf);
144 double set2[] = local
162 DO_TEST(frsp, set2, frsp2, fprf2);
|
| /external/icu4c/test/cintltst/ |
| usettest.c | 83 USet* set2; local
179 set2 = uset_open(1, 1);
180 uset_clear(set2);
183 uset_applyPropertyAlias(set2, PAT_lb, PAT_lb_LEN, VAL_SP, VAL_SP_LEN, &ec);
184 expect(set2, " ", "abcdefghi{bc}", NULL);
187 uset_set(set2, 0x0061, 0x0063);
192 if (uset_containsSome(set, set2)) {
193 log_err("set should not contain some of set2 yet\n");
195 uset_complementAll(set, set2);
196 if (!uset_containsSome(set, set2)) {
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| Sets.java | 571 * {@code set1}, then over each element of {@code set2}, in order, that is not
574 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
583 final Set<? extends E> set1, final Set<? extends E> set2) {
585 checkNotNull(set2, "set2");
587 final Set<? extends E> set2minus1 = difference(set2, set1);
594 return set1.isEmpty() && set2.isEmpty();
601 return set1.contains(object) || set2.contains(object);
605 set.addAll(set2);
610 .addAll(set1).addAll(set2).build()
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| Sets.java | 559 * {@code set1}, then over each element of {@code set2}, in order, that is not
562 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
571 final Set<? extends E> set1, final Set<? extends E> set2) {
573 checkNotNull(set2, "set2");
575 final Set<? extends E> set2minus1 = difference(set2, set1);
582 return set1.isEmpty() && set2.isEmpty();
589 return set1.contains(object) || set2.contains(object);
593 set.addAll(set2);
598 .addAll(set1).addAll(set2).build()
[all...] |
| /external/webkit/Source/WebKit/gtk/tests/ |
| testatk.c | 986 AtkAttributeSet* set2 = atk_text_get_run_attributes(childText, 15, &startOffset, &endOffset); local
1371 AtkAttributeSet* set2 = atk_object_get_attributes(table2); local
[all...] |
| /external/valgrind/main/coregrind/ |
| pub_core_libcsignal.h | 52 const vki_sigset_t* set2 );
|
| m_libcsignal.c | 90 Bool VG_(iseqsigset)( const vki_sigset_t* set1, const vki_sigset_t* set2 )
93 vg_assert(set1 != NULL && set2 != NULL);
95 if (set1->sig[i] != set2->sig[i]) return False;
|
| /external/webkit/Source/JavaScriptCore/icu/unicode/ |
| uset.h | 586 * of set2. It answers the question, 'Is set1 a subset of set2?'
588 * @param set2 set to be checked for containment
593 uset_containsAll(const USet* set1, const USet* set2);
597 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
599 * @param set2 set to be checked for containment
604 uset_containsNone(const USet* set1, const USet* set2);
608 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
[all...] |
| /external/webkit/Source/WebCore/icu/unicode/ |
| uset.h | 586 * of set2. It answers the question, 'Is set1 a subset of set2?'
588 * @param set2 set to be checked for containment
593 uset_containsAll(const USet* set1, const USet* set2);
597 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
599 * @param set2 set to be checked for containment
604 uset_containsNone(const USet* set1, const USet* set2);
608 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
[all...] |
| /external/icu4c/common/ |
| uset.cpp | 184 uset_containsAll(const USet* set1, const USet* set2) {
185 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2);
196 uset_containsNone(const USet* set1, const USet* set2) {
197 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2);
201 uset_containsSome(const USet* set1, const USet* set2) {
202 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2);
226 uset_equals(const USet* set1, const USet* set2) {
227 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2;
|
| /external/icu4c/common/unicode/ |
| uset.h | 862 * of set2. It answers the question, 'Is set1 a superset of set2?'
864 * @param set2 set to be checked for containment
869 uset_containsAll(const USet* set1, const USet* set2);
886 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
888 * @param set2 set to be checked for containment
893 uset_containsNone(const USet* set1, const USet* set2);
897 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
[all...] |
| /external/icu4c/test/intltest/ |
| ucdtest.cpp | 352 UnicodeSet set1, set2; local
358 set2.add(start);
362 if (set1!=set2) {
367 //compareUSets(set1, set2,
|
| usettest.cpp | 319 // set1 and set2 used to be built with the obsolete constructor taking
328 UnicodeSet *set2=new UnicodeSet(UNICODE_STRING_SIMPLE("\\p{Decimal Number}"), status); //Number, Decimal digit local
338 if (*set2 != *set2a) {
346 if(*set1 != *set1copy || *set1 == *set2 ||
355 UnicodeSet set2equal=*set2;
356 if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 ||
363 UnicodeSet *set2clone=(UnicodeSet*)set2->clone();
365 *set2clone != *set2 || *set2clone == *set1copy || *set2clone != set2equal ||
372 set2->hashCode() != set2equal.hashCode() || set2->hashCode() != set2clone->hashCode() |
439 UnicodeSet set2; local
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
| FeatureUtil.java | 298 Set<? extends T> set1, Set<? extends T> set2) {
299 return intersection(new Set[] {set1, set2});
|
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/picking/ |
| BresenhamTerrainPicker.java | 209 gridTriA.set2(t[0].get2());
213 gridTriB.set2(t[1].get2());
|
| /external/valgrind/main/callgrind/ |
| sim.c | 280 UInt set2 = ((a+size-1) >> c->line_size_bits) & (c->sets_min_1); local
284 if (set1 == set2)
289 else if (((set1 + 1) & (c->sets_min_1)) == set2) {
294 CacheResult res2 = cachesim_setref(c, set2, tag2);
298 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);
384 UInt set2 = ((a+size-1) >> c->line_size_bits) & (c->sets_min_1); local
388 if (set1 == set2)
393 else if (((set1 + 1) & (c->sets_min_1)) == set2) {
398 CacheResult res2 = cachesim_setref_wb(c, ref, set2, tag2);
404 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);
[all...] |
| /packages/apps/Browser/src/com/android/browser/ |
| NavTabScroller.java | 333 AnimatorSet set2 = new AnimatorSet(); local
334 set2.playTogether(scroll1, trans2);
335 set2.setDuration(duration2);
336 mAnimator.playSequentially(set1, set2);
|
| PhoneUi.java | 387 AnimatorSet set2 = new AnimatorSet(); local
400 set2.playTogether(l, t, r, b, scale);
401 set2.setDuration(200);
403 combo.playSequentially(set1, set2, otheralpha);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| SetsTest.java | 125 Set<String> set2 = (size > 0)
129 return Sets.union(set1, set2);
140 Set<String> set2 = Sets.newHashSet(elements);
141 set2.add(samples().e4);
142 return Sets.intersection(set1, set2);
153 Set<String> set2 = Sets.newHashSet(samples().e3);
154 return Sets.difference(set1, set2);
[all...] |
| /external/stlport/test/unit/ |
| set_test.cpp | 21 CPPUNIT_TEST(set2);
38 void set2();
68 void SetTest::set2() function in class:SetTest
|
