Heap

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. object Empty

   The empty heap

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

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    HeapFunctions

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

    Definition Classes

    HeapFunctions

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

    Definition Classes

    HeapFunctions

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

    Definition Classes

    AnyRef → Any

15. def hashCode(): Int

    Definition Classes

    AnyRef → Any

16. implicit def heapEqual[A](implicit arg0: Equal[A]): Equal[Heap[A]]

    Definition Classes

    HeapInstances

17. implicit val heapInstance: Foldable[Heap] with FromFoldr[Heap]

    Definition Classes

    HeapInstances

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

    Definition Classes

    HeapInstances

19. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

21. final def notify(): Unit

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    HeapFunctions

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

    A heap with one element.

    A heap with one element.

    Definition Classes

    HeapFunctions

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

    Heap sort

    Heap sort

    Definition Classes

    HeapFunctions

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

    Heap sort

    Heap sort

    Definition Classes

    HeapFunctions

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

    Definition Classes

    AnyRef

28. def toString(): String

    Definition Classes

    AnyRef → Any

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

30. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )