breeze/breeze.collection.immutable/BinomialHeap

BinomialHeap

class BinomialHeap[T](implicit ord: Ordering[T]) extends Iterable[T] with IterableOps[T, [A] =>> Iterable[A], BinomialHeap[T]] with StrictOptimizedIterableOps[T, [A] =>> Iterable[A], BinomialHeap[T]] with Serializable

From Okasaki's Functional Data Structures. Represents a functional heap

Companion
object
trait Serializable
trait StrictOptimizedIterableOps[T, [A] =>> Iterable[A], BinomialHeap[T]]
trait Iterable[T]
trait IterableFactoryDefaults[T, [A] =>> Iterable[A]]
trait IterableOps[T, [A] =>> Iterable[A], BinomialHeap[T]]
trait IterableOnceOps[T, [A] =>> Iterable[A], BinomialHeap[T]]
trait IterableOnce[T]
class Object
trait Matchable
class Any

Value members

Concrete methods

def +(x: T): BinomialHeap[T]
def ++(other: BinomialHeap[T]): BinomialHeap[T]
def ++(that: IterableOnce[T]): BinomialHeap[T]
def collect[B](pf: PartialFunction[T, B])(implicit ev: Ordering[B]): BinomialHeap[B]
def concat(that: IterableOnce[T]): BinomialHeap[T]
override def empty: BinomialHeap[T]
Definition Classes
IterableFactoryDefaults -> IterableOps
def flatMap[B](f: T => IterableOnce[B])(implicit ev: Ordering[B]): BinomialHeap[B]
override def fromSpecific(coll: IterableOnce[T]): BinomialHeap[T]
Definition Classes
IterableFactoryDefaults -> IterableOps
def iterator: Iterator[T]
def map[B](f: T => B)(implicit ev: Ordering[B]): BinomialHeap[B]
def min: T
override def newSpecificBuilder: Builder[T, BinomialHeap[T]]
Definition Classes
IterableFactoryDefaults -> IterableOps

Inherited methods

