libretto/libretto/BinarySearchTree/NonEmptyTree

NonEmptyTree

object NonEmptyTree
class Object
trait Matchable
class Any

Value members

Concrete methods

def branch[K, V]: NonEmptyTree[K, V] |*| NonEmptyTree[K, V] -⚬ NonEmptyTree[K, V]
def clear[K, V](f: V -⚬ Done): NonEmptyTree[K, V] -⚬ Done
def injectBranch[K, V]: Branch[K, V] -⚬ NonEmptyTree[K, V]
def injectSingleton[K, V]: Singleton[K, V] -⚬ NonEmptyTree[K, V]
def maxKey[K, V]: Getter[NonEmptyTree[K, V], Val[K]]
def minKey[K, V]: Getter[NonEmptyTree[K, V], Val[K]]
def singleton[K, V]: Val[K] |*| V -⚬ NonEmptyTree[K, V]
def summary[K, V]: Getter[NonEmptyTree[K, V], Summary[K]]
def update[K, V, A](f: A |*| V -⚬ PMaybe[V])(`evidence$10`: Ordering[K]): Val[K] |*| A |*| NonEmptyTree[K, V] -⚬ PMaybe[A] |*| PMaybe[NonEmptyTree[K, V]]
def update[K, V, A](f: A |*| V -⚬ PMaybe[V], ifAbsent: A -⚬ Done)(`evidence$11`: Ordering[K]): Val[K] |*| A |*| NonEmptyTree[K, V] -⚬ PMaybe[NonEmptyTree[K, V]]