LeftistHeap

abstract def collector: HC

Interface for collecting information about the elements stored in the heap

abstract def deleteMin: LeftistHeap[T, HC]

Remove the minimum element from this heap, or raise an exception iff this heap is empty (isEmpty()==true)

abstract def empty: LeftistHeap[T, HC]

Construct an empty heap

abstract def findMin: T

abstract def flatItMapRec(f: (T) ⇒ Iterator[T], stop: (LeftistHeap[T, HC]) ⇒ Boolean): LeftistHeap[T, HC]

Apply a function f to all elements in this heap.

abstract def insert(element: T): LeftistHeap[T, HC]

Add an element to this heap object

abstract def insertHeap(h: LeftistHeap[T, HC]): LeftistHeap[T, HC]

Add multiple elements to this heap object.

abstract def removeAll(element: T): LeftistHeap[T, HC]

Remove all elements of this heap which are equal to element.

abstract def rightHeight: Int

Length of the right spine, i.e.

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(el: T): LeftistHeap[T, HC]

def ++(els: Iterable[T]): LeftistHeap[T, HC]

def ++(els: Iterator[T]): LeftistHeap[T, HC]

def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

def /:[B](z: B)(op: (B, T) ⇒ B): B

def :\[B](z: B)(op: (T, B) ⇒ B): B

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

def companion: GenericCompanion[Iterable]

def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: T](xs: Array[B]): Unit

def copyToArray[B >: T](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: T](dest: Buffer[B]): Unit

def count(p: (T) ⇒ Boolean): Int

def drop(n: Int): LeftistHeap[T, HC]

def dropRight(n: Int): LeftistHeap[T, HC]

def dropWhile(p: (T) ⇒ Boolean): LeftistHeap[T, HC]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (T) ⇒ Boolean): Boolean

def filter(p: (T) ⇒ Boolean): LeftistHeap[T, HC]

def filterNot(p: (T) ⇒ Boolean): LeftistHeap[T, HC]

def find(p: (T) ⇒ Boolean): Option[T]

def findMinOption: Option[T]

def flatItMap(f: (T) ⇒ Iterator[T], stop: (LeftistHeap[T, HC]) ⇒ Boolean): LeftistHeap[T, HC]

Apply a function f to all elements in this heap.

def flatItMapIter(f: (T) ⇒ Iterator[T], stop: (LeftistHeap[T, HC]) ⇒ Boolean): LeftistHeap[T, HC]

Apply a function f to all elements in this heap.

def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

def foldRight[B](z: B)(op: (T, B) ⇒ B): B

def forall(p: (T) ⇒ Boolean): Boolean

def foreach[U](f: (T) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Iterable[B]]

final def getClass(): Class[_]

def groupBy[K](f: (T) ⇒ K): Map[K, LeftistHeap[T, HC]]

def grouped(size: Int): Iterator[LeftistHeap[T, HC]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

def init: LeftistHeap[T, HC]

def inits: Iterator[LeftistHeap[T, HC]]

def insertIt(elements: Iterator[T]): LeftistHeap[T, HC]

Add multiple elements to this heap object

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[T]

def last: T

def lastOption: Option[T]

def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

def max[B >: T](implicit cmp: Ordering[B]): T

def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def min[B >: T](implicit cmp: Ordering[B]): T

def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[T, LeftistHeap[T, HC]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[T]

def parCombiner: Combiner[T, ParIterable[T]]

def partition(p: (T) ⇒ Boolean): (LeftistHeap[T, HC], LeftistHeap[T, HC])

def product[B >: T](implicit num: Numeric[B]): B

def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: T](op: (B, T) ⇒ B): B

def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: T](op: (T, B) ⇒ B): B

def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

def repr: LeftistHeap[T, HC]

def reversed: List[T]

def sameElements[B >: T](that: GenIterable[B]): Boolean

def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

def seq: Iterable[T]

def size: Int

def slice(from: Int, until: Int): LeftistHeap[T, HC]

def sliding(size: Int, step: Int): Iterator[LeftistHeap[T, HC]]

def sliding(size: Int): Iterator[LeftistHeap[T, HC]]

def sortedIterator: Iterator[T]

def span(p: (T) ⇒ Boolean): (LeftistHeap[T, HC], LeftistHeap[T, HC])

def splitAt(n: Int): (LeftistHeap[T, HC], LeftistHeap[T, HC])

def stringPrefix: String

def sum[B >: T](implicit num: Numeric[B]): B

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

def tail: LeftistHeap[T, HC]

def tails: Iterator[LeftistHeap[T, HC]]

def take(n: Int): LeftistHeap[T, HC]

def takeRight(n: Int): LeftistHeap[T, HC]

def takeWhile(p: (T) ⇒ Boolean): LeftistHeap[T, HC]

def thisCollection: Iterable[T]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: T]: Buffer[B]

def toCollection(repr: LeftistHeap[T, HC]): Iterable[T]

def toIndexedSeq: IndexedSeq[T]

def toIterable: Iterable[T]

def toIterator: Iterator[T]

def toList: List[T]

def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

def toSeq: Seq[T]

def toSet[B >: T]: Set[B]

def toStream: Stream[T]

def toString(): String

def toTraversable: Traversable[T]

def toVector: Vector[T]

def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unsortedIterator: Iterator[T]

def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def view(from: Int, until: Int): IterableView[T, LeftistHeap[T, HC]]

def view: IterableView[T, LeftistHeap[T, HC]]

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, LeftistHeap[T, HC]]

def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[LeftistHeap[T, HC], (A1, B), That]): That

def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[LeftistHeap[T, HC], (A1, B), That]): That

def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[LeftistHeap[T, HC], (A1, Int), That]): That

def finalize(): Unit