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

commit: set whole manifest entries at once (node with its associated flags)...

commit: set whole manifest entries at once (node with its associated flags) Add a new function manifest.set that sets whole manifest entries at once, so the caller doesn't have to do two separate operations: m[p] = n m.set_flags(f) becomes: m.set(p, n, f) This obviously saves an extra lookup by path, and it also lets the underlying manifest implementation to be more efficient as it doesn't have to deal with partially-specified entries. It makes the interaction conceptually simpler, as well, since we don't have to go through an intermediate state of incorrect partially-written entry. (the real motivation for this change is an alternative manifest implementation where we batch pending writes, and dealing with fully defined entries makes the batching logic muchsimpler while avoiding slowdown due to alternating writes and reads)

Gregory Szorc - - Load All Authors

File last commit:

r37195:68ee6182 default


                r52651:421c9b3f

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