upstream/ipython Files · IPython/utils/data.py

Try to elide long completion based on user input....

Try to elide long completion based on user input. If what the user has typed is already in the completion and the completion is really long, try to elide what the user has already typed from the displayed text of the completion. Keep the first 3 and last 3 of what is already present. This will behave weirdly if all the completion have a common prefix as I believe prompt toolkit will insert the common prefix (or do we?). I'll have to check how to consider the common prefix as being typed.

Matthias Bussonnier - - Load All Authors

File last commit:

r24364:263db0b8


                r25689:d5704fdc

Download file

             data.py
        
                    30 lines
            
             | 1015 B
            
                | text/x-python
            
             |
                PythonLexer
            
             / IPython / utils / data.py
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      # encoding: utf-8

      """Utilities for working with data structures like lists, dicts and tuples.

      """

      #-----------------------------------------------------------------------------

      #  Copyright (C) 2008-2011  The IPython Development Team

      #

      #  Distributed under the terms of the BSD License.  The full license is in

      #  the file COPYING, distributed as part of this software.

      #-----------------------------------------------------------------------------

      def uniq_stable(elems):

          """uniq_stable(elems) -> list

          Return from an iterable, a list of all the unique elements in the input,

          but maintaining the order in which they first appear.

          Note: All elements in the input must be hashable for this routine

          to work, as it internally uses a set for efficiency reasons.

          """

          seen = set()

          return [x for x in elems if x not in seen and not seen.add(x)]

      def chop(seq, size):

          """Chop a sequence into chunks of the given size."""

          return [seq[i:i+size] for i in range(0,len(seq),size)]

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				# encoding: utf-8
				"""Utilities for working with data structures like lists, dicts and tuples.
				"""

				#-----------------------------------------------------------------------------
				# Copyright (C) 2008-2011 The IPython Development Team
				#
				# Distributed under the terms of the BSD License. The full license is in
				# the file COPYING, distributed as part of this software.
				#-----------------------------------------------------------------------------


				def uniq_stable(elems):
				"""uniq_stable(elems) -> list

				Return from an iterable, a list of all the unique elements in the input,
				but maintaining the order in which they first appear.

				Note: All elements in the input must be hashable for this routine
				to work, as it internally uses a set for efficiency reasons.
				"""
				seen = set()
				return [x for x in elems if x not in seen and not seen.add(x)]


				def chop(seq, size):
				"""Chop a sequence into chunks of the given size."""
				return [seq[i:i+size] for i in range(0,len(seq),size)]