MutableSortedSetFactory

abstract def empty[A](implicit ord: Ordering[A]): CC[A]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply[A](elems: A*)(implicit ord: Ordering[A]): CC[A]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def newBuilder[A](implicit ord: Ordering[A]): Builder[A, CC[A]]

mutable.SetBuilder uses '+' which is not a primitive for anything extending mutable.SetLike, this causes serious performance issues since each time 'elems = elems + x' is evaluated elems is cloned (which is O(n)).

implicit def newCanBuildFrom[A](implicit ord: Ordering[A]): CanBuildFrom[Coll, A, CC[A]]

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit