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

`AssertionError`: `assert _xterm_term_title_saved` in WSL (#14480)...

`AssertionError`: `assert _xterm_term_title_saved` in WSL (#14480) `AssertionError`: `assert _xterm_term_title_saved` In some (unknown) situation, it is possible that the `_xterm_term_title_saved` is unset, but the code would make a call to `_restore_term_title_xterm`, resulting in `AssertionError`. At least on replicatable reproduction is returning from `ipython` to `pudb` via `^D^D` on an empty cell. See more details in https://github.com/ipython/ipython/pull/14480 Signed-off-by: Stavros Ntentos <133706+stdedos@users.noreply.github.com> <details> <summary><em>was:</em></summary> In some (unknown) situation, it is possible that the `_xterm_term_title_saved` is unset, but the code would make a call to `_restore_term_title_xterm`, resulting in `AssertionError`. As title stacking does not seem to be getting traction (https://github.com/microsoft/terminal/issues/14575), do not set the `xterm` variants of `_set_term_title` / `_restore_term_title`. WSL detection: https://superuser.com/a/1749811/533196 Additionally, almost-`black` the file. </details>

Matthias Bussonnier - - Load All Authors

File last commit:

r24364:263db0b8


                r28838:9b8cd4a3

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)]