##// END OF EJS Templates
Add docstring
Corentin Cadiou -
Show More
@@ -1,2226 +1,2254 b''
1 1 """Completion for IPython.
2 2
3 3 This module started as fork of the rlcompleter module in the Python standard
4 4 library. The original enhancements made to rlcompleter have been sent
5 5 upstream and were accepted as of Python 2.3,
6 6
7 7 This module now support a wide variety of completion mechanism both available
8 8 for normal classic Python code, as well as completer for IPython specific
9 9 Syntax like magics.
10 10
11 11 Latex and Unicode completion
12 12 ============================
13 13
14 14 IPython and compatible frontends not only can complete your code, but can help
15 15 you to input a wide range of characters. In particular we allow you to insert
16 16 a unicode character using the tab completion mechanism.
17 17
18 18 Forward latex/unicode completion
19 19 --------------------------------
20 20
21 21 Forward completion allows you to easily type a unicode character using its latex
22 22 name, or unicode long description. To do so type a backslash follow by the
23 23 relevant name and press tab:
24 24
25 25
26 26 Using latex completion:
27 27
28 28 .. code::
29 29
30 30 \\alpha<tab>
31 31 Ξ±
32 32
33 33 or using unicode completion:
34 34
35 35
36 36 .. code::
37 37
38 38 \\GREEK SMALL LETTER ALPHA<tab>
39 39 Ξ±
40 40
41 41
42 42 Only valid Python identifiers will complete. Combining characters (like arrow or
43 43 dots) are also available, unlike latex they need to be put after the their
44 44 counterpart that is to say, `F\\\\vec<tab>` is correct, not `\\\\vec<tab>F`.
45 45
46 46 Some browsers are known to display combining characters incorrectly.
47 47
48 48 Backward latex completion
49 49 -------------------------
50 50
51 51 It is sometime challenging to know how to type a character, if you are using
52 52 IPython, or any compatible frontend you can prepend backslash to the character
53 53 and press `<tab>` to expand it to its latex form.
54 54
55 55 .. code::
56 56
57 57 \\Ξ±<tab>
58 58 \\alpha
59 59
60 60
61 61 Both forward and backward completions can be deactivated by setting the
62 62 ``Completer.backslash_combining_completions`` option to ``False``.
63 63
64 64
65 65 Experimental
66 66 ============
67 67
68 68 Starting with IPython 6.0, this module can make use of the Jedi library to
69 69 generate completions both using static analysis of the code, and dynamically
70 70 inspecting multiple namespaces. Jedi is an autocompletion and static analysis
71 71 for Python. The APIs attached to this new mechanism is unstable and will
72 72 raise unless use in an :any:`provisionalcompleter` context manager.
73 73
74 74 You will find that the following are experimental:
75 75
76 76 - :any:`provisionalcompleter`
77 77 - :any:`IPCompleter.completions`
78 78 - :any:`Completion`
79 79 - :any:`rectify_completions`
80 80
81 81 .. note::
82 82
83 83 better name for :any:`rectify_completions` ?
84 84
85 85 We welcome any feedback on these new API, and we also encourage you to try this
86 86 module in debug mode (start IPython with ``--Completer.debug=True``) in order
87 87 to have extra logging information if :any:`jedi` is crashing, or if current
88 88 IPython completer pending deprecations are returning results not yet handled
89 89 by :any:`jedi`
90 90
91 91 Using Jedi for tab completion allow snippets like the following to work without
92 92 having to execute any code:
93 93
94 94 >>> myvar = ['hello', 42]
95 95 ... myvar[1].bi<tab>
96 96
97 97 Tab completion will be able to infer that ``myvar[1]`` is a real number without
98 98 executing any code unlike the previously available ``IPCompleter.greedy``
99 99 option.
100 100
101 101 Be sure to update :any:`jedi` to the latest stable version or to try the
102 102 current development version to get better completions.
103 103 """
104 104
105 105
106 106 # Copyright (c) IPython Development Team.
107 107 # Distributed under the terms of the Modified BSD License.
108 108 #
109 109 # Some of this code originated from rlcompleter in the Python standard library
110 110 # Copyright (C) 2001 Python Software Foundation, www.python.org
111 111
112 112
113 113 import builtins as builtin_mod
114 114 import glob
115 115 import inspect
116 116 import itertools
117 117 import keyword
118 118 import os
119 119 import re
120 120 import string
121 121 import sys
122 122 import time
123 123 import unicodedata
124 124 import uuid
125 125 import warnings
126 126 from contextlib import contextmanager
127 127 from importlib import import_module
128 128 from types import SimpleNamespace
129 129 from typing import Iterable, Iterator, List, Tuple, Union, Any, Sequence, Dict, NamedTuple, Pattern, Optional
130 130
131 131 from IPython.core.error import TryNext
132 132 from IPython.core.inputtransformer2 import ESC_MAGIC
133 133 from IPython.core.latex_symbols import latex_symbols, reverse_latex_symbol
134 134 from IPython.core.oinspect import InspectColors
135 135 from IPython.utils import generics
136 136 from IPython.utils.dir2 import dir2, get_real_method
137 137 from IPython.utils.path import ensure_dir_exists
138 138 from IPython.utils.process import arg_split
139 139 from traitlets import Bool, Enum, Int, List as ListTrait, Unicode, default, observe
140 140 from traitlets.config.configurable import Configurable
141 141
142 142 import __main__
143 143
144 144 # skip module docstests
145 145 skip_doctest = True
146 146
147 147 try:
148 148 import jedi
149 149 jedi.settings.case_insensitive_completion = False
150 150 import jedi.api.helpers
151 151 import jedi.api.classes
152 152 JEDI_INSTALLED = True
153 153 except ImportError:
154 154 JEDI_INSTALLED = False
155 155 #-----------------------------------------------------------------------------
156 156 # Globals
157 157 #-----------------------------------------------------------------------------
158 158
159 159 # ranges where we have most of the valid unicode names. We could be more finer
160 160 # grained but is it worth it for performace While unicode have character in the
161 161 # rage 0, 0x110000, we seem to have name for about 10% of those. (131808 as I
162 162 # write this). With below range we cover them all, with a density of ~67%
163 163 # biggest next gap we consider only adds up about 1% density and there are 600
164 164 # gaps that would need hard coding.
165 165 _UNICODE_RANGES = [(32, 0x3134b), (0xe0001, 0xe01f0)]
166 166
167 167 # Public API
168 168 __all__ = ['Completer','IPCompleter']
169 169
170 170 if sys.platform == 'win32':
171 171 PROTECTABLES = ' '
172 172 else:
173 173 PROTECTABLES = ' ()[]{}?=\\|;:\'#*"^&'
174 174
175 175 # Protect against returning an enormous number of completions which the frontend
176 176 # may have trouble processing.
177 177 MATCHES_LIMIT = 500
178 178
179 179 _deprecation_readline_sentinel = object()
180 180
181 181
182 182 class ProvisionalCompleterWarning(FutureWarning):
183 183 """
184 184 Exception raise by an experimental feature in this module.
185 185
186 186 Wrap code in :any:`provisionalcompleter` context manager if you
187 187 are certain you want to use an unstable feature.
188 188 """
189 189 pass
190 190
191 191 warnings.filterwarnings('error', category=ProvisionalCompleterWarning)
192 192
193 193 @contextmanager
194 194 def provisionalcompleter(action='ignore'):
195 195 """
196 196
197 197
198 198 This context manager has to be used in any place where unstable completer
199 199 behavior and API may be called.
200 200
201 201 >>> with provisionalcompleter():
202 202 ... completer.do_experimental_things() # works
203 203
204 204 >>> completer.do_experimental_things() # raises.
205 205
206 206 .. note:: Unstable
207 207
208 208 By using this context manager you agree that the API in use may change
209 209 without warning, and that you won't complain if they do so.
210 210
211 211 You also understand that, if the API is not to your liking, you should report
212 212 a bug to explain your use case upstream.
213 213
214 214 We'll be happy to get your feedback, feature requests, and improvements on
215 215 any of the unstable APIs!
216 216 """
217 217 with warnings.catch_warnings():
218 218 warnings.filterwarnings(action, category=ProvisionalCompleterWarning)
219 219 yield
220 220
221 221
222 222 def has_open_quotes(s):
223 223 """Return whether a string has open quotes.
224 224
225 225 This simply counts whether the number of quote characters of either type in
226 226 the string is odd.
227 227
228 228 Returns
229 229 -------
230 230 If there is an open quote, the quote character is returned. Else, return
231 231 False.
232 232 """
233 233 # We check " first, then ', so complex cases with nested quotes will get
234 234 # the " to take precedence.
235 235 if s.count('"') % 2:
236 236 return '"'
237 237 elif s.count("'") % 2:
238 238 return "'"
239 239 else:
240 240 return False
241 241
242 242
243 243 def protect_filename(s, protectables=PROTECTABLES):
244 244 """Escape a string to protect certain characters."""
245 245 if set(s) & set(protectables):
246 246 if sys.platform == "win32":
247 247 return '"' + s + '"'
248 248 else:
249 249 return "".join(("\\" + c if c in protectables else c) for c in s)
250 250 else:
251 251 return s
252 252
253 253
254 254 def expand_user(path:str) -> Tuple[str, bool, str]:
255 255 """Expand ``~``-style usernames in strings.
256 256
257 257 This is similar to :func:`os.path.expanduser`, but it computes and returns
258 258 extra information that will be useful if the input was being used in
259 259 computing completions, and you wish to return the completions with the
260 260 original '~' instead of its expanded value.
261 261
262 262 Parameters
263 263 ----------
264 264 path : str
265 265 String to be expanded. If no ~ is present, the output is the same as the
266 266 input.
267 267
268 268 Returns
269 269 -------
270 270 newpath : str
271 271 Result of ~ expansion in the input path.
272 272 tilde_expand : bool
273 273 Whether any expansion was performed or not.
274 274 tilde_val : str
275 275 The value that ~ was replaced with.
276 276 """
277 277 # Default values
278 278 tilde_expand = False
279 279 tilde_val = ''
280 280 newpath = path
281 281
282 282 if path.startswith('~'):
283 283 tilde_expand = True
284 284 rest = len(path)-1
285 285 newpath = os.path.expanduser(path)
286 286 if rest:
287 287 tilde_val = newpath[:-rest]
288 288 else:
289 289 tilde_val = newpath
290 290
291 291 return newpath, tilde_expand, tilde_val
292 292
293 293
294 294 def compress_user(path:str, tilde_expand:bool, tilde_val:str) -> str:
295 295 """Does the opposite of expand_user, with its outputs.
296 296 """
297 297 if tilde_expand:
298 298 return path.replace(tilde_val, '~')
299 299 else:
300 300 return path
301 301
302 302
303 303 def completions_sorting_key(word):
304 304 """key for sorting completions
305 305
306 306 This does several things:
307 307
308 308 - Demote any completions starting with underscores to the end
309 309 - Insert any %magic and %%cellmagic completions in the alphabetical order
310 310 by their name
311 311 """
312 312 prio1, prio2 = 0, 0
313 313
314 314 if word.startswith('__'):
315 315 prio1 = 2
316 316 elif word.startswith('_'):
317 317 prio1 = 1
318 318
319 319 if word.endswith('='):
320 320 prio1 = -1
321 321
322 322 if word.startswith('%%'):
323 323 # If there's another % in there, this is something else, so leave it alone
324 324 if not "%" in word[2:]:
325 325 word = word[2:]
326 326 prio2 = 2
327 327 elif word.startswith('%'):
328 328 if not "%" in word[1:]:
329 329 word = word[1:]
330 330 prio2 = 1
331 331
332 332 return prio1, word, prio2
333 333
334 334
335 335 class _FakeJediCompletion:
336 336 """
337 337 This is a workaround to communicate to the UI that Jedi has crashed and to
338 338 report a bug. Will be used only id :any:`IPCompleter.debug` is set to true.
339 339
340 340 Added in IPython 6.0 so should likely be removed for 7.0
341 341
342 342 """
343 343
344 344 def __init__(self, name):
345 345
346 346 self.name = name
347 347 self.complete = name
348 348 self.type = 'crashed'
349 349 self.name_with_symbols = name
350 350 self.signature = ''
351 351 self._origin = 'fake'
352 352
353 353 def __repr__(self):
354 354 return '<Fake completion object jedi has crashed>'
355 355
356 356
357 357 class Completion:
358 358 """
359 359 Completion object used and return by IPython completers.
360 360
361 361 .. warning:: Unstable
362 362
363 363 This function is unstable, API may change without warning.
364 364 It will also raise unless use in proper context manager.
365 365
366 366 This act as a middle ground :any:`Completion` object between the
367 367 :any:`jedi.api.classes.Completion` object and the Prompt Toolkit completion
368 368 object. While Jedi need a lot of information about evaluator and how the
369 369 code should be ran/inspected, PromptToolkit (and other frontend) mostly
370 370 need user facing information.
371 371
372 372 - Which range should be replaced replaced by what.
373 373 - Some metadata (like completion type), or meta information to displayed to
374 374 the use user.
375 375
376 376 For debugging purpose we can also store the origin of the completion (``jedi``,
377 377 ``IPython.python_matches``, ``IPython.magics_matches``...).
378 378 """
379 379
380 380 __slots__ = ['start', 'end', 'text', 'type', 'signature', '_origin']
381 381
382 382 def __init__(self, start: int, end: int, text: str, *, type: str=None, _origin='', signature='') -> None:
383 383 warnings.warn("``Completion`` is a provisional API (as of IPython 6.0). "
384 384 "It may change without warnings. "
385 385 "Use in corresponding context manager.",
386 386 category=ProvisionalCompleterWarning, stacklevel=2)
387 387
388 388 self.start = start
389 389 self.end = end
390 390 self.text = text
391 391 self.type = type
392 392 self.signature = signature
393 393 self._origin = _origin
394 394
395 395 def __repr__(self):
396 396 return '<Completion start=%s end=%s text=%r type=%r, signature=%r,>' % \
397 397 (self.start, self.end, self.text, self.type or '?', self.signature or '?')
398 398
399 399 def __eq__(self, other)->Bool:
400 400 """
401 401 Equality and hash do not hash the type (as some completer may not be
402 402 able to infer the type), but are use to (partially) de-duplicate
403 403 completion.
404 404
405 405 Completely de-duplicating completion is a bit tricker that just
406 406 comparing as it depends on surrounding text, which Completions are not
407 407 aware of.
408 408 """
409 409 return self.start == other.start and \
410 410 self.end == other.end and \
411 411 self.text == other.text
412 412
413 413 def __hash__(self):
414 414 return hash((self.start, self.end, self.text))
415 415
416 416
417 417 _IC = Iterable[Completion]
418 418
419 419
420 420 def _deduplicate_completions(text: str, completions: _IC)-> _IC:
421 421 """
422 422 Deduplicate a set of completions.
423 423
424 424 .. warning:: Unstable
425 425
426 426 This function is unstable, API may change without warning.
427 427
428 428 Parameters
429 429 ----------
430 430 text: str
431 431 text that should be completed.
432 432 completions: Iterator[Completion]
433 433 iterator over the completions to deduplicate
434 434
435 435 Yields
436 436 ------
437 437 `Completions` objects
438 438
439 439
440 440 Completions coming from multiple sources, may be different but end up having
441 441 the same effect when applied to ``text``. If this is the case, this will
442 442 consider completions as equal and only emit the first encountered.
443 443
444 444 Not folded in `completions()` yet for debugging purpose, and to detect when
445 445 the IPython completer does return things that Jedi does not, but should be
446 446 at some point.
447 447 """
448 448 completions = list(completions)
449 449 if not completions:
450 450 return
451 451
452 452 new_start = min(c.start for c in completions)
453 453 new_end = max(c.end for c in completions)
454 454
455 455 seen = set()
456 456 for c in completions:
457 457 new_text = text[new_start:c.start] + c.text + text[c.end:new_end]
458 458 if new_text not in seen:
459 459 yield c
460 460 seen.add(new_text)
461 461
462 462
463 463 def rectify_completions(text: str, completions: _IC, *, _debug=False)->_IC:
464 464 """
465 465 Rectify a set of completions to all have the same ``start`` and ``end``
466 466
467 467 .. warning:: Unstable
468 468
469 469 This function is unstable, API may change without warning.
470 470 It will also raise unless use in proper context manager.
471 471
472 472 Parameters
473 473 ----------
474 474 text: str
475 475 text that should be completed.
476 476 completions: Iterator[Completion]
477 477 iterator over the completions to rectify
478 478
479 479
480 480 :any:`jedi.api.classes.Completion` s returned by Jedi may not have the same start and end, though
481 481 the Jupyter Protocol requires them to behave like so. This will readjust
482 482 the completion to have the same ``start`` and ``end`` by padding both
483 483 extremities with surrounding text.
484 484
485 485 During stabilisation should support a ``_debug`` option to log which
486 486 completion are return by the IPython completer and not found in Jedi in
487 487 order to make upstream bug report.
488 488 """
489 489 warnings.warn("`rectify_completions` is a provisional API (as of IPython 6.0). "
490 490 "It may change without warnings. "
491 491 "Use in corresponding context manager.",
492 492 category=ProvisionalCompleterWarning, stacklevel=2)
493 493
494 494 completions = list(completions)
495 495 if not completions:
496 496 return
497 497 starts = (c.start for c in completions)
498 498 ends = (c.end for c in completions)
499 499
500 500 new_start = min(starts)
501 501 new_end = max(ends)
502 502
503 503 seen_jedi = set()
504 504 seen_python_matches = set()
505 505 for c in completions:
506 506 new_text = text[new_start:c.start] + c.text + text[c.end:new_end]
507 507 if c._origin == 'jedi':
508 508 seen_jedi.add(new_text)
509 509 elif c._origin == 'IPCompleter.python_matches':
510 510 seen_python_matches.add(new_text)
511 511 yield Completion(new_start, new_end, new_text, type=c.type, _origin=c._origin, signature=c.signature)
512 512 diff = seen_python_matches.difference(seen_jedi)
513 513 if diff and _debug:
514 514 print('IPython.python matches have extras:', diff)
515 515
516 516
517 517 if sys.platform == 'win32':
518 518 DELIMS = ' \t\n`!@#$^&*()=+[{]}|;\'",<>?'
519 519 else:
520 520 DELIMS = ' \t\n`!@#$^&*()=+[{]}\\|;:\'",<>?'
521 521
522 522 GREEDY_DELIMS = ' =\r\n'
523 523
524 524
525 525 class CompletionSplitter(object):
526 526 """An object to split an input line in a manner similar to readline.
527 527
528 528 By having our own implementation, we can expose readline-like completion in
529 529 a uniform manner to all frontends. This object only needs to be given the
530 530 line of text to be split and the cursor position on said line, and it
531 531 returns the 'word' to be completed on at the cursor after splitting the
532 532 entire line.
533 533
534 534 What characters are used as splitting delimiters can be controlled by
535 535 setting the ``delims`` attribute (this is a property that internally
536 536 automatically builds the necessary regular expression)"""
537 537
538 538 # Private interface
539 539
540 540 # A string of delimiter characters. The default value makes sense for
541 541 # IPython's most typical usage patterns.
542 542 _delims = DELIMS
543 543
544 544 # The expression (a normal string) to be compiled into a regular expression
545 545 # for actual splitting. We store it as an attribute mostly for ease of
546 546 # debugging, since this type of code can be so tricky to debug.
547 547 _delim_expr = None
548 548
549 549 # The regular expression that does the actual splitting
550 550 _delim_re = None
551 551
552 552 def __init__(self, delims=None):
553 553 delims = CompletionSplitter._delims if delims is None else delims
554 554 self.delims = delims
555 555
556 556 @property
557 557 def delims(self):
558 558 """Return the string of delimiter characters."""
559 559 return self._delims
560 560
561 561 @delims.setter
562 562 def delims(self, delims):
563 563 """Set the delimiters for line splitting."""
564 564 expr = '[' + ''.join('\\'+ c for c in delims) + ']'
565 565 self._delim_re = re.compile(expr)
566 566 self._delims = delims
567 567 self._delim_expr = expr
568 568
569 569 def split_line(self, line, cursor_pos=None):
570 570 """Split a line of text with a cursor at the given position.
571 571 """
572 572 l = line if cursor_pos is None else line[:cursor_pos]
573 573 return self._delim_re.split(l)[-1]
574 574
575 575
576 576
577 577 class Completer(Configurable):
578 578
579 579 greedy = Bool(False,
580 580 help="""Activate greedy completion
581 581 PENDING DEPRECTION. this is now mostly taken care of with Jedi.
582 582
583 583 This will enable completion on elements of lists, results of function calls, etc.,
584 584 but can be unsafe because the code is actually evaluated on TAB.
585 585 """
586 586 ).tag(config=True)
587 587
588 588 use_jedi = Bool(default_value=JEDI_INSTALLED,
589 589 help="Experimental: Use Jedi to generate autocompletions. "
590 590 "Default to True if jedi is installed.").tag(config=True)
591 591
592 592 jedi_compute_type_timeout = Int(default_value=400,
593 593 help="""Experimental: restrict time (in milliseconds) during which Jedi can compute types.
594 594 Set to 0 to stop computing types. Non-zero value lower than 100ms may hurt
595 595 performance by preventing jedi to build its cache.
596 596 """).tag(config=True)
597 597
598 598 debug = Bool(default_value=False,
599 599 help='Enable debug for the Completer. Mostly print extra '
600 600 'information for experimental jedi integration.')\
601 601 .tag(config=True)
602 602
603 603 backslash_combining_completions = Bool(True,
604 604 help="Enable unicode completions, e.g. \\alpha<tab> . "
605 605 "Includes completion of latex commands, unicode names, and expanding "
606 606 "unicode characters back to latex commands.").tag(config=True)
607 607
608 608
609 609
610 610 def __init__(self, namespace=None, global_namespace=None, **kwargs):
611 611 """Create a new completer for the command line.
612 612
613 613 Completer(namespace=ns, global_namespace=ns2) -> completer instance.
614 614
615 615 If unspecified, the default namespace where completions are performed
616 616 is __main__ (technically, __main__.__dict__). Namespaces should be
617 617 given as dictionaries.
618 618
619 619 An optional second namespace can be given. This allows the completer
620 620 to handle cases where both the local and global scopes need to be
621 621 distinguished.
622 622 """
623 623
624 624 # Don't bind to namespace quite yet, but flag whether the user wants a
625 625 # specific namespace or to use __main__.__dict__. This will allow us
626 626 # to bind to __main__.__dict__ at completion time, not now.
627 627 if namespace is None:
628 628 self.use_main_ns = True
629 629 else:
630 630 self.use_main_ns = False
631 631 self.namespace = namespace
632 632
633 633 # The global namespace, if given, can be bound directly
634 634 if global_namespace is None:
635 635 self.global_namespace = {}
636 636 else:
637 637 self.global_namespace = global_namespace
638 638
639 639 self.custom_matchers = []
640 640
641 641 super(Completer, self).__init__(**kwargs)
642 642
643 643 def complete(self, text, state):
644 644 """Return the next possible completion for 'text'.
645 645
646 646 This is called successively with state == 0, 1, 2, ... until it
647 647 returns None. The completion should begin with 'text'.
648 648
649 649 """
650 650 if self.use_main_ns:
651 651 self.namespace = __main__.__dict__
652 652
653 653 if state == 0:
654 654 if "." in text:
655 655 self.matches = self.attr_matches(text)
656 656 else:
657 657 self.matches = self.global_matches(text)
658 658 try:
659 659 return self.matches[state]
660 660 except IndexError:
661 661 return None
662 662
663 663 def global_matches(self, text):
664 664 """Compute matches when text is a simple name.
665 665
666 666 Return a list of all keywords, built-in functions and names currently
667 667 defined in self.namespace or self.global_namespace that match.
668 668
669 669 """
670 670 matches = []
671 671 match_append = matches.append
672 672 n = len(text)
673 673 for lst in [keyword.kwlist,
674 674 builtin_mod.__dict__.keys(),
675 675 self.namespace.keys(),
676 676 self.global_namespace.keys()]:
677 677 for word in lst:
678 678 if word[:n] == text and word != "__builtins__":
679 679 match_append(word)
680 680
681 681 snake_case_re = re.compile(r"[^_]+(_[^_]+)+?\Z")
682 682 for lst in [self.namespace.keys(),
683 683 self.global_namespace.keys()]:
684 684 shortened = {"_".join([sub[0] for sub in word.split('_')]) : word
685 685 for word in lst if snake_case_re.match(word)}
686 686 for word in shortened.keys():
687 687 if word[:n] == text and word != "__builtins__":
688 688 match_append(shortened[word])
689 689 return matches
690 690
691 691 def attr_matches(self, text):
692 692 """Compute matches when text contains a dot.
693 693
694 694 Assuming the text is of the form NAME.NAME....[NAME], and is
695 695 evaluatable in self.namespace or self.global_namespace, it will be
696 696 evaluated and its attributes (as revealed by dir()) are used as
697 697 possible completions. (For class instances, class members are
698 698 also considered.)
699 699
700 700 WARNING: this can still invoke arbitrary C code, if an object
701 701 with a __getattr__ hook is evaluated.
702 702
703 703 """
704 704
705 705 # Another option, seems to work great. Catches things like ''.<tab>
706 706 m = re.match(r"(\S+(\.\w+)*)\.(\w*)$", text)
707 707
708 708 if m:
709 709 expr, attr = m.group(1, 3)
710 710 elif self.greedy:
711 711 m2 = re.match(r"(.+)\.(\w*)$", self.line_buffer)
712 712 if not m2:
713 713 return []
714 714 expr, attr = m2.group(1,2)
715 715 else:
716 716 return []
717 717
718 718 try:
719 719 obj = eval(expr, self.namespace)
720 720 except:
721 721 try:
722 722 obj = eval(expr, self.global_namespace)
723 723 except:
724 724 return []
725 725
726 726 if self.limit_to__all__ and hasattr(obj, '__all__'):
727 727 words = get__all__entries(obj)
728 728 else:
729 729 words = dir2(obj)
730 730
731 731 try:
732 732 words = generics.complete_object(obj, words)
733 733 except TryNext:
734 734 pass
735 735 except AssertionError:
736 736 raise
737 737 except Exception:
738 738 # Silence errors from completion function
739 739 #raise # dbg
740 740 pass
741 741 # Build match list to return
742 742 n = len(attr)
743 743 return [u"%s.%s" % (expr, w) for w in words if w[:n] == attr ]
744 744
745 745
746 746 def get__all__entries(obj):
747 747 """returns the strings in the __all__ attribute"""
748 748 try:
749 749 words = getattr(obj, '__all__')
750 750 except:
751 751 return []
752 752
753 753 return [w for w in words if isinstance(w, str)]
754 754
755 755
756 def match_dict_keys(keys: List[Union[str, bytes]], prefix: str, delims: str) -> Tuple[str, int, List[str]]:
756 def match_dict_keys(keys: List[Union[str, bytes, Tuple[Union[str, bytes]]]], prefix: str, delims: str,
757 prefix_tuple: Tuple[str, bytes]=()) -> Tuple[str, int, List[str]]:
757 758 """Used by dict_key_matches, matching the prefix to a list of keys
758 759
759 760 Parameters
760 761 ==========
761 762 keys:
762 763 list of keys in dictionary currently being completed.
763 764 prefix:
764 Part of the text already typed by the user. e.g. `mydict[b'fo`
765 Part of the text already typed by the user. E.g. `mydict[b'fo`
765 766 delims:
766 767 String of delimiters to consider when finding the current key.
768 prefix_tuple: optional
769 Part of the text already typed in multi-key index cases. E.g. for
770 `mydict['foo', "bar", 'b`, this would be `('foo', 'bar')`.
767 771
768 772 Returns
769 773 =======
770 774
771 775 A tuple of three elements: ``quote``, ``token_start``, ``matched``, with
772 776 ``quote`` being the quote that need to be used to close current string.
773 777 ``token_start`` the position where the replacement should start occurring,
774 778 ``matches`` a list of replacement/completion
775 779
776 780 """
777 keys = [k for k in keys if isinstance(k, (str, bytes))]
781 Nprefix = len(prefix_tuple)
782 def filter_by_prefix_tuple(key):
783 if len(key) < Nprefix:
784 return False
785 for k, pt in zip(key, prefix_tuple):
786 if k != pt:
787 return False
788 return True
789
790 new_keys = []
791 for k in keys:
792 if isinstance(k, (str, bytes)):
793 new_keys.append(k)
794 elif isinstance(k, tuple) and filter_by_prefix_tuple(k):
795 new_keys.append(k[Nprefix])
796
797 keys = new_keys
778 798 if not prefix:
779 799 return '', 0, [repr(k) for k in keys
780 800 if isinstance(k, (str, bytes))]
781 801 quote_match = re.search('["\']', prefix)
782 802 assert quote_match is not None # silence mypy
783 803 quote = quote_match.group()
784 804 try:
785 805 prefix_str = eval(prefix + quote, {})
786 806 except Exception:
787 807 return '', 0, []
788 808
789 809 pattern = '[^' + ''.join('\\' + c for c in delims) + ']*$'
790 810 token_match = re.search(pattern, prefix, re.UNICODE)
791 811 assert token_match is not None # silence mypy
792 812 token_start = token_match.start()
793 813 token_prefix = token_match.group()
794 814
795 815 matched:List[str] = []
796 816 for key in keys:
797 817 try:
798 818 if not key.startswith(prefix_str):
799 819 continue
800 820 except (AttributeError, TypeError, UnicodeError):
801 821 # Python 3+ TypeError on b'a'.startswith('a') or vice-versa
802 822 continue
803 823
804 824 # reformat remainder of key to begin with prefix
805 825 rem = key[len(prefix_str):]
806 826 # force repr wrapped in '
807 827 rem_repr = repr(rem + '"') if isinstance(rem, str) else repr(rem + b'"')
808 828 rem_repr = rem_repr[1 + rem_repr.index("'"):-2]
809 829 if quote == '"':
810 830 # The entered prefix is quoted with ",
811 831 # but the match is quoted with '.
812 832 # A contained " hence needs escaping for comparison:
813 833 rem_repr = rem_repr.replace('"', '\\"')
814 834
815 835 # then reinsert prefix from start of token
816 836 matched.append('%s%s' % (token_prefix, rem_repr))
817 837 return quote, token_start, matched
818 838
819 839
820 840 def cursor_to_position(text:str, line:int, column:int)->int:
821 841 """
822 842
823 843 Convert the (line,column) position of the cursor in text to an offset in a
824 844 string.
825 845
826 846 Parameters
827 847 ----------
828 848
829 849 text : str
830 850 The text in which to calculate the cursor offset
831 851 line : int
832 852 Line of the cursor; 0-indexed
833 853 column : int
834 854 Column of the cursor 0-indexed
835 855
836 856 Return
837 857 ------
838 858 Position of the cursor in ``text``, 0-indexed.
839 859
840 860 See Also
841 861 --------
842 862 position_to_cursor: reciprocal of this function
843 863
844 864 """
845 865 lines = text.split('\n')
846 866 assert line <= len(lines), '{} <= {}'.format(str(line), str(len(lines)))
847 867
848 868 return sum(len(l) + 1 for l in lines[:line]) + column
849 869
850 870 def position_to_cursor(text:str, offset:int)->Tuple[int, int]:
851 871 """
852 872 Convert the position of the cursor in text (0 indexed) to a line
853 873 number(0-indexed) and a column number (0-indexed) pair
854 874
855 875 Position should be a valid position in ``text``.
856 876
857 877 Parameters
858 878 ----------
859 879
860 880 text : str
861 881 The text in which to calculate the cursor offset
862 882 offset : int
863 883 Position of the cursor in ``text``, 0-indexed.
864 884
865 885 Return
866 886 ------
867 887 (line, column) : (int, int)
868 888 Line of the cursor; 0-indexed, column of the cursor 0-indexed
869 889
870 890
871 891 See Also
872 892 --------
873 893 cursor_to_position : reciprocal of this function
874 894
875 895
876 896 """
877 897
878 898 assert 0 <= offset <= len(text) , "0 <= %s <= %s" % (offset , len(text))
879 899
880 900 before = text[:offset]
881 901 blines = before.split('\n') # ! splitnes trim trailing \n
882 902 line = before.count('\n')
883 903 col = len(blines[-1])
884 904 return line, col
885 905
886 906
887 907 def _safe_isinstance(obj, module, class_name):
888 908 """Checks if obj is an instance of module.class_name if loaded
889 909 """
890 910 return (module in sys.modules and
891 911 isinstance(obj, getattr(import_module(module), class_name)))
892 912
893 913 def back_unicode_name_matches(text:str) -> Tuple[str, Sequence[str]]:
894 914 """Match Unicode characters back to Unicode name
895 915
896 916 This does ``β˜ƒ`` -> ``\\snowman``
897 917
898 918 Note that snowman is not a valid python3 combining character but will be expanded.
899 919 Though it will not recombine back to the snowman character by the completion machinery.
900 920
901 921 This will not either back-complete standard sequences like \\n, \\b ...
902 922
903 923 Returns
904 924 =======
905 925
906 926 Return a tuple with two elements:
907 927
908 928 - The Unicode character that was matched (preceded with a backslash), or
909 929 empty string,
910 930 - a sequence (of 1), name for the match Unicode character, preceded by
911 931 backslash, or empty if no match.
912 932
913 933 """
914 934 if len(text)<2:
915 935 return '', ()
916 936 maybe_slash = text[-2]
917 937 if maybe_slash != '\\':
918 938 return '', ()
919 939
920 940 char = text[-1]
921 941 # no expand on quote for completion in strings.
922 942 # nor backcomplete standard ascii keys
923 943 if char in string.ascii_letters or char in ('"',"'"):
924 944 return '', ()
925 945 try :
926 946 unic = unicodedata.name(char)
927 947 return '\\'+char,('\\'+unic,)
928 948 except KeyError:
929 949 pass
930 950 return '', ()
931 951
932 952 def back_latex_name_matches(text:str) -> Tuple[str, Sequence[str]] :
933 953 """Match latex characters back to unicode name
934 954
935 955 This does ``\\β„΅`` -> ``\\aleph``
936 956
937 957 """
938 958 if len(text)<2:
939 959 return '', ()
940 960 maybe_slash = text[-2]
941 961 if maybe_slash != '\\':
942 962 return '', ()
943 963
944 964
945 965 char = text[-1]
946 966 # no expand on quote for completion in strings.
947 967 # nor backcomplete standard ascii keys
948 968 if char in string.ascii_letters or char in ('"',"'"):
949 969 return '', ()
950 970 try :
951 971 latex = reverse_latex_symbol[char]
952 972 # '\\' replace the \ as well
953 973 return '\\'+char,[latex]
954 974 except KeyError:
955 975 pass
956 976 return '', ()
957 977
958 978
959 979 def _formatparamchildren(parameter) -> str:
960 980 """
961 981 Get parameter name and value from Jedi Private API
962 982
963 983 Jedi does not expose a simple way to get `param=value` from its API.
964 984
965 985 Parameter
966 986 =========
967 987
968 988 parameter:
969 989 Jedi's function `Param`
970 990
971 991 Returns
972 992 =======
973 993
974 994 A string like 'a', 'b=1', '*args', '**kwargs'
975 995
976 996
977 997 """
978 998 description = parameter.description
979 999 if not description.startswith('param '):
980 1000 raise ValueError('Jedi function parameter description have change format.'
981 1001 'Expected "param ...", found %r".' % description)
982 1002 return description[6:]
983 1003
984 1004 def _make_signature(completion)-> str:
985 1005 """
986 1006 Make the signature from a jedi completion
987 1007
988 1008 Parameter
989 1009 =========
990 1010
991 1011 completion: jedi.Completion
992 1012 object does not complete a function type
993 1013
994 1014 Returns
995 1015 =======
996 1016
997 1017 a string consisting of the function signature, with the parenthesis but
998 1018 without the function name. example:
999 1019 `(a, *args, b=1, **kwargs)`
1000 1020
1001 1021 """
1002 1022
1003 1023 # it looks like this might work on jedi 0.17
1004 1024 if hasattr(completion, 'get_signatures'):
1005 1025 signatures = completion.get_signatures()
1006 1026 if not signatures:
1007 1027 return '(?)'
1008 1028
1009 1029 c0 = completion.get_signatures()[0]
1010 1030 return '('+c0.to_string().split('(', maxsplit=1)[1]
1011 1031
1012 1032 return '(%s)'% ', '.join([f for f in (_formatparamchildren(p) for signature in completion.get_signatures()
1013 1033 for p in signature.defined_names()) if f])
1014 1034
1015 1035
1016 1036 class _CompleteResult(NamedTuple):
1017 1037 matched_text : str
1018 1038 matches: Sequence[str]
1019 1039 matches_origin: Sequence[str]
1020 1040 jedi_matches: Any
1021 1041
1022 1042
1023 1043 class IPCompleter(Completer):
1024 1044 """Extension of the completer class with IPython-specific features"""
1025 1045
1026 1046 __dict_key_regexps: Optional[Dict[bool,Pattern]] = None
1027 1047
1028 1048 @observe('greedy')
1029 1049 def _greedy_changed(self, change):
1030 1050 """update the splitter and readline delims when greedy is changed"""
1031 1051 if change['new']:
1032 1052 self.splitter.delims = GREEDY_DELIMS
1033 1053 else:
1034 1054 self.splitter.delims = DELIMS
1035 1055
1036 1056 dict_keys_only = Bool(False,
1037 1057 help="""Whether to show dict key matches only""")
1038 1058
1039 1059 merge_completions = Bool(True,
1040 1060 help="""Whether to merge completion results into a single list
1041 1061
1042 1062 If False, only the completion results from the first non-empty
1043 1063 completer will be returned.
1044 1064 """
1045 1065 ).tag(config=True)
1046 1066 omit__names = Enum((0,1,2), default_value=2,
1047 1067 help="""Instruct the completer to omit private method names
1048 1068
1049 1069 Specifically, when completing on ``object.<tab>``.
1050 1070
1051 1071 When 2 [default]: all names that start with '_' will be excluded.
1052 1072
1053 1073 When 1: all 'magic' names (``__foo__``) will be excluded.
1054 1074
1055 1075 When 0: nothing will be excluded.
1056 1076 """
1057 1077 ).tag(config=True)
1058 1078 limit_to__all__ = Bool(False,
1059 1079 help="""
1060 1080 DEPRECATED as of version 5.0.
1061 1081
1062 1082 Instruct the completer to use __all__ for the completion
1063 1083
1064 1084 Specifically, when completing on ``object.<tab>``.
1065 1085
1066 1086 When True: only those names in obj.__all__ will be included.
1067 1087
1068 1088 When False [default]: the __all__ attribute is ignored
1069 1089 """,
1070 1090 ).tag(config=True)
1071 1091
1072 1092 profile_completions = Bool(
1073 1093 default_value=False,
1074 1094 help="If True, emit profiling data for completion subsystem using cProfile."
1075 1095 ).tag(config=True)
1076 1096
1077 1097 profiler_output_dir = Unicode(
1078 1098 default_value=".completion_profiles",
1079 1099 help="Template for path at which to output profile data for completions."
1080 1100 ).tag(config=True)
1081 1101
1082 1102 @observe('limit_to__all__')
1083 1103 def _limit_to_all_changed(self, change):
1084 1104 warnings.warn('`IPython.core.IPCompleter.limit_to__all__` configuration '
1085 1105 'value has been deprecated since IPython 5.0, will be made to have '
1086 1106 'no effects and then removed in future version of IPython.',
1087 1107 UserWarning)
1088 1108
1089 1109 def __init__(self, shell=None, namespace=None, global_namespace=None,
1090 1110 use_readline=_deprecation_readline_sentinel, config=None, **kwargs):
1091 1111 """IPCompleter() -> completer
1092 1112
1093 1113 Return a completer object.
1094 1114
1095 1115 Parameters
1096 1116 ----------
1097 1117
1098 1118 shell
1099 1119 a pointer to the ipython shell itself. This is needed
1100 1120 because this completer knows about magic functions, and those can
1101 1121 only be accessed via the ipython instance.
1102 1122
1103 1123 namespace : dict, optional
1104 1124 an optional dict where completions are performed.
1105 1125
1106 1126 global_namespace : dict, optional
1107 1127 secondary optional dict for completions, to
1108 1128 handle cases (such as IPython embedded inside functions) where
1109 1129 both Python scopes are visible.
1110 1130
1111 1131 use_readline : bool, optional
1112 1132 DEPRECATED, ignored since IPython 6.0, will have no effects
1113 1133 """
1114 1134
1115 1135 self.magic_escape = ESC_MAGIC
1116 1136 self.splitter = CompletionSplitter()
1117 1137
1118 1138 if use_readline is not _deprecation_readline_sentinel:
1119 1139 warnings.warn('The `use_readline` parameter is deprecated and ignored since IPython 6.0.',
1120 1140 DeprecationWarning, stacklevel=2)
1121 1141
1122 1142 # _greedy_changed() depends on splitter and readline being defined:
1123 1143 Completer.__init__(self, namespace=namespace, global_namespace=global_namespace,
1124 1144 config=config, **kwargs)
1125 1145
1126 1146 # List where completion matches will be stored
1127 1147 self.matches = []
1128 1148 self.shell = shell
1129 1149 # Regexp to split filenames with spaces in them
1130 1150 self.space_name_re = re.compile(r'([^\\] )')
1131 1151 # Hold a local ref. to glob.glob for speed
1132 1152 self.glob = glob.glob
1133 1153
1134 1154 # Determine if we are running on 'dumb' terminals, like (X)Emacs
1135 1155 # buffers, to avoid completion problems.
1136 1156 term = os.environ.get('TERM','xterm')
1137 1157 self.dumb_terminal = term in ['dumb','emacs']
1138 1158
1139 1159 # Special handling of backslashes needed in win32 platforms
1140 1160 if sys.platform == "win32":
1141 1161 self.clean_glob = self._clean_glob_win32
1142 1162 else:
1143 1163 self.clean_glob = self._clean_glob
1144 1164
1145 1165 #regexp to parse docstring for function signature
1146 1166 self.docstring_sig_re = re.compile(r'^[\w|\s.]+\(([^)]*)\).*')
1147 1167 self.docstring_kwd_re = re.compile(r'[\s|\[]*(\w+)(?:\s*=\s*.*)')
1148 1168 #use this if positional argument name is also needed
1149 1169 #= re.compile(r'[\s|\[]*(\w+)(?:\s*=?\s*.*)')
1150 1170
1151 1171 self.magic_arg_matchers = [
1152 1172 self.magic_config_matches,
1153 1173 self.magic_color_matches,
1154 1174 ]
1155 1175
1156 1176 # This is set externally by InteractiveShell
1157 1177 self.custom_completers = None
1158 1178
1159 1179 # This is a list of names of unicode characters that can be completed
1160 1180 # into their corresponding unicode value. The list is large, so we
1161 1181 # laziliy initialize it on first use. Consuming code should access this
1162 1182 # attribute through the `@unicode_names` property.
1163 1183 self._unicode_names = None
1164 1184
1165 1185 @property
1166 1186 def matchers(self) -> List[Any]:
1167 1187 """All active matcher routines for completion"""
1168 1188 if self.dict_keys_only:
1169 1189 return [self.dict_key_matches]
1170 1190
1171 1191 if self.use_jedi:
1172 1192 return [
1173 1193 *self.custom_matchers,
1174 1194 self.file_matches,
1175 1195 self.magic_matches,
1176 1196 self.dict_key_matches,
1177 1197 ]
1178 1198 else:
1179 1199 return [
1180 1200 *self.custom_matchers,
1181 1201 self.python_matches,
1182 1202 self.file_matches,
1183 1203 self.magic_matches,
1184 1204 self.python_func_kw_matches,
1185 1205 self.dict_key_matches,
1186 1206 ]
1187 1207
1188 1208 def all_completions(self, text:str) -> List[str]:
1189 1209 """
1190 1210 Wrapper around the completion methods for the benefit of emacs.
1191 1211 """
1192 1212 prefix = text.rpartition('.')[0]
1193 1213 with provisionalcompleter():
1194 1214 return ['.'.join([prefix, c.text]) if prefix and self.use_jedi else c.text
1195 1215 for c in self.completions(text, len(text))]
1196 1216
1197 1217 return self.complete(text)[1]
1198 1218
1199 1219 def _clean_glob(self, text:str):
1200 1220 return self.glob("%s*" % text)
1201 1221
1202 1222 def _clean_glob_win32(self, text:str):
1203 1223 return [f.replace("\\","/")
1204 1224 for f in self.glob("%s*" % text)]
1205 1225
1206 1226 def file_matches(self, text:str)->List[str]:
1207 1227 """Match filenames, expanding ~USER type strings.
1208 1228
1209 1229 Most of the seemingly convoluted logic in this completer is an
1210 1230 attempt to handle filenames with spaces in them. And yet it's not
1211 1231 quite perfect, because Python's readline doesn't expose all of the
1212 1232 GNU readline details needed for this to be done correctly.
1213 1233
1214 1234 For a filename with a space in it, the printed completions will be
1215 1235 only the parts after what's already been typed (instead of the
1216 1236 full completions, as is normally done). I don't think with the
1217 1237 current (as of Python 2.3) Python readline it's possible to do
1218 1238 better."""
1219 1239
1220 1240 # chars that require escaping with backslash - i.e. chars
1221 1241 # that readline treats incorrectly as delimiters, but we
1222 1242 # don't want to treat as delimiters in filename matching
1223 1243 # when escaped with backslash
1224 1244 if text.startswith('!'):
1225 1245 text = text[1:]
1226 1246 text_prefix = u'!'
1227 1247 else:
1228 1248 text_prefix = u''
1229 1249
1230 1250 text_until_cursor = self.text_until_cursor
1231 1251 # track strings with open quotes
1232 1252 open_quotes = has_open_quotes(text_until_cursor)
1233 1253
1234 1254 if '(' in text_until_cursor or '[' in text_until_cursor:
1235 1255 lsplit = text
1236 1256 else:
1237 1257 try:
1238 1258 # arg_split ~ shlex.split, but with unicode bugs fixed by us
1239 1259 lsplit = arg_split(text_until_cursor)[-1]
1240 1260 except ValueError:
1241 1261 # typically an unmatched ", or backslash without escaped char.
1242 1262 if open_quotes:
1243 1263 lsplit = text_until_cursor.split(open_quotes)[-1]
1244 1264 else:
1245 1265 return []
1246 1266 except IndexError:
1247 1267 # tab pressed on empty line
1248 1268 lsplit = ""
1249 1269
1250 1270 if not open_quotes and lsplit != protect_filename(lsplit):
1251 1271 # if protectables are found, do matching on the whole escaped name
1252 1272 has_protectables = True
1253 1273 text0,text = text,lsplit
1254 1274 else:
1255 1275 has_protectables = False
1256 1276 text = os.path.expanduser(text)
1257 1277
1258 1278 if text == "":
1259 1279 return [text_prefix + protect_filename(f) for f in self.glob("*")]
1260 1280
1261 1281 # Compute the matches from the filesystem
1262 1282 if sys.platform == 'win32':
1263 1283 m0 = self.clean_glob(text)
1264 1284 else:
1265 1285 m0 = self.clean_glob(text.replace('\\', ''))
1266 1286
1267 1287 if has_protectables:
1268 1288 # If we had protectables, we need to revert our changes to the
1269 1289 # beginning of filename so that we don't double-write the part
1270 1290 # of the filename we have so far
1271 1291 len_lsplit = len(lsplit)
1272 1292 matches = [text_prefix + text0 +
1273 1293 protect_filename(f[len_lsplit:]) for f in m0]
1274 1294 else:
1275 1295 if open_quotes:
1276 1296 # if we have a string with an open quote, we don't need to
1277 1297 # protect the names beyond the quote (and we _shouldn't_, as
1278 1298 # it would cause bugs when the filesystem call is made).
1279 1299 matches = m0 if sys.platform == "win32" else\
1280 1300 [protect_filename(f, open_quotes) for f in m0]
1281 1301 else:
1282 1302 matches = [text_prefix +
1283 1303 protect_filename(f) for f in m0]
1284 1304
1285 1305 # Mark directories in input list by appending '/' to their names.
1286 1306 return [x+'/' if os.path.isdir(x) else x for x in matches]
1287 1307
1288 1308 def magic_matches(self, text:str):
1289 1309 """Match magics"""
1290 1310 # Get all shell magics now rather than statically, so magics loaded at
1291 1311 # runtime show up too.
1292 1312 lsm = self.shell.magics_manager.lsmagic()
1293 1313 line_magics = lsm['line']
1294 1314 cell_magics = lsm['cell']
1295 1315 pre = self.magic_escape
1296 1316 pre2 = pre+pre
1297 1317
1298 1318 explicit_magic = text.startswith(pre)
1299 1319
1300 1320 # Completion logic:
1301 1321 # - user gives %%: only do cell magics
1302 1322 # - user gives %: do both line and cell magics
1303 1323 # - no prefix: do both
1304 1324 # In other words, line magics are skipped if the user gives %% explicitly
1305 1325 #
1306 1326 # We also exclude magics that match any currently visible names:
1307 1327 # https://github.com/ipython/ipython/issues/4877, unless the user has
1308 1328 # typed a %:
1309 1329 # https://github.com/ipython/ipython/issues/10754
1310 1330 bare_text = text.lstrip(pre)
1311 1331 global_matches = self.global_matches(bare_text)
1312 1332 if not explicit_magic:
1313 1333 def matches(magic):
1314 1334 """
1315 1335 Filter magics, in particular remove magics that match
1316 1336 a name present in global namespace.
1317 1337 """
1318 1338 return ( magic.startswith(bare_text) and
1319 1339 magic not in global_matches )
1320 1340 else:
1321 1341 def matches(magic):
1322 1342 return magic.startswith(bare_text)
1323 1343
1324 1344 comp = [ pre2+m for m in cell_magics if matches(m)]
1325 1345 if not text.startswith(pre2):
1326 1346 comp += [ pre+m for m in line_magics if matches(m)]
1327 1347
1328 1348 return comp
1329 1349
1330 1350 def magic_config_matches(self, text:str) -> List[str]:
1331 1351 """ Match class names and attributes for %config magic """
1332 1352 texts = text.strip().split()
1333 1353
1334 1354 if len(texts) > 0 and (texts[0] == 'config' or texts[0] == '%config'):
1335 1355 # get all configuration classes
1336 1356 classes = sorted(set([ c for c in self.shell.configurables
1337 1357 if c.__class__.class_traits(config=True)
1338 1358 ]), key=lambda x: x.__class__.__name__)
1339 1359 classnames = [ c.__class__.__name__ for c in classes ]
1340 1360
1341 1361 # return all classnames if config or %config is given
1342 1362 if len(texts) == 1:
1343 1363 return classnames
1344 1364
1345 1365 # match classname
1346 1366 classname_texts = texts[1].split('.')
1347 1367 classname = classname_texts[0]
1348 1368 classname_matches = [ c for c in classnames
1349 1369 if c.startswith(classname) ]
1350 1370
1351 1371 # return matched classes or the matched class with attributes
1352 1372 if texts[1].find('.') < 0:
1353 1373 return classname_matches
1354 1374 elif len(classname_matches) == 1 and \
1355 1375 classname_matches[0] == classname:
1356 1376 cls = classes[classnames.index(classname)].__class__
1357 1377 help = cls.class_get_help()
1358 1378 # strip leading '--' from cl-args:
1359 1379 help = re.sub(re.compile(r'^--', re.MULTILINE), '', help)
1360 1380 return [ attr.split('=')[0]
1361 1381 for attr in help.strip().splitlines()
1362 1382 if attr.startswith(texts[1]) ]
1363 1383 return []
1364 1384
1365 1385 def magic_color_matches(self, text:str) -> List[str] :
1366 1386 """ Match color schemes for %colors magic"""
1367 1387 texts = text.split()
1368 1388 if text.endswith(' '):
1369 1389 # .split() strips off the trailing whitespace. Add '' back
1370 1390 # so that: '%colors ' -> ['%colors', '']
1371 1391 texts.append('')
1372 1392
1373 1393 if len(texts) == 2 and (texts[0] == 'colors' or texts[0] == '%colors'):
1374 1394 prefix = texts[1]
1375 1395 return [ color for color in InspectColors.keys()
1376 1396 if color.startswith(prefix) ]
1377 1397 return []
1378 1398
1379 1399 def _jedi_matches(self, cursor_column:int, cursor_line:int, text:str) -> Iterable[Any]:
1380 1400 """
1381 1401
1382 1402 Return a list of :any:`jedi.api.Completions` object from a ``text`` and
1383 1403 cursor position.
1384 1404
1385 1405 Parameters
1386 1406 ----------
1387 1407 cursor_column : int
1388 1408 column position of the cursor in ``text``, 0-indexed.
1389 1409 cursor_line : int
1390 1410 line position of the cursor in ``text``, 0-indexed
1391 1411 text : str
1392 1412 text to complete
1393 1413
1394 1414 Debugging
1395 1415 ---------
1396 1416
1397 1417 If ``IPCompleter.debug`` is ``True`` may return a :any:`_FakeJediCompletion`
1398 1418 object containing a string with the Jedi debug information attached.
1399 1419 """
1400 1420 namespaces = [self.namespace]
1401 1421 if self.global_namespace is not None:
1402 1422 namespaces.append(self.global_namespace)
1403 1423
1404 1424 completion_filter = lambda x:x
1405 1425 offset = cursor_to_position(text, cursor_line, cursor_column)
1406 1426 # filter output if we are completing for object members
1407 1427 if offset:
1408 1428 pre = text[offset-1]
1409 1429 if pre == '.':
1410 1430 if self.omit__names == 2:
1411 1431 completion_filter = lambda c:not c.name.startswith('_')
1412 1432 elif self.omit__names == 1:
1413 1433 completion_filter = lambda c:not (c.name.startswith('__') and c.name.endswith('__'))
1414 1434 elif self.omit__names == 0:
1415 1435 completion_filter = lambda x:x
1416 1436 else:
1417 1437 raise ValueError("Don't understand self.omit__names == {}".format(self.omit__names))
1418 1438
1419 1439 interpreter = jedi.Interpreter(text[:offset], namespaces)
1420 1440 try_jedi = True
1421 1441
1422 1442 try:
1423 1443 # find the first token in the current tree -- if it is a ' or " then we are in a string
1424 1444 completing_string = False
1425 1445 try:
1426 1446 first_child = next(c for c in interpreter._get_module().tree_node.children if hasattr(c, 'value'))
1427 1447 except StopIteration:
1428 1448 pass
1429 1449 else:
1430 1450 # note the value may be ', ", or it may also be ''' or """, or
1431 1451 # in some cases, """what/you/typed..., but all of these are
1432 1452 # strings.
1433 1453 completing_string = len(first_child.value) > 0 and first_child.value[0] in {"'", '"'}
1434 1454
1435 1455 # if we are in a string jedi is likely not the right candidate for
1436 1456 # now. Skip it.
1437 1457 try_jedi = not completing_string
1438 1458 except Exception as e:
1439 1459 # many of things can go wrong, we are using private API just don't crash.
1440 1460 if self.debug:
1441 1461 print("Error detecting if completing a non-finished string :", e, '|')
1442 1462
1443 1463 if not try_jedi:
1444 1464 return []
1445 1465 try:
1446 1466 return filter(completion_filter, interpreter.complete(column=cursor_column, line=cursor_line + 1))
1447 1467 except Exception as e:
1448 1468 if self.debug:
1449 1469 return [_FakeJediCompletion('Oops Jedi has crashed, please report a bug with the following:\n"""\n%s\ns"""' % (e))]
1450 1470 else:
1451 1471 return []
1452 1472
1453 1473 def python_matches(self, text:str)->List[str]:
1454 1474 """Match attributes or global python names"""
1455 1475 if "." in text:
1456 1476 try:
1457 1477 matches = self.attr_matches(text)
1458 1478 if text.endswith('.') and self.omit__names:
1459 1479 if self.omit__names == 1:
1460 1480 # true if txt is _not_ a __ name, false otherwise:
1461 1481 no__name = (lambda txt:
1462 1482 re.match(r'.*\.__.*?__',txt) is None)
1463 1483 else:
1464 1484 # true if txt is _not_ a _ name, false otherwise:
1465 1485 no__name = (lambda txt:
1466 1486 re.match(r'\._.*?',txt[txt.rindex('.'):]) is None)
1467 1487 matches = filter(no__name, matches)
1468 1488 except NameError:
1469 1489 # catches <undefined attributes>.<tab>
1470 1490 matches = []
1471 1491 else:
1472 1492 matches = self.global_matches(text)
1473 1493 return matches
1474 1494
1475 1495 def _default_arguments_from_docstring(self, doc):
1476 1496 """Parse the first line of docstring for call signature.
1477 1497
1478 1498 Docstring should be of the form 'min(iterable[, key=func])\n'.
1479 1499 It can also parse cython docstring of the form
1480 1500 'Minuit.migrad(self, int ncall=10000, resume=True, int nsplit=1)'.
1481 1501 """
1482 1502 if doc is None:
1483 1503 return []
1484 1504
1485 1505 #care only the firstline
1486 1506 line = doc.lstrip().splitlines()[0]
1487 1507
1488 1508 #p = re.compile(r'^[\w|\s.]+\(([^)]*)\).*')
1489 1509 #'min(iterable[, key=func])\n' -> 'iterable[, key=func]'
1490 1510 sig = self.docstring_sig_re.search(line)
1491 1511 if sig is None:
1492 1512 return []
1493 1513 # iterable[, key=func]' -> ['iterable[' ,' key=func]']
1494 1514 sig = sig.groups()[0].split(',')
1495 1515 ret = []
1496 1516 for s in sig:
1497 1517 #re.compile(r'[\s|\[]*(\w+)(?:\s*=\s*.*)')
1498 1518 ret += self.docstring_kwd_re.findall(s)
1499 1519 return ret
1500 1520
1501 1521 def _default_arguments(self, obj):
1502 1522 """Return the list of default arguments of obj if it is callable,
1503 1523 or empty list otherwise."""
1504 1524 call_obj = obj
1505 1525 ret = []
1506 1526 if inspect.isbuiltin(obj):
1507 1527 pass
1508 1528 elif not (inspect.isfunction(obj) or inspect.ismethod(obj)):
1509 1529 if inspect.isclass(obj):
1510 1530 #for cython embedsignature=True the constructor docstring
1511 1531 #belongs to the object itself not __init__
1512 1532 ret += self._default_arguments_from_docstring(
1513 1533 getattr(obj, '__doc__', ''))
1514 1534 # for classes, check for __init__,__new__
1515 1535 call_obj = (getattr(obj, '__init__', None) or
1516 1536 getattr(obj, '__new__', None))
1517 1537 # for all others, check if they are __call__able
1518 1538 elif hasattr(obj, '__call__'):
1519 1539 call_obj = obj.__call__
1520 1540 ret += self._default_arguments_from_docstring(
1521 1541 getattr(call_obj, '__doc__', ''))
1522 1542
1523 1543 _keeps = (inspect.Parameter.KEYWORD_ONLY,
1524 1544 inspect.Parameter.POSITIONAL_OR_KEYWORD)
1525 1545
1526 1546 try:
1527 1547 sig = inspect.signature(call_obj)
1528 1548 ret.extend(k for k, v in sig.parameters.items() if
1529 1549 v.kind in _keeps)
1530 1550 except ValueError:
1531 1551 pass
1532 1552
1533 1553 return list(set(ret))
1534 1554
1535 1555 def python_func_kw_matches(self, text):
1536 1556 """Match named parameters (kwargs) of the last open function"""
1537 1557
1538 1558 if "." in text: # a parameter cannot be dotted
1539 1559 return []
1540 1560 try: regexp = self.__funcParamsRegex
1541 1561 except AttributeError:
1542 1562 regexp = self.__funcParamsRegex = re.compile(r'''
1543 1563 '.*?(?<!\\)' | # single quoted strings or
1544 1564 ".*?(?<!\\)" | # double quoted strings or
1545 1565 \w+ | # identifier
1546 1566 \S # other characters
1547 1567 ''', re.VERBOSE | re.DOTALL)
1548 1568 # 1. find the nearest identifier that comes before an unclosed
1549 1569 # parenthesis before the cursor
1550 1570 # e.g. for "foo (1+bar(x), pa<cursor>,a=1)", the candidate is "foo"
1551 1571 tokens = regexp.findall(self.text_until_cursor)
1552 1572 iterTokens = reversed(tokens); openPar = 0
1553 1573
1554 1574 for token in iterTokens:
1555 1575 if token == ')':
1556 1576 openPar -= 1
1557 1577 elif token == '(':
1558 1578 openPar += 1
1559 1579 if openPar > 0:
1560 1580 # found the last unclosed parenthesis
1561 1581 break
1562 1582 else:
1563 1583 return []
1564 1584 # 2. Concatenate dotted names ("foo.bar" for "foo.bar(x, pa" )
1565 1585 ids = []
1566 1586 isId = re.compile(r'\w+$').match
1567 1587
1568 1588 while True:
1569 1589 try:
1570 1590 ids.append(next(iterTokens))
1571 1591 if not isId(ids[-1]):
1572 1592 ids.pop(); break
1573 1593 if not next(iterTokens) == '.':
1574 1594 break
1575 1595 except StopIteration:
1576 1596 break
1577 1597
1578 1598 # Find all named arguments already assigned to, as to avoid suggesting
1579 1599 # them again
1580 1600 usedNamedArgs = set()
1581 1601 par_level = -1
1582 1602 for token, next_token in zip(tokens, tokens[1:]):
1583 1603 if token == '(':
1584 1604 par_level += 1
1585 1605 elif token == ')':
1586 1606 par_level -= 1
1587 1607
1588 1608 if par_level != 0:
1589 1609 continue
1590 1610
1591 1611 if next_token != '=':
1592 1612 continue
1593 1613
1594 1614 usedNamedArgs.add(token)
1595 1615
1596 1616 argMatches = []
1597 1617 try:
1598 1618 callableObj = '.'.join(ids[::-1])
1599 1619 namedArgs = self._default_arguments(eval(callableObj,
1600 1620 self.namespace))
1601 1621
1602 1622 # Remove used named arguments from the list, no need to show twice
1603 1623 for namedArg in set(namedArgs) - usedNamedArgs:
1604 1624 if namedArg.startswith(text):
1605 1625 argMatches.append("%s=" %namedArg)
1606 1626 except:
1607 1627 pass
1608 1628
1609 1629 return argMatches
1610 1630
1611 1631 @staticmethod
1612 1632 def _get_keys(obj: Any) -> List[Any]:
1613 1633 # Objects can define their own completions by defining an
1614 1634 # _ipy_key_completions_() method.
1615 1635 method = get_real_method(obj, '_ipython_key_completions_')
1616 1636 if method is not None:
1617 1637 return method()
1618 1638
1619 1639 # Special case some common in-memory dict-like types
1620 1640 if isinstance(obj, dict) or\
1621 1641 _safe_isinstance(obj, 'pandas', 'DataFrame'):
1622 1642 try:
1623 1643 return list(obj.keys())
1624 1644 except Exception:
1625 1645 return []
1626 1646 elif _safe_isinstance(obj, 'numpy', 'ndarray') or\
1627 1647 _safe_isinstance(obj, 'numpy', 'void'):
1628 1648 return obj.dtype.names or []
1629 1649 return []
1630 1650
1631 1651 def dict_key_matches(self, text:str) -> List[str]:
1632 1652 "Match string keys in a dictionary, after e.g. 'foo[' "
1633 1653
1634 1654
1635 1655 if self.__dict_key_regexps is not None:
1636 1656 regexps = self.__dict_key_regexps
1637 1657 else:
1638 1658 dict_key_re_fmt = r'''(?x)
1639 1659 ( # match dict-referring expression wrt greedy setting
1640 1660 %s
1641 1661 )
1642 1662 \[ # open bracket
1643 1663 \s* # and optional whitespace
1664 # Capture any number of str-like objects (e.g. "a", "b", 'c')
1644 1665 ((?:[uUbB]? # string prefix (r not handled)
1645 1666 (?:
1646 1667 '(?:[^']|(?<!\\)\\')*'
1647 1668 |
1648 1669 "(?:[^"]|(?<!\\)\\")*"
1649 1670 )
1650 1671 \s*,\s*
1651 1672 )*)
1652 1673 ([uUbB]? # string prefix (r not handled)
1653 1674 (?: # unclosed string
1654 1675 '(?:[^']|(?<!\\)\\')*
1655 1676 |
1656 1677 "(?:[^"]|(?<!\\)\\")*
1657 1678 )
1658 1679 )?
1659 1680 $
1660 1681 '''
1661 1682 regexps = self.__dict_key_regexps = {
1662 1683 False: re.compile(dict_key_re_fmt % r'''
1663 1684 # identifiers separated by .
1664 1685 (?!\d)\w+
1665 1686 (?:\.(?!\d)\w+)*
1666 1687 '''),
1667 1688 True: re.compile(dict_key_re_fmt % '''
1668 1689 .+
1669 1690 ''')
1670 1691 }
1671 1692
1672 1693 match = regexps[self.greedy].search(self.text_until_cursor)
1694
1673 1695 if match is None:
1674 1696 return []
1675 1697
1676 expr, prefix = match.groups()
1698 expr, prefix0, prefix = match.groups()
1677 1699 try:
1678 1700 obj = eval(expr, self.namespace)
1679 1701 except Exception:
1680 1702 try:
1681 1703 obj = eval(expr, self.global_namespace)
1682 1704 except Exception:
1683 1705 return []
1684 1706
1685 1707 keys = self._get_keys(obj)
1686 1708 if not keys:
1687 1709 return keys
1688 closing_quote, token_offset, matches = match_dict_keys(keys, prefix, self.splitter.delims)
1710
1711 if prefix0 != '':
1712 tuple_prefix = eval(prefix0)
1713 else:
1714 tuple_prefix = tuple()
1715
1716 closing_quote, token_offset, matches = match_dict_keys(keys, tuple_prefix, prefix, self.splitter.delims)
1689 1717 if not matches:
1690 1718 return matches
1691 1719
1692 1720 # get the cursor position of
1693 1721 # - the text being completed
1694 1722 # - the start of the key text
1695 1723 # - the start of the completion
1696 1724 text_start = len(self.text_until_cursor) - len(text)
1697 1725 if prefix:
1698 key_start = match.start(2)
1726 key_start = match.start(3)
1699 1727 completion_start = key_start + token_offset
1700 1728 else:
1701 1729 key_start = completion_start = match.end()
1702 1730
1703 1731 # grab the leading prefix, to make sure all completions start with `text`
1704 1732 if text_start > key_start:
1705 1733 leading = ''
1706 1734 else:
1707 1735 leading = text[text_start:completion_start]
1708 1736
1709 1737 # the index of the `[` character
1710 1738 bracket_idx = match.end(1)
1711 1739
1712 1740 # append closing quote and bracket as appropriate
1713 1741 # this is *not* appropriate if the opening quote or bracket is outside
1714 1742 # the text given to this method
1715 1743 suf = ''
1716 1744 continuation = self.line_buffer[len(self.text_until_cursor):]
1717 1745 if key_start > text_start and closing_quote:
1718 1746 # quotes were opened inside text, maybe close them
1719 1747 if continuation.startswith(closing_quote):
1720 1748 continuation = continuation[len(closing_quote):]
1721 1749 else:
1722 1750 suf += closing_quote
1723 1751 if bracket_idx > text_start:
1724 1752 # brackets were opened inside text, maybe close them
1725 1753 if not continuation.startswith(']'):
1726 1754 suf += ']'
1727 1755
1728 1756 return [leading + k + suf for k in matches]
1729 1757
1730 1758 @staticmethod
1731 1759 def unicode_name_matches(text:str) -> Tuple[str, List[str]] :
1732 1760 """Match Latex-like syntax for unicode characters base
1733 1761 on the name of the character.
1734 1762
1735 1763 This does ``\\GREEK SMALL LETTER ETA`` -> ``Ξ·``
1736 1764
1737 1765 Works only on valid python 3 identifier, or on combining characters that
1738 1766 will combine to form a valid identifier.
1739 1767 """
1740 1768 slashpos = text.rfind('\\')
1741 1769 if slashpos > -1:
1742 1770 s = text[slashpos+1:]
1743 1771 try :
1744 1772 unic = unicodedata.lookup(s)
1745 1773 # allow combining chars
1746 1774 if ('a'+unic).isidentifier():
1747 1775 return '\\'+s,[unic]
1748 1776 except KeyError:
1749 1777 pass
1750 1778 return '', []
1751 1779
1752 1780
1753 1781 def latex_matches(self, text:str) -> Tuple[str, Sequence[str]]:
1754 1782 """Match Latex syntax for unicode characters.
1755 1783
1756 1784 This does both ``\\alp`` -> ``\\alpha`` and ``\\alpha`` -> ``Ξ±``
1757 1785 """
1758 1786 slashpos = text.rfind('\\')
1759 1787 if slashpos > -1:
1760 1788 s = text[slashpos:]
1761 1789 if s in latex_symbols:
1762 1790 # Try to complete a full latex symbol to unicode
1763 1791 # \\alpha -> Ξ±
1764 1792 return s, [latex_symbols[s]]
1765 1793 else:
1766 1794 # If a user has partially typed a latex symbol, give them
1767 1795 # a full list of options \al -> [\aleph, \alpha]
1768 1796 matches = [k for k in latex_symbols if k.startswith(s)]
1769 1797 if matches:
1770 1798 return s, matches
1771 1799 return '', ()
1772 1800
1773 1801 def dispatch_custom_completer(self, text):
1774 1802 if not self.custom_completers:
1775 1803 return
1776 1804
1777 1805 line = self.line_buffer
1778 1806 if not line.strip():
1779 1807 return None
1780 1808
1781 1809 # Create a little structure to pass all the relevant information about
1782 1810 # the current completion to any custom completer.
1783 1811 event = SimpleNamespace()
1784 1812 event.line = line
1785 1813 event.symbol = text
1786 1814 cmd = line.split(None,1)[0]
1787 1815 event.command = cmd
1788 1816 event.text_until_cursor = self.text_until_cursor
1789 1817
1790 1818 # for foo etc, try also to find completer for %foo
1791 1819 if not cmd.startswith(self.magic_escape):
1792 1820 try_magic = self.custom_completers.s_matches(
1793 1821 self.magic_escape + cmd)
1794 1822 else:
1795 1823 try_magic = []
1796 1824
1797 1825 for c in itertools.chain(self.custom_completers.s_matches(cmd),
1798 1826 try_magic,
1799 1827 self.custom_completers.flat_matches(self.text_until_cursor)):
1800 1828 try:
1801 1829 res = c(event)
1802 1830 if res:
1803 1831 # first, try case sensitive match
1804 1832 withcase = [r for r in res if r.startswith(text)]
1805 1833 if withcase:
1806 1834 return withcase
1807 1835 # if none, then case insensitive ones are ok too
1808 1836 text_low = text.lower()
1809 1837 return [r for r in res if r.lower().startswith(text_low)]
1810 1838 except TryNext:
1811 1839 pass
1812 1840 except KeyboardInterrupt:
1813 1841 """
1814 1842 If custom completer take too long,
1815 1843 let keyboard interrupt abort and return nothing.
1816 1844 """
1817 1845 break
1818 1846
1819 1847 return None
1820 1848
1821 1849 def completions(self, text: str, offset: int)->Iterator[Completion]:
1822 1850 """
1823 1851 Returns an iterator over the possible completions
1824 1852
1825 1853 .. warning:: Unstable
1826 1854
1827 1855 This function is unstable, API may change without warning.
1828 1856 It will also raise unless use in proper context manager.
1829 1857
1830 1858 Parameters
1831 1859 ----------
1832 1860
1833 1861 text:str
1834 1862 Full text of the current input, multi line string.
1835 1863 offset:int
1836 1864 Integer representing the position of the cursor in ``text``. Offset
1837 1865 is 0-based indexed.
1838 1866
1839 1867 Yields
1840 1868 ------
1841 1869 :any:`Completion` object
1842 1870
1843 1871
1844 1872 The cursor on a text can either be seen as being "in between"
1845 1873 characters or "On" a character depending on the interface visible to
1846 1874 the user. For consistency the cursor being on "in between" characters X
1847 1875 and Y is equivalent to the cursor being "on" character Y, that is to say
1848 1876 the character the cursor is on is considered as being after the cursor.
1849 1877
1850 1878 Combining characters may span more that one position in the
1851 1879 text.
1852 1880
1853 1881
1854 1882 .. note::
1855 1883
1856 1884 If ``IPCompleter.debug`` is :any:`True` will yield a ``--jedi/ipython--``
1857 1885 fake Completion token to distinguish completion returned by Jedi
1858 1886 and usual IPython completion.
1859 1887
1860 1888 .. note::
1861 1889
1862 1890 Completions are not completely deduplicated yet. If identical
1863 1891 completions are coming from different sources this function does not
1864 1892 ensure that each completion object will only be present once.
1865 1893 """
1866 1894 warnings.warn("_complete is a provisional API (as of IPython 6.0). "
1867 1895 "It may change without warnings. "
1868 1896 "Use in corresponding context manager.",
1869 1897 category=ProvisionalCompleterWarning, stacklevel=2)
1870 1898
1871 1899 seen = set()
1872 1900 profiler:Optional[cProfile.Profile]
1873 1901 try:
1874 1902 if self.profile_completions:
1875 1903 import cProfile
1876 1904 profiler = cProfile.Profile()
1877 1905 profiler.enable()
1878 1906 else:
1879 1907 profiler = None
1880 1908
1881 1909 for c in self._completions(text, offset, _timeout=self.jedi_compute_type_timeout/1000):
1882 1910 if c and (c in seen):
1883 1911 continue
1884 1912 yield c
1885 1913 seen.add(c)
1886 1914 except KeyboardInterrupt:
1887 1915 """if completions take too long and users send keyboard interrupt,
1888 1916 do not crash and return ASAP. """
1889 1917 pass
1890 1918 finally:
1891 1919 if profiler is not None:
1892 1920 profiler.disable()
1893 1921 ensure_dir_exists(self.profiler_output_dir)
1894 1922 output_path = os.path.join(self.profiler_output_dir, str(uuid.uuid4()))
1895 1923 print("Writing profiler output to", output_path)
1896 1924 profiler.dump_stats(output_path)
1897 1925
1898 1926 def _completions(self, full_text: str, offset: int, *, _timeout) -> Iterator[Completion]:
1899 1927 """
1900 1928 Core completion module.Same signature as :any:`completions`, with the
1901 1929 extra `timeout` parameter (in seconds).
1902 1930
1903 1931
1904 1932 Computing jedi's completion ``.type`` can be quite expensive (it is a
1905 1933 lazy property) and can require some warm-up, more warm up than just
1906 1934 computing the ``name`` of a completion. The warm-up can be :
1907 1935
1908 1936 - Long warm-up the first time a module is encountered after
1909 1937 install/update: actually build parse/inference tree.
1910 1938
1911 1939 - first time the module is encountered in a session: load tree from
1912 1940 disk.
1913 1941
1914 1942 We don't want to block completions for tens of seconds so we give the
1915 1943 completer a "budget" of ``_timeout`` seconds per invocation to compute
1916 1944 completions types, the completions that have not yet been computed will
1917 1945 be marked as "unknown" an will have a chance to be computed next round
1918 1946 are things get cached.
1919 1947
1920 1948 Keep in mind that Jedi is not the only thing treating the completion so
1921 1949 keep the timeout short-ish as if we take more than 0.3 second we still
1922 1950 have lots of processing to do.
1923 1951
1924 1952 """
1925 1953 deadline = time.monotonic() + _timeout
1926 1954
1927 1955
1928 1956 before = full_text[:offset]
1929 1957 cursor_line, cursor_column = position_to_cursor(full_text, offset)
1930 1958
1931 1959 matched_text, matches, matches_origin, jedi_matches = self._complete(
1932 1960 full_text=full_text, cursor_line=cursor_line, cursor_pos=cursor_column)
1933 1961
1934 1962 iter_jm = iter(jedi_matches)
1935 1963 if _timeout:
1936 1964 for jm in iter_jm:
1937 1965 try:
1938 1966 type_ = jm.type
1939 1967 except Exception:
1940 1968 if self.debug:
1941 1969 print("Error in Jedi getting type of ", jm)
1942 1970 type_ = None
1943 1971 delta = len(jm.name_with_symbols) - len(jm.complete)
1944 1972 if type_ == 'function':
1945 1973 signature = _make_signature(jm)
1946 1974 else:
1947 1975 signature = ''
1948 1976 yield Completion(start=offset - delta,
1949 1977 end=offset,
1950 1978 text=jm.name_with_symbols,
1951 1979 type=type_,
1952 1980 signature=signature,
1953 1981 _origin='jedi')
1954 1982
1955 1983 if time.monotonic() > deadline:
1956 1984 break
1957 1985
1958 1986 for jm in iter_jm:
1959 1987 delta = len(jm.name_with_symbols) - len(jm.complete)
1960 1988 yield Completion(start=offset - delta,
1961 1989 end=offset,
1962 1990 text=jm.name_with_symbols,
1963 1991 type='<unknown>', # don't compute type for speed
1964 1992 _origin='jedi',
1965 1993 signature='')
1966 1994
1967 1995
1968 1996 start_offset = before.rfind(matched_text)
1969 1997
1970 1998 # TODO:
1971 1999 # Suppress this, right now just for debug.
1972 2000 if jedi_matches and matches and self.debug:
1973 2001 yield Completion(start=start_offset, end=offset, text='--jedi/ipython--',
1974 2002 _origin='debug', type='none', signature='')
1975 2003
1976 2004 # I'm unsure if this is always true, so let's assert and see if it
1977 2005 # crash
1978 2006 assert before.endswith(matched_text)
1979 2007 for m, t in zip(matches, matches_origin):
1980 2008 yield Completion(start=start_offset, end=offset, text=m, _origin=t, signature='', type='<unknown>')
1981 2009
1982 2010
1983 2011 def complete(self, text=None, line_buffer=None, cursor_pos=None) -> Tuple[str, Sequence[str]]:
1984 2012 """Find completions for the given text and line context.
1985 2013
1986 2014 Note that both the text and the line_buffer are optional, but at least
1987 2015 one of them must be given.
1988 2016
1989 2017 Parameters
1990 2018 ----------
1991 2019 text : string, optional
1992 2020 Text to perform the completion on. If not given, the line buffer
1993 2021 is split using the instance's CompletionSplitter object.
1994 2022
1995 2023 line_buffer : string, optional
1996 2024 If not given, the completer attempts to obtain the current line
1997 2025 buffer via readline. This keyword allows clients which are
1998 2026 requesting for text completions in non-readline contexts to inform
1999 2027 the completer of the entire text.
2000 2028
2001 2029 cursor_pos : int, optional
2002 2030 Index of the cursor in the full line buffer. Should be provided by
2003 2031 remote frontends where kernel has no access to frontend state.
2004 2032
2005 2033 Returns
2006 2034 -------
2007 2035 Tuple of two items:
2008 2036 text : str
2009 2037 Text that was actually used in the completion.
2010 2038 matches : list
2011 2039 A list of completion matches.
2012 2040
2013 2041
2014 2042 .. note::
2015 2043
2016 2044 This API is likely to be deprecated and replaced by
2017 2045 :any:`IPCompleter.completions` in the future.
2018 2046
2019 2047
2020 2048 """
2021 2049 warnings.warn('`Completer.complete` is pending deprecation since '
2022 2050 'IPython 6.0 and will be replaced by `Completer.completions`.',
2023 2051 PendingDeprecationWarning)
2024 2052 # potential todo, FOLD the 3rd throw away argument of _complete
2025 2053 # into the first 2 one.
2026 2054 return self._complete(line_buffer=line_buffer, cursor_pos=cursor_pos, text=text, cursor_line=0)[:2]
2027 2055
2028 2056 def _complete(self, *, cursor_line, cursor_pos, line_buffer=None, text=None,
2029 2057 full_text=None) -> _CompleteResult:
2030 2058 """
2031 2059
2032 2060 Like complete but can also returns raw jedi completions as well as the
2033 2061 origin of the completion text. This could (and should) be made much
2034 2062 cleaner but that will be simpler once we drop the old (and stateful)
2035 2063 :any:`complete` API.
2036 2064
2037 2065
2038 2066 With current provisional API, cursor_pos act both (depending on the
2039 2067 caller) as the offset in the ``text`` or ``line_buffer``, or as the
2040 2068 ``column`` when passing multiline strings this could/should be renamed
2041 2069 but would add extra noise.
2042 2070
2043 2071 Return
2044 2072 ======
2045 2073
2046 2074 A tuple of N elements which are (likely):
2047 2075
2048 2076 matched_text: ? the text that the complete matched
2049 2077 matches: list of completions ?
2050 2078 matches_origin: ? list same lenght as matches, and where each completion came from
2051 2079 jedi_matches: list of Jedi matches, have it's own structure.
2052 2080 """
2053 2081
2054 2082
2055 2083 # if the cursor position isn't given, the only sane assumption we can
2056 2084 # make is that it's at the end of the line (the common case)
2057 2085 if cursor_pos is None:
2058 2086 cursor_pos = len(line_buffer) if text is None else len(text)
2059 2087
2060 2088 if self.use_main_ns:
2061 2089 self.namespace = __main__.__dict__
2062 2090
2063 2091 # if text is either None or an empty string, rely on the line buffer
2064 2092 if (not line_buffer) and full_text:
2065 2093 line_buffer = full_text.split('\n')[cursor_line]
2066 2094 if not text: # issue #11508: check line_buffer before calling split_line
2067 2095 text = self.splitter.split_line(line_buffer, cursor_pos) if line_buffer else ''
2068 2096
2069 2097 if self.backslash_combining_completions:
2070 2098 # allow deactivation of these on windows.
2071 2099 base_text = text if not line_buffer else line_buffer[:cursor_pos]
2072 2100
2073 2101 for meth in (self.latex_matches,
2074 2102 self.unicode_name_matches,
2075 2103 back_latex_name_matches,
2076 2104 back_unicode_name_matches,
2077 2105 self.fwd_unicode_match):
2078 2106 name_text, name_matches = meth(base_text)
2079 2107 if name_text:
2080 2108 return _CompleteResult(name_text, name_matches[:MATCHES_LIMIT], \
2081 2109 [meth.__qualname__]*min(len(name_matches), MATCHES_LIMIT), ())
2082 2110
2083 2111
2084 2112 # If no line buffer is given, assume the input text is all there was
2085 2113 if line_buffer is None:
2086 2114 line_buffer = text
2087 2115
2088 2116 self.line_buffer = line_buffer
2089 2117 self.text_until_cursor = self.line_buffer[:cursor_pos]
2090 2118
2091 2119 # Do magic arg matches
2092 2120 for matcher in self.magic_arg_matchers:
2093 2121 matches = list(matcher(line_buffer))[:MATCHES_LIMIT]
2094 2122 if matches:
2095 2123 origins = [matcher.__qualname__] * len(matches)
2096 2124 return _CompleteResult(text, matches, origins, ())
2097 2125
2098 2126 # Start with a clean slate of completions
2099 2127 matches = []
2100 2128
2101 2129 # FIXME: we should extend our api to return a dict with completions for
2102 2130 # different types of objects. The rlcomplete() method could then
2103 2131 # simply collapse the dict into a list for readline, but we'd have
2104 2132 # richer completion semantics in other environments.
2105 2133 completions:Iterable[Any] = []
2106 2134 if self.use_jedi:
2107 2135 if not full_text:
2108 2136 full_text = line_buffer
2109 2137 completions = self._jedi_matches(
2110 2138 cursor_pos, cursor_line, full_text)
2111 2139
2112 2140 if self.merge_completions:
2113 2141 matches = []
2114 2142 for matcher in self.matchers:
2115 2143 try:
2116 2144 matches.extend([(m, matcher.__qualname__)
2117 2145 for m in matcher(text)])
2118 2146 except:
2119 2147 # Show the ugly traceback if the matcher causes an
2120 2148 # exception, but do NOT crash the kernel!
2121 2149 sys.excepthook(*sys.exc_info())
2122 2150 else:
2123 2151 for matcher in self.matchers:
2124 2152 matches = [(m, matcher.__qualname__)
2125 2153 for m in matcher(text)]
2126 2154 if matches:
2127 2155 break
2128 2156
2129 2157 seen = set()
2130 2158 filtered_matches = set()
2131 2159 for m in matches:
2132 2160 t, c = m
2133 2161 if t not in seen:
2134 2162 filtered_matches.add(m)
2135 2163 seen.add(t)
2136 2164
2137 2165 _filtered_matches = sorted(filtered_matches, key=lambda x: completions_sorting_key(x[0]))
2138 2166
2139 2167 custom_res = [(m, 'custom') for m in self.dispatch_custom_completer(text) or []]
2140 2168
2141 2169 _filtered_matches = custom_res or _filtered_matches
2142 2170
2143 2171 _filtered_matches = _filtered_matches[:MATCHES_LIMIT]
2144 2172 _matches = [m[0] for m in _filtered_matches]
2145 2173 origins = [m[1] for m in _filtered_matches]
2146 2174
2147 2175 self.matches = _matches
2148 2176
2149 2177 return _CompleteResult(text, _matches, origins, completions)
2150 2178
2151 2179 def fwd_unicode_match(self, text:str) -> Tuple[str, Sequence[str]]:
2152 2180 """
2153 2181
2154 2182 Forward match a string starting with a backslash with a list of
2155 2183 potential Unicode completions.
2156 2184
2157 2185 Will compute list list of Unicode character names on first call and cache it.
2158 2186
2159 2187 Return
2160 2188 ======
2161 2189
2162 2190 At tuple with:
2163 2191 - matched text (empty if no matches)
2164 2192 - list of potential completions, empty tuple otherwise)
2165 2193 """
2166 2194 # TODO: self.unicode_names is here a list we traverse each time with ~100k elements.
2167 2195 # We could do a faster match using a Trie.
2168 2196
2169 2197 # Using pygtrie the follwing seem to work:
2170 2198
2171 2199 # s = PrefixSet()
2172 2200
2173 2201 # for c in range(0,0x10FFFF + 1):
2174 2202 # try:
2175 2203 # s.add(unicodedata.name(chr(c)))
2176 2204 # except ValueError:
2177 2205 # pass
2178 2206 # [''.join(k) for k in s.iter(prefix)]
2179 2207
2180 2208 # But need to be timed and adds an extra dependency.
2181 2209
2182 2210 slashpos = text.rfind('\\')
2183 2211 # if text starts with slash
2184 2212 if slashpos > -1:
2185 2213 # PERF: It's important that we don't access self._unicode_names
2186 2214 # until we're inside this if-block. _unicode_names is lazily
2187 2215 # initialized, and it takes a user-noticeable amount of time to
2188 2216 # initialize it, so we don't want to initialize it unless we're
2189 2217 # actually going to use it.
2190 2218 s = text[slashpos+1:]
2191 2219 candidates = [x for x in self.unicode_names if x.startswith(s)]
2192 2220 if candidates:
2193 2221 return s, candidates
2194 2222 else:
2195 2223 return '', ()
2196 2224
2197 2225 # if text does not start with slash
2198 2226 else:
2199 2227 return '', ()
2200 2228
2201 2229 @property
2202 2230 def unicode_names(self) -> List[str]:
2203 2231 """List of names of unicode code points that can be completed.
2204 2232
2205 2233 The list is lazily initialized on first access.
2206 2234 """
2207 2235 if self._unicode_names is None:
2208 2236 names = []
2209 2237 for c in range(0,0x10FFFF + 1):
2210 2238 try:
2211 2239 names.append(unicodedata.name(chr(c)))
2212 2240 except ValueError:
2213 2241 pass
2214 2242 self._unicode_names = _unicode_name_compute(_UNICODE_RANGES)
2215 2243
2216 2244 return self._unicode_names
2217 2245
2218 2246 def _unicode_name_compute(ranges:List[Tuple[int,int]]) -> List[str]:
2219 2247 names = []
2220 2248 for start,stop in ranges:
2221 2249 for c in range(start, stop) :
2222 2250 try:
2223 2251 names.append(unicodedata.name(chr(c)))
2224 2252 except ValueError:
2225 2253 pass
2226 2254 return names
General Comments 0
You need to be logged in to leave comments. Login now