Chain

stdx.collections.Chain
See theChain companion object
trait Chain[C <: ([_] =>> AnyRef)] extends Foldable[C], OrderedFoldable[C]

Attributes

Companion
object
Experimental
true
Graph
Supertypes
trait OrderedFoldable[C]
trait Foldable[C]
class Object
trait Matchable
class Any
Known subtypes

Members list

Value members

Abstract methods

def empty[T](using PartialOrder[T]): C[T]

Extensions

Extensions

extension [T](c: C[T])
def excl(t: T): C[T]
def findIncomparable(t: T): C[T]
def maxBefore(t: T): Maybe[T]
def tryIncl(t: T): Maybe[C[T]]
def union[D[_]](d: D[T])(using Foldable[D]): Maybe[C[T]]

Inherited and Abstract extensions

extension [T](c: C[T])
def asIndexedSeq: IndexedSeq[T]

Attributes

Inherited from:
Foldable
def contains(t: T): Boolean

Attributes

Inherited from:
Foldable
def exists(predicate: T => Boolean): Boolean

Attributes

Inherited from:
Foldable
def filter(predicate: T => Boolean): C[T]

Attributes

Inherited from:
Foldable
def foldL[U](acc: U)(op: (U, T) => U): U

Steps through a collection, processing all elements into type U Note: Fold has no defined ordering, stepping through elements in whatever fashion makes sense for the collection

Steps through a collection, processing all elements into type U Note: Fold has no defined ordering, stepping through elements in whatever fashion makes sense for the collection

Attributes

Inherited from:
Foldable
def forAll(predicate: T => Boolean): Boolean

Attributes

Inherited from:
Foldable
def size: Int

Attributes

Inherited from:
Foldable
extension [A](container: C[A])
def max: Maybe[A]

Attributes

Inherited from:
OrderedFoldable
def ordFold[B](start: B)(fn: (accumulator: B, value: A) => B): B

Attributes

Inherited from:
OrderedFoldable
def query(queryBuilder: (o: PartialOrder[A]) ?=> Query { type Elem = A; type O = o.type; }): C[A]

Attributes

Inherited from:
OrderedFoldable