| /external/testng/src/test/java/test/tmp/ |
| D | AssertEqualsTest.java | 42 Set set2 = new HashSet(); in main() local
45 set2.add(5); in main()
48 set2.add(6); in main()
51 set2.add(1); in main()
54 set2.add(9); in main()
57 System.out.println("set2 is:" + set2.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/google-breakpad/src/client/linux/minidump_writer/ |
| D | cpu_set_unittest.cc | 126 CpuSet set2; in TEST() local
127 ASSERT_TRUE(set2.ParseSysFile(file2.GetFd())); in TEST()
128 ASSERT_EQ(9, set2.GetCount()); in TEST()
130 set1.IntersectWith(set2); in TEST()
132 ASSERT_EQ(9, set2.GetCount()); in TEST()
155 CpuSet set2; in TEST() local
156 ASSERT_TRUE(set2.ParseSysFile(file2.GetFd())); in TEST()
157 ASSERT_EQ(20, set2.GetCount()); in TEST()
159 set1.IntersectWith(set2); in TEST()
162 ASSERT_EQ(20, set2.GetCount()); in TEST()
|
| /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
65 set2.insert(absl::make_unique<int>(7)); in TEST()
66 set2.insert(absl::make_unique<int>(19)); in TEST()
69 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
71 set1.merge(set2); in TEST()
74 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
81 auto insert_result = set2.insert(std::move(node)); in TEST()
88 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
97 insert_result = set2.insert(std::move(node)); in TEST()
102 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); in TEST()
|
| D | flat_hash_set_test.cc | 84 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local
88 set2.insert(absl::make_unique<int>(7)); in TEST()
89 set2.insert(absl::make_unique<int>(19)); in TEST()
92 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
94 set1.merge(set2); in TEST()
97 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
104 auto insert_result = set2.insert(std::move(node)); in TEST()
111 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
120 insert_result = set2.insert(std::move(node)); in TEST()
125 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); 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
65 set2.insert(absl::make_unique<int>(7)); in TEST()
66 set2.insert(absl::make_unique<int>(19)); in TEST()
69 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
71 set1.merge(set2); in TEST()
74 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
81 auto insert_result = set2.insert(std::move(node)); in TEST()
88 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
97 insert_result = set2.insert(std::move(node)); in TEST()
102 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); in TEST()
|
| D | flat_hash_set_test.cc | 96 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local
100 set2.insert(absl::make_unique<int>(7)); in TEST()
101 set2.insert(absl::make_unique<int>(19)); in TEST()
104 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
106 set1.merge(set2); in TEST()
109 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
116 auto insert_result = set2.insert(std::move(node)); in TEST()
123 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
132 insert_result = set2.insert(std::move(node)); in TEST()
137 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); 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
65 set2.insert(absl::make_unique<int>(7)); in TEST()
66 set2.insert(absl::make_unique<int>(19)); in TEST()
69 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
71 set1.merge(set2); in TEST()
74 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
81 auto insert_result = set2.insert(std::move(node)); in TEST()
88 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
97 insert_result = set2.insert(std::move(node)); in TEST()
102 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); in TEST()
|
| D | flat_hash_set_test.cc | 96 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local
100 set2.insert(absl::make_unique<int>(7)); in TEST()
101 set2.insert(absl::make_unique<int>(19)); in TEST()
104 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
106 set1.merge(set2); in TEST()
109 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
116 auto insert_result = set2.insert(std::move(node)); in TEST()
123 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
132 insert_result = set2.insert(std::move(node)); in TEST()
137 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); 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
65 set2.insert(absl::make_unique<int>(7)); in TEST()
66 set2.insert(absl::make_unique<int>(19)); in TEST()
69 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
71 set1.merge(set2); in TEST()
74 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
81 auto insert_result = set2.insert(std::move(node)); in TEST()
88 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
97 insert_result = set2.insert(std::move(node)); in TEST()
102 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); in TEST()
|
| D | flat_hash_set_test.cc | 96 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local
100 set2.insert(absl::make_unique<int>(7)); in TEST()
101 set2.insert(absl::make_unique<int>(19)); in TEST()
104 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
106 set1.merge(set2); in TEST()
109 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
116 auto insert_result = set2.insert(std::move(node)); in TEST()
123 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
132 insert_result = set2.insert(std::move(node)); in TEST()
137 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); 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
65 set2.insert(absl::make_unique<int>(7)); in TEST()
66 set2.insert(absl::make_unique<int>(19)); in TEST()
69 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
71 set1.merge(set2); in TEST()
74 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
81 auto insert_result = set2.insert(std::move(node)); in TEST()
88 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
97 insert_result = set2.insert(std::move(node)); in TEST()
102 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); in TEST()
|
| D | flat_hash_set_test.cc | 84 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local
88 set2.insert(absl::make_unique<int>(7)); in TEST()
89 set2.insert(absl::make_unique<int>(19)); in TEST()
92 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
94 set1.merge(set2); in TEST()
97 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
104 auto insert_result = set2.insert(std::move(node)); in TEST()
111 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
120 insert_result = set2.insert(std::move(node)); in TEST()
125 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); 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
65 set2.insert(absl::make_unique<int>(7)); in TEST()
66 set2.insert(absl::make_unique<int>(19)); in TEST()
69 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
71 set1.merge(set2); in TEST()
74 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
81 auto insert_result = set2.insert(std::move(node)); in TEST()
88 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
97 insert_result = set2.insert(std::move(node)); in TEST()
102 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); in TEST()
|
| D | flat_hash_set_test.cc | 96 absl::flat_hash_set<std::unique_ptr<int>, Hash, Eq> set1, set2; in TEST() local
100 set2.insert(absl::make_unique<int>(7)); in TEST()
101 set2.insert(absl::make_unique<int>(19)); in TEST()
104 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(19))); in TEST()
106 set1.merge(set2); in TEST()
109 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
116 auto insert_result = set2.insert(std::move(node)); in TEST()
123 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7))); in TEST()
132 insert_result = set2.insert(std::move(node)); in TEST()
137 EXPECT_THAT(set2, UnorderedElementsAre(Pointee(7), Pointee(23))); in TEST()
|
| /external/cldr/tools/java/org/unicode/cldr/draft/ |
| D | Compacter.java | 28 public static String encodeString(Collection<String> set2) { in encodeString() argument
30 for (String s : set2) { in encodeString()
45 List<Interval> intermediate = codePointsToIntervals(set2); in encodeString()
70 private static List<Interval> codePointsToIntervals(Collection<String> set2) { in codePointsToIntervals() argument
74 for (String item : set2) { in codePointsToIntervals()
98 public static String appendCompacted(Collection<String> set2) { in appendCompacted() argument
100 return encodeString(set2); in appendCompacted()
102 String resultStr = getInternalRangeString(set2); in appendCompacted()
106 public static String getInternalRangeString(Collection<String> set2) { in getInternalRangeString() argument
110 for (String item : set2) { in getInternalRangeString()
|
| /external/libchrome/base/sampling_heap_profiler/ |
| D | lock_free_address_hash_set_unittest.cc | 36 const LockFreeAddressHashSet& set2) { in Equals() argument
37 return Subset(set1, set2) && Subset(set2, set1); in Equals()
98 LockFreeAddressHashSet set2(4); in TEST_F() local
100 set2.Copy(set); in TEST_F()
103 EXPECT_TRUE(Equals(set, set2)); in TEST_F()
105 EXPECT_TRUE(Equals(set2, set3)); in TEST_F()
109 EXPECT_FALSE(Equals(set, set2)); in TEST_F()
111 EXPECT_TRUE(Equals(set2, set3)); in TEST_F()
113 EXPECT_TRUE(Subset(set, set2)); in TEST_F()
114 EXPECT_FALSE(Subset(set2, set)); in TEST_F()
|
| /external/toybox/toys/pending/ |
| D | tr.c | 36 static void map_translation(char *set1 , char *set2) in map_translation() argument
47 TT.map[set2[k]] = TT.map[set2[k]]|0x200; in map_translation()
50 while (!(toys.optflags & FLAG_d) && set2 && TT.len1--) { //ignore set2 if -d present in map_translation()
51 TT.map[set1[i]] = ((TT.map[set1[i]] & 0xFF00) | set2[k]); in map_translation()
52 if (set2[k + 1]) 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
256 set2 = expand_set(toys.optargs[1], &TT.len2); in tr_main()
258 map_translation(set1, set2); in tr_main()
260 print_map(set1, set2); in tr_main()
[all …]
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/sigprocmask/ |
| D | 10-1.c | 20 sigset_t set1, set2; in main() local
24 sigemptyset(&set2); in main()
28 sigprocmask(SIG_SETMASK, NULL, &set2); in main()
30 if (sigismember(&set2, SIGKILL)) { in main()
34 if (sigismember(&set2, SIGSTOP)) { in main()
|
| /external/protobuf/objectivec/Tests/ |
| D | GPBUnknownFieldSetTest.m | 75 GPBUnknownFieldSet *set2 = [[[GPBUnknownFieldSet alloc] init] autorelease];
76 XCTAssertEqualObjects(set1, set2);
77 XCTAssertEqual([set1 hash], [set2 hash]);
84 XCTAssertNotEqualObjects(set1, set2);
87 [set2 addField:field2];
88 XCTAssertEqualObjects(set1, set2);
89 XCTAssertEqual([set1 hash], [set2 hash]);
96 XCTAssertNotEqualObjects(set1, set2);
99 [set2 addField:field2];
100 XCTAssertEqualObjects(set1, set2);
[all …]
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_sigmask/ |
| D | 10-1.c | 21 sigset_t set1, set2; in a_thread_func() local
25 sigemptyset(&set2); in a_thread_func()
29 pthread_sigmask(SIG_SETMASK, NULL, &set2); in a_thread_func()
31 if (sigismember(&set2, SIGKILL)) { in a_thread_func()
35 if (sigismember(&set2, SIGSTOP)) { in a_thread_func()
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/types/ |
| D | SetTagTest.java | 39 Set<String> set2 = (Set<String>) map.get("baseball teams"); in testSet() local
40 assertEquals(3, set2.size()); in testSet()
41 assertTrue(set2.contains("Boston Red Sox")); in testSet()
42 assertTrue(set2.contains("Detroit Tigers")); in testSet()
43 assertTrue(set2.contains("New York Yankees")); in testSet()
|
| /external/llvm-project/polly/lib/External/isl/ |
| D | isl_test_list_templ.c | 22 SET *set, *set2; in FN() local
28 set2 = FN(SET,empty)(FN(SET,get_space)(set)); in FN()
34 set2 = FN(SET,union)(set2, FN(FN(SET,from),EL_BASE)(el)); in FN()
37 equal = FN(SET,is_equal)(set, set2); in FN()
40 FN(SET,free)(set2); in FN()
|
| /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.
76 as `set2`. Dimension `n` contains values in a set, duplicates are allowed but
79 Input `set2` is a `SparseTensor` represented by `set2_indices`, `set2_values`,
80 and `set2_shape`. For `set2` ranked `n`, 1st `n-1` dimensions must be the same
85 and `set2` indices.
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`
|
| D | api_def_DenseToSparseSetOperation.pbtxt | 6 `Tensor` with rank `n`. 1st `n-1` dimensions must be the same as `set2`.
48 the same as the 1st `n-1` dimensions of `set1` and `set2`, `result_shape[n]`
56 Input `set2` is a `SparseTensor` represented by `set2_indices`, `set2_values`,
57 and `set2_shape`. For `set2` ranked `n`, 1st `n-1` dimensions must be the same
61 If `validate_indices` is `True`, this op validates the order and range of `set2`
65 `result_values`, and `result_shape`. For `set1` and `set2` ranked `n`, this
66 has rank `n` and the same 1st `n-1` dimensions as `set1` and `set2`. The `nth`
|
| /external/icu/icu4c/source/test/cintltst/ |
| D | usettest.c | 84 USet* set2; in TestAPI() local
180 set2 = uset_open(1, 1); in TestAPI()
181 uset_clear(set2); in TestAPI()
184 uset_applyPropertyAlias(set2, PAT_lb, PAT_lb_LEN, VAL_SP, VAL_SP_LEN, &ec); in TestAPI()
185 expect(set2, " ", "abcdefghi{bc}", NULL); in TestAPI()
188 uset_set(set2, 0x0061, 0x0063); in TestAPI()
193 if (uset_containsSome(set, set2)) { in TestAPI()
196 uset_complementAll(set, set2); in TestAPI()
197 if (!uset_containsSome(set, set2)) { in TestAPI()
203 uset_removeAll(set, set2); in TestAPI()
[all …]
|