Lines Matching refs:set2
571 * {@code set1}, then over each element of {@code set2}, in order, that is not
574 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
583 final Set<? extends E> set1, final Set<? extends E> set2) {
585 checkNotNull(set2, "set2");
587 final Set<? extends E> set2minus1 = difference(set2, set1);
594 return set1.isEmpty() && set2.isEmpty();
601 return set1.contains(object) || set2.contains(object);
605 set.addAll(set2);
610 .addAll(set1).addAll(set2).build();
620 * <p>Results are undefined if {@code set1} and {@code set2} are sets based
642 final Set<E> set1, final Set<?> set2) {
644 checkNotNull(set2, "set2");
646 final Predicate<Object> inSet2 = Predicates.in(set2);
658 return set1.contains(object) && set2.contains(object);
662 && set2.containsAll(collection);
670 * not contained by {@code set2}. {@code set2} may also contain elements not
674 * <p>Results are undefined if {@code set1} and {@code set2} are sets based
679 final Set<E> set1, final Set<?> set2) {
681 checkNotNull(set2, "set2");
683 final Predicate<Object> notInSet2 = Predicates.not(Predicates.in(set2));
692 return set2.containsAll(set1);
695 return set1.contains(element) && !set2.contains(element);
703 * {@code set1} or {@code set2} but not in both. The iteration order of the
706 * <p>Results are undefined if {@code set1} and {@code set2} are sets based
713 Set<? extends E> set1, Set<? extends E> set2) {
715 checkNotNull(set2, "set2");
718 return difference(union(set1, set2), intersection(set1, set2));