Searched refs:intersection (Results 1 – 11 of 11) sorted by relevance
55 Set intersection = clone(s1); in main() local56 intersection.retainAll(s2); in main()63 if (diff1.removeAll(intersection)) in main()67 if (diff2.removeAll(intersection)) in main()69 if (intersection.removeAll(diff1)) in main()71 if (intersection.removeAll(diff1)) in main()74 intersection.addAll(diff1); intersection.addAll(diff2); in main()75 if (!intersection.equals(union)) in main()83 if (!intersection.remove(e.next())) in main()85 if (!intersection.isEmpty()) in main()
72 Set<Integer> intersection = clone(s1, supplier); in testCheckedSet() local73 intersection.retainAll(s2); in testCheckedSet()80 if (diff1.removeAll(intersection)) in testCheckedSet()84 if (diff2.removeAll(intersection)) in testCheckedSet()86 if (intersection.removeAll(diff1)) in testCheckedSet()88 if (intersection.removeAll(diff1)) in testCheckedSet()91 intersection.addAll(diff1); intersection.addAll(diff2); in testCheckedSet()92 if (!intersection.equals(union)) in testCheckedSet()100 if (!intersection.remove(e.next())) in testCheckedSet()102 if (!intersection.isEmpty()) in testCheckedSet()
56 List intersection = clone(s1); intersection.retainAll(s2); in main() local63 if (diff1.removeAll(intersection)) in main()67 if (diff2.removeAll(intersection)) in main()69 if (intersection.removeAll(diff1)) in main()71 if (intersection.removeAll(diff1)) in main()74 intersection.addAll(diff1); intersection.addAll(diff2); in main()75 if (!(intersection.containsAll(union) && in main()76 union.containsAll(intersection))) in main()81 intersection.remove(e.next()); in main()82 if (!intersection.isEmpty()) in main()
218 Set<Long> intersection = new HashSet<>(enabled); in ChangeConfig() local219 intersection.retainAll(disabled); in ChangeConfig()220 if (!intersection.isEmpty()) { in ChangeConfig()221 throw new IllegalArgumentException("Cannot have changes " + intersection in ChangeConfig()
92 EnumSet<T> intersection = clone(s1, enumClass); in bash() local93 intersection.retainAll(s2); in bash()99 Assert.assertFalse(diff1.removeAll(intersection)); in bash()101 Assert.assertFalse(diff2.removeAll(intersection)); in bash()102 Assert.assertFalse(intersection.removeAll(diff1)); in bash()103 Assert.assertFalse(intersection.removeAll(diff1)); in bash()105 intersection.addAll(diff1); intersection.addAll(diff2); in bash()106 Assert.assertTrue(intersection.equals(union)); in bash()112 Assert.assertTrue(intersection.remove(e.next())); in bash()113 Assert.assertTrue(intersection.isEmpty()); in bash()
736 Set<Class<?>> intersection = new HashSet<Class<?>>(); in intersectExceptions() local740 intersection.add(b); in intersectExceptions()742 intersection.add(a); in intersectExceptions()746 return intersection.toArray(new Class<?>[intersection.size()]); in intersectExceptions()
395 boolean intersection = false; in intersect()409 intersection = true; in intersect()415 if (intersection == false) { in intersect()
399 intersection = set(filter(lambda e: e.dst_path in removed_paths,401 diff_entries = list(filter(lambda e: e.dst_path not in intersection, diff_entries))402 new_removed_paths = set(filter(lambda p: p not in intersection,
166 // Negation with nested char class and intersection240 // Class union and intersection
151 // Class union and intersection
272 // Class union and intersection