Packages

c

ap.basetypes

EmptyHeap

class EmptyHeap[T, HC <: HeapCollector[T, HC]] extends LeftistHeap[T, HC]

Use this class to construct new heaps

Linear Supertypes
LeftistHeap[T, HC], Iterable[T], IterableFactoryDefaults[T, Iterable], IterableOps[T, Iterable, Iterable[T]], IterableOnceOps[T, Iterable, Iterable[T]], IterableOnce[T], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EmptyHeap
  2. LeftistHeap
  3. Iterable
  4. IterableFactoryDefaults
  5. IterableOps
  6. IterableOnceOps
  7. IterableOnce
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new EmptyHeap(collector: HC)(implicit ord: Ordering[T])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def +(el: T): LeftistHeap[T, HC]
    Definition Classes
    LeftistHeap
  4. def ++(els: Iterable[T]): LeftistHeap[T, HC]
    Definition Classes
    LeftistHeap
  5. def ++(els: Iterator[T]): LeftistHeap[T, HC]
    Definition Classes
    LeftistHeap
  6. final def ++[B >: T](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  7. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. final def addString(b: StringBuilder): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  9. final def addString(b: StringBuilder, sep: String): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  10. def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
    Definition Classes
    IterableOnceOps
  11. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  12. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  13. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  14. final def coll: EmptyHeap.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  15. def collect[B](pf: PartialFunction[T, B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  16. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    IterableOnceOps
  17. val collector: HC

    Interface for collecting information about the elements stored in the heap

    Interface for collecting information about the elements stored in the heap

    Definition Classes
    EmptyHeap → LeftistHeap
  18. def concat[B >: T](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
  19. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  20. def copyToArray[B >: T](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  21. def copyToArray[B >: T](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  22. def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  23. def count(p: (T) => Boolean): Int
    Definition Classes
    IterableOnceOps
  24. def deleteMin: LeftistHeap[T, HC]

    Remove the minimum element from this heap

    Remove the minimum element from this heap

    returns

    a heap that contains all elements of this heap except for the minimum element

    Definition Classes
    EmptyHeap → LeftistHeap
  25. def drop(n: Int): Iterable[T]
    Definition Classes
    IterableOps → IterableOnceOps
  26. def dropRight(n: Int): Iterable[T]
    Definition Classes
    IterableOps
  27. def dropWhile(p: (T) => Boolean): Iterable[T]
    Definition Classes
    IterableOps → IterableOnceOps
  28. def empty: Iterable[T]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  29. def emptyHeap: LeftistHeap[T, HC]

    Construct an empty heap

    Construct an empty heap

    Attributes
    protected
    Definition Classes
    EmptyHeap → LeftistHeap
  30. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  32. def exists(p: (T) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  33. def filter(pred: (T) => Boolean): Iterable[T]
    Definition Classes
    IterableOps → IterableOnceOps
  34. def filterNot(pred: (T) => Boolean): Iterable[T]
    Definition Classes
    IterableOps → IterableOnceOps
  35. def find(p: (T) => Boolean): Option[T]
    Definition Classes
    IterableOnceOps
  36. def findMin: Nothing

    returns

    the minimum element of this heap, or null iff this heap is empty (isEmpty()==true)

    Definition Classes
    EmptyHeap → LeftistHeap
  37. def findMinOption: Option[T]

    returns

    the minimum element of this heap, or None> iff this heap is empty (isEmpty()==true)

    Definition Classes
    LeftistHeap
  38. def flatItMap(f: (T) => Iterator[T], stop: (LeftistHeap[T, HC]) => Boolean): LeftistHeap[T, HC]

    Apply a function f to all elements in this heap.

    Apply a function f to all elements in this heap. The heap traversal is skipped for a subheap if the function stop applied to this subheap returns true. The function f can return null to signal that a data element has not changed.

    Definition Classes
    LeftistHeap
  39. def flatItMapIter(f: (T) => Iterator[T], stop: (LeftistHeap[T, HC]) => Boolean): LeftistHeap[T, HC]

    Apply a function f to all elements in this heap.

    Apply a function f to all elements in this heap. The heap traversal is skipped for a subheap if the function stop applied to this subheap returns true. The function f can return null to signal that a data element has not changed.

    Definition Classes
    LeftistHeap
  40. def flatItMapRec(f: (T) => Iterator[T], stop: (LeftistHeap[T, HC]) => Boolean): LeftistHeap[T, HC]

    Apply a function f to all elements in this heap.

    Apply a function f to all elements in this heap. The heap traversal is skipped for a subheap if the function stop applied to this subheap returns true. The function f can return null to signal that a data element has not changed.

    Definition Classes
    EmptyHeap → LeftistHeap
  41. def flatMap[B](f: (T) => IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  42. def flatten[B](implicit asIterable: (T) => IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  43. def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  44. def foldLeft[B](z: B)(op: (B, T) => B): B
    Definition Classes
    IterableOnceOps
  45. def foldRight[B](z: B)(op: (T, B) => B): B
    Definition Classes
    IterableOnceOps
  46. def forall(p: (T) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  47. def foreach[U](f: (T) => U): Unit
    Definition Classes
    IterableOnceOps
  48. def fromSpecific(coll: IterableOnce[T]): Iterable[T]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  49. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  50. def groupBy[K](f: (T) => K): Map[K, Iterable[T]]
    Definition Classes
    IterableOps
  51. def groupMap[K, B](key: (T) => K)(f: (T) => B): Map[K, Iterable[B]]
    Definition Classes
    IterableOps
  52. def groupMapReduce[K, B](key: (T) => K)(f: (T) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  53. def grouped(size: Int): Iterator[Iterable[T]]
    Definition Classes
    IterableOps
  54. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  55. def head: T
    Definition Classes
    IterableOps
  56. def headOption: Option[T]
    Definition Classes
    IterableOps
  57. def init: Iterable[T]
    Definition Classes
    IterableOps
  58. def inits: Iterator[Iterable[T]]
    Definition Classes
    IterableOps
  59. def insert(element: T): LeftistHeap[T, HC]

    Add an element to this heap object

    Add an element to this heap object

    element

    The element to be added

    returns

    a heap that contains all elements of this heap, and additionally element

    Definition Classes
    EmptyHeap → LeftistHeap
  60. def insertHeap(h: LeftistHeap[T, HC]): LeftistHeap[T, HC]

    Add multiple elements to this heap object

    Add multiple elements to this heap object

    h

    a heap containing the elements to be added

    returns

    a heap that contains all elements of this heap, and additionally all objects from h

    Attributes
    protected[basetypes]
    Definition Classes
    EmptyHeap → LeftistHeap
  61. def insertIt(elements: Iterator[T]): LeftistHeap[T, HC]

    Add multiple elements to this heap object

    Add multiple elements to this heap object

    elements

    the elements to be added

    returns

    a heap that contains all elements of this heap, and additionally all objects from elements

    Definition Classes
    LeftistHeap
  62. def isEmpty: Boolean

    returns

    true iff this heap is empty

    Definition Classes
    EmptyHeap → LeftistHeap → IterableOnceOps
  63. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  64. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  65. def iterableFactory: IterableFactory[Iterable]
    Definition Classes
    Iterable → IterableOps
  66. def iterator: Iterator[T]
    Definition Classes
    LeftistHeap → IterableOnce
  67. def knownSize: Int
    Definition Classes
    IterableOnce
  68. def last: T
    Definition Classes
    IterableOps
  69. def lastOption: Option[T]
    Definition Classes
    IterableOps
  70. def lazyZip[B](that: Iterable[B]): LazyZip2[T, B, EmptyHeap.this.type]
    Definition Classes
    Iterable
  71. def map[B](f: (T) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  72. def max[B >: T](implicit ord: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  73. def maxBy[B](f: (T) => B)(implicit ord: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  74. def maxByOption[B](f: (T) => B)(implicit ord: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  75. def maxOption[B >: T](implicit ord: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  76. def min[B >: T](implicit ord: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  77. def minBy[B](f: (T) => B)(implicit ord: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  78. def minByOption[B](f: (T) => B)(implicit ord: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  79. def minOption[B >: T](implicit ord: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  80. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  81. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  82. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  83. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  84. def newSpecificBuilder: Builder[T, Iterable[T]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  85. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  86. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  87. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  88. def partition(p: (T) => Boolean): (Iterable[T], Iterable[T])
    Definition Classes
    IterableOps
  89. def partitionMap[A1, A2](f: (T) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  90. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  91. def reduce[B >: T](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  92. def reduceLeft[B >: T](op: (B, T) => B): B
    Definition Classes
    IterableOnceOps
  93. def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
    Definition Classes
    IterableOnceOps
  94. def reduceOption[B >: T](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  95. def reduceRight[B >: T](op: (T, B) => B): B
    Definition Classes
    IterableOnceOps
  96. def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  97. def removeAll(element: T): LeftistHeap[T, HC]

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

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

    returns

    heap that has all occurrences of element removed

    Definition Classes
    EmptyHeap → LeftistHeap
  98. def reversed: Iterable[T]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  99. val rightHeight: Int

    Length of the right spine, i.e.

    Length of the right spine, i.e. the length of the path from the root to rightmost leaf

    Definition Classes
    EmptyHeap → LeftistHeap
  100. def scan[B >: T](z: B)(op: (B, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  101. def scanLeft[B](z: B)(op: (B, T) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  102. def scanRight[B](z: B)(op: (T, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  103. val size: Int

    returns

    the number of elements this heap holds

    Definition Classes
    EmptyHeap → IterableOnceOps
  104. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  105. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  106. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  107. def slice(from: Int, until: Int): Iterable[T]
    Definition Classes
    IterableOps → IterableOnceOps
  108. def sliding(size: Int, step: Int): Iterator[Iterable[T]]
    Definition Classes
    IterableOps
  109. def sliding(size: Int): Iterator[Iterable[T]]
    Definition Classes
    IterableOps
  110. def sortedIterator: Iterator[T]

    returns

    an iterator that returns all elements of this heap in increasing order

    Definition Classes
    LeftistHeap
  111. def span(p: (T) => Boolean): (Iterable[T], Iterable[T])
    Definition Classes
    IterableOps → IterableOnceOps
  112. def splitAt(n: Int): (Iterable[T], Iterable[T])
    Definition Classes
    IterableOps → IterableOnceOps
  113. def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
    Definition Classes
    IterableOnce
  114. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
    Annotations
    @deprecatedOverriding()
  115. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  116. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  117. def tail: Iterable[T]
    Definition Classes
    IterableOps
  118. def tails: Iterator[Iterable[T]]
    Definition Classes
    IterableOps
  119. def take(n: Int): Iterable[T]
    Definition Classes
    IterableOps → IterableOnceOps
  120. def takeRight(n: Int): Iterable[T]
    Definition Classes
    IterableOps
  121. def takeWhile(p: (T) => Boolean): Iterable[T]
    Definition Classes
    IterableOps → IterableOnceOps
  122. def tapEach[U](f: (T) => U): Iterable[T]
    Definition Classes
    IterableOps → IterableOnceOps
  123. def to[C1](factory: Factory[T, C1]): C1
    Definition Classes
    IterableOnceOps
  124. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  125. final def toBuffer[B >: T]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  126. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    IterableOnceOps
  127. def toList: List[T]
    Definition Classes
    IterableOnceOps
  128. def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  129. def toSeq: Seq[T]
    Definition Classes
    IterableOnceOps
  130. def toSet[B >: T]: Set[B]
    Definition Classes
    IterableOnceOps
  131. def toString(): String
    Definition Classes
    LeftistHeap → Iterable → AnyRef → Any
  132. def toVector: Vector[T]
    Definition Classes
    IterableOnceOps
  133. def transpose[B](implicit asIterable: (T) => Iterable[B]): Iterable[Iterable[B]]
    Definition Classes
    IterableOps
  134. def unsortedIterator: Iterator[T]

    returns

    an iterator that returns all elements of this heap

    Definition Classes
    LeftistHeap
  135. def unzip[A1, A2](implicit asPair: (T) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  136. def unzip3[A1, A2, A3](implicit asTriple: (T) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    IterableOps
  137. def view: View[T]
    Definition Classes
    IterableOps
  138. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  139. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  140. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  141. def withFilter(p: (T) => Boolean): WithFilter[T, Iterable]
    Definition Classes
    IterableOps
  142. def zip[B](that: IterableOnce[B]): Iterable[(T, B)]
    Definition Classes
    IterableOps
  143. def zipAll[A1 >: T, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Definition Classes
    IterableOps
  144. def zipWithIndex: Iterable[(T, Int)]
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

  1. def ++:[B >: T](that: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  2. final def /:[B](z: B)(op: (B, T) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  3. final def :\[B](z: B)(op: (T, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  4. def aggregate[B](z: => B)(seqop: (B, T) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) For sequential collections, prefer foldLeft(z)(seqop). For parallel collections, use ParIterableLike#aggregate.

  5. def companion: IterableFactory[Iterable]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  6. final def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  7. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

    (Since version 9)

  8. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  9. final def repr: Iterable[T]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  10. def seq: EmptyHeap.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  11. final def toIterable: EmptyHeap.this.type
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  12. final def toIterator: Iterator[T]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  13. final def toStream: Stream[T]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  14. final def toTraversable: Traversable[T]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  15. def view(from: Int, until: Int): View[T]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from LeftistHeap[T, HC]

Inherited from Iterable[T]

Inherited from IterableFactoryDefaults[T, Iterable]

Inherited from IterableOps[T, Iterable, Iterable[T]]

Inherited from IterableOnceOps[T, Iterable, Iterable[T]]

Inherited from IterableOnce[T]

Inherited from AnyRef

Inherited from Any

Ungrouped