forked from gfngfn/SATySFi
-
Notifications
You must be signed in to change notification settings - Fork 0
/
assoc.ml
87 lines (50 loc) · 1.55 KB
/
assoc.ml
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
module AssocMap = Map.Make(String)
type key = AssocMap.key
type 'a t = 'a AssocMap.t
let empty = AssocMap.empty
let rec add amap key value =
amap |> AssocMap.add key value
let find_opt amap key =
amap |> AssocMap.find_opt key
let to_list amap =
AssocMap.fold (fun k v acc ->
(k, v) :: acc
) amap [] |> List.rev
let of_list lst =
List.fold_left (fun imap (k, v) -> imap |> AssocMap.add k v) empty lst
let map_value f amap =
AssocMap.map f amap
let iter_value f amap =
AssocMap.iter (fun _ v -> f v) amap
let iter f amap =
AssocMap.iter (fun k v -> f k v) amap
let fold_value f init amap =
AssocMap.fold (fun _ v acc -> f acc v) amap init
let to_value_list amap =
AssocMap.fold (fun _ v acc ->
v :: acc
) amap [] |> List.rev
let fold f init amap =
AssocMap.fold (fun k v acc -> f acc k v) amap init
let rec mem key amap =
AssocMap.mem key amap
let domain_included amap1 amap2 =
AssocMap.fold (fun k _ b -> b && (mem k amap2)) amap1 true
let domain_same amap1 amap2 =
(domain_included amap1 amap2) && (domain_included amap2 amap1)
let intersection amap1 amap2 =
AssocMap.fold (fun k v acc ->
match AssocMap.find_opt k amap2 with
| None -> acc
| Some(w) -> (v, w) :: acc
) amap1 [] |> List.rev
let combine_value amap1 amap2 =
AssocMap.fold (fun k v acc ->
match AssocMap.find_opt k amap2 with
| None -> acc
| Some(w) -> (v, w) :: acc
) amap1 [] |> List.rev
let union amap1 amap2 =
AssocMap.union (fun k v1 v2 -> Some(v2)) amap1 amap2
let cardinal amap =
AssocMap.cardinal amap