The usual mapping on aggregate types: apply a function to all elements of the tree.
List of Import References :
See BOOL
See BSTree
See DENOTATION
See Nat
See Option
See Pair
See Seq
See Tree
SIGNATURE BSTreeMap[from ,< :from ** from -> bool, to, < :to ** to -> bool]
$Date: 2010-09-30 18:24:17 +0200 (Do, 30. Sep 2010) $ ($Revision: 616 $)
IMPORT BSTree[from, <] ONLY bstree[from, <] BSTree[to, <] ONLY bstree[to, <]
from
is the original data type of the elements of the tree,
to
is the new data type.
SORT from to FUN < : from ** from -> bool FUN < : to ** to -> bool
If the result constitutes no valid bs tree, the structure is altered. Thus, the function is total.
FUN * : (from -> to) ** bstree[from, <] -> bstree[to, <]
next node: BSTreeMapEnv,
prev node: BSTreeReduce,
up to node: Subsystem Balanced Search Trees