6118
|
1 |
(* Title: Pure/General/name_space.ML
|
5012
|
2 |
ID: $Id$
|
|
3 |
Author: Markus Wenzel, TU Muenchen
|
8806
|
4 |
License: GPL (GNU GENERAL PUBLIC LICENSE)
|
5012
|
5 |
|
|
6 |
Hierarchically structured name spaces.
|
|
7 |
|
|
8 |
More general than ML-like nested structures, but also slightly more
|
|
9 |
ad-hoc. Does not support absolute addressing. Unknown names are
|
|
10 |
implicitely considered to be declared outermost.
|
|
11 |
*)
|
|
12 |
|
|
13 |
signature NAME_SPACE =
|
|
14 |
sig
|
|
15 |
val separator: string (*single char!*)
|
|
16 |
val append: string -> string -> string
|
|
17 |
val unpack: string -> string list
|
|
18 |
val pack: string list -> string
|
|
19 |
val base: string -> string
|
8728
|
20 |
val is_qualified: string -> bool
|
5012
|
21 |
val accesses: string -> string list
|
|
22 |
type T
|
|
23 |
val empty: T
|
|
24 |
val extend: T * string list -> T
|
|
25 |
val merge: T * T -> T
|
8728
|
26 |
val hide: T * string list -> T
|
5012
|
27 |
val intern: T -> string -> string
|
|
28 |
val extern: T -> string -> string
|
5175
|
29 |
val long_names: bool ref
|
|
30 |
val cond_extern: T -> string -> string
|
6845
|
31 |
val cond_extern_table: T -> 'a Symtab.table -> (string * 'a) list
|
5012
|
32 |
val dest: T -> (string * string list) list
|
|
33 |
end;
|
|
34 |
|
|
35 |
structure NameSpace: NAME_SPACE =
|
|
36 |
struct
|
|
37 |
|
|
38 |
|
|
39 |
(** utils **)
|
|
40 |
|
|
41 |
fun prefixes1 [] = []
|
|
42 |
| prefixes1 (x :: xs) = map (cons x) ([] :: prefixes1 xs);
|
|
43 |
|
|
44 |
fun suffixes1 xs = map rev (prefixes1 (rev xs));
|
|
45 |
|
|
46 |
|
|
47 |
|
|
48 |
(** long identifiers **)
|
|
49 |
|
|
50 |
val separator = ".";
|
8728
|
51 |
fun hidden name = "??." ^ name;
|
|
52 |
fun is_hidden name = (case explode name of "?" :: "?" :: "." :: _ => true | _ => false);
|
5012
|
53 |
|
|
54 |
fun append name1 name2 = name1 ^ separator ^ name2;
|
|
55 |
|
|
56 |
val unpack = space_explode separator;
|
|
57 |
val pack = space_implode separator;
|
|
58 |
|
|
59 |
val base = last_elem o unpack;
|
8728
|
60 |
fun is_qualified name = length (unpack name) > 1;
|
5012
|
61 |
|
|
62 |
fun accesses name =
|
|
63 |
let
|
|
64 |
val uname = unpack name;
|
|
65 |
val (q, b) = split_last uname;
|
|
66 |
val sfxs = suffixes1 uname;
|
|
67 |
val pfxs = map (fn x => x @ [b]) (prefixes1 q);
|
|
68 |
in map pack (sfxs @ pfxs) end;
|
|
69 |
|
|
70 |
|
|
71 |
|
|
72 |
(** name spaces **)
|
|
73 |
|
8728
|
74 |
(* basic operations *)
|
|
75 |
|
|
76 |
fun map_space f xname tab =
|
|
77 |
Symtab.update ((xname, f (if_none (Symtab.lookup (tab, xname)) ([], []))), tab);
|
|
78 |
|
|
79 |
fun change f xname (name, tab) =
|
|
80 |
map_space (fn (names, names') => (f names name, names')) xname tab;
|
|
81 |
|
|
82 |
fun change' f xname (name', tab) =
|
|
83 |
map_space (fn (names, names') => (names, f names' name')) xname tab;
|
|
84 |
|
|
85 |
fun del names nm = if nm mem_string names then Library.gen_rem (op =) (names, nm) else names;
|
|
86 |
fun add names nm = nm :: del names nm;
|
|
87 |
|
|
88 |
|
5012
|
89 |
(* datatype T *)
|
|
90 |
|
|
91 |
datatype T =
|
8728
|
92 |
NameSpace of (string list * string list) Symtab.table;
|
5012
|
93 |
|
|
94 |
val empty = NameSpace Symtab.empty;
|
|
95 |
|
|
96 |
|
8728
|
97 |
(* extend *) (*later entries preferred*)
|
|
98 |
|
|
99 |
fun extend_aux (name, tab) =
|
|
100 |
if is_hidden name then
|
|
101 |
error ("Attempt to declare hidden name " ^ quote name)
|
|
102 |
else foldl (fn (tb, xname) => change add xname (name, tb)) (tab, accesses name);
|
5012
|
103 |
|
8728
|
104 |
fun extend (NameSpace tab, names) = NameSpace (foldr extend_aux (names, tab));
|
|
105 |
|
|
106 |
|
|
107 |
(* merge *) (*1st preferred over 2nd*)
|
|
108 |
|
|
109 |
fun merge_aux (tab, (xname, (names, names'))) =
|
|
110 |
foldr (change add xname) (names, foldr (change' add xname) (names', tab));
|
5012
|
111 |
|
8728
|
112 |
fun merge (NameSpace tab1, NameSpace tab2) =
|
|
113 |
NameSpace (Symtab.foldl merge_aux (tab2, tab1));
|
|
114 |
|
|
115 |
|
|
116 |
(* hide *)
|
5012
|
117 |
|
8728
|
118 |
fun hide_aux (name, tab) =
|
|
119 |
if not (is_qualified name) then
|
|
120 |
error ("Attempt to hide global name " ^ quote name)
|
|
121 |
else if is_hidden name then
|
|
122 |
error ("Attempt to hide hidden name " ^ quote name)
|
|
123 |
else (change' add name (name,
|
|
124 |
foldl (fn (tb, xname) => change del xname (name, tb)) (tab, accesses name)));
|
|
125 |
|
|
126 |
fun hide (NameSpace tab, names) = NameSpace (foldr hide_aux (names, tab));
|
5012
|
127 |
|
|
128 |
|
|
129 |
(* intern / extern names *)
|
|
130 |
|
8728
|
131 |
fun lookup (NameSpace tab) xname =
|
|
132 |
(case Symtab.lookup (tab, xname) of
|
|
133 |
None => (xname, true)
|
|
134 |
| Some ([name], _) => (name, true)
|
|
135 |
| Some (name :: _, _) => (name, false)
|
|
136 |
| Some ([], []) => (xname, true)
|
|
137 |
| Some ([], name' :: _) => (hidden name', true));
|
|
138 |
|
|
139 |
fun intern spc xname = #1 (lookup spc xname);
|
5012
|
140 |
|
|
141 |
fun extern space name =
|
|
142 |
let
|
8728
|
143 |
fun try [] = hidden name
|
5012
|
144 |
| try (nm :: nms) =
|
8728
|
145 |
let val (full_nm, uniq) = lookup space nm
|
|
146 |
in if full_nm = name andalso uniq then nm else try nms end
|
5012
|
147 |
in try (map pack (suffixes1 (unpack name))) end;
|
|
148 |
|
5175
|
149 |
(*prune names on output by default*)
|
|
150 |
val long_names = ref false;
|
|
151 |
|
|
152 |
fun cond_extern space = if ! long_names then I else extern space;
|
|
153 |
|
6845
|
154 |
fun cond_extern_table space tab =
|
|
155 |
Library.sort_wrt #1 (map (apfst (cond_extern space)) (Symtab.dest tab));
|
|
156 |
|
5012
|
157 |
|
|
158 |
(* dest *)
|
|
159 |
|
8728
|
160 |
fun dest_entry (xname, ([], _)) = None
|
|
161 |
| dest_entry (xname, (name :: _, _)) = Some (name, xname);
|
|
162 |
|
5012
|
163 |
fun dest (NameSpace tab) =
|
|
164 |
map (apsnd (sort (int_ord o pairself size)))
|
8728
|
165 |
(Symtab.dest (Symtab.make_multi (mapfilter dest_entry (Symtab.dest tab))));
|
5012
|
166 |
|
|
167 |
|
|
168 |
end;
|
5175
|
169 |
|
|
170 |
|
|
171 |
val long_names = NameSpace.long_names;
|