Class/Object

ap.basetypes

LeftistHeap

Related Docs: object LeftistHeap | package basetypes

Permalink

abstract class LeftistHeap[T, HC <: HeapCollector[T, HC]] extends Iterable[T] with IterableLike[T, LeftistHeap[T, HC]]

This class implements the leftist heap, see "Functional Data Structures" by Chris Okasaki

Linear Supertypes
Iterable[T], IterableLike[T, LeftistHeap[T, HC]], Equals, GenIterable[T], GenIterableLike[T, LeftistHeap[T, HC]], Traversable[T], GenTraversable[T], GenericTraversableTemplate[T, Iterable], TraversableLike[T, LeftistHeap[T, HC]], GenTraversableLike[T, LeftistHeap[T, HC]], Parallelizable[T, ParIterable[T]], TraversableOnce[T], GenTraversableOnce[T], FilterMonadic[T, LeftistHeap[T, HC]], HasNewBuilder[T, LeftistHeap[T, HC]], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LeftistHeap
  2. Iterable
  3. IterableLike
  4. Equals
  5. GenIterable
  6. GenIterableLike
  7. Traversable
  8. GenTraversable
  9. GenericTraversableTemplate
  10. TraversableLike
  11. GenTraversableLike
  12. Parallelizable
  13. TraversableOnce
  14. GenTraversableOnce
  15. FilterMonadic
  16. HasNewBuilder
  17. AnyRef
  18. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LeftistHeap()(implicit ord: Ordering[T])

    Permalink

