Aardvark.Base.Incremental


AList

Nested types and modules

ModuleDescription
Comparer
Implementation
Readers

Functions and values

Function or valueDescription
append(l r)
Signature: l:alist<'a> -> r:alist<'a> -> alist<'a>
Type parameters: 'a
bind(mapping m)
Signature: mapping:('a -> alist<'b>) -> m:IMod<'a> -> alist<'b>
Type parameters: 'a, 'b
bind2(mapping a b)
Signature: mapping:('a -> 'b -> alist<'c>) -> a:IMod<'a> -> b:IMod<'b> -> alist<'c>
Type parameters: 'a, 'b, 'c
choose(mapping list)
Signature: mapping:('a -> Option<'b>) -> list:alist<'a> -> alist<'b>
Type parameters: 'a, 'b
choosei(mapping list)
Signature: mapping:(Index -> 'a -> Option<'b>) -> list:alist<'a> -> alist<'b>
Type parameters: 'a, 'b
chooseiM(mapping list)
Signature: mapping:(Index -> 'a -> IMod<Option<'b>>) -> list:alist<'a> -> alist<'b>
Type parameters: 'a, 'b
chooseM(mapping list)
Signature: mapping:('a -> IMod<Option<'b>>) -> list:alist<'a> -> alist<'b>
Type parameters: 'a, 'b
collect(mapping list)
Signature: mapping:('a -> alist<'b>) -> list:alist<'a> -> alist<'b>
Type parameters: 'a, 'b
collecti(mapping list)
Signature: mapping:(Index -> 'a -> alist<'b>) -> list:alist<'a> -> alist<'b>
Type parameters: 'a, 'b
concat(lists)
Signature: lists:alist<alist<'a>> -> alist<'a>
Type parameters: 'a
concat'(lists)
Signature: lists:plist<alist<'a>> -> alist<'a>
Type parameters: 'a
empty
Signature: alist<'a>
Type parameters: 'a

the empty alist

filter(predicate list)
Signature: predicate:('a -> bool) -> list:alist<'a> -> alist<'a>
Type parameters: 'a
filteri(predicate list)
Signature: predicate:(Index -> 'a -> bool) -> list:alist<'a> -> alist<'a>
Type parameters: 'a
filteriM(f list)
Signature: f:(Index -> 'a -> IMod<bool>) -> list:alist<'a> -> alist<'a>
Type parameters: 'a
filterM(f list)
Signature: f:('a -> IMod<bool>) -> list:alist<'a> -> alist<'a>
Type parameters: 'a
map(mapping list)
Signature: mapping:('a -> 'b) -> list:alist<'a> -> alist<'b>
Type parameters: 'a, 'b
mapi(mapping list)
Signature: mapping:(Index -> 'a -> 'b) -> list:alist<'a> -> alist<'b>
Type parameters: 'a, 'b
ofArray(l)
Signature: l:'a [] -> alist<'a>
Type parameters: 'a

creates a new alist using the given sequence

ofASet(set)
Signature: set:aset<'a> -> alist<'a>
Type parameters: 'a
ofList(l)
Signature: l:'a list -> alist<'a>
Type parameters: 'a

creates a new alist using the given sequence

ofMod(m)
Signature: m:IMod<plist<'a>> -> alist<'a>
Type parameters: 'a
ofModSingle(m)
Signature: m:IMod<'a> -> alist<'a>
Type parameters: 'a
ofPList(l)
Signature: l:plist<'a> -> alist<'a>
Type parameters: 'a

creates a new alist using the given list

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

creates a new alist using the given sequence

registerCallback(f set)
Signature: f:((Index * ElementOperation<'?10511>) list -> unit) -> set:alist<'?10511> -> IDisposable
Type parameters: '?10511
single(v)
Signature: v:'a -> alist<'a>
Type parameters: 'a

creates a new alist containing only the given element

sort(list)
Signature: list:alist<'a> -> alist<'a>
Type parameters: 'a
sortBy(f list)
Signature: f:('a -> 'b) -> list:alist<'a> -> alist<'a>
Type parameters: 'a, 'b
sortWith(cmp list)
Signature: cmp:('a -> 'a -> int) -> list:alist<'a> -> alist<'a>
Type parameters: 'a
toArray(list)
Signature: list:alist<'a> -> 'a []
Type parameters: 'a
toASet(l)
Signature: l:alist<'a> -> aset<'a>
Type parameters: 'a
toList(list)
Signature: list:alist<'a> -> 'a list
Type parameters: 'a
toMod(l)
Signature: l:alist<'a> -> IMod<plist<'a>>
Type parameters: 'a
toPList(list)
Signature: list:alist<'a> -> plist<'a>
Type parameters: 'a
toSeq(list)
Signature: list:alist<'a> -> seq<'a>
Type parameters: 'a
unsafeRegisterCallbackKeepDisposable(...)
Signature: f:((Index * ElementOperation<'a>) list -> unit) -> list:alist<'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 list)
Signature: f:((Index * ElementOperation<'a>) list -> unit) -> list:alist<'a> -> IDisposable
Type parameters: 'a
Fork me on GitHub