class
TreeSet[T >: Null <: AnyRef] extends Set[T]
Instance Constructors
-
new
TreeSet(less: (T, T) ⇒ Boolean)
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
def
->[B](y: B): (TreeSet[T], B)
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
addEntry(x: T): Unit
-
def
apply(x: T): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
contains(x: T): Boolean
-
def
ensuring(cond: (TreeSet[T]) ⇒ Boolean, msg: ⇒ Any): TreeSet[T]
-
def
ensuring(cond: (TreeSet[T]) ⇒ Boolean): TreeSet[T]
-
def
ensuring(cond: Boolean, msg: ⇒ Any): TreeSet[T]
-
def
ensuring(cond: Boolean): TreeSet[T]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
findEntry(x: T): T
-
def
foreach[U](f: (T) ⇒ U): Unit
-
def
formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
iterator: Iterator[T]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
val
self: Any
-
val
self: Any
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toList: List[T]
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
→[B](y: B): (TreeSet[T], B)
Deprecated Value Members
-
def
elements: Iterator[T]
-
-
Inherited from Set[T]
Inherited from AnyRef
Inherited from Any
Inherited by implicit conversion any2stringadd from
TreeSet[T] to StringAdd
Inherited by implicit conversion any2stringfmt from
TreeSet[T] to StringFormat
Inherited by implicit conversion any2ArrowAssoc from
TreeSet[T] to ArrowAssoc[TreeSet[T]]
Inherited by implicit conversion any2Ensuring from
TreeSet[T] to Ensuring[TreeSet[T]]
Sets implemented as binary trees.
1.0