Utilities for addressing and modifying leaves of binary bisection trees.
- data BisecTreePath
- path2dom :: ERIntApprox ira => ira -> BisecTreePath -> ira
- data FnZipper f
- lookupSubdomain :: ERFnDomApprox box varid domra ranra fa => fa -> BisecTreePath -> (fa, FnZipper fa)
- updateFnZ :: ERFnDomApprox box varid domra ranra fa => FnZipper fa -> fa -> fa
A path in a binary tree.
It is used mainly in connection with
Assuming that bisection happens at default points as defined by
bisectDomain and starts from the given root interval.
A representation of a binary tree with a hole that can be efficiently filled.
Lookup a subdomain of a function according to a bisection path. Return the restrited function as well as a zipper that allows an efficient modification of the function on the looked up subdomain.