1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2012 *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
module type S =
sig
type label
type data
type t
val empty : t
val get : t -> data list
val next : t -> label -> t
val labels : t -> label list
val add : label list -> data -> t -> t
val remove : label list -> data -> t -> t
val iter : (label list -> data -> unit) -> t -> unit
end
module Make (Y : Map.OrderedType) (X : Set.OrderedType) =
struct
module T_dom = Fset.Make(X)
module T_codom = Fmap.Make(Y)
type data = X.t
type label = Y.t
type t = Node of T_dom.t * t T_codom.t
let codom_to_list m = T_codom.fold (fun x y l -> (x,y)::l) m []
let codom_rng m = T_codom.fold (fun _ y acc -> y::acc) m []
let codom_dom m = T_codom.fold (fun x _ acc -> x::acc) m []
let empty = Node (T_dom.empty, T_codom.empty)
let next (Node (_,m)) lbl = T_codom.find lbl m
let get (Node (hereset,_)) = T_dom.elements hereset
let labels (Node (_,m)) = codom_dom m
let in_dom (Node (_,m)) lbl = T_codom.mem lbl m
let is_empty_node (Node(a,b)) = (T_dom.elements a = []) && (codom_to_list b = [])
let assure_arc m lbl =
if T_codom.mem lbl m then
m
else
T_codom.add lbl (Node (T_dom.empty,T_codom.empty)) m
let cleanse_arcs (Node (hereset,m)) =
let l = codom_rng m in
Node(hereset, if List.for_all is_empty_node l then T_codom.empty else m)
let rec at_path f (Node (hereset,m)) = function
| [] ->
cleanse_arcs (Node(f hereset,m))
| h::t ->
let m = assure_arc m h in
cleanse_arcs (Node(hereset,
T_codom.add h (at_path f (T_codom.find h m) t) m))
let add path v tm =
at_path (fun hereset -> T_dom.add v hereset) tm path
let remove path v tm =
at_path (fun hereset -> T_dom.remove v hereset) tm path
let iter f tlm =
let rec apprec pfx (Node(hereset,m)) =
let path = List.rev pfx in
T_dom.iter (fun v -> f path v) hereset;
T_codom.iter (fun l tm -> apprec (l::pfx) tm) m
in
apprec [] tlm
let to_list tlm =
let rec torec pfx (Node(hereset,m)) =
let path = List.rev pfx in
List.flatten((List.map (fun v -> (path,v)) (T_dom.elements hereset))::
(List.map (fun (l,tm) -> torec (l::pfx) tm) (codom_to_list m)))
in
torec [] tlm
end
|
