module Hptmap:sig
..end
type
tag
module type Id_Datatype =sig
..end
module type V =sig
..end
module Shape:
Key
.
type
cache_type =
| |
NoCache |
(* |
The results of the function will not be cached.
| *) |
| |
PersistentCache of |
(* |
The results of the function will be cached, and the function that uses
the cache is a permanent closure (at the toplevel of an OCaml module).
| *) |
| |
TemporaryCache of |
(* |
The results of the function will be cached, but the function itself
is a local function which is garbage-collectable.
| *) |
module Make:functor (
Key
:
Id_Datatype
) ->
functor (
V
:
V
) ->
functor (
Compositional_bool
:
sig
A boolean information is maintained for each tree, by composing the boolean on the subtrees and the value information present on each leaf. SeeComp_unused
for a default implementation.
val e :bool
Value for the empty tree
val f :Key.t -> Hptmap.V.t -> bool
Value for a leaf
val compose :bool -> bool -> bool
Composition of the values of two subtrees
val default :bool
end
) ->
functor (
Initial_Values
:
sig
val v :(Key.t * Hptmap.V.t) list list
List of the maps that must be shared between all instances of Frama-C (the maps being described by the list of their elements). Must include all maps that are exported at Caml link-time when the functor is applied. This usually includes at least the empty map, hencev
nearly always contains[]
.
end
) ->
functor (
Datatype_deps
:
sig
val l :State.t list
Dependencies of the hash-consing table. The table will be cleared whenever one of those dependencies is cleared.
end
) ->
sig
..end
module Comp_unused:sig
..end
Compositional_bool
argument of the functor
Hptmap.Make
.