Type Members

  1. type Self = LeftistHeap[T, HC]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def collector: HC

    Permalink

    Interface for collecting information about the elements stored in the heap

  2. abstract def deleteMin: LeftistHeap[T, HC]

    Permalink

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

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

    returns

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

  3. abstract def empty: LeftistHeap[T, HC]

    Permalink

    Construct an empty heap

    Construct an empty heap

    Attributes
    protected
  4. abstract def findMin: T

    Permalink

    returns

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

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

    Permalink

    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.

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

    Permalink

    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

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

    Permalink

    Add multiple elements to this heap object.

    Add multiple elements to this heap object. We keep this method protected, because otherwise one could use it to insert heaps that are sorted differently

    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[ap.basetypes]
  8. abstract def removeAll(element: T): LeftistHeap[T, HC]

    Permalink

    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

  9. abstract def rightHeight: Int

    Permalink

    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

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def +(el: T): LeftistHeap[T, HC]

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  7. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  8. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  9. def /:[B](z: B)(op: (B, T) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. def :\[B](z: B)(op: (T, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  11. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  12. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  15. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  17. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    IterableLike → Equals
  18. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  20. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  21. def companion: GenericCompanion[Iterable]

    Permalink
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  22. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  23. def copyToArray[B >: T](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  24. def copyToArray[B >: T](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def copyToBuffer[B >: T](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  26. def count(p: (T) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def drop(n: Int): LeftistHeap[T, HC]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  28. def dropRight(n: Int): LeftistHeap[T, HC]

    Permalink
    Definition Classes
    IterableLike
  29. def dropWhile(p: (T) ⇒ Boolean): LeftistHeap[T, HC]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  30. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  31. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  32. def exists(p: (T) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  33. def filter(p: (T) ⇒ Boolean): LeftistHeap[T, HC]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  34. def filterNot(p: (T) ⇒ Boolean): LeftistHeap[T, HC]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  35. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  36. def find(p: (T) ⇒ Boolean): Option[T]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  37. def findMinOption: Option[T]

    Permalink

    returns

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

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

    Permalink

    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.

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

    Permalink

    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.

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  41. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Iterable[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  42. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def foldRight[B](z: B)(op: (T, B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  45. def forall(p: (T) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  46. def foreach[U](f: (T) ⇒ U): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  47. def genericBuilder[B]: Builder[B, Iterable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  48. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  49. def groupBy[K](f: (T) ⇒ K): Map[K, LeftistHeap[T, HC]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def grouped(size: Int): Iterator[LeftistHeap[T, HC]]

    Permalink
    Definition Classes
    IterableLike
  51. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  52. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  53. def head: T

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  54. def headOption: Option[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def init: LeftistHeap[T, HC]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def inits: Iterator[LeftistHeap[T, HC]]

    Permalink
    Definition Classes
    TraversableLike
  57. def insertIt(elements: Iterator[T]): LeftistHeap[T, HC]

    Permalink

    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

  58. def isEmpty: Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  59. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  60. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  61. def iterator: Iterator[T]

    Permalink
    Definition Classes
    LeftistHeap → IterableLike → GenIterableLike
  62. def last: T

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def lastOption: Option[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  64. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  65. def max[B >: T](implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  66. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def min[B >: T](implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  70. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  73. def newBuilder: Builder[T, LeftistHeap[T, HC]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    LeftistHeap → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  74. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  76. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  77. def par: ParIterable[T]

    Permalink
    Definition Classes
    Parallelizable
  78. def parCombiner: Combiner[T, ParIterable[T]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  79. def partition(p: (T) ⇒ Boolean): (LeftistHeap[T, HC], LeftistHeap[T, HC])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  80. def product[B >: T](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  81. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. def reduceLeft[B >: T](op: (B, T) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  83. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def reduceRight[B >: T](op: (T, B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  86. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def repr: LeftistHeap[T, HC]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  88. def reversed: List[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  89. def sameElements[B >: T](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  90. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  91. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  92. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  93. def seq: Iterable[T]

    Permalink
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  94. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def slice(from: Int, until: Int): LeftistHeap[T, HC]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  96. def sliding(size: Int, step: Int): Iterator[LeftistHeap[T, HC]]

    Permalink
    Definition Classes
    IterableLike
  97. def sliding(size: Int): Iterator[LeftistHeap[T, HC]]

    Permalink
    Definition Classes
    IterableLike
  98. def sortedIterator: Iterator[T]

    Permalink

    returns

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def splitAt(n: Int): (LeftistHeap[T, HC], LeftistHeap[T, HC])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  101. def stringPrefix: String

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  102. def sum[B >: T](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  104. def tail: LeftistHeap[T, HC]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def tails: Iterator[LeftistHeap[T, HC]]

    Permalink
    Definition Classes
    TraversableLike
  106. def take(n: Int): LeftistHeap[T, HC]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  107. def takeRight(n: Int): LeftistHeap[T, HC]

    Permalink
    Definition Classes
    IterableLike
  108. def takeWhile(p: (T) ⇒ Boolean): LeftistHeap[T, HC]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  109. def thisCollection: Iterable[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  110. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  111. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def toBuffer[B >: T]: Buffer[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def toCollection(repr: LeftistHeap[T, HC]): Iterable[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  114. def toIndexedSeq: IndexedSeq[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def toIterable: Iterable[T]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  116. def toIterator: Iterator[T]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  117. def toList: List[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def toSeq: Seq[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def toSet[B >: T]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def toStream: Stream[T]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  122. def toString(): String

    Permalink
    Definition Classes
    LeftistHeap → TraversableLike → AnyRef → Any
  123. def toTraversable: Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  124. def toVector: Vector[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  126. def unsortedIterator: Iterator[T]

    Permalink

    returns

    an iterator that returns all elements of this heap

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

    Permalink
    Definition Classes
    GenericTraversableTemplate
  128. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  129. def view(from: Int, until: Int): IterableView[T, LeftistHeap[T, HC]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike
  130. def view: IterableView[T, LeftistHeap[T, HC]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike
  131. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  132. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  133. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  134. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, LeftistHeap[T, HC]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic
  135. def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[LeftistHeap[T, HC], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  136. def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[LeftistHeap[T, HC], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  137. def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[LeftistHeap[T, HC], (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

Inherited from Iterable[T]

Inherited from IterableLike[T, LeftistHeap[T, HC]]

Inherited from Equals

Inherited from GenIterable[T]

Inherited from GenIterableLike[T, LeftistHeap[T, HC]]

Inherited from Traversable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, Iterable]

Inherited from TraversableLike[T, LeftistHeap[T, HC]]

Inherited from GenTraversableLike[T, LeftistHeap[T, HC]]

Inherited from Parallelizable[T, ParIterable[T]]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from FilterMonadic[T, LeftistHeap[T, HC]]

Inherited from HasNewBuilder[T, LeftistHeap[T, HC]]

Inherited from AnyRef

Inherited from Any

Ungrouped