-
Notifications
You must be signed in to change notification settings - Fork 125
/
qmlRenamingMap.ml
62 lines (47 loc) · 1.64 KB
/
qmlRenamingMap.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
(*
Copyright © 2011 MLstate
This file is part of OPA.
OPA is free software: you can redistribute it and/or modify it under the
terms of the GNU Affero General Public License, version 3, as published by
the Free Software Foundation.
OPA is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for
more details.
You should have received a copy of the GNU Affero General Public License
along with OPA. If not, see <http://www.gnu.org/licenses/>.
*)
type id_to_id = Ident.t IdentMap.t
type t = {
map : id_to_id;
rev : id_to_id;
}
let empty = {
map = IdentMap.empty;
rev = IdentMap.empty;
}
let add t original_id new_id = {
map = IdentMap.add original_id new_id t.map;
rev = IdentMap.add new_id original_id t.rev;
}
let from_map map = {
map = map;
rev = IdentMap.fold (fun k v acc -> IdentMap.safe_add v k acc) map IdentMap.empty;
}
let original_from_new t new_id =
IdentMap.find new_id t.rev
let original_from_new_opt t new_id =
IdentMap.find_opt new_id t.rev
let new_from_original t original_id =
IdentMap.find original_id t.map
let new_from_original_opt t original_id =
IdentMap.find_opt original_id t.map
let filter t filter =
IdentMap.fold
(fun original_id new_id filtered ->
match filter original_id new_id with
| true -> add filtered original_id new_id
| false -> filtered)
t.map empty
let pp f m =
IdentMap.iter (fun k v -> Format.fprintf f "%s <-> %s@ " (Ident.to_string k) (Ident.to_string v)) m.map