upstream/mercurial-mirror Files · mercurial/thirdparty/zope/interface/ro.py

mdiff: tweak calls into `bdiff.fixws` to match its type hints...

mdiff: tweak calls into `bdiff.fixws` to match its type hints It turns out that protocol classes can be used for modules too, which is great because all of the dynamically loaded modules (and their attributes) are currently inferred as `Any`. See the next commit for details. A protocol class for the `bdiff` module detected this (trivial) mismatch, so correct it first. The various implementations of this method are typed as taking a `bool`. The `cext` implementation parses its arguments with `PyArg_ParseTuple(args, "Sb:fixws", &s, &allws)`, which wants an `int`. But experimenting in `hg debugshell` under py38, passing `True` or `False` to `cext.fixws()` also works. We can change the implementation to use "p" (which was introduced in py33) instead of "b", but that's beyond the scope of this.

Gregory Szorc - - Load All Authors

File last commit:

r37195:68ee6182 default


                r52825:d94e21b5

default

Download file

             ro.py
        
                    67 lines
            
             | 2.0 KiB
            
                | text/x-python
            
             |
                PythonLexer
            
             / mercurial / thirdparty / zope / interface / ro.py
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      ##############################################################################

      #

      # Copyright (c) 2003 Zope Foundation and Contributors.

      # All Rights Reserved.

      #

      # This software is subject to the provisions of the Zope Public License,

      # Version 2.1 (ZPL).  A copy of the ZPL should accompany this distribution.

      # THIS SOFTWARE IS PROVIDED "AS IS" AND ANY AND ALL EXPRESS OR IMPLIED

      # WARRANTIES ARE DISCLAIMED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED

      # WARRANTIES OF TITLE, MERCHANTABILITY, AGAINST INFRINGEMENT, AND FITNESS

      # FOR A PARTICULAR PURPOSE.

      #

      ##############################################################################

      """Compute a resolution order for an object and its bases

      """

      from __future__ import absolute_import

      __docformat__ = 'restructuredtext'

      def _mergeOrderings(orderings):

          """Merge multiple orderings so that within-ordering order is preserved

          Orderings are constrained in such a way that if an object appears

          in two or more orderings, then the suffix that begins with the

          object must be in both orderings.

          For example:

          >>> _mergeOrderings([

          ... ['x', 'y', 'z'],

          ... ['q', 'z'],

          ... [1, 3, 5],

          ... ['z']

          ... ])

          ['x', 'y', 'q', 1, 3, 5, 'z']

          """

          seen = {}

          result = []

          for ordering in reversed(orderings):

              for o in reversed(ordering):

                  if o not in seen:

                      seen[o] = 1

                      result.insert(0, o)

          return result

      def _flatten(ob):

          result = [ob]

          i = 0

          for ob in iter(result):

              i += 1

              # The recursive calls can be avoided by inserting the base classes

              # into the dynamically growing list directly after the currently

              # considered object;  the iterator makes sure this will keep working

              # in the future, since it cannot rely on the length of the list

              # by definition.

              result[i:i] = ob.__bases__

          return result

      def ro(object):

          """Compute a "resolution order" for an object

          """

          return _mergeOrderings([_flatten(object)])

	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

				##############################################################################
				#
				# Copyright (c) 2003 Zope Foundation and Contributors.
				# All Rights Reserved.
				#
				# This software is subject to the provisions of the Zope Public License,
				# Version 2.1 (ZPL). A copy of the ZPL should accompany this distribution.
				# THIS SOFTWARE IS PROVIDED "AS IS" AND ANY AND ALL EXPRESS OR IMPLIED
				# WARRANTIES ARE DISCLAIMED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
				# WARRANTIES OF TITLE, MERCHANTABILITY, AGAINST INFRINGEMENT, AND FITNESS
				# FOR A PARTICULAR PURPOSE.
				#
				##############################################################################
				"""Compute a resolution order for an object and its bases
				"""

				from __future__ import absolute_import

				__docformat__ = 'restructuredtext'

				def _mergeOrderings(orderings):
				"""Merge multiple orderings so that within-ordering order is preserved

				Orderings are constrained in such a way that if an object appears
				in two or more orderings, then the suffix that begins with the
				object must be in both orderings.

				For example:

				>>> _mergeOrderings([
				... ['x', 'y', 'z'],
				... ['q', 'z'],
				... [1, 3, 5],
				... ['z']
				... ])
				['x', 'y', 'q', 1, 3, 5, 'z']

				"""

				seen = {}
				result = []
				for ordering in reversed(orderings):
				for o in reversed(ordering):
				if o not in seen:
				seen[o] = 1
				result.insert(0, o)

				return result

				def _flatten(ob):
				result = [ob]
				i = 0
				for ob in iter(result):
				i += 1
				# The recursive calls can be avoided by inserting the base classes
				# into the dynamically growing list directly after the currently
				# considered object; the iterator makes sure this will keep working
				# in the future, since it cannot rely on the length of the list
				# by definition.
				result[i:i] = ob.__bases__
				return result


				def ro(object):
				"""Compute a "resolution order" for an object
				"""
				return _mergeOrderings([_flatten(object)])