EmptyHeap

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. def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[LeftistHeap[T, HC], B, That]): That

   

   Definition Classes

   TraversableLike → GenTraversableLike

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

   

   Definition Classes

   TraversableLike

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

   

   Definition Classes

   TraversableLike

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

   

   Definition Classes

   TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

11. final def ==(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

12. def addString(b: StringBuilder): StringBuilder

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

16. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

17. def canEqual(that: Any): Boolean

    

    Definition Classes

    IterableLike → Equals

18. def clone(): AnyRef

    

    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

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableOnce

21. 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

22. def companion: GenericCompanion[Iterable]

    

    Definition Classes

    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

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

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

28. 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

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

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike

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

    

    Definition Classes

    IterableLike

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

32. def empty: LeftistHeap[T, HC]

    

    Construct an empty heap

    Construct an empty heap

    Attributes

    protected

    Definition Classes

    EmptyHeap → LeftistHeap

33. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

34. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

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

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

38. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

40. def findMin: Nothing

    
    returns

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

    Definition Classes

    EmptyHeap → LeftistHeap

41. def findMinOption: Option[T]

    
    returns

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

    Definition Classes

    LeftistHeap

42. 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

43. 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

44. 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

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

    

    Definition Classes

    TraversableLike → GenTraversableLike → FilterMonadic

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

    

    Definition Classes

    GenericTraversableTemplate

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    IterableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

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

    

    Definition Classes

    GenericTraversableTemplate

53. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    IterableLike

56. def hasDefiniteSize: Boolean

    

    Definition Classes

    TraversableLike → TraversableOnce → GenTraversableOnce

57. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

58. def head: T

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike

59. def headOption: Option[T]

    

    Definition Classes

    TraversableLike → GenTraversableLike

60. def init: LeftistHeap[T, HC]

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableLike

62. 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

63. 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[ap.basetypes]

    Definition Classes

    EmptyHeap → LeftistHeap

64. 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

65. def isEmpty: Boolean

    
    returns

    true iff this heap is empty

    Definition Classes

    EmptyHeap → LeftistHeap → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce

66. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

67. final def isTraversableAgain: Boolean

    

    Definition Classes

    TraversableLike → GenTraversableLike → GenTraversableOnce

68. def iterator: Iterator[T]

    

    Definition Classes

    LeftistHeap → IterableLike → GenIterableLike

69. def last: T

    

    Definition Classes

    TraversableLike → GenTraversableLike

70. def lastOption: Option[T]

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableLike → GenTraversableLike → FilterMonadic

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

76. def mkString: String

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

77. def mkString(sep: String): String

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

79. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

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

    

    Attributes

    protected[this]

    Definition Classes

    LeftistHeap → GenericTraversableTemplate → TraversableLike → HasNewBuilder

81. def nonEmpty: Boolean

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

82. final def notify(): Unit

    

    Definition Classes

    AnyRef

83. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

84. def par: ParIterable[T]

    

    Definition Classes

    Parallelizable

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

    

    Attributes

    protected[this]

    Definition Classes

    TraversableLike → Parallelizable

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    IterableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

94. 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

95. def repr: LeftistHeap[T, HC]

    

    Definition Classes

    TraversableLike → GenTraversableLike

96. def reversed: List[T]

    

    Attributes

    protected[this]

    Definition Classes

    TraversableOnce

97. 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

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

    

    Definition Classes

    IterableLike → GenIterableLike

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     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.

102. def seq: Iterable[T]

     

     Definition Classes

     Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

103. val size: Int

     
     returns

     the number of elements this heap holds

     Definition Classes

     EmptyHeap → GenTraversableLike → TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

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

     

     Definition Classes

     IterableLike

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

     

     Definition Classes

     IterableLike

107. def sortedIterator: Iterator[T]

     
     returns

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

     Definition Classes

     LeftistHeap

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

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableLike → GenTraversableLike

110. def stringPrefix: String

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     AnyRef

113. def tail: LeftistHeap[T, HC]

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableLike

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

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

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

     

     Definition Classes

     IterableLike

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

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

118. def thisCollection: Iterable[T]

     

     Attributes

     protected[this]

     Definition Classes

     IterableLike → TraversableLike

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

     

     Definition Classes

     TraversableLike → TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Attributes

     protected[this]

     Definition Classes

     IterableLike → TraversableLike

123. def toIndexedSeq: IndexedSeq[T]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

124. def toIterable: Iterable[T]

     

     Definition Classes

     IterableLike → TraversableOnce → GenTraversableOnce

125. def toIterator: Iterator[T]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableOnce

     Annotations

     @deprecatedOverriding( ... , "2.11.0" )

126. def toList: List[T]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

128. def toSeq: Seq[T]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

130. def toStream: Stream[T]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableOnce

131. def toString(): String

     

     Definition Classes

     LeftistHeap → TraversableLike → AnyRef → Any

132. def toTraversable: Traversable[T]

     

     Definition Classes

     TraversableLike → TraversableOnce → GenTraversableOnce

     Annotations

     @deprecatedOverriding( ... , "2.11.0" )

133. def toVector: Vector[T]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     GenericTraversableTemplate

     Annotations

     @migration

     Migration

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

135. def unsortedIterator: Iterator[T]

     
     returns

     an iterator that returns all elements of this heap

     Definition Classes

     LeftistHeap

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

     

     Definition Classes

     GenericTraversableTemplate

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

     

     Definition Classes

     GenericTraversableTemplate

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

     

     Definition Classes

     IterableLike → TraversableLike

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

     

     Definition Classes

     IterableLike → TraversableLike

140. final def wait(): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

142. final def wait(arg0: Long): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     TraversableLike → FilterMonadic

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

     

     Definition Classes

     IterableLike → GenIterableLike

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

     

     Definition Classes

     IterableLike → GenIterableLike

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

     

     Definition Classes

     IterableLike → GenIterableLike