3761
|
1 |
(* Title: Pure/name_space.ML
|
|
2 |
ID: $Id$
|
|
3 |
Author: Markus Wenzel, TU Muenchen
|
|
4 |
|
|
5 |
Hierarchically structured name spaces.
|
|
6 |
|
3786
|
7 |
More general than ML-like nested structures, but also slightly more
|
|
8 |
ad-hoc. Does not support absolute addressing. Unknown names are
|
|
9 |
implicitely considered to be declared outermost.
|
3761
|
10 |
*)
|
|
11 |
|
|
12 |
signature NAME_SPACE =
|
|
13 |
sig
|
4851
|
14 |
val separator: string (*single char!*)
|
|
15 |
val append: string -> string -> string
|
3761
|
16 |
val unpack: string -> string list
|
|
17 |
val pack: string list -> string
|
3786
|
18 |
val base: string -> string
|
3761
|
19 |
val qualified: string -> bool
|
4886
|
20 |
val accesses: string -> string list
|
3761
|
21 |
type T
|
|
22 |
val empty: T
|
4490
|
23 |
val extend: T * string list -> T
|
3761
|
24 |
val merge: T * T -> T
|
3993
|
25 |
val intern: T -> string -> string
|
|
26 |
val extern: T -> string -> string
|
4497
|
27 |
val dest: T -> (string * string list) list
|
3761
|
28 |
end;
|
|
29 |
|
3876
|
30 |
structure NameSpace: NAME_SPACE =
|
3761
|
31 |
struct
|
|
32 |
|
|
33 |
|
4490
|
34 |
(** utils **)
|
|
35 |
|
|
36 |
fun prefixes1 [] = []
|
|
37 |
| prefixes1 (x :: xs) = map (cons x) ([] :: prefixes1 xs);
|
|
38 |
|
|
39 |
fun suffixes1 xs = map rev (prefixes1 (rev xs));
|
|
40 |
|
|
41 |
|
|
42 |
|
3761
|
43 |
(** long identifiers **)
|
|
44 |
|
3833
|
45 |
val separator = ".";
|
3761
|
46 |
|
4851
|
47 |
fun append name1 name2 = name1 ^ separator ^ name2;
|
|
48 |
|
3833
|
49 |
val unpack = space_explode separator;
|
3761
|
50 |
val pack = space_implode separator;
|
|
51 |
|
3786
|
52 |
val base = last_elem o unpack;
|
3833
|
53 |
fun qualified name = length (unpack name) > 1;
|
3761
|
54 |
|
4490
|
55 |
fun accesses name =
|
|
56 |
let
|
|
57 |
val uname = unpack name;
|
|
58 |
val (q, b) = split_last uname;
|
|
59 |
val sfxs = suffixes1 uname;
|
|
60 |
val pfxs = map (fn x => x @ [b]) (prefixes1 q);
|
4886
|
61 |
in map pack (sfxs @ pfxs) end;
|
4490
|
62 |
|
3761
|
63 |
|
|
64 |
|
|
65 |
(** name spaces **)
|
|
66 |
|
|
67 |
(* datatype T *)
|
|
68 |
|
|
69 |
datatype T =
|
4490
|
70 |
NameSpace of string Symtab.table;
|
3761
|
71 |
|
4490
|
72 |
val empty = NameSpace Symtab.empty;
|
3761
|
73 |
|
|
74 |
|
4490
|
75 |
(* extend, merge operations *)
|
3761
|
76 |
|
4490
|
77 |
fun add (tab, entry) = Symtab.update (entry, tab);
|
3761
|
78 |
|
4490
|
79 |
fun extend (NameSpace tab, names) =
|
4886
|
80 |
NameSpace (foldl add (tab, flat (map (fn name => map (rpair name) (accesses name)) names)));
|
3761
|
81 |
|
4490
|
82 |
fun merge (NameSpace tab1, NameSpace tab2) = (*2nd overrides 1st*)
|
|
83 |
NameSpace (foldl add (tab1, Symtab.dest tab2));
|
3761
|
84 |
|
|
85 |
|
3993
|
86 |
(* intern / extern names *)
|
|
87 |
|
4490
|
88 |
fun intern (NameSpace tab) name =
|
|
89 |
if_none (Symtab.lookup (tab, name)) name;
|
3761
|
90 |
|
3993
|
91 |
fun extern space name =
|
3972
|
92 |
let
|
|
93 |
fun try [] = "??" ^ separator ^ name (*hidden name*)
|
|
94 |
| try (nm :: nms) =
|
3993
|
95 |
if intern space nm = name then nm
|
3972
|
96 |
else try nms;
|
|
97 |
in try (map pack (suffixes1 (unpack name))) end;
|
3761
|
98 |
|
|
99 |
|
4497
|
100 |
(* dest *)
|
|
101 |
|
|
102 |
fun dest (NameSpace tab) =
|
|
103 |
map (apsnd (sort (int_ord o pairself size)))
|
|
104 |
(Symtab.dest (Symtab.make_multi (map swap (Symtab.dest tab))));
|
|
105 |
|
|
106 |
|
3761
|
107 |
end;
|