Value Members

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

   Definition Classes

   Any

2.  final def ##: Int

   Definition Classes

   Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   Any

4.  def apply[A](xs: A*)(implicit arg0: Ordering[A]): Heap[A]

   Creates a Heap containing the given elements

   Creates a Heap containing the given elements

   Note

   Time Complexity: O(n)

5.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

6.  val branchingFactor: Int
7.  def empty[A](implicit arg0: Ordering[A]): Heap[A]

   Creates an empty Heap

   Creates an empty Heap

   Note

   Time Complexity: O(1)

8.  def fill[A](n: Int)(elem: => A)(implicit arg0: Ordering[A]): Heap[A]
   Note

   Time Complexity: O(n)

   See also

   scala.collection.SortedIterableFactory.fill

9.  def from[A](iterable: IterableOnce[A])(implicit arg0: Ordering[A]): Heap[A]

   Creates a Heap containing elements of the given iterable

   Creates a Heap containing elements of the given iterable

   Note

   Time Complexity: O(n)

10.  def getClass(): Class[_ <: AnyVal]

    Definition Classes

    AnyVal → Any

11.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

12.  def iterate[A](start: A, len: Int)(f: (A) => A)(implicit arg0: Ordering[A]): Heap[A]
    Note

    Time Complexity: O(n)

    See also

    scala.collection.SortedIterableFactory.iterate

13.  def newBuilder[A](implicit arg0: Ordering[A]): Builder[A, Heap[A]]

    Creates a Heap builder

14.  def tabulate[A](n: Int)(f: (Int) => A)(implicit arg0: Ordering[A]): Heap[A]
    Note

    Time Complexity: O(n)

    See also

    scala.collection.SortedIterableFactory.tabulate

15.  def toString(): String

    Definition Classes

    Any

16.  def unfold[A, S](init: S)(f: (S) => Option[(A, S)])(implicit arg0: Ordering[A]): Heap[A]
    Note

    Time Complexity: O(n)

    See also

    scala.collection.SortedIterableFactory.unfold