stdx
API
Generated with
stdx/stdx/stdx.collections/stdx.collections.immutable/TreeChain

TreeChain

stdx.collections.immutable.TreeChain
See theTreeChain companion object
final class TreeChain[T](tree: Evermean[T, Any])(using partialOrder: PartialOrder[T])

Attributes

Companion
object
Experimental
true
Graph
Supertypes
class Object
trait Matchable
class Any

Members list

Value members

Concrete methods

def asIndexedSeq: IndexedSeq[T]
def contains(t: T): Boolean
def excl(t: T): TreeChain[T]
def exists(predicate: T => Boolean): Boolean
def filter(predicate: T => Boolean): TreeChain[T]
def findIncomparable(t: T): TreeChain[T]
def foldL[U](acc: U)(op: (U, T) => U): U
def forAll(predicate: T => Boolean): Boolean
def max: Maybe[T]
def maxBefore(k: T): Maybe[T]

Gets the maximum element in the set before the item given

Gets the maximum element in the set before the item given

Value parameters

k

a value to find in the set

Attributes

Returns

Maybe.none if TreeChain is empty or if k is incomparable with an element in the chain

def ordFold[U](start: U)(fn: (U, T) => U): U
def query(queryFn: (o: PartialOrder[T]) ?=> Query { type Elem = T; type O = o.type; }): TreeChain[T]
def size: Int
override def toString(): String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Attributes

Returns

a string representation of the object.

Definition Classes
Any
def tryIncl(t: T): Maybe[TreeChain[T]]
def union[D[_]](d: D[T])(using Foldable[D]): Maybe[TreeChain[T]]
Generated with