@Override public Comparator<? super T> comparator() { return host.comparator(); }
@Override public boolean contains(Object o) { return host.containsValue((T)o); }
@Override public Object[] toArray() { return host.stream().toArray(); }
@Override public int size() { return host.size(); }
@Override public Iterator<T> iterator() { return host.iterator(); }
@Override public boolean isEmpty() { return host.isEmpty(); }
@Override public T first() { return host.get(0).orElse(null); }
@Override public SortedSet<T> headSet(T toElement) { ReactiveSeq<T> x = host.stream() .takeWhile(e -> !Objects.equals(e, toElement)); return x.collect(Collectors.toCollection(()->new TreeSet<>(comparator()))); }
@Override public int size() { return host.size(); }
@Override public Iterator<T> iterator() { return host.iterator(); }
@Override public boolean isEmpty() { return host.isEmpty(); }
@Override public T first() { return host.get(0).orElse(null); }
@Override public SortedSet<T> tailSet(T fromElement) { ReactiveSeq<T> x = host.stream() .dropWhile(e -> !Objects.equals(e, fromElement)); return x.collect(Collectors.toCollection(()->new TreeSet<>(comparator()))); }
@Override public Comparator<? super T> comparator() { return host.comparator(); }
@Override public boolean contains(Object o) { return host.containsValue((T)o); }
@Override public SortedSet<T> subSet(T fromElement, T toElement) { ReactiveSeq<T> x = host.stream() .dropWhile(e -> !Objects.equals(e, fromElement)) .takeWhile(e -> !Objects.equals(e, toElement)); return x.collect(Collectors.toCollection(()->new TreeSet<>(comparator()))); }
@Override public Object[] toArray() { return host.stream().toArray(); }
@Override public SortedSet<T> tailSet(T fromElement) { ReactiveSeq<T> x = host.stream() .dropWhile(e -> !Objects.equals(e, fromElement)); return x.collect(Collectors.toCollection(()->new TreeSet<>(comparator()))); }