stdx
API
Generated with
stdx/stdx/stdx.collections/stdx.collections.immutable/stdx.collections.immutable.impl/Evermean

Evermean

stdx.collections.immutable.impl.Evermean$package.Evermean
object Evermean

Attributes

Experimental
true
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Evermean.type

Members list

Type members

Classlikes

final class IncomparableException extends Exception

Attributes

Supertypes
class Exception
class Throwable
trait Serializable
class Object
trait Matchable
class Any
Show all

Extensions

Extensions

extension [A, B](tree: Evermean[A, B])
def chainDelete(k: A)(using PartialOrder[A]): Evermean[A, B]
def chainMaxBefore(k: A)(using PartialOrder[A]): Evermean[A, B]
def chainUpdate[B1 >: B](k: A, v: B1, overwrite: Boolean)(using PartialOrder[A]): Evermean[A, B1]
def delete(k: A)(using Order[A]): Evermean[A, B]
def filterS(using po: PartialOrder[A])(q: Query { type O = po.type; type Elem = A; }): Evermean[A, B]
def findIncomparable(k: A)(using PartialOrder[A]): Evermean[A, B]
def join(k: A, v: B, tr: Evermean[A, B]): Tree[A, B]
def max: Tree[A, B] | Null
def ordFold[C](start: C)(fn: (C, Tree[A, B]) => C): C
def partialOrderLookup(x: A)(using PartialOrder[A]): Evermean[A, B]
def split(k2: A)(using PartialOrder[A]): (Evermean[A, B], Evermean[A, B], Evermean[A, B], A)
def toDebugString(level: Int = ...): String
def union(t2: Evermean[A, B])(using PartialOrder[A]): Evermean[A, B]
extension [A](tree: Tree[A, _] | Null)
def keysIterator(start: Maybe[A] = ...)(using PartialOrder[A]): Iterator[A]
extension (tree: Tree[_, _] | Null)
def size: Int
Generated with