@Override public <U> U foldRight(U zero, BiFunction<? super T, ? super U, ? extends U> f) { Objects.requireNonNull(f, "f is null"); return iterator().foldRight(zero, f); }
@Override public String mkString(CharSequence prefix, CharSequence delimiter, CharSequence suffix) { return iterator().mkString(prefix, delimiter, suffix); }
@Override public LinkedHashSet<T> peek(Consumer<? super T> action) { Objects.requireNonNull(action, "action is null"); if (!isEmpty()) { action.accept(iterator().head()); } return this; }
@Override public <U, R> LinkedHashSet<R> zipWith(Iterable<? extends U> that, BiFunction<? super T, ? super U, ? extends R> mapper) { Objects.requireNonNull(that, "that is null"); Objects.requireNonNull(mapper, "mapper is null"); return LinkedHashSet.ofAll(iterator().zipWith(that, mapper)); }
@Override public <U> LinkedHashSet<T> distinctBy(Function<? super T, ? extends U> keyExtractor) { Objects.requireNonNull(keyExtractor, "keyExtractor is null"); return LinkedHashSet.ofAll(iterator().distinctBy(keyExtractor)); }
@Override public <U> LinkedHashSet<Tuple2<T, U>> zipAll(Iterable<? extends U> that, T thisElem, U thatElem) { Objects.requireNonNull(that, "that is null"); return LinkedHashSet.ofAll(iterator().zipAll(that, thisElem, thatElem)); }
@Override public LinkedHashSet<T> distinctBy(Comparator<? super T> comparator) { Objects.requireNonNull(comparator, "comparator is null"); return LinkedHashSet.ofAll(iterator().distinctBy(comparator)); }
@Override public T head() { if (map.isEmpty()) { throw new NoSuchElementException("head of empty set"); } return iterator().next(); }
@Override public <U> LinkedHashSet<U> zipWithIndex(BiFunction<? super T, ? super Integer, ? extends U> mapper) { Objects.requireNonNull(mapper, "mapper is null"); return LinkedHashSet.ofAll(iterator().zipWithIndex(mapper)); }
@Override public LinkedHashSet<T> drop(int n) { if (n <= 0) { return this; } else { return LinkedHashSet.ofAll(iterator().drop(n)); } }
@Override public LinkedHashSet<T> dropRight(int n) { if (n <= 0) { return this; } else { return LinkedHashSet.ofAll(iterator().dropRight(n)); } }
@Override public LinkedHashSet<T> takeRight(int n) { if (map.size() <= n) { return this; } return LinkedHashSet.ofAll(() -> iterator().takeRight(n)); }
@Override public Tuple2<LinkedHashSet<T>, LinkedHashSet<T>> partition(Predicate<? super T> predicate) { Objects.requireNonNull(predicate, "predicate is null"); final Tuple2<Iterator<T>, Iterator<T>> p = iterator().partition(predicate); return Tuple.of(LinkedHashSet.ofAll(p._1), LinkedHashSet.ofAll(p._2)); }
@Override public LinkedHashSet<T> takeWhile(Predicate<? super T> predicate) { Objects.requireNonNull(predicate, "predicate is null"); final LinkedHashSet<T> taken = LinkedHashSet.ofAll(iterator().takeWhile(predicate)); return taken.length() == length() ? this : taken; }
@Override public LinkedHashSet<T> dropWhile(Predicate<? super T> predicate) { Objects.requireNonNull(predicate, "predicate is null"); final LinkedHashSet<T> dropped = LinkedHashSet.ofAll(iterator().dropWhile(predicate)); return dropped.length() == length() ? this : dropped; }
@Override public LinkedHashSet<T> filter(Predicate<? super T> predicate) { Objects.requireNonNull(predicate, "predicate is null"); final LinkedHashSet<T> filtered = LinkedHashSet.ofAll(iterator().filter(predicate)); return filtered.length() == length() ? this : filtered; }
@Override public Tuple2<LinkedHashSet<T>, LinkedHashSet<T>> span(Predicate<? super T> predicate) { Objects.requireNonNull(predicate, "predicate is null"); final Tuple2<Iterator<T>, Iterator<T>> t = iterator().span(predicate); return Tuple.of(LinkedHashSet.ofAll(t._1), LinkedHashSet.ofAll(t._2)); }
@Override public <T1, T2> Tuple2<LinkedHashSet<T1>, LinkedHashSet<T2>> unzip( Function<? super T, Tuple2<? extends T1, ? extends T2>> unzipper) { Objects.requireNonNull(unzipper, "unzipper is null"); final Tuple2<Iterator<T1>, Iterator<T2>> t = iterator().unzip(unzipper); return Tuple.of(LinkedHashSet.ofAll(t._1), LinkedHashSet.ofAll(t._2)); }
@Override public LinkedHashSet<T> take(int n) { if (map.size() <= n) { return this; } return LinkedHashSet.ofAll(() -> iterator().take(n)); }
@Override public <T1, T2, T3> Tuple3<LinkedHashSet<T1>, LinkedHashSet<T2>, LinkedHashSet<T3>> unzip3( Function<? super T, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) { Objects.requireNonNull(unzipper, "unzipper is null"); final Tuple3<Iterator<T1>, Iterator<T2>, Iterator<T3>> t = iterator().unzip3(unzipper); return Tuple.of(LinkedHashSet.ofAll(t._1), LinkedHashSet.ofAll(t._2), LinkedHashSet.ofAll(t._3)); }