scalaz

Heap

object Heap extends AnyRef

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Heap
  2. AnyRef
  3. Any
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. def != (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  2. def != (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  3. def ## (): Int

    Attributes
    final
    Definition Classes
    AnyRef → Any

  4. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  5. def == (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  6. object Empty extends AnyRef

    The empty heap

  7. def apply [A] (sz: Int, leq: (A, A) ⇒ Boolean, t: Tree[Ranked[A]]): Heap[A]

  8. def asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any

  9. def clone (): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  10. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  11. def equals (arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  12. def finalize (): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  13. def fromCodata [F[_], A] (as: F[A])(implicit arg0: Foldable[F], arg1: Order[A]): Heap[A]

  14. def fromData [F[_], A] (as: F[A])(implicit arg0: Foldable[F], arg1: Order[A]): Heap[A]

  15. def fromDataWith [F[_], A] (f: (A, A) ⇒ Boolean, as: F[A])(implicit arg0: Foldable[F]): Heap[A]

  16. def getClass (): java.lang.Class[_]

    Attributes
    final
    Definition Classes
    AnyRef → Any

  17. def hashCode (): Int

    Definition Classes
    AnyRef → Any

  18. implicit val heapFoldable : Foldable[Heap]

    Attributes
    implicit

  19. implicit def heapMonoid [A] : Monoid[Heap[A]]

    Attributes
    implicit

  20. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any

  21. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  22. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  23. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  24. 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)

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

    A heap with one element.

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

    Heap sort

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

    Heap sort

  28. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef

  29. def toString (): String

    Definition Classes
    AnyRef → Any

  30. def unapply [A] (h: Heap[A]): Option[(Int, (A, A) ⇒ Boolean, Tree[Ranked[A]])]

  31. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  33. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from AnyRef

Inherited from Any