forked from python/mypy
-
Notifications
You must be signed in to change notification settings - Fork 0
/
stubdoc.py
363 lines (300 loc) · 13.2 KB
/
stubdoc.py
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
"""Parsing/inferring signatures from documentation.
This module provides several functions to generate better stubs using
docstrings and Sphinx docs (.rst files).
"""
import re
import io
import contextlib
import tokenize
from typing import (
Optional, MutableMapping, MutableSequence, List, Sequence, Tuple, NamedTuple, Any
)
from typing_extensions import Final
# Type alias for signatures strings in format ('func_name', '(arg, opt_arg=False)').
Sig = Tuple[str, str]
_TYPE_RE = re.compile(r'^[a-zA-Z_][\w\[\], ]*(\.[a-zA-Z_][\w\[\], ]*)*$') # type: Final
_ARG_NAME_RE = re.compile(r'\**[A-Za-z_][A-Za-z0-9_]*$') # type: Final
def is_valid_type(s: str) -> bool:
"""Try to determine whether a string might be a valid type annotation."""
if s in ('True', 'False', 'retval'):
return False
if ',' in s and '[' not in s:
return False
return _TYPE_RE.match(s) is not None
class ArgSig:
"""Signature info for a single argument."""
def __init__(self, name: str, type: Optional[str] = None, default: bool = False):
self.name = name
if type and not is_valid_type(type):
raise ValueError("Invalid type: " + type)
self.type = type
# Does this argument have a default value?
self.default = default
def __repr__(self) -> str:
return "ArgSig(name={}, type={}, default={})".format(repr(self.name), repr(self.type),
repr(self.default))
def __eq__(self, other: Any) -> bool:
if isinstance(other, ArgSig):
return (self.name == other.name and self.type == other.type and
self.default == other.default)
return False
FunctionSig = NamedTuple('FunctionSig', [
('name', str),
('args', List[ArgSig]),
('ret_type', str)
])
# States of the docstring parser.
STATE_INIT = 1 # type: Final
STATE_FUNCTION_NAME = 2 # type: Final
STATE_ARGUMENT_LIST = 3 # type: Final
STATE_ARGUMENT_TYPE = 4 # type: Final
STATE_ARGUMENT_DEFAULT = 5 # type: Final
STATE_RETURN_VALUE = 6 # type: Final
STATE_OPEN_BRACKET = 7 # type: Final # For generic types.
class DocStringParser:
"""Parse function signatures in documentation."""
def __init__(self, function_name: str) -> None:
# Only search for signatures of function with this name.
self.function_name = function_name
self.state = [STATE_INIT]
self.accumulator = ""
self.arg_type = None # type: Optional[str]
self.arg_name = ""
self.arg_default = None # type: Optional[str]
self.ret_type = "Any"
self.found = False
self.args = [] # type: List[ArgSig]
# Valid signatures found so far.
self.signatures = [] # type: List[FunctionSig]
def add_token(self, token: tokenize.TokenInfo) -> None:
"""Process next token from the token stream."""
if (token.type == tokenize.NAME and token.string == self.function_name and
self.state[-1] == STATE_INIT):
self.state.append(STATE_FUNCTION_NAME)
elif (token.type == tokenize.OP and token.string == '(' and
self.state[-1] == STATE_FUNCTION_NAME):
self.state.pop()
self.accumulator = ""
self.found = True
self.state.append(STATE_ARGUMENT_LIST)
elif self.state[-1] == STATE_FUNCTION_NAME:
# Reset state, function name not followed by '('.
self.state.pop()
elif (token.type == tokenize.OP and token.string in ('[', '(', '{') and
self.state[-1] != STATE_INIT):
self.accumulator += token.string
self.state.append(STATE_OPEN_BRACKET)
elif (token.type == tokenize.OP and token.string in (']', ')', '}') and
self.state[-1] == STATE_OPEN_BRACKET):
self.accumulator += token.string
self.state.pop()
elif (token.type == tokenize.OP and token.string == ':' and
self.state[-1] == STATE_ARGUMENT_LIST):
self.arg_name = self.accumulator
self.accumulator = ""
self.state.append(STATE_ARGUMENT_TYPE)
elif (token.type == tokenize.OP and token.string == '=' and
self.state[-1] in (STATE_ARGUMENT_LIST, STATE_ARGUMENT_TYPE)):
if self.state[-1] == STATE_ARGUMENT_TYPE:
self.arg_type = self.accumulator
self.state.pop()
else:
self.arg_name = self.accumulator
self.accumulator = ""
self.state.append(STATE_ARGUMENT_DEFAULT)
elif (token.type == tokenize.OP and token.string in (',', ')') and
self.state[-1] in (STATE_ARGUMENT_LIST, STATE_ARGUMENT_DEFAULT,
STATE_ARGUMENT_TYPE)):
if self.state[-1] == STATE_ARGUMENT_DEFAULT:
self.arg_default = self.accumulator
self.state.pop()
elif self.state[-1] == STATE_ARGUMENT_TYPE:
self.arg_type = self.accumulator
self.state.pop()
elif self.state[-1] == STATE_ARGUMENT_LIST:
self.arg_name = self.accumulator
if not _ARG_NAME_RE.match(self.arg_name):
# Invalid argument name.
self.reset()
return
if token.string == ')':
self.state.pop()
try:
self.args.append(ArgSig(name=self.arg_name, type=self.arg_type,
default=bool(self.arg_default)))
except ValueError:
# wrong type, use Any
self.args.append(ArgSig(name=self.arg_name, type=None,
default=bool(self.arg_default)))
self.arg_name = ""
self.arg_type = None
self.arg_default = None
self.accumulator = ""
elif token.type == tokenize.OP and token.string == '->' and self.state[-1] == STATE_INIT:
self.accumulator = ""
self.state.append(STATE_RETURN_VALUE)
# ENDMAKER is necessary for python 3.4 and 3.5.
elif (token.type in (tokenize.NEWLINE, tokenize.ENDMARKER) and
self.state[-1] in (STATE_INIT, STATE_RETURN_VALUE)):
if self.state[-1] == STATE_RETURN_VALUE:
if not is_valid_type(self.accumulator):
self.reset()
return
self.ret_type = self.accumulator
self.accumulator = ""
self.state.pop()
if self.found:
self.signatures.append(FunctionSig(name=self.function_name, args=self.args,
ret_type=self.ret_type))
self.found = False
self.args = []
self.ret_type = 'Any'
# Leave state as INIT.
else:
self.accumulator += token.string
def reset(self) -> None:
self.state = [STATE_INIT]
self.args = []
self.found = False
self.accumulator = ""
def get_signatures(self) -> List[FunctionSig]:
"""Return sorted copy of the list of signatures found so far."""
def has_arg(name: str, signature: FunctionSig) -> bool:
return any(x.name == name for x in signature.args)
def args_kwargs(signature: FunctionSig) -> bool:
return has_arg('*args', signature) and has_arg('**kwargs', signature)
# Move functions with (*args, **kwargs) in their signature to last place.
return list(sorted(self.signatures, key=lambda x: 1 if args_kwargs(x) else 0))
def infer_sig_from_docstring(docstr: Optional[str], name: str) -> Optional[List[FunctionSig]]:
"""Convert function signature to list of TypedFunctionSig
Look for function signatures of function in docstring. Signature is a string of
the format <function_name>(<signature>) -> <return type> or perhaps without
the return type.
Returns empty list, when no signature is found, one signature in typical case,
multiple signatures, if docstring specifies multiple signatures for overload functions.
Return None if the docstring is empty.
Arguments:
* docstr: docstring
* name: name of function for which signatures are to be found
"""
if not docstr:
return None
state = DocStringParser(name)
# Return all found signatures, even if there is a parse error after some are found.
with contextlib.suppress(tokenize.TokenError):
try:
tokens = tokenize.tokenize(io.BytesIO(docstr.encode('utf-8')).readline)
for token in tokens:
state.add_token(token)
except IndentationError:
return None
sigs = state.get_signatures()
def is_unique_args(sig: FunctionSig) -> bool:
"""return true if function argument names are unique"""
return len(sig.args) == len(set((arg.name for arg in sig.args)))
# Return only signatures that have unique argument names. Mypy fails on non-uniqnue arg names.
return [sig for sig in sigs if is_unique_args(sig)]
def infer_arg_sig_from_anon_docstring(docstr: str) -> List[ArgSig]:
"""Convert signature in form of "(self: TestClass, arg0: str='ada')" to List[TypedArgList]."""
ret = infer_sig_from_docstring("stub" + docstr, "stub")
if ret:
return ret[0].args
return []
def infer_ret_type_sig_from_anon_docstring(docstr: str) -> Optional[str]:
"""Convert signature in form of "(self: TestClass, arg0) -> int" to their return type."""
ret = infer_sig_from_docstring("stub" + docstr.strip(), "stub")
if ret:
return ret[0].ret_type
return None
def parse_signature(sig: str) -> Optional[Tuple[str,
List[str],
List[str]]]:
"""Split function signature into its name, positional an optional arguments.
The expected format is "func_name(arg, opt_arg=False)". Return the name of function
and lists of positional and optional argument names.
"""
m = re.match(r'([.a-zA-Z0-9_]+)\(([^)]*)\)', sig)
if not m:
return None
name = m.group(1)
name = name.split('.')[-1]
arg_string = m.group(2)
if not arg_string.strip():
# Simple case -- no arguments.
return name, [], []
args = [arg.strip() for arg in arg_string.split(',')]
positional = []
optional = []
i = 0
while i < len(args):
# Accept optional arguments as in both formats: x=None and [x].
if args[i].startswith('[') or '=' in args[i]:
break
positional.append(args[i].rstrip('['))
i += 1
if args[i - 1].endswith('['):
break
while i < len(args):
arg = args[i]
arg = arg.strip('[]')
arg = arg.split('=')[0]
optional.append(arg)
i += 1
return name, positional, optional
def build_signature(positional: Sequence[str],
optional: Sequence[str]) -> str:
"""Build function signature from lists of positional and optional argument names."""
args = [] # type: MutableSequence[str]
args.extend(positional)
for arg in optional:
if arg.startswith('*'):
args.append(arg)
else:
args.append('%s=...' % arg)
sig = '(%s)' % ', '.join(args)
# Ad-hoc fixes.
sig = sig.replace('(self)', '')
return sig
def parse_all_signatures(lines: Sequence[str]) -> Tuple[List[Sig],
List[Sig]]:
"""Parse all signatures in a given reST document.
Return lists of found signatures for functions and classes.
"""
sigs = []
class_sigs = []
for line in lines:
line = line.strip()
m = re.match(r'\.\. *(function|method|class) *:: *[a-zA-Z_]', line)
if m:
sig = line.split('::')[1].strip()
parsed = parse_signature(sig)
if parsed:
name, fixed, optional = parsed
if m.group(1) != 'class':
sigs.append((name, build_signature(fixed, optional)))
else:
class_sigs.append((name, build_signature(fixed, optional)))
return sorted(sigs), sorted(class_sigs)
def find_unique_signatures(sigs: Sequence[Sig]) -> List[Sig]:
"""Remove names with duplicate found signatures."""
sig_map = {} # type: MutableMapping[str, List[str]]
for name, sig in sigs:
sig_map.setdefault(name, []).append(sig)
result = []
for name, name_sigs in sig_map.items():
if len(set(name_sigs)) == 1:
result.append((name, name_sigs[0]))
return sorted(result)
def infer_prop_type_from_docstring(docstr: Optional[str]) -> Optional[str]:
"""Check for Google/Numpy style docstring type annotation for a property.
The docstring has the format "<type>: <descriptions>".
In the type string, we allow the following characters:
* dot: because sometimes classes are annotated using full path
* brackets: to allow type hints like List[int]
* comma/space: things like Tuple[int, int]
"""
if not docstr:
return None
test_str = r'^([a-zA-Z0-9_, \.\[\]]*): '
m = re.match(test_str, docstr)
return m.group(1) if m else None