0N/A/*
3261N/A * Copyright (c) 1998, 2010, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
2362N/A * published by the Free Software Foundation. Oracle designates this
0N/A * particular file as subject to the "Classpath" exception as provided
2362N/A * by Oracle in the LICENSE file that accompanied this code.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/Apackage java.util;
0N/A
0N/A/**
0N/A * A {@link NavigableSet} implementation based on a {@link TreeMap}.
0N/A * The elements are ordered using their {@linkplain Comparable natural
0N/A * ordering}, or by a {@link Comparator} provided at set creation
0N/A * time, depending on which constructor is used.
0N/A *
0N/A * <p>This implementation provides guaranteed log(n) time cost for the basic
0N/A * operations ({@code add}, {@code remove} and {@code contains}).
0N/A *
0N/A * <p>Note that the ordering maintained by a set (whether or not an explicit
0N/A * comparator is provided) must be <i>consistent with equals</i> if it is to
0N/A * correctly implement the {@code Set} interface. (See {@code Comparable}
0N/A * or {@code Comparator} for a precise definition of <i>consistent with
0N/A * equals</i>.) This is so because the {@code Set} interface is defined in
0N/A * terms of the {@code equals} operation, but a {@code TreeSet} instance
0N/A * performs all element comparisons using its {@code compareTo} (or
0N/A * {@code compare}) method, so two elements that are deemed equal by this method
0N/A * are, from the standpoint of the set, equal. The behavior of a set
0N/A * <i>is</i> well-defined even if its ordering is inconsistent with equals; it
0N/A * just fails to obey the general contract of the {@code Set} interface.
0N/A *
0N/A * <p><strong>Note that this implementation is not synchronized.</strong>
0N/A * If multiple threads access a tree set concurrently, and at least one
0N/A * of the threads modifies the set, it <i>must</i> be synchronized
0N/A * externally. This is typically accomplished by synchronizing on some
0N/A * object that naturally encapsulates the set.
0N/A * If no such object exists, the set should be "wrapped" using the
0N/A * {@link Collections#synchronizedSortedSet Collections.synchronizedSortedSet}
0N/A * method. This is best done at creation time, to prevent accidental
0N/A * unsynchronized access to the set: <pre>
0N/A * SortedSet s = Collections.synchronizedSortedSet(new TreeSet(...));</pre>
0N/A *
0N/A * <p>The iterators returned by this class's {@code iterator} method are
0N/A * <i>fail-fast</i>: if the set is modified at any time after the iterator is
0N/A * created, in any way except through the iterator's own {@code remove}
0N/A * method, the iterator will throw a {@link ConcurrentModificationException}.
0N/A * Thus, in the face of concurrent modification, the iterator fails quickly
0N/A * and cleanly, rather than risking arbitrary, non-deterministic behavior at
0N/A * an undetermined time in the future.
0N/A *
0N/A * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed
0N/A * as it is, generally speaking, impossible to make any hard guarantees in the
0N/A * presence of unsynchronized concurrent modification. Fail-fast iterators
0N/A * throw {@code ConcurrentModificationException} on a best-effort basis.
0N/A * Therefore, it would be wrong to write a program that depended on this
0N/A * exception for its correctness: <i>the fail-fast behavior of iterators
0N/A * should be used only to detect bugs.</i>
0N/A *
0N/A * <p>This class is a member of the
0N/A * <a href="{@docRoot}/../technotes/guides/collections/index.html">
0N/A * Java Collections Framework</a>.
0N/A *
0N/A * @param <E> the type of elements maintained by this set
0N/A *
0N/A * @author Josh Bloch
0N/A * @see Collection
0N/A * @see Set
0N/A * @see HashSet
0N/A * @see Comparable
0N/A * @see Comparator
0N/A * @see TreeMap
0N/A * @since 1.2
0N/A */
0N/A
0N/Apublic class TreeSet<E> extends AbstractSet<E>
0N/A implements NavigableSet<E>, Cloneable, java.io.Serializable
0N/A{
0N/A /**
0N/A * The backing map.
0N/A */
0N/A private transient NavigableMap<E,Object> m;
0N/A
0N/A // Dummy value to associate with an Object in the backing Map
0N/A private static final Object PRESENT = new Object();
0N/A
0N/A /**
0N/A * Constructs a set backed by the specified navigable map.
0N/A */
0N/A TreeSet(NavigableMap<E,Object> m) {
0N/A this.m = m;
0N/A }
0N/A
0N/A /**
0N/A * Constructs a new, empty tree set, sorted according to the
0N/A * natural ordering of its elements. All elements inserted into
0N/A * the set must implement the {@link Comparable} interface.
0N/A * Furthermore, all such elements must be <i>mutually
0N/A * comparable</i>: {@code e1.compareTo(e2)} must not throw a
0N/A * {@code ClassCastException} for any elements {@code e1} and
0N/A * {@code e2} in the set. If the user attempts to add an element
0N/A * to the set that violates this constraint (for example, the user
0N/A * attempts to add a string element to a set whose elements are
0N/A * integers), the {@code add} call will throw a
0N/A * {@code ClassCastException}.
0N/A */
0N/A public TreeSet() {
0N/A this(new TreeMap<E,Object>());
0N/A }
0N/A
0N/A /**
0N/A * Constructs a new, empty tree set, sorted according to the specified
0N/A * comparator. All elements inserted into the set must be <i>mutually
0N/A * comparable</i> by the specified comparator: {@code comparator.compare(e1,
0N/A * e2)} must not throw a {@code ClassCastException} for any elements
0N/A * {@code e1} and {@code e2} in the set. If the user attempts to add
0N/A * an element to the set that violates this constraint, the
0N/A * {@code add} call will throw a {@code ClassCastException}.
0N/A *
0N/A * @param comparator the comparator that will be used to order this set.
0N/A * If {@code null}, the {@linkplain Comparable natural
0N/A * ordering} of the elements will be used.
0N/A */
0N/A public TreeSet(Comparator<? super E> comparator) {
3323N/A this(new TreeMap<>(comparator));
0N/A }
0N/A
0N/A /**
0N/A * Constructs a new tree set containing the elements in the specified
0N/A * collection, sorted according to the <i>natural ordering</i> of its
0N/A * elements. All elements inserted into the set must implement the
0N/A * {@link Comparable} interface. Furthermore, all such elements must be
0N/A * <i>mutually comparable</i>: {@code e1.compareTo(e2)} must not throw a
0N/A * {@code ClassCastException} for any elements {@code e1} and
0N/A * {@code e2} in the set.
0N/A *
0N/A * @param c collection whose elements will comprise the new set
0N/A * @throws ClassCastException if the elements in {@code c} are
0N/A * not {@link Comparable}, or are not mutually comparable
0N/A * @throws NullPointerException if the specified collection is null
0N/A */
0N/A public TreeSet(Collection<? extends E> c) {
0N/A this();
0N/A addAll(c);
0N/A }
0N/A
0N/A /**
0N/A * Constructs a new tree set containing the same elements and
0N/A * using the same ordering as the specified sorted set.
0N/A *
0N/A * @param s sorted set whose elements will comprise the new set
0N/A * @throws NullPointerException if the specified sorted set is null
0N/A */
0N/A public TreeSet(SortedSet<E> s) {
0N/A this(s.comparator());
0N/A addAll(s);
0N/A }
0N/A
0N/A /**
0N/A * Returns an iterator over the elements in this set in ascending order.
0N/A *
0N/A * @return an iterator over the elements in this set in ascending order
0N/A */
0N/A public Iterator<E> iterator() {
0N/A return m.navigableKeySet().iterator();
0N/A }
0N/A
0N/A /**
0N/A * Returns an iterator over the elements in this set in descending order.
0N/A *
0N/A * @return an iterator over the elements in this set in descending order
0N/A * @since 1.6
0N/A */
0N/A public Iterator<E> descendingIterator() {
0N/A return m.descendingKeySet().iterator();
0N/A }
0N/A
0N/A /**
0N/A * @since 1.6
0N/A */
0N/A public NavigableSet<E> descendingSet() {
3323N/A return new TreeSet<>(m.descendingMap());
0N/A }
0N/A
0N/A /**
0N/A * Returns the number of elements in this set (its cardinality).
0N/A *
0N/A * @return the number of elements in this set (its cardinality)
0N/A */
0N/A public int size() {
0N/A return m.size();
0N/A }
0N/A
0N/A /**
0N/A * Returns {@code true} if this set contains no elements.
0N/A *
0N/A * @return {@code true} if this set contains no elements
0N/A */
0N/A public boolean isEmpty() {
0N/A return m.isEmpty();
0N/A }
0N/A
0N/A /**
0N/A * Returns {@code true} if this set contains the specified element.
0N/A * More formally, returns {@code true} if and only if this set
0N/A * contains an element {@code e} such that
0N/A * <tt>(o==null&nbsp;?&nbsp;e==null&nbsp;:&nbsp;o.equals(e))</tt>.
0N/A *
0N/A * @param o object to be checked for containment in this set
0N/A * @return {@code true} if this set contains the specified element
0N/A * @throws ClassCastException if the specified object cannot be compared
0N/A * with the elements currently in the set
0N/A * @throws NullPointerException if the specified element is null
0N/A * and this set uses natural ordering, or its comparator
0N/A * does not permit null elements
0N/A */
0N/A public boolean contains(Object o) {
0N/A return m.containsKey(o);
0N/A }
0N/A
0N/A /**
0N/A * Adds the specified element to this set if it is not already present.
0N/A * More formally, adds the specified element {@code e} to this set if
0N/A * the set contains no element {@code e2} such that
0N/A * <tt>(e==null&nbsp;?&nbsp;e2==null&nbsp;:&nbsp;e.equals(e2))</tt>.
0N/A * If this set already contains the element, the call leaves the set
0N/A * unchanged and returns {@code false}.
0N/A *
0N/A * @param e element to be added to this set
0N/A * @return {@code true} if this set did not already contain the specified
0N/A * element
0N/A * @throws ClassCastException if the specified object cannot be compared
0N/A * with the elements currently in this set
0N/A * @throws NullPointerException if the specified element is null
0N/A * and this set uses natural ordering, or its comparator
0N/A * does not permit null elements
0N/A */
0N/A public boolean add(E e) {
0N/A return m.put(e, PRESENT)==null;
0N/A }
0N/A
0N/A /**
0N/A * Removes the specified element from this set if it is present.
0N/A * More formally, removes an element {@code e} such that
0N/A * <tt>(o==null&nbsp;?&nbsp;e==null&nbsp;:&nbsp;o.equals(e))</tt>,
0N/A * if this set contains such an element. Returns {@code true} if
0N/A * this set contained the element (or equivalently, if this set
0N/A * changed as a result of the call). (This set will not contain the
0N/A * element once the call returns.)
0N/A *
0N/A * @param o object to be removed from this set, if present
0N/A * @return {@code true} if this set contained the specified element
0N/A * @throws ClassCastException if the specified object cannot be compared
0N/A * with the elements currently in this set
0N/A * @throws NullPointerException if the specified element is null
0N/A * and this set uses natural ordering, or its comparator
0N/A * does not permit null elements
0N/A */
0N/A public boolean remove(Object o) {
0N/A return m.remove(o)==PRESENT;
0N/A }
0N/A
0N/A /**
0N/A * Removes all of the elements from this set.
0N/A * The set will be empty after this call returns.
0N/A */
0N/A public void clear() {
0N/A m.clear();
0N/A }
0N/A
0N/A /**
0N/A * Adds all of the elements in the specified collection to this set.
0N/A *
0N/A * @param c collection containing elements to be added to this set
0N/A * @return {@code true} if this set changed as a result of the call
0N/A * @throws ClassCastException if the elements provided cannot be compared
0N/A * with the elements currently in the set
0N/A * @throws NullPointerException if the specified collection is null or
0N/A * if any element is null and this set uses natural ordering, or
0N/A * its comparator does not permit null elements
0N/A */
0N/A public boolean addAll(Collection<? extends E> c) {
0N/A // Use linear-time version if applicable
0N/A if (m.size()==0 && c.size() > 0 &&
0N/A c instanceof SortedSet &&
0N/A m instanceof TreeMap) {
0N/A SortedSet<? extends E> set = (SortedSet<? extends E>) c;
0N/A TreeMap<E,Object> map = (TreeMap<E, Object>) m;
0N/A Comparator<? super E> cc = (Comparator<? super E>) set.comparator();
0N/A Comparator<? super E> mc = map.comparator();
0N/A if (cc==mc || (cc != null && cc.equals(mc))) {
0N/A map.addAllForTreeSet(set, PRESENT);
0N/A return true;
0N/A }
0N/A }
0N/A return super.addAll(c);
0N/A }
0N/A
0N/A /**
0N/A * @throws ClassCastException {@inheritDoc}
0N/A * @throws NullPointerException if {@code fromElement} or {@code toElement}
0N/A * is null and this set uses natural ordering, or its comparator
0N/A * does not permit null elements
0N/A * @throws IllegalArgumentException {@inheritDoc}
0N/A * @since 1.6
0N/A */
0N/A public NavigableSet<E> subSet(E fromElement, boolean fromInclusive,
0N/A E toElement, boolean toInclusive) {
3323N/A return new TreeSet<>(m.subMap(fromElement, fromInclusive,
0N/A toElement, toInclusive));
0N/A }
0N/A
0N/A /**
0N/A * @throws ClassCastException {@inheritDoc}
0N/A * @throws NullPointerException if {@code toElement} is null and
0N/A * this set uses natural ordering, or its comparator does
0N/A * not permit null elements
0N/A * @throws IllegalArgumentException {@inheritDoc}
0N/A * @since 1.6
0N/A */
0N/A public NavigableSet<E> headSet(E toElement, boolean inclusive) {
3323N/A return new TreeSet<>(m.headMap(toElement, inclusive));
0N/A }
0N/A
0N/A /**
0N/A * @throws ClassCastException {@inheritDoc}
0N/A * @throws NullPointerException if {@code fromElement} is null and
0N/A * this set uses natural ordering, or its comparator does
0N/A * not permit null elements
0N/A * @throws IllegalArgumentException {@inheritDoc}
0N/A * @since 1.6
0N/A */
0N/A public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
3323N/A return new TreeSet<>(m.tailMap(fromElement, inclusive));
0N/A }
0N/A
0N/A /**
0N/A * @throws ClassCastException {@inheritDoc}
0N/A * @throws NullPointerException if {@code fromElement} or
0N/A * {@code toElement} is null and this set uses natural ordering,
0N/A * or its comparator does not permit null elements
0N/A * @throws IllegalArgumentException {@inheritDoc}
0N/A */
0N/A public SortedSet<E> subSet(E fromElement, E toElement) {
0N/A return subSet(fromElement, true, toElement, false);
0N/A }
0N/A
0N/A /**
0N/A * @throws ClassCastException {@inheritDoc}
0N/A * @throws NullPointerException if {@code toElement} is null
0N/A * and this set uses natural ordering, or its comparator does
0N/A * not permit null elements
0N/A * @throws IllegalArgumentException {@inheritDoc}
0N/A */
0N/A public SortedSet<E> headSet(E toElement) {
0N/A return headSet(toElement, false);
0N/A }
0N/A
0N/A /**
0N/A * @throws ClassCastException {@inheritDoc}
0N/A * @throws NullPointerException if {@code fromElement} is null
0N/A * and this set uses natural ordering, or its comparator does
0N/A * not permit null elements
0N/A * @throws IllegalArgumentException {@inheritDoc}
0N/A */
0N/A public SortedSet<E> tailSet(E fromElement) {
0N/A return tailSet(fromElement, true);
0N/A }
0N/A
0N/A public Comparator<? super E> comparator() {
0N/A return m.comparator();
0N/A }
0N/A
0N/A /**
0N/A * @throws NoSuchElementException {@inheritDoc}
0N/A */
0N/A public E first() {
0N/A return m.firstKey();
0N/A }
0N/A
0N/A /**
0N/A * @throws NoSuchElementException {@inheritDoc}
0N/A */
0N/A public E last() {
0N/A return m.lastKey();
0N/A }
0N/A
0N/A // NavigableSet API methods
0N/A
0N/A /**
0N/A * @throws ClassCastException {@inheritDoc}
0N/A * @throws NullPointerException if the specified element is null
0N/A * and this set uses natural ordering, or its comparator
0N/A * does not permit null elements
0N/A * @since 1.6
0N/A */
0N/A public E lower(E e) {
0N/A return m.lowerKey(e);
0N/A }
0N/A
0N/A /**
0N/A * @throws ClassCastException {@inheritDoc}
0N/A * @throws NullPointerException if the specified element is null
0N/A * and this set uses natural ordering, or its comparator
0N/A * does not permit null elements
0N/A * @since 1.6
0N/A */
0N/A public E floor(E e) {
0N/A return m.floorKey(e);
0N/A }
0N/A
0N/A /**
0N/A * @throws ClassCastException {@inheritDoc}
0N/A * @throws NullPointerException if the specified element is null
0N/A * and this set uses natural ordering, or its comparator
0N/A * does not permit null elements
0N/A * @since 1.6
0N/A */
0N/A public E ceiling(E e) {
0N/A return m.ceilingKey(e);
0N/A }
0N/A
0N/A /**
0N/A * @throws ClassCastException {@inheritDoc}
0N/A * @throws NullPointerException if the specified element is null
0N/A * and this set uses natural ordering, or its comparator
0N/A * does not permit null elements
0N/A * @since 1.6
0N/A */
0N/A public E higher(E e) {
0N/A return m.higherKey(e);
0N/A }
0N/A
0N/A /**
0N/A * @since 1.6
0N/A */
0N/A public E pollFirst() {
0N/A Map.Entry<E,?> e = m.pollFirstEntry();
3203N/A return (e == null) ? null : e.getKey();
0N/A }
0N/A
0N/A /**
0N/A * @since 1.6
0N/A */
0N/A public E pollLast() {
0N/A Map.Entry<E,?> e = m.pollLastEntry();
3203N/A return (e == null) ? null : e.getKey();
0N/A }
0N/A
0N/A /**
0N/A * Returns a shallow copy of this {@code TreeSet} instance. (The elements
0N/A * themselves are not cloned.)
0N/A *
0N/A * @return a shallow copy of this set
0N/A */
0N/A public Object clone() {
0N/A TreeSet<E> clone = null;
0N/A try {
0N/A clone = (TreeSet<E>) super.clone();
0N/A } catch (CloneNotSupportedException e) {
0N/A throw new InternalError();
0N/A }
0N/A
3323N/A clone.m = new TreeMap<>(m);
0N/A return clone;
0N/A }
0N/A
0N/A /**
0N/A * Save the state of the {@code TreeSet} instance to a stream (that is,
0N/A * serialize it).
0N/A *
0N/A * @serialData Emits the comparator used to order this set, or
0N/A * {@code null} if it obeys its elements' natural ordering
0N/A * (Object), followed by the size of the set (the number of
0N/A * elements it contains) (int), followed by all of its
0N/A * elements (each an Object) in order (as determined by the
0N/A * set's Comparator, or by the elements' natural ordering if
0N/A * the set has no Comparator).
0N/A */
0N/A private void writeObject(java.io.ObjectOutputStream s)
0N/A throws java.io.IOException {
0N/A // Write out any hidden stuff
0N/A s.defaultWriteObject();
0N/A
0N/A // Write out Comparator
0N/A s.writeObject(m.comparator());
0N/A
0N/A // Write out size
0N/A s.writeInt(m.size());
0N/A
0N/A // Write out all elements in the proper order.
28N/A for (E e : m.keySet())
28N/A s.writeObject(e);
0N/A }
0N/A
0N/A /**
0N/A * Reconstitute the {@code TreeSet} instance from a stream (that is,
0N/A * deserialize it).
0N/A */
0N/A private void readObject(java.io.ObjectInputStream s)
0N/A throws java.io.IOException, ClassNotFoundException {
0N/A // Read in any hidden stuff
0N/A s.defaultReadObject();
0N/A
0N/A // Read in Comparator
0N/A Comparator<? super E> c = (Comparator<? super E>) s.readObject();
0N/A
0N/A // Create backing TreeMap
0N/A TreeMap<E,Object> tm;
0N/A if (c==null)
3323N/A tm = new TreeMap<>();
0N/A else
3323N/A tm = new TreeMap<>(c);
0N/A m = tm;
0N/A
0N/A // Read in size
0N/A int size = s.readInt();
0N/A
0N/A tm.readTreeSet(size, s, PRESENT);
0N/A }
0N/A
0N/A private static final long serialVersionUID = -2479143000061671589L;
0N/A}