GenericHeap

org.encalmo.data.GenericHeap
sealed trait GenericHeap[N] extends Heap[N]

The (binary) heap data structure is an buffer-wrapping object that can be viewed as a nearly complete binary tree

Attributes

Graph
Supertypes
trait Heap[N]
class Object
trait Matchable
class Any
Known subtypes
class MaxHeap[N]
class MinHeap[N]
Self type

Members list

Value members

Concrete methods

final protected def bubbleDown(i: Int): Unit
final protected def bubbleUp(i: Int): Unit
final override def contains(elem: N): Boolean

Attributes

Definition Classes
final override def extract: Option[N]

Attributes

Definition Classes
final override def filter(p: N => Boolean): Iterator[N]

Attributes

Definition Classes
final def foreach[U](f: N => U): Unit
final override def head: N

Attributes

Definition Classes
final override def insert(elements: Iterator[N]): Unit

Attributes

Definition Classes
final override def insert(elements: Traversable[N]): Unit

Attributes

Definition Classes
final override def insert(elements: Heap[N]): Unit

Attributes

Definition Classes
final override def insert(elem: N): Unit

Attributes

Definition Classes
final def isEmpty: Boolean
final inline def left(i: Int): Int
final inline def parent(i: Int): Int
final override def refresh(elem: N): Unit

Attributes

Definition Classes
final override def remove(elements: Iterator[N]): Unit

Attributes

Definition Classes
final override def remove(elements: Traversable[N]): Unit

Attributes

Definition Classes
final override def remove(elements: Heap[N]): Unit

Attributes

Definition Classes
final override def remove(elem: N): Unit

Attributes

Definition Classes
final override def remove(p: N => Boolean): Unit

Attributes

Definition Classes
final override def removeNot(p: N => Boolean): Unit

Attributes

Definition Classes
final inline def right(i: Int): Int
final override def size: Int

Attributes

Definition Classes

Abstract fields

protected val A: Buffer[N]
protected val lower: (N, N) => Boolean