2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
21 (* qualified identifier: uri, name, qualifiers *)
22 type qid = D.uri * D.id * D.id list
24 type context = E.attrs * D.term list
26 type context_node = qid option (* context node: None = root *)
29 path: D.id list; (* current section path *)
30 node: context_node; (* current context node *)
31 nodes: context_node list; (* context node list *)
32 line: int; (* line number *)
33 mk_uri:G.uri_generator (* uri generator *)
36 type resolver = Local of int
39 let henv_size, hcnt_size = 7000, 4300 (* hash tables initial sizes *)
41 let henv = K.create henv_size (* optimized global environment *)
43 let hcnt = K.create hcnt_size (* optimized context *)
45 (* Internal functions *******************************************************)
47 let empty_cnt = [], []
49 let add_abst (a, ws) id w =
50 E.Name (id, true) :: a, w :: ws
52 let mk_lref f i j k = f (D.TLRef ([E.Apix k], i, j))
54 let id_of_name (id, _, _) = id
56 let mk_qid f st id path =
57 let str = String.concat "/" path in
58 let str = Filename.concat str id in
59 let str = st.mk_uri str in
60 f (U.uri_of_string str, id, path)
62 let uri_of_qid (uri, _, _) = uri
64 let complete_qid f st (id, is_local, qs) =
65 let f path = C.list_rev_append (mk_qid f st id) path ~tail:qs in
66 let rec skip f = function
67 | phd :: ptl, qshd :: _ when phd = qshd -> f ptl
68 | _ :: ptl, _ :: _ -> skip f (ptl, qs)
71 if is_local then f st.path else skip f (st.path, qs)
73 let relax_qid f st (_, id, path) =
75 | _ :: tl -> C.list_rev (mk_qid f st id) tl
80 let relax_opt_qid f st = function
82 | Some qid -> let f qid = f (Some qid) in relax_qid f st qid
84 let resolve_gref err f st qid =
85 try let cnt = K.find henv (uri_of_qid qid) in f qid cnt
86 with Not_found -> err qid
88 let resolve_gref_relaxed f st qid =
89 (* this is not tail recursive *)
90 let rec err qid = relax_qid (resolve_gref err f st) st qid in
91 resolve_gref err f st qid
93 let get_cnt err f st = function
96 try let cnt = K.find hcnt (uri_of_qid qid) in f cnt
97 with Not_found -> err node
99 let get_cnt_relaxed f st =
100 (* this is not tail recursive *)
101 let rec err node = relax_opt_qid (get_cnt err f st) st node in
102 get_cnt err f st st.node
104 (****************************************************************************)
106 let push_abst f lenv a w =
107 let bw = D.Abst (N.infinite, [w]) in
108 let f lenv = f lenv in
109 D.push_bind f lenv a bw
111 let lenv_of_cnt (a, ws) =
112 D.push_bind C.start D.empty_lenv a (D.Abst (N.infinite, ws))
114 (* this is not tail recursive in the GRef branch *)
115 let rec xlate_term f st lenv = function
117 let f h = f (D.TSort ([], h)) in
118 if s then f 0 else f 1
120 let f vv tt = f (D.TAppl ([], [vv], tt)) in
121 let f vv = xlate_term (f vv) st lenv t in
122 xlate_term f st lenv v
123 | A.Abst (name, w, t) ->
125 let a = [E.Name (name, true)] in
127 let b = D.Abst (N.infinite, [ww]) in
128 f (D.TBind (a, b, tt))
130 let f lenv = xlate_term f st lenv t in
131 push_abst f lenv a ww
133 xlate_term f st lenv w
134 | A.GRef (name, args) ->
135 let map1 f = function
136 | E.Name (id, _) -> f (A.GRef ((id, true, []), []))
139 let map2 f t = xlate_term f st lenv t in
141 let gref = D.TGRef ([], uri_of_qid qid) in
145 let f args = f (D.TAppl ([], args, gref)) in
146 let f args = C.list_rev_map f map2 args in
147 let f a = C.list_rev_map_append f map1 a ~tail:args in
148 C.list_sub_strict f a args
150 let g qid = resolve_gref_relaxed g st qid in
151 let err () = complete_qid g st name in
152 D.resolve_lref err (mk_lref f) (id_of_name name) lenv
154 let xlate_entity err f st = function
155 | A.Section (Some (_, name)) ->
156 err {st with path = name :: st.path; nodes = st.node :: st.nodes}
158 begin match st.path, st.nodes with
159 | _ :: ptl, nhd :: ntl ->
160 err {st with path = ptl; node = nhd; nodes = ntl}
164 err {st with node = None}
165 | A.Context (Some name) ->
166 let f name = err {st with node = Some name} in
167 complete_qid f st name
168 | A.Block (name, w) ->
171 let lenv = lenv_of_cnt cnt in
173 K.add hcnt (uri_of_qid qid) (add_abst cnt name ww);
174 err {st with node = Some qid}
176 xlate_term f st lenv w
180 complete_qid f st (name, true, [])
181 | A.Decl (name, w) ->
184 let lenv = lenv_of_cnt cnt in
187 K.add henv (uri_of_qid qid) cnt;
188 let t = match ws with
190 | _ -> D.TBind (a, D.Abst (N.infinite, ws), ww)
193 print_newline (); CrgOutput.pp_term print_string t;
195 let b = E.Abst (N.infinite, t) in
196 let entity = [E.Mark st.line], uri_of_qid qid, b in
197 f {st with line = succ st.line} entity
199 xlate_term f st lenv w
201 complete_qid f st (name, true, [])
204 | A.Def (name, w, trans, v) ->
207 let lenv = lenv_of_cnt cnt in
211 K.add henv (uri_of_qid qid) cnt;
212 let t = match ws with
213 | [] -> D.TCast ([], ww, vv)
214 | _ -> D.TBind (a, D.Abst (N.infinite, ws), D.TCast ([], ww, vv))
217 print_newline (); CrgOutput.pp_term print_string t;
220 let a = E.Mark st.line :: if trans then [] else [E.Meta [E.Private]] in
221 let entity = a, uri_of_qid qid, b in
222 f {st with line = succ st.line} entity
224 xlate_term f st lenv v
226 xlate_term f st lenv w
228 complete_qid f st (name, true, [])
232 (* Interface functions ******************************************************)
234 let initial_status () =
235 K.clear henv; K.clear hcnt; {
236 path = []; node = None; nodes = []; line = 1; mk_uri = G.get_mk_uri ()
239 let refresh_status st = {st with
240 mk_uri = G.get_mk_uri ()
243 let crg_of_aut = xlate_entity