HomeSort by relevance Sort by last modified time
    Searched defs:set1 (Results 26 - 50 of 100) sorted by null

12 3 4

  /external/chromium_org/third_party/icu/source/test/intltest/
ucdtest.cpp 355 UnicodeSet set1, set2; local
356 if (nfcImpl->getCanonStartSet(0x49, set1)) {
365 if (set1!=set2) {
370 //compareUSets(set1, set2,
usettest.cpp 319 // set1 and set2 used to be built with the obsolete constructor taking
322 UnicodeSet *set1=new UnicodeSet(UNICODE_STRING_SIMPLE("\\p{Lowercase Letter}"), status); // :Ll: Letter, lowercase local
335 if (*set1 != *set1a) {
345 UnicodeSet *set1copy=new UnicodeSet(*set1);
346 if(*set1 != *set1copy || *set1 == *set2 ||
347 getPairs(*set1) != getPairs(*set1copy) ||
348 set1->hashCode() != set1copy->hashCode()){
354 UnicodeSet set1equal=*set1;
356 if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 ||
    [all...]
  /external/icu/icu4c/source/test/intltest/
ucdtest.cpp 355 UnicodeSet set1, set2; local
356 if (nfcImpl->getCanonStartSet(0x49, set1)) {
365 if (set1!=set2) {
370 //compareUSets(set1, set2,
usettest.cpp 319 // set1 and set2 used to be built with the obsolete constructor taking
322 UnicodeSet *set1=new UnicodeSet(UNICODE_STRING_SIMPLE("\\p{Lowercase Letter}"), status); // :Ll: Letter, lowercase local
335 if (*set1 != *set1a) {
345 UnicodeSet *set1copy=new UnicodeSet(*set1);
346 if(*set1 != *set1copy || *set1 == *set2 ||
347 getPairs(*set1) != getPairs(*set1copy) ||
348 set1->hashCode() != set1copy->hashCode()){
354 UnicodeSet set1equal=*set1;
356 if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 ||
    [all...]
  /external/stlport/test/unit/
set_test.cpp 20 CPPUNIT_TEST(set1);
37 void set1();
56 void SetTest::set1() function in class:SetTest
  /libcore/support/src/test/java/tests/support/
Support_MapTest.java 130 private static <T> void crossCheckOrdering(Set<T> set1, Set<T> set2, Class<?> elementType) {
131 Iterator<T> set1Iterator = set1.iterator();
135 T[] set1TypedArray1 = set1.toArray(zeroLengthArray);
136 assertEquals(set1.size(), set1TypedArray1.length);
138 // Compare set1.iterator(), set2.iterator() and set1.toArray(new T[0])
144 // Compare set1 with set2
153 assertEquals(set1.size(), entryCount);
157 // set1.toArray(new T[size])
158 T[] parameterArray1 = createArray(elementType, set1.size())
    [all...]
  /ndk/sources/host-tools/gdb-pretty-printers/stlport/gppfs-0.2/test/
test.cpp 64 std::set<int> set1; local
65 set1.insert( 100);
66 set1.insert( 200);
67 set1.insert( 300);
  /ndk/tests/device/test-gnustl-full/unit/
set_test.cpp 20 CPPUNIT_TEST(set1);
37 void set1();
56 void SetTest::set1() function in class:SetTest
  /ndk/tests/device/test-stlport/unit/
set_test.cpp 20 CPPUNIT_TEST(set1);
37 void set1();
56 void SetTest::set1() function in class:SetTest
  /prebuilts/python/darwin-x86/2.7.5/share/pretty-printers/stlport/test/
test.cpp 64 std::set<int> set1; local
65 set1.insert( 100);
66 set1.insert( 200);
67 set1.insert( 300);
  /prebuilts/python/linux-x86/2.7.5/share/pretty-printers/stlport/test/
test.cpp 64 std::set<int> set1; local
65 set1.insert( 100);
66 set1.insert( 200);
67 set1.insert( 300);
  /packages/apps/Browser/src/com/android/browser/
NavTabScroller.java 314 AnimatorSet set1 = new AnimatorSet(); local
315 set1.playTogether(trans, alpha);
316 set1.setDuration(duration);
336 mAnimator.playSequentially(set1, set2);
339 mAnimator.playSequentially(set1, scroll1);
344 mAnimator.playSequentially(set1, trans2);
  /external/chromium_org/chrome/common/extensions/permissions/
permission_set_unittest.cc 252 scoped_refptr<PermissionSet> set1; local
279 set1 = new PermissionSet(apis1, manifest_permissions,
283 union_set = PermissionSet::CreateUnion(set1.get(), set2.get());
284 EXPECT_TRUE(set1->Contains(*set2.get()));
285 EXPECT_TRUE(set1->Contains(*union_set.get()));
286 EXPECT_FALSE(set2->Contains(*set1.get()));
288 EXPECT_TRUE(union_set->Contains(*set1.get()));
339 union_set = PermissionSet::CreateUnion(set1.get(), set2.get());
341 EXPECT_FALSE(set1->Contains(*set2.get()));
342 EXPECT_FALSE(set1->Contains(*union_set.get()))
374 scoped_refptr<PermissionSet> set1; local
486 scoped_refptr<PermissionSet> set1; local
1668 scoped_refptr<PermissionSet> set1; local
    [all...]
  /libcore/luni/src/main/native/
libcore_icu_NativeConverter.cpp 541 UnicodeSet set1; local
542 ucnv_getUnicodeSet(&*converter1, set1.toUSet(), UCNV_ROUNDTRIP_SET, &errorCode);
548 return U_SUCCESS(errorCode) && set1.containsAll(set2);
  /external/chromium_org/testing/gtest/test/
gtest-printers_test.cc 837 hash_set<string> set1; local
838 set1.insert("hello");
839 EXPECT_EQ("{ \"hello\" }", Print(set1));
845 hash_multiset<int> set1(a, a + kSize);
848 const string result = Print(set1);
906 set<unsigned int> set1(a, a + 3);
907 EXPECT_EQ("{ 0, 3, 5 }", Print(set1));
912 multiset<int> set1(a, a + 5);
913 EXPECT_EQ("{ 1, 1, 1, 2, 5 }", Print(set1));
    [all...]
  /external/gtest/test/
gtest-printers_test.cc 843 hash_set<string> set1; local
844 set1.insert("hello");
845 EXPECT_EQ("{ \"hello\" }", Print(set1));
851 hash_multiset<int> set1(a, a + kSize);
854 const string result = Print(set1);
912 set<unsigned int> set1(a, a + 3);
913 EXPECT_EQ("{ 0, 3, 5 }", Print(set1));
918 multiset<int> set1(a, a + 5);
919 EXPECT_EQ("{ 1, 1, 1, 2, 5 }", Print(set1));
    [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
EnumMapTest.java 334 Set set1 = enumSizeMap.entrySet(); local
335 assertSame("Should be same", set1, set);
602 Set set1 = enumSizeMap.keySet(); local
603 assertSame("Should be same", set1, set);
    [all...]
  /ndk/sources/third_party/googletest/googletest/test/
gtest-printers_test.cc 843 hash_set<string> set1; local
844 set1.insert("hello");
845 EXPECT_EQ("{ \"hello\" }", Print(set1));
851 hash_multiset<int> set1(a, a + kSize);
854 const string result = Print(set1);
912 set<unsigned int> set1(a, a + 3);
913 EXPECT_EQ("{ 0, 3, 5 }", Print(set1));
918 multiset<int> set1(a, a + 5);
919 EXPECT_EQ("{ 1, 1, 1, 2, 5 }", Print(set1));
    [all...]
  /external/clang/test/Misc/
diag-template-diffing.cpp 41 void set1(I1<1,2,3,4,2,3,4,3>) {}; function
43 set1(I1<1,2,3,4,2,2,4,3,7>());
45 // CHECK-ELIDE-NOTREE: no matching function for call to 'set1'
47 // CHECK-NOELIDE-NOTREE: no matching function for call to 'set1'
49 // CHECK-ELIDE-TREE: no matching function for call to 'set1'
56 // CHECK-NOELIDE-TREE: no matching function for call to 'set1'
    [all...]
  /external/chromium_org/third_party/icu/source/test/cintltst/
cucdtst.c 3057 USet *set1, *set2, *set3, *set4; local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_peephole.cpp 1126 Instruction *set1 = src1->getInsn(); local
1128 if (!set0 || set0->fixed || !set1 || set1->fixed)
1130 if (set1->op != OP_SET) {
1132 set0 = set1;
1133 set1 = xchg;
1134 if (set1->op != OP_SET)
1139 if (!prog->getTarget()->isOpSupported(redOp, set1->sType))
1147 set1->getDef(0)->refCount() > 1)
1149 if (set0->getPredicate() || set1->getPredicate()
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
ImmutableSortedSetTest.java 697 ImmutableSortedSet<LegacyComparable> set1 = ImmutableSortedSet.of( local
    [all...]
  /external/icu/icu4c/source/test/cintltst/
cucdtst.c 3056 USet *set1, *set2, *set3, *set4; local
    [all...]
  /external/mesa3d/src/gallium/drivers/nv50/codegen/
nv50_ir_peephole.cpp 1126 Instruction *set1 = src1->getInsn(); local
1128 if (!set0 || set0->fixed || !set1 || set1->fixed)
1130 if (set1->op != OP_SET) {
1132 set0 = set1;
1133 set1 = xchg;
1134 if (set1->op != OP_SET)
1139 if (!prog->getTarget()->isOpSupported(redOp, set1->sType))
1147 set1->getDef(0)->refCount() > 1)
1149 if (set0->getPredicate() || set1->getPredicate()
    [all...]
  /external/valgrind/main/callgrind/
sim.c 288 UInt set1 = block1 & c->sets_min_1; local
295 return cachesim_setref(c, set1, tag1);
303 CacheResult res1 = cachesim_setref(c, set1, tag1);
395 UInt set1 = ( a >> c->line_size_bits) & (c->sets_min_1); local
400 if (set1 == set2)
401 return cachesim_setref_wb(c, ref, set1, tag);
404 /* Nb: this is a fast way of doing ((set1+1) % c->sets) */
405 else if (((set1 + 1) & (c->sets_min_1)) == set2) {
409 CacheResult res1 = cachesim_setref_wb(c, ref, set1, tag);
416 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2)
    [all...]

Completed in 289 milliseconds

12 3 4