| /external/skia/tests/ |
| D | BitSetTest.cpp | 17 SkBitSet set1(65536); in TestBitSet() local
18 REPORTER_ASSERT(reporter, set0 == set1); in TestBitSet()
37 set1.setBit(12345, true); in TestBitSet()
38 set1.orBits(set0); in TestBitSet()
40 REPORTER_ASSERT(reporter, set1.isBitSet(12345) == true); in TestBitSet()
41 REPORTER_ASSERT(reporter, set1.isBitSet(22) == false); in TestBitSet()
42 REPORTER_ASSERT(reporter, set1.isBitSet(24) == true); in TestBitSet()
44 REPORTER_ASSERT(reporter, set1 != set0); in TestBitSet()
46 set1.clearAll(); in TestBitSet()
48 REPORTER_ASSERT(reporter, set1.isBitSet(12345) == false); in TestBitSet()
[all …]
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| D | Sets.java | 571 final Set<? extends E> set1, final Set<? extends E> set2) { in union() argument
572 checkNotNull(set1, "set1"); in union()
575 final Set<? extends E> set2minus1 = difference(set2, set1); in union()
579 return set1.size() + set2minus1.size(); in union()
582 return set1.isEmpty() && set2.isEmpty(); in union()
586 Iterators.concat(set1.iterator(), set2minus1.iterator())); in union()
589 return set1.contains(object) || set2.contains(object); in union()
592 set.addAll(set1); in union()
598 .addAll(set1).addAll(set2).build(); in union()
630 final Set<E> set1, final Set<?> set2) {
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | Sets.java | 583 final Set<? extends E> set1, final Set<? extends E> set2) { in union() argument
584 checkNotNull(set1, "set1"); in union()
587 final Set<? extends E> set2minus1 = difference(set2, set1); in union()
591 return set1.size() + set2minus1.size(); in union()
594 return set1.isEmpty() && set2.isEmpty(); in union()
598 Iterators.concat(set1.iterator(), set2minus1.iterator())); in union()
601 return set1.contains(object) || set2.contains(object); in union()
604 set.addAll(set1); in union()
610 .addAll(set1).addAll(set2).build(); in union()
642 final Set<E> set1, final Set<?> set2) {
[all …]
|
| /external/valgrind/main/cachegrind/ |
| D | cg_sim.c | 101 UInt set1 = ( a >> L.line_size_bits) & (L.sets_min_1); \
110 if (set1 == set2) { \
112 set = &(L.tags[set1 * L.assoc]); \
142 } else if (((set1 + 1) & (L.sets_min_1)) == set2) { \
143 set = &(L.tags[set1 * L.assoc]); \
185 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);\
|
| /external/stlport/test/eh/ |
| D | test.cpp | 18 std::set<int> set1, set2; in main() local
24 set1.insert(aVector.begin(), aVector.end()); in main()
30 printElements(set1, "set1 : "); in main()
|
| /external/webkit/Source/WebKit/gtk/tests/ |
| D | testatk.c | 942 static gboolean atkAttributeSetAreEqual(AtkAttributeSet* set1, AtkAttributeSet* set2) in atkAttributeSetAreEqual() argument
944 if (!set1) in atkAttributeSetAreEqual()
947 set1 = g_slist_sort(set1, (GCompareFunc)compAtkAttribute); in atkAttributeSetAreEqual()
950 while (set1) { in atkAttributeSetAreEqual()
951 if (!set2 || compAtkAttribute(set1->data, set2->data)) in atkAttributeSetAreEqual()
954 set1 = set1->next; in atkAttributeSetAreEqual()
981 AtkAttributeSet* set1 = atk_text_get_run_attributes(childText, 0, &startOffset, &endOffset); in testWebkitAtkTextAttributes() local
984 g_assert(atkAttributeSetAreEqual(set1, 0)); in testWebkitAtkTextAttributes()
1000 atk_attribute_set_free(set1); in testWebkitAtkTextAttributes()
1009 set1 = atk_text_get_default_attributes(childText); in testWebkitAtkTextAttributes()
[all …]
|
| /external/chromium/chrome/browser/sync/sessions/ |
| D | session_state.cc | 238 vector<syncable::Id>* set1 = id_to_conflict_set_[id1]; in MergeSets() local
241 if (0 == set1 && 0 == set2) { in MergeSets()
251 } else if (0 == set1) { in MergeSets()
257 rv = set1; in MergeSets()
259 } else if (set1 == set2) { in MergeSets()
264 rv = set1; in MergeSets()
|
| /external/webkit/Source/JavaScriptCore/icu/unicode/ |
| D | uset.h | 593 uset_containsAll(const USet* set1, const USet* set2);
604 uset_containsNone(const USet* set1, const USet* set2);
615 uset_containsSome(const USet* set1, const USet* set2);
626 uset_equals(const USet* set1, const USet* set2);
|
| /external/webkit/Source/WebCore/icu/unicode/ |
| D | uset.h | 593 uset_containsAll(const USet* set1, const USet* set2);
604 uset_containsNone(const USet* set1, const USet* set2);
615 uset_containsSome(const USet* set1, const USet* set2);
626 uset_equals(const USet* set1, const USet* set2);
|
| /external/icu4c/common/ |
| D | uset.cpp | 184 uset_containsAll(const USet* set1, const USet* set2) { in uset_containsAll() argument
185 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2); in uset_containsAll()
196 uset_containsNone(const USet* set1, const USet* set2) { in uset_containsNone() argument
197 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2); in uset_containsNone()
201 uset_containsSome(const USet* set1, const USet* set2) { in uset_containsSome() argument
202 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2); in uset_containsSome()
226 uset_equals(const USet* set1, const USet* set2) { in uset_equals() argument
227 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2; in uset_equals()
|
| /external/valgrind/main/callgrind/ |
| D | sim.c | 279 UInt set1 = ( a >> c->line_size_bits) & (c->sets_min_1); in cachesim_ref() local
284 if (set1 == set2) in cachesim_ref()
285 return cachesim_setref(c, set1, tag); in cachesim_ref()
289 else if (((set1 + 1) & (c->sets_min_1)) == set2) { in cachesim_ref()
293 CacheResult res1 = cachesim_setref(c, set1, tag); in cachesim_ref()
298 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2); in cachesim_ref()
383 UInt set1 = ( a >> c->line_size_bits) & (c->sets_min_1); in cachesim_ref_wb() local
388 if (set1 == set2) in cachesim_ref_wb()
389 return cachesim_setref_wb(c, ref, set1, tag); in cachesim_ref_wb()
393 else if (((set1 + 1) & (c->sets_min_1)) == set2) { in cachesim_ref_wb()
[all …]
|
| /external/icu4c/common/unicode/ |
| D | uset.h | 869 uset_containsAll(const USet* set1, const USet* set2);
893 uset_containsNone(const USet* set1, const USet* set2);
904 uset_containsSome(const USet* set1, const USet* set2);
1001 uset_equals(const USet* set1, const USet* set2);
|
| /external/gtest/test/ |
| D | gtest-printers_test.cc | 823 hash_set<string> set1; in TEST() local
824 set1.insert("hello"); in TEST()
825 EXPECT_EQ("{ \"hello\" }", Print(set1)); in TEST()
831 hash_multiset<int> set1(a, a + kSize); in TEST() local
834 const string result = Print(set1); in TEST()
892 set<unsigned int> set1(a, a + 3); in TEST() local
893 EXPECT_EQ("{ 0, 3, 5 }", Print(set1)); in TEST()
898 multiset<int> set1(a, a + 5); in TEST() local
899 EXPECT_EQ("{ 1, 1, 1, 2, 5 }", Print(set1)); in TEST()
|
| /external/chromium/testing/gtest/test/ |
| D | gtest-printers_test.cc | 823 hash_set<string> set1; in TEST() local
824 set1.insert("hello"); in TEST()
825 EXPECT_EQ("{ \"hello\" }", Print(set1)); in TEST()
831 hash_multiset<int> set1(a, a + kSize); in TEST() local
834 const string result = Print(set1); in TEST()
886 set<unsigned int> set1(a, a + 3); in TEST() local
887 EXPECT_EQ("{ 0, 3, 5 }", Print(set1)); in TEST()
892 multiset<int> set1(a, a + 5); in TEST() local
893 EXPECT_EQ("{ 1, 1, 1, 2, 5 }", Print(set1)); in TEST()
|
| /external/valgrind/main/none/tests/ppc32/ |
| D | power5+_round.c | 136 double set1[] = { inf, 0.9, 0.1, 0, neg0, -0.1, -0.9, -inf, nan }; in main() local
161 DO_TEST(frsp, set1, frsp1, fprf1); in main()
|
| /external/icu4c/test/cintltst/ |
| D | cucdtst.c | 2887 USet *set1, *set2, *set3, *set4; in TestConsistency() local
2935 set1=uset_openPattern(hyphenPattern, 10, &errorCode); in TestConsistency()
2939 uset_remove(set1, 0x30fb); in TestConsistency()
2940 uset_remove(set1, 0xff65); /* halfwidth variant */ in TestConsistency()
2941 showAMinusB(set1, set2, "[:Hyphen:]", "[:Dash:]", FALSE); in TestConsistency()
2950 showAIntersectB(set3, set1, "[:Cf:]", "[:Hyphen:]", FALSE); in TestConsistency()
2957 uset_close(set1); in TestConsistency()
2969 set1=uset_openPattern(lowerPattern, 13, &errorCode); in TestConsistency()
2972 length=uset_getItem(set1, i, &start, &end, NULL, 0, &errorCode); in TestConsistency()
3002 uset_close(set1); in TestConsistency()
[all …]
|
| /external/icu4c/test/intltest/ |
| D | ucdtest.cpp | 352 UnicodeSet set1, set2; in TestConsistency() local
353 if (nfcImpl->getCanonStartSet(0x49, set1)) { in TestConsistency()
362 if (set1!=set2) { in TestConsistency()
|
| D | trnserr.cpp | 181 UnicodeSet *set1 = new UnicodeSet(badPattern, status); in TestUnicodeSetErrors() local
185 delete set1; in TestUnicodeSetErrors()
|
| D | usettest.cpp | 322 …UnicodeSet *set1=new UnicodeSet(UNICODE_STRING_SIMPLE("\\p{Lowercase Letter}"), status); // :Ll: … in TestCloneEqualHash() local
335 if (*set1 != *set1a) { in TestCloneEqualHash()
345 UnicodeSet *set1copy=new UnicodeSet(*set1); in TestCloneEqualHash()
346 if(*set1 != *set1copy || *set1 == *set2 || in TestCloneEqualHash()
347 getPairs(*set1) != getPairs(*set1copy) || in TestCloneEqualHash()
348 set1->hashCode() != set1copy->hashCode()){ in TestCloneEqualHash()
354 UnicodeSet set1equal=*set1; in TestCloneEqualHash()
356 if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 || in TestCloneEqualHash()
357 set2equal == *set1 || set2equal == *set1copy || set2equal == set1equal){ in TestCloneEqualHash()
362 UnicodeSet *set1clone=(UnicodeSet*)set1->clone(); in TestCloneEqualHash()
[all …]
|
| /external/llvm/test/Transforms/GlobalOpt/ |
| D | integer-bool.ll | 8 define void @set1() {
|
| /external/valgrind/main/coregrind/ |
| D | m_libcsignal.c | 90 Bool VG_(iseqsigset)( const vki_sigset_t* set1, const vki_sigset_t* set2 ) in VG_()
93 vg_assert(set1 != NULL && set2 != NULL); in VG_()
95 if (set1->sig[i] != set2->sig[i]) return False; in VG_()
|
| D | pub_core_libcsignal.h | 51 extern Bool VG_(iseqsigset) ( const vki_sigset_t* set1,
|
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/picking/ |
| D | BresenhamTerrainPicker.java | 208 gridTriA.set1(t[0].get1()); in getTriangles()
212 gridTriB.set1(t[1].get1()); in getTriangles()
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
| D | FeatureUtil.java | 298 Set<? extends T> set1, Set<? extends T> set2) { in intersection() argument
299 return intersection(new Set[] {set1, set2}); in intersection()
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | SetsTest.java | 120 Set<String> set1 = (size > 1) in suite()
129 return Sets.union(set1, set2); in suite()
138 Set<String> set1 = Sets.newHashSet(elements); in suite()
139 set1.add(samples().e3); in suite()
142 return Sets.intersection(set1, set2); in suite()
151 Set<String> set1 = Sets.newHashSet(elements); in suite()
152 set1.add(samples().e3); in suite()
154 return Sets.difference(set1, set2); in suite()
|