Lines Matching refs:set2
527 * {@code set1}, then over each element of {@code set2}, in order, that is not
530 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
544 final Set<? extends E> set1, final Set<? extends E> set2) {
546 checkNotNull(set2, "set2");
548 final Set<? extends E> set2minus1 = difference(set2, set1);
555 return set1.isEmpty() && set2.isEmpty();
562 return set1.contains(object) || set2.contains(object);
566 set.addAll(set2);
571 .addAll(set1).addAll(set2).build();
581 * <p>Results are undefined if {@code set1} and {@code set2} are sets based
603 final Set<E> set1, final Set<?> set2) {
605 checkNotNull(set2, "set2");
607 final Predicate<Object> inSet2 = Predicates.in(set2);
619 return set1.contains(object) && set2.contains(object);
623 && set2.containsAll(collection);
631 * not contained by {@code set2}. {@code set2} may also contain elements not
635 * <p>Results are undefined if {@code set1} and {@code set2} are sets based
640 final Set<E> set1, final Set<?> set2) {
642 checkNotNull(set2, "set2");
644 final Predicate<Object> notInSet2 = Predicates.not(Predicates.in(set2));
653 return set2.containsAll(set1);
656 return set1.contains(element) && !set2.contains(element);
664 * {@code set1} or {@code set2} but not in both. The iteration order of the
667 * <p>Results are undefined if {@code set1} and {@code set2} are sets based
674 Set<? extends E> set1, Set<? extends E> set2) {
676 checkNotNull(set2, "set2");
679 return difference(union(set1, set2), intersection(set1, set2));