PartMap

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def filledOrElse(alterSeq: ⇒ Seq[A]): Seq[A]

Returns Seq value if the Seq is nonempty, otherwise return the result of evaluating alterSeq.

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def partitionMap[B](p: (A) ⇒ Boolean)(f: (A) ⇒ B): (Seq[B], Seq[B])

Apply f after Partitions by p this Seq[A] in two (Seq[B],Seq[B])

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

def emptyOrElse(alterSeq: ⇒ Seq[A]): Seq[A]