object Heap extends HeapInstances with HeapFunctions
- Source
- Heap.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Heap
- HeapFunctions
- HeapInstances
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
-
type
Forest[A] = Stream[Tree[Ranked[A]]]
- Definition Classes
- HeapFunctions
-
type
ForestZipper[A] = (Forest[A], Forest[A])
- Definition Classes
- HeapFunctions
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[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.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]
- Definition Classes
- HeapFunctions
-
def
fromData[F[_], A](as: F[A])(implicit arg0: Foldable[F], arg1: Order[A]): Heap[A]
- Definition Classes
- HeapFunctions
-
def
fromDataWith[F[_], A](f: (A, A) ⇒ Boolean, as: F[A])(implicit arg0: Foldable[F]): Heap[A]
- Definition Classes
- HeapFunctions
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
implicit
def
heapEqual[A](implicit arg0: Equal[A]): Equal[Heap[A]]
- Definition Classes
- HeapInstances
-
implicit
val
heapInstance: Foldable[Heap] with FromFoldr[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
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
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
-
def
singleton[A](a: A)(implicit arg0: Order[A]): Heap[A]
A heap with one element.
A heap with one element.
- Definition Classes
- HeapFunctions
-
def
sort[F[_], A](xs: F[A])(implicit arg0: Foldable[F], arg1: Order[A]): List[A]
Heap sort
Heap sort
- Definition Classes
- HeapFunctions
-
def
sortWith[F[_], A](f: (A, A) ⇒ Boolean, xs: F[A])(implicit arg0: Foldable[F]): List[A]
Heap sort
Heap sort
- Definition Classes
- HeapFunctions
-
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( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
object
Empty
The empty heap
The empty heap
- Definition Classes
- HeapFunctions