/external/google-breakpad/src/client/linux/minidump_writer/ |
D | cpu_set_unittest.cc | 120 CpuSet set1; in TEST() local 121 ASSERT_TRUE(set1.ParseSysFile(file1.GetFd())); in TEST() 122 ASSERT_EQ(11, set1.GetCount()); in TEST() 130 set1.IntersectWith(set2); in TEST() 131 ASSERT_EQ(4, set1.GetCount()); in TEST() 138 CpuSet set1; in TEST() local 139 ASSERT_TRUE(set1.ParseSysFile(file1.GetFd())); in TEST() 140 ASSERT_EQ(11, set1.GetCount()); in TEST() 142 set1.IntersectWith(set1); in TEST() 143 ASSERT_EQ(11, set1.GetCount()); in TEST() [all …]
|
/external/testng/src/test/java/test/tmp/ |
D | AssertEqualsTest.java | 41 Set set1 = new LinkedHashSet(); in main() local 44 set1.add(5); in main() 47 set1.add(6); in main() 50 set1.add(1); in main() 53 set1.add(9); in main() 56 System.out.println("set1 is:" + set1.toString()); in main() 59 System.out.println("is set1 equals set2 :" + set1.equals(set2)); in main() 62 Assert.assertEquals(set1, set2, "set1 must equals with set2"); in main()
|
/external/toybox/toys/pending/ |
D | tr.c | 36 static void map_translation(char *set1 , char *set2) in map_translation() argument 41 for (; i; i--, k++) TT.map[set1[k]] = set1[k]|0x100; //set delete bit in map_translation() 45 TT.map[set1[k]] = TT.map[set1[k]]|0x200; in map_translation() 51 TT.map[set1[i]] = ((TT.map[set1[i]] & 0xFF00) | set2[k]); in map_translation() 211 static void print_map(char *set1, char *set2) in print_map() argument 247 char *set1, *set2 = NULL; in tr_main() local 252 set1 = expand_set(toys.optargs[0], &TT.len1); in tr_main() 253 if (toys.optflags & FLAG_c) do_complement(&set1); in tr_main() 258 map_translation(set1, set2); in tr_main() 260 print_map(set1, set2); in tr_main() [all …]
|
/external/abseil-cpp/absl/container/ |
D | node_hash_set_test.cc | 61 absl::node_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 62 set1.insert(absl::make_unique<int>(7)); in TEST() 63 set1.insert(absl::make_unique<int>(17)); in TEST() 68 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 71 set1.merge(set2); in TEST() 73 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 76 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 79 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 90 node = set1.extract(absl::make_unique<int>(17)); in TEST() 93 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
D | flat_hash_set_test.cc | 84 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 85 set1.insert(absl::make_unique<int>(7)); in TEST() 86 set1.insert(absl::make_unique<int>(17)); in TEST() 91 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 94 set1.merge(set2); in TEST() 96 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 99 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 102 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 113 node = set1.extract(absl::make_unique<int>(17)); in TEST() 116 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
/external/openscreen/third_party/abseil/src/absl/container/ |
D | node_hash_set_test.cc | 61 absl::node_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 62 set1.insert(absl::make_unique<int>(7)); in TEST() 63 set1.insert(absl::make_unique<int>(17)); in TEST() 68 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 71 set1.merge(set2); in TEST() 73 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 76 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 79 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 90 node = set1.extract(absl::make_unique<int>(17)); in TEST() 93 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
D | flat_hash_set_test.cc | 96 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 97 set1.insert(absl::make_unique<int>(7)); in TEST() 98 set1.insert(absl::make_unique<int>(17)); in TEST() 103 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 106 set1.merge(set2); in TEST() 108 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 111 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 114 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 125 node = set1.extract(absl::make_unique<int>(17)); in TEST() 128 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/ |
D | node_hash_set_test.cc | 61 absl::node_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 62 set1.insert(absl::make_unique<int>(7)); in TEST() 63 set1.insert(absl::make_unique<int>(17)); in TEST() 68 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 71 set1.merge(set2); in TEST() 73 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 76 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 79 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 90 node = set1.extract(absl::make_unique<int>(17)); in TEST() 93 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
D | flat_hash_set_test.cc | 96 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 97 set1.insert(absl::make_unique<int>(7)); in TEST() 98 set1.insert(absl::make_unique<int>(17)); in TEST() 103 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 106 set1.merge(set2); in TEST() 108 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 111 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 114 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 125 node = set1.extract(absl::make_unique<int>(17)); in TEST() 128 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
/external/angle/third_party/abseil-cpp/absl/container/ |
D | node_hash_set_test.cc | 61 absl::node_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 62 set1.insert(absl::make_unique<int>(7)); in TEST() 63 set1.insert(absl::make_unique<int>(17)); in TEST() 68 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 71 set1.merge(set2); in TEST() 73 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 76 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 79 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 90 node = set1.extract(absl::make_unique<int>(17)); in TEST() 93 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
D | flat_hash_set_test.cc | 96 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 97 set1.insert(absl::make_unique<int>(7)); in TEST() 98 set1.insert(absl::make_unique<int>(17)); in TEST() 103 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 106 set1.merge(set2); in TEST() 108 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 111 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 114 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 125 node = set1.extract(absl::make_unique<int>(17)); in TEST() 128 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
/external/webrtc/third_party/abseil-cpp/absl/container/ |
D | node_hash_set_test.cc | 61 absl::node_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 62 set1.insert(absl::make_unique<int>(7)); in TEST() 63 set1.insert(absl::make_unique<int>(17)); in TEST() 68 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 71 set1.merge(set2); in TEST() 73 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 76 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 79 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 90 node = set1.extract(absl::make_unique<int>(17)); in TEST() 93 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
D | flat_hash_set_test.cc | 84 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 85 set1.insert(absl::make_unique<int>(7)); in TEST() 86 set1.insert(absl::make_unique<int>(17)); in TEST() 91 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 94 set1.merge(set2); in TEST() 96 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 99 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 102 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 113 node = set1.extract(absl::make_unique<int>(17)); in TEST() 116 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
/external/libtextclassifier/abseil-cpp/absl/container/ |
D | node_hash_set_test.cc | 61 absl::node_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 62 set1.insert(absl::make_unique<int>(7)); in TEST() 63 set1.insert(absl::make_unique<int>(17)); in TEST() 68 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 71 set1.merge(set2); in TEST() 73 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 76 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 79 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 90 node = set1.extract(absl::make_unique<int>(17)); in TEST() 93 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
D | flat_hash_set_test.cc | 96 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local 97 set1.insert(absl::make_unique<int>(7)); in TEST() 98 set1.insert(absl::make_unique<int>(17)); in TEST() 103 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17))); in TEST() 106 set1.merge(set2); in TEST() 108 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(7), Pointee(17), Pointee(19))); in TEST() 111 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() 114 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(17), Pointee(19))); in TEST() 125 node = set1.extract(absl::make_unique<int>(17)); in TEST() 128 EXPECT_THAT(set1, UnorderedElementsAre(Pointee(19))); in TEST()
|
/external/tensorflow/tensorflow/python/util/ |
D | object_identity_test.py | 81 set1 = object_identity.ObjectIdentitySet([a, b]) 83 diff_set = set1.difference(set2) 91 set1 = object_identity.ObjectIdentitySet([a, b]) 92 set1.discard(a) 93 self.assertIn(b, set1) 94 self.assertNotIn(a, set1) 99 set1 = object_identity.ObjectIdentitySet([a, b]) 100 set1.clear() 101 self.assertLen(set1, 0)
|
/external/protobuf/objectivec/Tests/ |
D | GPBUnknownFieldSetTest.m | 72 GPBUnknownFieldSet *set1 = [[[GPBUnknownFieldSet alloc] init] autorelease]; 73 XCTAssertTrue([set1 isEqual:set1]); 74 XCTAssertFalse([set1 isEqual:@"foo"]); 76 XCTAssertEqualObjects(set1, set2); 77 XCTAssertEqual([set1 hash], [set2 hash]); 83 [set1 addField:field1]; 84 XCTAssertNotEqualObjects(set1, set2); 88 XCTAssertEqualObjects(set1, set2); 89 XCTAssertEqual([set1 hash], [set2 hash]); 95 [set1 addField:field1]; [all …]
|
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/sigprocmask/ |
D | 10-1.c | 20 sigset_t set1, set2; in main() local 23 sigemptyset(&set1); in main() 25 sigaddset(&set1, SIGKILL); in main() 26 sigaddset(&set1, SIGSTOP); in main() 27 sigprocmask_return_val = sigprocmask(SIG_SETMASK, &set1, NULL); in main()
|
D | 6-1.c | 28 sigset_t set1, set2, pending_set; in main() local 30 sigemptyset(&set1); in main() 31 sigaddset(&set1, SIGABRT); in main() 32 sigaddset(&set1, SIGUSR2); in main() 53 if (sigprocmask(SIG_SETMASK, &set1, NULL) == -1) { in main()
|
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_sigmask/ |
D | 10-1.c | 21 sigset_t set1, set2; in a_thread_func() local 24 sigemptyset(&set1); in a_thread_func() 26 sigaddset(&set1, SIGKILL); in a_thread_func() 27 sigaddset(&set1, SIGSTOP); in a_thread_func() 28 pthread_sigmask_return_val = pthread_sigmask(SIG_SETMASK, &set1, NULL); in a_thread_func()
|
D | 6-1.c | 45 sigset_t set1, set2, pending_set; in a_thread_func() local 47 sigemptyset(&set1); in a_thread_func() 48 sigaddset(&set1, SIGABRT); in a_thread_func() 49 sigaddset(&set1, SIGALRM); in a_thread_func() 70 if (pthread_sigmask(SIG_SETMASK, &set1, NULL) == -1) { in a_thread_func()
|
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/types/ |
D | SetTagTest.java | 33 Set<String> set1 = (Set<String>) map.get("baseball players"); in testSet() local 34 assertEquals(3, set1.size()); in testSet() 35 assertTrue(set1.contains("Mark McGwire")); in testSet() 36 assertTrue(set1.contains("Sammy Sosa")); in testSet() 37 assertTrue(set1.contains("Ken Griffey")); in testSet()
|
/external/tensorflow/tensorflow/core/api_def/base_api/ |
D | api_def_SparseToSparseSetOperation.pbtxt | 63 the same as the 1st `n-1` dimensions of `set1` and `set2`, `result_shape[n]` 72 order and range of `set1` and `set2` indices. 74 Input `set1` is a `SparseTensor` represented by `set1_indices`, `set1_values`, 75 and `set1_shape`. For `set1` ranked `n`, 1st `n-1` dimensions must be the same 81 as `set1`. Dimension `n` contains values in a set, duplicates are allowed but 84 If `validate_indices` is `True`, this op validates the order and range of `set1` 88 `result_values`, and `result_shape`. For `set1` and `set2` ranked `n`, this 89 has rank `n` and the same 1st `n-1` dimensions as `set1` and `set2`. The `nth`
|
/external/testng/src/test/java/test/asserttests/ |
D | AssertTest.java | 60 Set<Integer> set1 = Sets.newHashSet(); in setsSuccess() local 63 set1.add(1); in setsSuccess() 66 set1.add(3); in setsSuccess() 69 set1.add(2); in setsSuccess() 72 Assert.assertEquals(set1, set2); in setsSuccess() 73 Assert.assertEquals(set2, set1); in setsSuccess()
|
/external/guava/guava/src/com/google/common/collect/ |
D | Sets.java | 724 public static <E> SetView<E> union(final Set<? extends E> set1, final Set<? extends E> set2) { in union() argument 725 checkNotNull(set1, "set1"); in union() 731 int size = set1.size(); in union() 733 if (!set1.contains(e)) { in union() 742 return set1.isEmpty() && set2.isEmpty(); in union() 748 final Iterator<? extends E> itr1 = set1.iterator(); in union() 758 if (!set1.contains(e)) { in union() 769 return Stream.concat(set1.stream(), set2.stream().filter(e -> !set1.contains(e))); in union() 779 return set1.contains(object) || set2.contains(object); in union() 784 set.addAll(set1); in union() [all …]
|