HeapMap

The usual mapping on aggregate types: apply a function to all elements of the heap.

Signature of HeapMap

List of Import References :
See BOOL
See DENOTATION
See Heap
See Nat
See Option
See Seq
See Tree

SIGNATURE HeapMap[from ,< :from ** from -> bool, to, < :to ** to -> bool]

$Date: 2010-09-30 18:24:17 +0200 (Do, 30. Sep 2010) $ ($Revision: 616 $)

IMPORT Heap[from, <] ONLY heap
       Heap[to, <] ONLY heap

Parameter

from is the original data type of the elements of the heap, to is the new data type.

SORT from to
FUN < : from ** from -> bool
FUN < : to ** to -> bool

Mapping

If the result constitutes no valid heap, the structure is altered. Thus, the function is total.

FUN * : (from -> to) ** heap[from, <] -> heap[to, <]

next node: HeapMapEnv,
prev node: HeapReduce,
up to node: Subsystem Heaps