forked from rescript-lang/rescript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlam_methname.ml
148 lines (136 loc) · 3.71 KB
/
lam_methname.ml
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
(* Copyright (C) 2015-2016 Bloomberg Finance L.P.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* In addition to the permissions granted to you by the LGPL, you may combine
* or link a "work that uses the Library" with a publicly distributed version
* of this file to produce a combined library or application, then distribute
* that combined work under the terms of your choosing, with no requirement
* to comply with the obligations normally placed on you by section 4 of the
* LGPL version 3 (or the corresponding section of a later version of the LGPL
* should you choose to use a later version).
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *)
(**
{[
_open -> open
_in -> in
_MAX_LENGTH -> MAX_LENGTH
_Capital -> Capital
_open__ -> _open
open__ -> open
_'x -> 'x
_Capital__ -> _Capital
_MAX__ -> _MAX
__ -> __
__x -> __x
___ -> _
____ -> __
_ -> _ (* error *)
]}
First we scan '__' from end to start,
If found, discard it.
Otherwise, check if it is [_ + keyword] or followed by capital letter,
If so, discard [_].
Limitations: user can not have [_Capital__, _Capital__other] to
make it all compile to [Capital].
Keyword is fine [open__, open__other].
So we loose polymorphism over capital letter.
It is okay, otherwise, if [_Captial__] is interpreted as [Capital], then
there is no way to express [_Capital]
*)
(* Copied from [ocaml/parsing/lexer.mll] *)
let key_words =
Hash_set_string.of_array
[|
"and";
"as";
"assert";
"begin";
"class";
"constraint";
"do";
"done";
"downto";
"else";
"end";
"exception";
"external";
"false";
"for";
"fun";
"function";
"functor";
"if";
"in";
"include";
"inherit";
"initializer";
"lazy";
"let";
"match";
"method";
"module";
"mutable";
"new";
"nonrec";
"object";
"of";
"open";
"or";
(* "parser", PARSER; *)
"private";
"rec";
"sig";
"struct";
"then";
"to";
"true";
"try";
"type";
"val";
"virtual";
"when";
"while";
"with";
"mod";
"land";
"lor";
"lxor";
"lsl";
"lsr";
"asr";
|]
let double_underscore = "__"
(*https://caml.inria.fr/pub/docs/manual-ocaml/lex.html
{[
label-name ::= lowercase-ident
]}
*)
let valid_start_char x = match x with '_' | 'a' .. 'z' -> true | _ -> false
let translate name =
assert (not @@ Ext_string.is_empty name);
let i = Ext_string.rfind ~sub:double_underscore name in
if i < 0 then
let name_len = String.length name in
if name.[0] = '_' then
let try_key_word = String.sub name 1 (name_len - 1) in
if
name_len > 1
&& ((not (valid_start_char try_key_word.[0]))
|| Hash_set_string.mem key_words try_key_word)
then try_key_word
else name
else name
else if i = 0 then name
else String.sub name 0 i