class TreeSet[E] extends AbstractSet[E] with NavigableSet[E] with Cloneable with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- TreeSet
- Serializable
- Cloneable
- NavigableSet
- SortedSet
- SequencedSet
- SequencedCollection
- AbstractSet
- Set
- AbstractCollection
- Collection
- Iterable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new TreeSet(sortedSet: SortedSet[E])
- new TreeSet(collection: Collection[_ <: E])
- new TreeSet(comparator: Comparator[_ >: E])
- new TreeSet()
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def add(e: E): Boolean
- Definition Classes
- TreeSet → Set → AbstractCollection → Collection
- def addAll(c: Collection[_ <: E]): Boolean
- Definition Classes
- AbstractCollection → Collection
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def ceiling(e: E): E
- Definition Classes
- TreeSet → NavigableSet
- def clear(): Unit
- Definition Classes
- TreeSet → Set → AbstractCollection → Collection
- def clone(): TreeSet[E]
- Definition Classes
- TreeSet → AnyRef
- def comparator(): Comparator[_ >: E]
- def contains(o: Any): Boolean
- Definition Classes
- TreeSet → Set → AbstractCollection → Collection
- def containsAll(c: Collection[_]): Boolean
- Definition Classes
- AbstractCollection → Collection
- def descendingIterator(): Iterator[E]
- Definition Classes
- TreeSet → NavigableSet
- def descendingSet(): NavigableSet[E]
- Definition Classes
- TreeSet → NavigableSet
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- AbstractSet → Collection → AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def first(): E
- def floor(e: E): E
- Definition Classes
- TreeSet → NavigableSet
- def forEach(action: Consumer[_ >: E]): Unit
- Definition Classes
- Iterable
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AbstractSet → Collection → AnyRef → Any
- def headSet(toElement: E): SortedSet[E]
- Definition Classes
- TreeSet → NavigableSet → SortedSet
- def headSet(toElement: E, inclusive: Boolean): NavigableSet[E]
- Definition Classes
- TreeSet → NavigableSet
- def higher(e: E): E
- Definition Classes
- TreeSet → NavigableSet
- def isEmpty(): Boolean
- Definition Classes
- TreeSet → Set → AbstractCollection → Collection
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def iterator(): Iterator[E]
- Definition Classes
- TreeSet → NavigableSet → Set → AbstractCollection → Collection → Iterable
- def last(): E
- def lower(e: E): E
- Definition Classes
- TreeSet → NavigableSet
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def parallelStream(): Stream[E]
- Definition Classes
- Collection
- def pollFirst(): E
- Definition Classes
- TreeSet → NavigableSet
- def pollLast(): E
- Definition Classes
- TreeSet → NavigableSet
- def remove(o: Any): Boolean
- Definition Classes
- TreeSet → Set → AbstractCollection → Collection
- def removeAll(c: Collection[_]): Boolean
- Definition Classes
- AbstractSet → Set → AbstractCollection → Collection
- def removeIf(filter: Predicate[_ >: E]): Boolean
- Definition Classes
- Collection
- def retainAll(c: Collection[_]): Boolean
- Definition Classes
- AbstractCollection → Collection
- def size(): Int
- Definition Classes
- TreeSet → Set → AbstractCollection → Collection
- def spliterator(): Spliterator[E]
From the Java 8 documentation: The default implementation should usually be overridden.
From the Java 8 documentation: The default implementation should usually be overridden. The spliterator returned by the default implementation has poor splitting capabilities, is unsized, and does not report any spliterator characteristics. Implementing classes can nearly always provide a better implementation.
- Definition Classes
- Collection → Iterable
- def stream(): Stream[E]
- Definition Classes
- Collection
- def subSet(fromElement: E, toElement: E): SortedSet[E]
- Definition Classes
- TreeSet → NavigableSet → SortedSet
- def subSet(fromElement: E, fromInclusive: Boolean, toElement: E, toInclusive: Boolean): NavigableSet[E]
- Definition Classes
- TreeSet → NavigableSet
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tailSet(fromElement: E): SortedSet[E]
- Definition Classes
- TreeSet → NavigableSet → SortedSet
- def tailSet(fromElement: E, inclusive: Boolean): NavigableSet[E]
- Definition Classes
- TreeSet → NavigableSet
- def toArray[T <: AnyRef](a: Array[T]): Array[T]
- Definition Classes
- AbstractCollection → Collection
- def toArray(): Array[AnyRef]
- Definition Classes
- AbstractCollection → Collection
- def toString(): String
- Definition Classes
- AbstractCollection → AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()