Heap

Binary Heap

Normally, binary heaps are not common the functional environments since they implementationis based on mutable arrays. However, this implementation is purely functional, based on the VLADIMIR KOSTYUKOV paper.

It is important to note that we can, in fact, to create the Binary Heap in order O(n) from a List using the function heapify.

Linear Supertypes

AnyRef, Any

Abstract Value Members

abstract def getMin: Option[A]

Returns min value on the heap.
abstract def height: Int

Returns the height of the heap.
abstract def isEmpty: Boolean

Verfies if the heap is empty.
abstract def size: Int

Returns the size of the heap.

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def +(x: A)(implicit order: Order[A]): Heap[A]

Alias for add
def --(implicit order: Order[A]): Heap[A]

Alias for remove
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def add(x: A)(implicit order: Order[A]): Heap[A]

Insert a new element into the heap.
Insert a new element into the heap. Order O(log n)
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] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def heapify(a: List[A])(implicit order: Order[A]): Heap[A]

Build a heap using a list.
Build a heap using a list. Order O(n)
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 remove()(implicit order: Order[A]): Heap[A]

Remove the min element from the heap (the root).
Remove the min element from the heap (the root). Order O(log n)
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toList()(implicit order: Order[A]): List[A]

Returns a sorted list of the elements within the heap.
def toString(): String

Definition Classes
AnyRef → Any
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( ... )

Related Docs: object Heap | package dogs

sealed abstract class Heap[A] extends AnyRef

Abstract Value Members

abstract def getMin: Option[A]

abstract def height: Int

abstract def isEmpty: Boolean

abstract def size: Int

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(x: A)(implicit order: Order[A]): Heap[A]

def --(implicit order: Order[A]): Heap[A]

final def ==(arg0: Any): Boolean

def add(x: A)(implicit order: Order[A]): Heap[A]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def heapify(a: List[A])(implicit order: Order[A]): Heap[A]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def remove()(implicit order: Order[A]): Heap[A]

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

def toList()(implicit order: Order[A]): List[A]

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped