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

restore master behavior...

restore master behavior up arrow at the top line first goes to char 0, and only goes to the cell above if already on char 0. Same with down arrow on the bottom line: transition cursor to the end of the line, and only go down a cell if already at the end of the last line. this makes for an unhappy experience in code-mirror's vim mode for j and k keys, but we'll fix that in the next commit

Thomas Kluyver - - Load All Authors

File last commit:

r13356:0a3c3bee


                r15835:dc3c98b8

Download file

             data.py
        
                    37 lines
            
             | 1.2 KiB
            
                | 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.

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

      from .py3compat import xrange

      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 flatten(seq):

          """Flatten a list of lists (NOT recursive, only works for 2d lists)."""

          return [x for subseq in seq for x in subseq]

      def chop(seq, size):

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

          return [seq[i:i+size] for i in xrange(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.
				#-----------------------------------------------------------------------------

				from .py3compat import xrange

				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 flatten(seq):
				"""Flatten a list of lists (NOT recursive, only works for 2d lists)."""

				return [x for subseq in seq for x in subseq]


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