Class TreeSet

Ports/CLDC11/src/java/util/TreeSet.java:28–526

///
/// 1.2
public class TreeSet<E> extends AbstractSet<E> implements NavigableSet<E> {

    /// Keys are this set's elements. Values are always Boolean.TRUE
    private transient NavigableMap<E, Object> backingMap;

    private transient NavigableSet<E> descendingSet;

    TreeSet(NavigableMap<E, Object> map) {
        backingMap = map;
    }

    /// Constructs a new empty instance of `TreeSet` which uses natural
    /// ordering.
    public TreeSet() {
        backingMap = new TreeMap<E, Object>();
    }

    /// Constructs a new instance of `TreeSet` which uses natural ordering
    /// and containing the unique elements in the specified collection.
    ///
    /// #### Parameters
    ///
    /// - `collection`: the collection of elements to add.
    ///
    /// #### Throws
    ///
    /// - `ClassCastException`: @throws ClassCastException
    /// when an element in the collection does not implement the
    /// Comparable interface, or the elements in the collection
    /// cannot be compared.
    public TreeSet(Collection<? extends E> collection) {
        this();
        addAll(collection);
    }

    /// Constructs a new empty instance of `TreeSet` which uses the
    /// specified comparator.
    ///
    /// #### Parameters
    ///
    /// - `comparator`: the comparator to use.
    public TreeSet(Comparator<? super E> comparator) {
        backingMap = new TreeMap<E, Object>(comparator);
    }

    /// Constructs a new instance of `TreeSet` containing the elements of
    /// the specified SortedSet and using the same Comparator.
    ///
    /// #### Parameters
    ///
    /// - `set`: the SortedSet of elements to add.
    public TreeSet(SortedSet<E> set) {
        this(set.comparator());
        Iterator<E> it = set.iterator();
        while (it.hasNext()) {
            add(it.next());
        }
    }