@inline
final def ++[B >: T](suffix: IterableOnce[B]): Iterable[B]
Inherited from
IterableOps
@inline
final def addString(b: StringBuilder): StringBuilder
Inherited from
IterableOnceOps
@inline
final def addString(b: StringBuilder, sep: String): StringBuilder
Inherited from
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Inherited from
IterableOnceOps
override def collect[B](pf: PartialFunction[T, B]): Iterable[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
Inherited from
IterableOnceOps
def concat[B >: T](suffix: IterableOnce[B]): Iterable[B]
Inherited from
IterableOps
def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: T](xs: Array[B], start: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: T](xs: Array[B]): Int
Inherited from
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
Inherited from
IterableOnceOps
def count(p: T => Boolean): Int
Inherited from
IterableOnceOps
def drop(n: Int): BinomialHeap[T]
Inherited from
IterableOps
override def dropRight(n: Int): BinomialHeap[T]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def dropWhile(p: T => Boolean): BinomialHeap[T]
Inherited from
IterableOps
def exists(p: T => Boolean): Boolean
Inherited from
IterableOnceOps
override def filter(pred: T => Boolean): BinomialHeap[T]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def filterNot(pred: T => Boolean): BinomialHeap[T]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def find(p: T => Boolean): Option[T]
Inherited from
IterableOnceOps
override def flatMap[B](f: T => IterableOnce[B]): Iterable[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def flatten[B](implicit toIterableOnce: T => IterableOnce[B]): Iterable[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1
Inherited from
IterableOnceOps
def foldLeft[B](z: B)(op: (B, T) => B): B
Inherited from
IterableOnceOps
def foldRight[B](z: B)(op: (T, B) => B): B
Inherited from
IterableOnceOps
def forall(p: T => Boolean): Boolean
Inherited from
IterableOnceOps
def foreach[U](f: T => U): Unit
Inherited from
IterableOnceOps
def groupBy[K](f: T => K): Map[K, BinomialHeap[T]]
Inherited from
IterableOps
def groupMap[K, B](key: T => K)(f: T => B): Map[K, Iterable[B]]
Inherited from
IterableOps
def groupMapReduce[K, B](key: T => K)(f: T => B)(reduce: (B, B) => B): Map[K, B]
Inherited from
IterableOps
def grouped(size: Int): Iterator[BinomialHeap[T]]
Inherited from
IterableOps
def head: T
Inherited from
IterableOps
def headOption: Option[T]
Inherited from
IterableOps
def init: BinomialHeap[T]
Inherited from
IterableOps
def inits: Iterator[BinomialHeap[T]]
Inherited from
IterableOps
def isEmpty: Boolean
Inherited from
IterableOnceOps
override def isTraversableAgain: Boolean
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def iterableFactory: IterableFactory[[A] =>> Iterable[A]]
Inherited from
Iterable
def knownSize: Int
Inherited from
IterableOnce
def last: T
Inherited from
IterableOps
def lastOption: Option[T]
Inherited from
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[T, B, BinomialHeap[T]]
Inherited from
Iterable
override def map[B](f: T => B): Iterable[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def max[B >: T](implicit ord: Ordering[B]): T
Inherited from
IterableOnceOps
def maxBy[B](f: T => B)(implicit cmp: Ordering[B]): T
Inherited from
IterableOnceOps
def maxByOption[B](f: T => B)(implicit cmp: Ordering[B]): Option[T]
Inherited from
IterableOnceOps
def maxOption[B >: T](implicit ord: Ordering[B]): Option[T]
Inherited from
IterableOnceOps
def min[B >: T](implicit ord: Ordering[B]): T
Inherited from
IterableOnceOps
def minBy[B](f: T => B)(implicit cmp: Ordering[B]): T
Inherited from
IterableOnceOps
def minByOption[B](f: T => B)(implicit cmp: Ordering[B]): Option[T]
Inherited from
IterableOnceOps
def minOption[B >: T](implicit ord: Ordering[B]): Option[T]
Inherited from
IterableOnceOps
@inline
final def mkString: String
Inherited from
IterableOnceOps
@inline
final def mkString(sep: String): String
Inherited from
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String
Inherited from
IterableOnceOps
@deprecatedOverriding(message = "nonEmpty is defined as !isEmpty; override isEmpty instead", since = "2.13.0")
def nonEmpty: Boolean
Inherited from
IterableOnceOps
override def partition(p: T => Boolean): (BinomialHeap[T], BinomialHeap[T])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def partitionMap[A1, A2](f: T => Either[A1, A2]): (Iterable[A1], Iterable[A2])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def product[B >: T](implicit num: Numeric[B]): B
Inherited from
IterableOnceOps
def reduce[B >: T](op: (B, B) => B): B
Inherited from
IterableOnceOps
def reduceLeft[B >: T](op: (B, T) => B): B
Inherited from
IterableOnceOps
def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
Inherited from
IterableOnceOps
def reduceOption[B >: T](op: (B, B) => B): Option[B]
Inherited from
IterableOnceOps
def reduceRight[B >: T](op: (T, B) => B): B
Inherited from
IterableOnceOps
def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
Inherited from
IterableOnceOps
protected def reversed: Iterable[T]
Inherited from
IterableOnceOps
def scan[B >: T](z: B)(op: (B, B) => B): Iterable[B]
Inherited from
IterableOps
override def scanLeft[B](z: B)(op: (B, T) => B): Iterable[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def scanRight[B](z: B)(op: (T, B) => B): Iterable[B]
Inherited from
IterableOps
def sizeCompare(that: Iterable[_]): Int
Inherited from
IterableOps
def sizeCompare(otherSize: Int): Int
Inherited from
IterableOps
@inline
final def sizeIs: SizeCompareOps
Inherited from
IterableOps
def slice(from: Int, until: Int): BinomialHeap[T]
Inherited from
IterableOps
def sliding(size: Int, step: Int): Iterator[BinomialHeap[T]]
Inherited from
IterableOps
def sliding(size: Int): Iterator[BinomialHeap[T]]
Inherited from
IterableOps
override def span(p: T => Boolean): (BinomialHeap[T], BinomialHeap[T])
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def splitAt(n: Int): (BinomialHeap[T], BinomialHeap[T])
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
Inherited from
IterableOnce
def sum[B >: T](implicit num: Numeric[B]): B
Inherited from
IterableOnceOps
def tail: BinomialHeap[T]
Inherited from
IterableOps
def tails: Iterator[BinomialHeap[T]]
Inherited from
IterableOps
def take(n: Int): BinomialHeap[T]
Inherited from
IterableOps
override def takeRight(n: Int): BinomialHeap[T]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def takeWhile(p: T => Boolean): BinomialHeap[T]
Inherited from
IterableOps
override def tapEach[U](f: T => U): BinomialHeap[T]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def to[C1](factory: Factory[T, C1]): C1
Inherited from
IterableOnceOps
def toArray[B >: T](implicit ClassTag[B]): Array[B]
Inherited from
IterableOnceOps
@inline
final def toBuffer[B >: T]: Buffer[B]
Inherited from
IterableOnceOps
def toIndexedSeq: IndexedSeq[T]
Inherited from
IterableOnceOps
final def toIterable: BinomialHeap[T]
Inherited from
Iterable
def toList: List[T]
Inherited from
IterableOnceOps
def toMap[K, V](implicit ev: T <:< (K, V)): Map[K, V]
Inherited from
IterableOnceOps
def toSeq: Seq[T]
Inherited from
IterableOnceOps
def toSet[B >: T]: Set[B]
Inherited from
IterableOnceOps
override def toString(): String
Definition Classes
Iterable -> Any
Inherited from
Iterable
def toVector: Vector[T]
Inherited from
IterableOnceOps
def transpose[B](implicit asIterable: T => Iterable[B]): Iterable[Iterable[B]]
Inherited from
IterableOps
override def unzip[A1, A2](implicit asPair: T => (A1, A2)): (Iterable[A1], Iterable[A2])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def unzip3[A1, A2, A3](implicit asTriple: T => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def view: View[T]
Inherited from
IterableOps
def withFilter(p: T => Boolean): WithFilter[T, [A] =>> Iterable[A]]
Inherited from
IterableOps
override def zip[B](that: IterableOnce[B]): Iterable[(T, B)]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def zipAll[A1 >: T, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
Inherited from
IterableOps
override def zipWithIndex: Iterable[(T, Int)]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps

Deprecated and Inherited methods

@deprecated(message = "Use ++ instead of ++: for collections of type Iterable", since = "2.13.0")
def ++:[B >: T](that: IterableOnce[B]): Iterable[B]
Deprecated
[Since version 2.13.0] Use ++ instead of ++: for collections of type Iterable
Inherited from
IterableOps
@inline @deprecated(message = "Use foldLeft instead of /:", since = "2.13.0")
final def /:[B](z: B)(op: (B, T) => B): B
Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from
IterableOnceOps
@inline @deprecated(message = "Use foldRight instead of :\\", since = "2.13.0")
final def :\[B](z: B)(op: (T, B) => B): B
Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from
IterableOnceOps
@deprecated(message = "`aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.", since = "2.13.0")
def aggregate[B](z: => B)(seqop: (B, T) => B, combop: (B, B) => B): B
Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from
IterableOnceOps
@inline @deprecatedOverriding(message = "Use iterableFactory instead", since = "2.13.0") @deprecated(message = "Use iterableFactory instead", since = "2.13.0")
def companion: IterableFactory[[A] =>> Iterable[A]]
Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from
IterableOps
@inline @deprecated(message = "Use `dest ++= coll` instead", since = "2.13.0")
final def copyToBuffer[B >: T](dest: Buffer[B]): Unit
Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from
IterableOnceOps
@deprecated(message = "Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)", since = "2.13.0")
def hasDefiniteSize: Boolean
Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from
IterableOnceOps
@deprecated(message = "Use coll instead of repr in a collection implementation, use the collection value itself from the outside", since = "2.13.0")
final def repr: BinomialHeap[T]
Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from
IterableOps
@deprecated(message = "Iterable.seq always returns the iterable itself", since = "2.13.0")
def seq: BinomialHeap[T]
Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from
Iterable
@inline @deprecated(message = "Use .iterator instead of .toIterator", since = "2.13.0")
final def toIterator: Iterator[T]
Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from
IterableOnceOps
@inline @deprecated(message = "Use .to(LazyList) instead of .toStream", since = "2.13.0")
final def toStream: Stream[T]
Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from
IterableOnceOps
@deprecated(message = "Use toIterable instead", since = "2.13.0")
final def toTraversable: Iterable[T]
Deprecated
[Since version 2.13.0] Use toIterable instead
Inherited from
IterableOps
@deprecated(message = "Use .view.slice(from, until) instead of .view(from, until)", since = "2.13.0")
def view(from: Int, until: Int): View[T]
Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Inherited from
IterableOps

Concrete fields

lazy val minOpt: Option[T]
override val size: Int