/** * checks if two sets have a non-empty intersection * * @return {@code true} if the sets intersect; {@code false} otherwise */ public static <T> boolean intersecting(final Set<T> s1, final Set<T> s2) { return forSome(s1, s2::contains); }
/** * checks if two sets have a non-empty intersection * * @return {@code true} if the sets intersect; {@code false} otherwise */ public static <T> boolean intersecting(final Set<T> s1, final Set<T> s2) { return forSome(s1, s2::contains); }
/** * checks if two sets have a non-empty intersection * * @return {@code true} if the sets intersect; {@code false} otherwise */ public static <T> boolean intersecting(final Set<T> s1, final Set<T> s2) { return forSome(s1, s2::contains); }