Packages

object Heap extends HeapInstances

Source
Heap.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Heap
  2. HeapInstances
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Forest[A] = Stream[Tree[Ranked[A]]]
  2. type ForestZipper[A] = (Forest[A], Forest[A])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def apply[A](sz: Int, leq: (A, A) ⇒ Boolean, t: Tree[Ranked[A]]): Heap[A]
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. def fromCodata[F[_], A](as: F[A])(implicit arg0: Foldable[F], arg1: Order[A]): Heap[A]
  11. def fromData[F[_], A](as: F[A])(implicit arg0: Foldable[F], arg1: Order[A]): Heap[A]
  12. def fromDataWith[F[_], A](f: (A, A) ⇒ Boolean, as: F[A])(implicit arg0: Foldable[F]): Heap[A]
  13. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. implicit def heapEqual[A](implicit arg0: Equal[A]): Equal[Heap[A]]
    Definition Classes
    HeapInstances
  16. implicit val heapInstance: Foldable[Heap] with FromFoldr[Heap]
    Definition Classes
    HeapInstances
  17. implicit def heapMonoid[A]: Monoid[Heap[A]]
    Definition Classes
    HeapInstances
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  21. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  22. def replicate[A](a: A, i: Int)(implicit arg0: Order[A]): Heap[A]

    Create a heap consisting of multiple copies of the same value.

    Create a heap consisting of multiple copies of the same value. O(log n)

  23. def singleton[A](a: A)(implicit arg0: Order[A]): Heap[A]

    A heap with one element.

  24. def sort[F[_], A](xs: F[A])(implicit arg0: Foldable[F], arg1: Order[A]): List[A]

    Heap sort

  25. def sortWith[F[_], A](f: (A, A) ⇒ Boolean, xs: F[A])(implicit arg0: Foldable[F]): List[A]

    Heap sort

  26. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  27. def toString(): String
    Definition Classes
    AnyRef → Any
  28. def unapply[A](h: Heap[A]): Option[(Int, (A, A) ⇒ Boolean, Tree[Ranked[A]])]
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  32. object Empty

    The empty heap

Inherited from HeapInstances

Inherited from AnyRef

Inherited from Any

Ungrouped