ATSLIB/libats/ML/funset
This package implements functional sets based on ordered AVL-trees.
Synopsis
typedef set(a:t0p) = set_type(a)
Synopsis
abstype
set_type
(
a:t@ype+
) = ptr
Synopsis
fun{a:t0p}
funset_is_member(xs: set(INV(a)), x0: a):<> bool
Synopsis
fun{a:t0p}
funset_isnot_member(xs: set(INV(a)), x0: a):<> bool
Synopsis
fun{a:t0p}
funset_insert
(xs: &set(INV(a)) >> _, x0: a): bool
Synopsis
fun{a:t0p}
funset_remove
(xs: &set(INV(a)) >> _, x0: a): bool
Synopsis
fun{a:t0p}
funset_getmax_opt(xs: set(INV(a))): Option_vt(a)
Synopsis
fun{a:t0p}
funset_getmin_opt(xs: set(INV(a))): Option_vt(a)
Synopsis
fun{a:t0p}
funset_takeoutmax_opt(xs: &set(INV(a)) >> _): Option_vt(a)
Synopsis
fun{a:t0p}
funset_takeoutmin_opt(xs: &set(INV(a)) >> _): Option_vt(a)
Synopsis
fun{a:t0p}
funset_union(xs1: set(INV(a)), xs2: set(a)):<> set(a)
Synopsis
fun{a:t0p}
funset_intersect(xs1: set(INV(a)), xs2: set(a)):<> set(a)
Synopsis
Synopsis for [funset_diff] is unavailable.
Synopsis
fun{a:t0p}
funset_symdiff(xs1: set(INV(a)), xs2: set(a)):<> set(a)
Synopsis
fun{a:t0p}
funset_equal(xs1: set(INV(a)), xs2: set(a)):<> bool
Synopsis
fun{a:t0p}
funset_compare(xs1: set(INV(a)), xs2: set(a)):<> int
Synopsis
fun{a:t0p}
funset_is_subset(xs1: set(INV(a)), xs2: set(a)):<> bool
Synopsis
fun{a:t0p}
funset_is_supset(xs1: set(INV(a)), xs2: set(a)):<> bool
Synopsis
fun{a:t0p}
funset_foreach(set: set(INV(a))): void
Synopsis
fun
{a:t0p}
{env:vt0p}
funset_foreach_env
(set: set(INV(a)), env: &(env) >> _): void
Synopsis
fun
{a:t0p}
{env:vt0p}
funset_foreach$fwork(x: a, env: &(env) >> _): void
Synopsis
fun{a:t0p}
funset_listize(xs: set(INV(a))):<> list0(a)