object Heap extends HeapInstances
- Source
- Heap.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Heap
- HeapInstances
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[A](sz: Int, leq: (A, A) => Boolean, t: Tree[Ranked[A]]): Heap[A]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def fromCodata[F[_], A](as: F[A])(implicit arg0: Foldable[F], arg1: Order[A]): Heap[A]
- def fromData[F[_], A](as: F[A])(implicit arg0: Foldable[F], arg1: Order[A]): Heap[A]
- def fromDataWith[F[_], A](f: (A, A) => Boolean, as: F[A])(implicit arg0: Foldable[F]): Heap[A]
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- implicit def healEqual[A](implicit arg0: Equal[A], H: Foldable[Heap]): Equal[Heap[A]]
- Definition Classes
- HeapInstances
- implicit val heapInstance: Foldable[Heap]
- Definition Classes
- HeapInstances
- implicit def heapMonoid[A]: Monoid[Heap[A]]
- Definition Classes
- HeapInstances
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- 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)
- def singleton[A](a: A)(implicit arg0: Order[A]): Heap[A]
A heap with one element.
- def sort[F[_], A](xs: F[A])(implicit arg0: Foldable[F], arg1: Order[A]): IList[A]
Heap sort
- def sortWith[F[_], A](f: (A, A) => Boolean, xs: F[A])(implicit arg0: Foldable[F]): IList[A]
Heap sort
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def unapply[A](h: Heap[A]): Option[(Int, (A, A) => Boolean, Tree[Ranked[A]])]
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- object Empty
The empty heap