/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/sigprocmask/ |
H A D | 10-1.c | 20 sigset_t set1, set2; local 23 sigemptyset(&set1); 25 sigaddset(&set1, SIGKILL); 26 sigaddset(&set1, SIGSTOP); 27 sigprocmask_return_val = sigprocmask(SIG_SETMASK, &set1, NULL);
|
H A D | 6-1.c | 28 sigset_t set1, set2, pending_set; local 30 sigemptyset(&set1); 31 sigaddset(&set1, SIGABRT); 32 sigaddset(&set1, SIGUSR2); 53 if (sigprocmask(SIG_SETMASK, &set1, NULL) == -1) {
|
/external/testng/src/test/java/test/tmp/ |
H A D | AssertEqualsTest.java | 41 Set set1 = new LinkedHashSet(); 44 set1.add(5); 47 set1.add(6); 50 set1.add(1); 53 set1.add(9); 56 System.out.println("set1 is:" + set1.toString()); 59 System.out.println("is set1 equals set2 :" + set1.equals(set2)); 62 Assert.assertEquals(set1, set [all...] |
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_sigmask/ |
H A D | 10-1.c | 21 sigset_t set1, set2; local 24 sigemptyset(&set1); 26 sigaddset(&set1, SIGKILL); 27 sigaddset(&set1, SIGSTOP); 28 pthread_sigmask_return_val = pthread_sigmask(SIG_SETMASK, &set1, NULL);
|
H A D | 6-1.c | 45 sigset_t set1, set2, pending_set; local 47 sigemptyset(&set1); 48 sigaddset(&set1, SIGABRT); 49 sigaddset(&set1, SIGALRM); 70 if (pthread_sigmask(SIG_SETMASK, &set1, NULL) == -1) {
|
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/types/ |
H A D | SetTagTest.java | 33 Set<String> set1 = (Set<String>) map.get("baseball players"); 34 assertEquals(3, set1.size()); 35 assertTrue(set1.contains("Mark McGwire")); 36 assertTrue(set1.contains("Sammy Sosa")); 37 assertTrue(set1.contains("Ken Griffey"));
|
/external/google-breakpad/src/client/linux/minidump_writer/ |
H A D | cpu_set_unittest.cc | 120 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/skia/tests/ |
H A D | BitSetTest.cpp | 33 SkBitSet set1(65536); 34 set1.set(12345); 36 REPORTER_ASSERT(reporter, set1.has(12345) == true); 37 REPORTER_ASSERT(reporter, set1.has(22) == false);
|
/external/toybox/toys/pending/ |
H A D | tr.c | 36 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/ltp/testcases/kernel/syscalls/rt_sigsuspend/ |
H A D | rt_sigsuspend01.c | 54 sigset_t set, set1, set2; local 78 &set1, SIGSETSIZE)); 94 } else if (set1.__val[0] != set2.__val[0]) {
|
/external/testng/src/test/java/test/asserttests/ |
H A D | AssertTest.java | 60 Set<Integer> set1 = Sets.newHashSet(); 63 set1.add(1); 66 set1.add(3); 69 set1.add(2); 72 Assert.assertEquals(set1, set2); 73 Assert.assertEquals(set2, set1);
|
/external/eigen/bench/ |
H A D | sparse_randomsetter.cpp | 51 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/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue73/ |
H A D | RecursiveSetTest.java | 29 Set<Object> set1 = new HashSet<Object>(); 31 set1.add(set2); 32 set2.add(set1); 35 yaml.dump(set1);
|
/external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/ |
H A D | Optimum.java | 42 void set1(int newPrice, int optCur, int back) { method in class:Optimum
|
H A D | LZMAEncoderNormal.java | 181 opts[1].set1(literalPrice, 0, -1); 193 opts[1].set1(shortRepPrice, 0, 0); 233 opts[repLen].set1(price, 0, rep); 255 opts[len].set1(price, 0, dist + REPS); 384 opts[optCur + 1].set1(literalPrice, optCur, -1); 395 opts[optCur + 1].set1(shortRepPrice, optCur, 0); 447 opts[optCur + i].set1(price, optCur, rep); 525 opts[optCur + len].set1(matchAndLenPrice,
|
/external/smali/util/src/main/java/org/jf/util/ |
H A D | CollectionUtils.java | 192 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/guava/guava/src/com/google/common/collect/ |
H A D | Sets.java | 563 * {@code set1}, then over each element of {@code set2}, in order, that is not 564 * contained in {@code set1}. 566 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on 570 * <p><b>Note:</b> The returned view performs better when {@code set1} is the 580 final Set<? extends E> set1, final Set<? extends E> set2) { 581 checkNotNull(set1, "set1"); 584 final Set<? extends E> set2minus1 = difference(set2, set1); 588 return set1.size() + set2minus1.size(); 591 return set1 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 D | Sets.java | 527 * {@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/vixl/test/ |
H A D | test-invalset.cc | 359 TestSet set1; local 360 VIXL_CHECK(set1.empty() && (set1.size() == 0)); 367 set1.insert(Obj(i, 1)); 371 TestSet::iterator it1_a = set1.begin(); 372 TestSet::iterator it1_b = set1.begin(); 380 VIXL_CHECK(set1.begin() != set1.end()); 382 VIXL_CHECK(set1.begin() != set2.begin()); 383 VIXL_CHECK(set1 [all...] |
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/lang/ |
H A D | UnicodeSetTest.java | 1519 UnicodeSet set1 = new UnicodeSet("[a-b d-g {ch} {zh}]").freeze(); 1530 for (UnicodeSetIterator it = new UnicodeSetIterator(set1); it.next();) { 1535 for (String s : set1) { 1542 set1.addAllTo(list1); 1545 list1 = set1.addAllTo(new ArrayList<String>()); 1552 TreeSet sorted1 = set1.addAllTo(new TreeSet<String>()); 1557 assertTrue("containsAll", set1.containsAll(list1)); 1558 assertTrue("containsAll", set1.containsAll(sorted1)); 1559 assertTrue("containsAll", set1.containsAll(list2)); 1560 assertTrue("containsAll", set1 [all...] |
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/ |
H A D | UnicodeSetTest.java | 1518 UnicodeSet set1 = new UnicodeSet("[a-b d-g {ch} {zh}]").freeze(); 1529 for (UnicodeSetIterator it = new UnicodeSetIterator(set1); it.next();) { 1534 for (String s : set1) { 1541 set1.addAllTo(list1); 1544 list1 = set1.addAllTo(new ArrayList<String>()); 1551 TreeSet sorted1 = set1.addAllTo(new TreeSet<String>()); 1556 assertTrue("containsAll", set1.containsAll(list1)); 1557 assertTrue("containsAll", set1.containsAll(sorted1)); 1558 assertTrue("containsAll", set1.containsAll(list2)); 1559 assertTrue("containsAll", set1 [all...] |
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/ |
H A D | TestBoilerplate.java | 144 public static boolean verifySetsIdentical(AbstractTestLog here, UnicodeSet set1, UnicodeSet set2) { argument 145 if (set1.equals(set2)) return true; 148 TestFmwk.errln(new UnicodeSet(set1).removeAll(set2).toPattern(true)); 150 TestFmwk.errln(new UnicodeSet(set2).removeAll(set1).toPattern(true));
|
/external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/test/ |
H A D | TestBoilerplate.java | 143 public static boolean verifySetsIdentical(AbstractTestLog here, UnicodeSet set1, UnicodeSet set2) { argument 144 if (set1.equals(set2)) return true; 147 TestFmwk.errln(new UnicodeSet(set1).removeAll(set2).toPattern(true)); 149 TestFmwk.errln(new UnicodeSet(set2).removeAll(set1).toPattern(true));
|
/external/valgrind/coregrind/ |
H A D | pub_core_libcsignal.h | 51 extern Bool VG_(iseqsigset) ( const vki_sigset_t* set1,
|
/external/icu/icu4c/source/common/ |
H A D | uset.cpp | 181 uset_containsAll(const USet* set1, const USet* set2) { argument 182 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2); 193 uset_containsNone(const USet* set1, const USet* set2) { argument 194 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2); 198 uset_containsSome(const USet* set1, const USet* set2) { argument 199 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2); 223 uset_equals(const USet* set1, const USet* set2) { argument 224 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2;
|