public static <E> POrderedSet<E> orderedSet() { return OrderedPSet.empty(); }
public static <E> POrderedSet<E> orderedSet() { return OrderedPSet.empty(); }
@SuppressWarnings("unchecked") public static <E> OrderedPSet<E> from(final Collection<? extends E> list) { if (list instanceof OrderedPSet) return (OrderedPSet<E>) list; return OrderedPSet.<E> empty().plusAll(list); }
@SuppressWarnings("unchecked") public static <E> OrderedPSet<E> from(final Collection<? extends E> list) { if (list instanceof OrderedPSet) return (OrderedPSet<E>) list; return OrderedPSet.<E> empty().plusAll(list); }
public static <E> OrderedPSet<E> singleton(final E e) { return OrderedPSet.<E> empty().plus(e); }
public static <E> OrderedPSet<E> singleton(final E e) { return OrderedPSet.<E> empty().plus(e); }
@Override protected OrderedPSet<Object> createEmptyCollection() { return OrderedPSet.empty(); } }
public static <T> POrderedSet<T> empty(){ return OrderedPSet.empty(); } public static <T> POrderedSet<T> singleton(T value){
public static <E> POrderedSet<E> orderedSet() { return OrderedPSet.empty(); }
public static <E> POrderedSet<E> orderedSet() { return OrderedPSet.empty(); }
@SuppressWarnings("unchecked") public static <E> OrderedPSet<E> from(final Collection<? extends E> list) { if (list instanceof OrderedPSet) return (OrderedPSet<E>) list; return OrderedPSet.<E>empty().plusAll(list); }
@SuppressWarnings("unchecked") public static <E> OrderedPSet<E> from(final Collection<? extends E> list) { if (list instanceof OrderedPSet) return (OrderedPSet<E>) list; return OrderedPSet.<E> empty().plusAll(list); }
public static <T> POrderedSetX<T> empty(){ return new POrderedSetXImpl<>(OrderedPSet.empty()); } public static <T> POrderedSetX<T> singleton(T value){
public static <E> OrderedPSet<E> singleton(final E e) { return OrderedPSet.<E>empty().plus(e); }
public Fork() { this(OrderedPSet.empty(), HashTreePMap.empty()); }
public static <E> OrderedPSet<E> singleton(final E e) { return OrderedPSet.<E> empty().plus(e); }
public static <T> OrderedSetX<T> empty() { return new LazyPOrderedSetX<>( OrderedPSet.empty(),null,Reducers.toPOrderedSet(),Evaluation.LAZY); }
public static <T> Keys<T> from(Collection<Keys<T>> keys) { PSet<Key<T, ?>> result = OrderedPSet.empty(); for (Keys<T> innerKeys : keys) { for (Key<T, ?> key : innerKeys) { result = result.plus(key); } } return new KeySet<>(result); }
public static <T> Monoid<POrderedSet<T>> toPOrderedSet() { return Monoid.<POrderedSet<T>>of(OrderedPSet.empty(), (POrderedSet<T> a) -> b -> a.plusAll(b), (T x) -> OrderedPSet.singleton(x)); } public static <T> Monoid<PBag<T>> toPBag() {
/** * <pre> * {@code * POrderedSet<Integer> q = Reducers.<Integer>toPOrderedSet() .mapReduce(Stream.of(1,2,3,4)); * * } * </pre> * @return Reducer to POrderedSet */ public static <T> Reducer<POrderedSet<T>> toPOrderedSet() { return Reducer.<POrderedSet<T>> of(OrderedPSet.empty(), (final POrderedSet<T> a) -> b -> a.plusAll(b), (final T x) -> OrderedPSet.singleton(x)); } /**