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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2015 *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
open Pp
open Errors
open Util
open Names
(**********************************************)
let pr_dirpath sl = (str (DirPath.to_string sl))
(*s Operations on dirpaths *)
let split_dirpath d = match DirPath.repr d with
| id :: l -> DirPath.make l, id
| _ -> failwith "split_dirpath"
let pop_dirpath p = match DirPath.repr p with
| _::l -> DirPath.make l
| [] -> failwith "pop_dirpath"
(* Pop the last n module idents *)
let pop_dirpath_n n dir = DirPath.make (List.skipn n (DirPath.repr dir))
let is_dirpath_prefix_of d1 d2 =
List.prefix_of Id.equal
(List.rev (DirPath.repr d1)) (List.rev (DirPath.repr d2))
let chop_dirpath n d =
let d1,d2 = List.chop n (List.rev (DirPath.repr d)) in
DirPath.make (List.rev d1), DirPath.make (List.rev d2)
let drop_dirpath_prefix d1 d2 =
let d =
List.drop_prefix Id.equal
(List.rev (DirPath.repr d1)) (List.rev (DirPath.repr d2))
in
DirPath.make (List.rev d)
let append_dirpath d1 d2 = DirPath.make (DirPath.repr d2 @ DirPath.repr d1)
let add_dirpath_prefix id d = DirPath.make (DirPath.repr d @ [id])
let add_dirpath_suffix p id = DirPath.make (id :: DirPath.repr p)
(* parsing *)
let parse_dir s =
let len = String.length s in
let rec decoupe_dirs dirs n =
if Int.equal n len && n > 0 then error (s ^ " is an invalid path.");
if n >= len then dirs else
let pos =
try
String.index_from s n '.'
with Not_found -> len
in
if Int.equal pos n then error (s ^ " is an invalid path.");
let dir = String.sub s n (pos-n) in
decoupe_dirs ((Id.of_string dir)::dirs) (pos+1)
in
decoupe_dirs [] 0
let dirpath_of_string s =
let path = match s with
| "" -> []
| _ -> parse_dir s
in
DirPath.make path
let string_of_dirpath = Names.DirPath.to_string
module Dirset = Set.Make(DirPath)
module Dirmap = Map.Make(DirPath)
(*s Section paths are absolute names *)
type full_path = {
dirpath : DirPath.t ;
basename : Id.t }
let dirpath sp = sp.dirpath
let basename sp = sp.basename
let make_path pa id = { dirpath = pa; basename = id }
let repr_path { dirpath = pa; basename = id } = (pa,id)
let eq_full_path p1 p2 =
Id.equal p1.basename p2.basename &&
DirPath.equal p1.dirpath p2.dirpath
(* parsing and printing of section paths *)
let string_of_path sp =
let (sl,id) = repr_path sp in
match DirPath.repr sl with
| [] -> Id.to_string id
| _ -> (DirPath.to_string sl) ^ "." ^ (Id.to_string id)
let sp_ord sp1 sp2 =
let (p1,id1) = repr_path sp1
and (p2,id2) = repr_path sp2 in
let p_bit = DirPath.compare p1 p2 in
if Int.equal p_bit 0 then Id.compare id1 id2 else p_bit
module SpOrdered =
struct
type t = full_path
let compare = sp_ord
end
module Spmap = Map.Make(SpOrdered)
let path_of_string s =
try
let dir, id = split_dirpath (dirpath_of_string s) in
make_path dir id
with
| Invalid_argument _ -> invalid_arg "path_of_string"
let pr_path sp = str (string_of_path sp)
let restrict_path n sp =
let dir, s = repr_path sp in
let dir' = List.firstn n (DirPath.repr dir) in
make_path (DirPath.make dir') s
(*s qualified names *)
type qualid = full_path
let make_qualid = make_path
let repr_qualid = repr_path
let qualid_eq = eq_full_path
let string_of_qualid = string_of_path
let pr_qualid = pr_path
let qualid_of_string = path_of_string
let qualid_of_path sp = sp
let qualid_of_ident id = make_qualid DirPath.empty id
let qualid_of_dirpath dir =
let (l,a) = split_dirpath dir in
make_qualid l a
type object_name = full_path * kernel_name
type object_prefix = DirPath.t * (module_path * DirPath.t)
let make_oname (dirpath,(mp,dir)) id =
make_path dirpath id, make_kn mp dir (Label.of_id id)
(* to this type are mapped DirPath.t's in the nametab *)
type global_dir_reference =
| DirOpenModule of object_prefix
| DirOpenModtype of object_prefix
| DirOpenSection of object_prefix
| DirModule of object_prefix
| DirClosedSection of DirPath.t
(* this won't last long I hope! *)
let eq_op (d1, (mp1, p1)) (d2, (mp2, p2)) =
DirPath.equal d1 d2 &&
DirPath.equal p1 p2 &&
mp_eq mp1 mp2
let eq_global_dir_reference r1 r2 = match r1, r2 with
| DirOpenModule op1, DirOpenModule op2 -> eq_op op1 op2
| DirOpenModtype op1, DirOpenModtype op2 -> eq_op op1 op2
| DirOpenSection op1, DirOpenSection op2 -> eq_op op1 op2
| DirModule op1, DirModule op2 -> eq_op op1 op2
| DirClosedSection dp1, DirClosedSection dp2 -> DirPath.equal dp1 dp2
| _ -> false
type reference =
| Qualid of qualid Loc.located
| Ident of Id.t Loc.located
let qualid_of_reference = function
| Qualid (loc,qid) -> loc, qid
| Ident (loc,id) -> loc, qualid_of_ident id
let string_of_reference = function
| Qualid (loc,qid) -> string_of_qualid qid
| Ident (loc,id) -> Id.to_string id
let pr_reference = function
| Qualid (_,qid) -> pr_qualid qid
| Ident (_,id) -> str (Id.to_string id)
let loc_of_reference = function
| Qualid (loc,qid) -> loc
| Ident (loc,id) -> loc
let eq_reference r1 r2 = match r1, r2 with
| Qualid (_, q1), Qualid (_, q2) -> qualid_eq q1 q2
| Ident (_, id1), Ident (_, id2) -> Id.equal id1 id2
| _ -> false
let join_reference ns r =
match ns , r with
Qualid (_, q1), Qualid (loc, q2) ->
let (dp1,id1) = repr_qualid q1 in
let (dp2,id2) = repr_qualid q2 in
Qualid (loc,
make_qualid
(append_dirpath (append_dirpath dp1 (dirpath_of_string (Names.Id.to_string id1))) dp2)
id2)
| Qualid (_, q1), Ident (loc, id2) ->
let (dp1,id1) = repr_qualid q1 in
Qualid (loc,
make_qualid
(append_dirpath dp1 (dirpath_of_string (Names.Id.to_string id1)))
id2)
| Ident (_, id1), Qualid (loc, q2) ->
let (dp2,id2) = repr_qualid q2 in
Qualid (loc, make_qualid
(append_dirpath (dirpath_of_string (Names.Id.to_string id1)) dp2)
id2)
| Ident (_, id1), Ident (loc, id2) ->
Qualid (loc, make_qualid
(dirpath_of_string (Names.Id.to_string id1)) id2)
(* Deprecated synonyms *)
let make_short_qualid = qualid_of_ident
let qualid_of_sp = qualid_of_path
|