Aardvark.Base.Incremental


ASet

Nested types and modules

ModuleDescription
Implementation
Readers

Functions and values

Function or valueDescription
bind(mapping m)
Signature: mapping:('a -> aset<'b>) -> m:IMod<'a> -> aset<'b>
Type parameters: 'a, 'b
bind2(mapping a b)
Signature: mapping:('a -> 'b -> aset<'c>) -> a:IMod<'a> -> b:IMod<'b> -> aset<'c>
Type parameters: 'a, 'b, 'c
choose(chooser set)
Signature: chooser:('a -> Option<'b>) -> set:aset<'a> -> aset<'b>
Type parameters: 'a, 'b

applies the given function to each element of the given aset. returns an aset comprised of the results x for each element where the function returns Some(x)

chooseM(mapping set)
Signature: mapping:('a -> IMod<Option<'b>>) -> set:aset<'a> -> aset<'b>
Type parameters: 'a, 'b
collect(mapping set)
Signature: mapping:('a -> aset<'b>) -> set:aset<'a> -> aset<'b>
Type parameters: 'a, 'b

applies the given function to each element of the given aset. unions all the results and returns the combined aset

collect'(mapping set)
Signature: mapping:('a -> '?11137) -> set:aset<'a> -> aset<'b>
Type parameters: 'a, '?11137, 'b

applies the given function to each element of the given aset. unions all the results and returns the combined aset

contains(value set)
Signature: value:'a -> set:aset<'a> -> IMod<bool>
Type parameters: 'a
containsAll(seq set)
Signature: seq:seq<'a> -> set:aset<'a> -> IMod<bool>
Type parameters: 'a
containsAny(seq set)
Signature: seq:seq<'a> -> set:aset<'a> -> IMod<bool>
Type parameters: 'a
count(set)
Signature: set:aset<'a> -> IMod<int>
Type parameters: 'a
create(f)
Signature: f:(Scope -> 'a) -> aset<'a>
Type parameters: 'a, 'a

creates a new aset using the given reader-creator

custom(f)
Signature: f:(AdaptiveToken -> hrefset<'a> -> hdeltaset<'a>) -> aset<'a>
Type parameters: 'a
difference(l r)
Signature: l:aset<'a> -> r:aset<'a> -> aset<'a>
Type parameters: 'a
empty
Signature: aset<'a>
Type parameters: 'a

the empty aset

filter(predicate set)
Signature: predicate:('a -> bool) -> set:aset<'a> -> aset<'a>
Type parameters: 'a

creates a new aset containing only the elements of the given one for which the given predicate returns true

filterM(predicate set)
Signature: predicate:('a -> IMod<bool>) -> set:aset<'a> -> aset<'a>
Type parameters: 'a
flattenM(set)
Signature: set:aset<IMod<'a>> -> aset<'a>
Type parameters: 'a
fold(f seed s)
Signature: f:('s -> 'a -> 's) -> seed:'s -> s:aset<'a> -> IMod<'s>
Type parameters: 's, 'a
foldGroup(add sub zero s)
Signature: add:('s -> 'a -> 's) -> sub:('s -> 'a -> 's) -> zero:'s -> s:aset<'a> -> IMod<'s>
Type parameters: 's, 'a
foldHalfGroup(add trySub zero s)
Signature: add:('s -> 'a -> 's) -> trySub:('s -> 'a -> Option<'s>) -> zero:'s -> s:aset<'a> -> IMod<'s>
Type parameters: 's, 'a
map(mapping set)
Signature: mapping:('a -> 'b) -> set:aset<'a> -> aset<'b>
Type parameters: 'a, 'b

creates a new aset whose elements are the result of applying the given function to each of the elements of the given set

mapM(mapping set)
Signature: mapping:('a -> IMod<'b>) -> set:aset<'a> -> aset<'b>
Type parameters: 'a, 'b
mapUse(mapping set)
Signature: mapping:('a -> 'b) -> set:aset<'a> -> aset<'b>
Type parameters: 'a, 'b
ofArray(arr)
Signature: arr:'a [] -> aset<'a>
Type parameters: 'a

create a new aset using all distinct entries from the array

ofList(list)
Signature: list:'a list -> aset<'a>
Type parameters: 'a

create a new aset using all distinct entries from the list

ofMod(m)
Signature: m:IMod<hrefset<'a>> -> aset<'a>
Type parameters: 'a

creates set which will always contain the elements given by the mod-cell

ofModSingle(m)
Signature: m:IMod<'a> -> aset<'a>
Type parameters: 'a

creates a singleton set which will always contain the latest value of the given mod-cell

ofSeq(seq)
Signature: seq:seq<'a> -> aset<'a>
Type parameters: 'a

create a new aset using all distinct entries from the sequence

ofSet(set)
Signature: set:hrefset<'a> -> aset<'a>
Type parameters: 'a

creates a new aset using the given set content

product(s)
Signature: s:aset<^a> -> IMod<^?11178>
Type parameters: ^a, ^?11178

Adaptively calculates the product of all elements in the set

registerCallback(f set)
Signature: f:(SetOperation<'?11188> list -> unit) -> set:aset<'?11188> -> IDisposable
Type parameters: '?11188
single(v)
Signature: v:'a -> aset<'a>
Type parameters: 'a

creates a new aset containing only the given element

sum(s)
Signature: s:aset<^a> -> IMod<^c>
Type parameters: ^a, ^c

Adaptively calculates the sum of all elements in the set

toArray(set)
Signature: set:aset<'a> -> 'a []
Type parameters: 'a

creates an array from the current state of the aset

toList(set)
Signature: set:aset<'a> -> 'a list
Type parameters: 'a

creates a list from the current state of the aset

toMod(s)
Signature: s:aset<'a> -> IMod<hrefset<'a>>
Type parameters: 'a

creates a mod-cell containing the set's content as set

toSeq(set)
Signature: set:aset<'a> -> seq<'a>
Type parameters: 'a

creates a seq from the current state of the aset

toSet(set)
Signature: set:aset<'a> -> hrefset<'a>
Type parameters: 'a

creates a set from the current state of the aset

union(l r)
Signature: l:aset<'a> -> r:aset<'a> -> aset<'a>
Type parameters: 'a
unionMany(sets)
Signature: sets:aset<aset<'a>> -> aset<'a>
Type parameters: 'a
unionMany'(sets)
Signature: sets:seq<aset<'a>> -> aset<'a>
Type parameters: 'a
unsafeRegisterCallbackKeepDisposable(...)
Signature: f:(SetOperation<'a> list -> unit) -> set:aset<'a> -> IDisposable
Type parameters: 'a

registers a callback for execution whenever the set's value might have changed and returns a disposable subscription in order to unregister the callback. Note that the callback will be executed immediately once here. In contrast to registerCallbackNoGcRoot, this function holds on to the fresh disposable, i.e. even if the input set goes out of scope, the disposable still forces the complete computation to exist. When disposing the assosciated disposable, the gc root disappears and the computation can be collected.

unsafeRegisterCallbackNoGcRoot(f set)
Signature: f:(SetOperation<'a> list -> unit) -> set:aset<'a> -> IDisposable
Type parameters: 'a
Fork me on GitHub