blob: da7fb84002d3764e386f983639d10863f1cee19c (
plain)
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
|
(***********************************************************************)
(* OCamldoc *)
(* *)
(* Maxence Guesdon, projet Cristal, INRIA Rocquencourt *)
(* *)
(* Copyright 2001 Institut National de Recherche en Informatique et *)
(* en Automatique. All rights reserved. This file is distributed *)
(* under the terms of the Q Public License version 1.0. *)
(* *)
(***********************************************************************)
(* $Id$ *)
(** Representation of element names. *)
let infix_chars = [ '|' ;
'<' ;
'>' ;
'@' ;
'^' ;
'&' ;
'+' ;
'-' ;
'*' ;
'/' ;
'$' ;
'%' ;
'=' ;
':' ;
'~' ;
'!' ;
]
type t = string
let parens_if_infix name =
match name with
"" -> ""
| s ->
if List.mem s.[0] infix_chars then
"("^s^")"
else
s
let cut name =
match name with
"" -> ("", "")
| s ->
let len = String.length s in
match s.[len-1] with
')' ->
(
let j = ref 0 in
let buf = [|Buffer.create len ; Buffer.create len |] in
for i = 0 to len - 1 do
match s.[i] with
'.' when !j = 0 ->
if i < len - 1 then
match s.[i+1] with
'(' ->
j := 1
| _ ->
Buffer.add_char buf.(!j) '('
else
Buffer.add_char buf.(!j) s.[i]
| c ->
Buffer.add_char buf.(!j) c
done;
(Buffer.contents buf.(0), Buffer.contents buf.(1))
)
| _ ->
match List.rev (Str.split (Str.regexp_string ".") s) with
[] -> ("", "")
| h :: q ->
(String.concat "." (List.rev q), h)
let simple name = snd (cut name)
let father name = fst (cut name)
let concat n1 n2 = n1^"."^n2
let head n =
match Str.split (Str.regexp "\\.") n with
[] -> n
| h :: _ -> h
let depth name =
try
List.length (Str.split (Str.regexp "\\.") name)
with
_ -> 1
let prefix n1 n2 =
(n1 <> n2) &
(try
let len1 = String.length n1 in
((String.sub n2 0 len1) = n1) &
(n2.[len1] = '.')
with _ -> false)
let get_relative n1 n2 =
if prefix n1 n2 then
let len1 = String.length n1 in
try
String.sub n2 (len1+1) ((String.length n2) - len1 - 1)
with
_ -> n2
else
n2
let hide_given_modules l s =
let rec iter = function
[] -> s
| h :: q ->
let s2 = get_relative h s in
if s = s2 then
iter q
else
s2
in
iter l
let qualified name = String.contains name '.'
let from_ident ident = Ident.name ident
let from_path path = Path.name path
let to_path n =
match
List.fold_left
(fun acc_opt -> fun s ->
match acc_opt with
None -> Some (Path.Pident (Ident.create s))
| Some acc -> Some (Path.Pdot (acc, s, 0)))
None
(Str.split (Str.regexp "\\.") n)
with
None -> raise (Failure "to_path")
| Some p -> p
let from_longident longident = String.concat "." (Longident.flatten longident)
|
