static <T extends java.lang.Comparable<T>> PersistentTreeSet<T> |
PersistentTreeSet.empty() |
Be extremely careful with this because it uses the default comparator, which only works for
items that implement Comparable (have a "natural ordering").
|
static <T extends java.lang.Comparable<T>> PersistentTreeSet<T> |
PersistentTreeSet.of(java.lang.Iterable<T> items) |
Returns a new PersistentTreeSet of the given comparable items.
|
static <T> PersistentTreeSet<T> |
PersistentTreeSet.ofComp(java.util.Comparator<? super T> comp) |
Returns a new PersistentTreeSet of the given comparator.
|
static <T> PersistentTreeSet<T> |
PersistentTreeSet.ofComp(java.util.Comparator<? super T> comp,
java.lang.Iterable<T> elements) |
Returns a new PersistentTreeSet of the given comparator and items.
|
static <T> PersistentTreeSet<T> |
PersistentTreeSet.ofMap(ImSortedMap<T,?> i) |
Returns a new PersistentTreeSet of the keys and comparator in the given map.
|
PersistentTreeSet<E> |
PersistentTreeSet.put(E e) |
Adds an element.
|
PersistentTreeSet<E> |
PersistentTreeSet.without(E key) |
Removes this key from the set
|