Lines Matching refs:set2
559 * {@code set1}, then over each element of {@code set2}, in order, that is not
562 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
571 final Set<? extends E> set1, final Set<? extends E> set2) {
573 checkNotNull(set2, "set2");
575 final Set<? extends E> set2minus1 = difference(set2, set1);
582 return set1.isEmpty() && set2.isEmpty();
589 return set1.contains(object) || set2.contains(object);
593 set.addAll(set2);
598 .addAll(set1).addAll(set2).build();
608 * <p>Results are undefined if {@code set1} and {@code set2} are sets based
630 final Set<E> set1, final Set<?> set2) {
632 checkNotNull(set2, "set2");
634 final Predicate<Object> inSet2 = Predicates.in(set2);
646 return set1.contains(object) && set2.contains(object);
650 && set2.containsAll(collection);
658 * not contained by {@code set2}. {@code set2} may also contain elements not
662 * <p>Results are undefined if {@code set1} and {@code set2} are sets based
667 final Set<E> set1, final Set<?> set2) {
669 checkNotNull(set2, "set2");
671 final Predicate<Object> notInSet2 = Predicates.not(Predicates.in(set2));
680 return set2.containsAll(set1);
683 return set1.contains(element) && !set2.contains(element);
691 * {@code set1} or {@code set2} but not in both. The iteration order of the
694 * <p>Results are undefined if {@code set1} and {@code set2} are sets based
701 Set<? extends E> set1, Set<? extends E> set2) {
703 checkNotNull(set2, "set2");
706 return difference(union(set1, set2), intersection(set1, set2));