public class PersistentTreeSet<E> extends UnmodSet.AbstractUnmodSet<E> implements ImSortedSet<E>, Serializable
UnmodSet.AbstractUnmodSet<T>
UnmodIterable.AbstractUnmodIterable<T>
Modifier and Type | Field and Description |
---|---|
static 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").
|
Modifier and Type | Method and Description |
---|---|
Comparator<? super E> |
comparator()
Returns the comparator used to order the items in this set, or null if it uses
Function2.DEFAULT_COMPARATOR (for compatibility with java.util.SortedSet).
|
boolean |
contains(Object o)
Returns true if the set contains the given item in O(log n) time.
|
static <T extends Comparable<T>> |
empty()
Be extremely careful with this because it uses the default comparator, which only works for
items that implement Comparable (have a "natural ordering").
|
boolean |
equals(Object other)
This is designed to be correct, rather than fully compatible with TreeSet.equals().
|
E |
first()
Use head() inherited from Sequence instead of this method which is inherited from SortedSet.
|
Option<E> |
head()
The first item in this sequence.
|
boolean |
isEmpty()
This is a convenience method inherited from Collection that returns true if size() == 0 (if
this set contains no elements).
|
UnmodSortedIterator<E> |
iterator()
Iterates over contents in a guaranteed order.
|
E |
last()
Inherited from SortedSet, returns the last item in this set, or throw an exception if this set
is empty.
|
static <T extends Comparable<T>> |
of(Iterable<T> items)
Returns a new PersistentTreeSet of the given comparable items.
|
static <T> PersistentTreeSet<T> |
ofComp(Comparator<? super T> comp)
Returns a new PersistentTreeSet of the given comparator.
|
static <T> PersistentTreeSet<T> |
ofComp(Comparator<? super T> comp,
Iterable<T> elements)
Returns a new PersistentTreeSet of the given comparator and items.
|
static <T> PersistentTreeSet<T> |
ofMap(ImSortedMap<T,?> i)
Returns a new PersistentTreeSet of the keys and comparator in the given map.
|
PersistentTreeSet<E> |
put(E e)
Adds an element, returning a modified version of the set (leaving the original set unchanged).
|
int |
size()
The size of this set.
|
ImSortedSet<E> |
subSet(E fromElement,
E toElement)
Return the elements in this set from the start element (inclusive) to the end element
(exclusive)
|
ImSortedSet<E> |
tailSet(E fromElement) |
PersistentTreeSet<E> |
without(E key)
Removes the given item, returning a modified version of the set (leaving the original set
unchanged).
|
hashCode, toString
clone, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
headSet, union
add, addAll, clear, containsAll, remove, removeAll, removeIf, retainAll, toArray, toArray
spliterator
parallelStream, stream
castFromList, castFromSortedMap, castFromSortedSet, equal, equals
concat, drop, filter, flatMap, foldLeft, foldLeft, hash, hashCode, map, precat, take, takeWhile, toString
toImList, toImMap, toImSet, toImSortedMap, toImSortedSet, toMutableList, toMutableMap, toMutableSet, toMutableSortedMap, toMutableSortedSet
public static final PersistentTreeSet EMPTY
public static <T extends Comparable<T>> PersistentTreeSet<T> empty()
public static <T> PersistentTreeSet<T> ofComp(Comparator<? super T> comp)
public static <T> PersistentTreeSet<T> ofComp(Comparator<? super T> comp, Iterable<T> elements)
comp
- A comparator that defines the sort order of elements in the new set. This
becomes part of the set (it's not for pre-sorting).elements
- items to go into the set. In the case of a duplicate element, later
values in the input list overwrite the earlier ones.public static <T extends Comparable<T>> PersistentTreeSet<T> of(Iterable<T> items)
public static <T> PersistentTreeSet<T> ofMap(ImSortedMap<T,?> i)
public Comparator<? super E> comparator()
comparator
in interface SortedSet<E>
public boolean contains(Object o)
public PersistentTreeSet<E> without(E key)
public UnmodSortedIterator<E> iterator()
iterator
in interface Iterable<E>
iterator
in interface Collection<E>
iterator
in interface Set<E>
iterator
in interface ImSortedSet<E>
iterator
in interface UnmodCollection<E>
iterator
in interface UnmodIterable<E>
iterator
in interface UnmodSet<E>
iterator
in interface UnmodSortedCollection<E>
iterator
in interface UnmodSortedIterable<E>
iterator
in interface UnmodSortedSet<E>
public boolean equals(Object other)
equals
in interface Collection<E>
equals
in interface Set<E>
equals
in class UnmodSet.AbstractUnmodSet<E>
public E first()
public Option<E> head()
head
in interface UnmodIterable<E>
public boolean isEmpty()
public E last()
public PersistentTreeSet<E> put(E e)
public int size()
public ImSortedSet<E> subSet(E fromElement, E toElement)
subSet
in interface SortedSet<E>
subSet
in interface ImSortedSet<E>
subSet
in interface UnmodSortedSet<E>
public ImSortedSet<E> tailSet(E fromElement)
tailSet
in interface SortedSet<E>
tailSet
in interface ImSortedSet<E>
tailSet
in interface UnmodSortedSet<E>
Copyright © 2016. All rights reserved.