Gecko [ 37julay.space ]

Name	Size	Permission	Date
__pycache__	[ DIR ]	drwxr-xr-x	2024-01-22 04:29
common	[ DIR ]	drwxr-xr-x	2024-01-22 04:29
__init__.py	3.33 KB	-rw-r--r--	2018-10-23 20:17
_compat.py	1.65 KB	-rw-r--r--	2018-10-23 20:17
_flatten.py	1.03 KB	-rw-r--r--	2018-10-23 20:17
_zope_interface_coptimizations.cpython-36m-x86_64-linux-gnu.so	32.54 KB	-rwxr-xr-x	2019-07-22 21:46
adapter.py	22.87 KB	-rw-r--r--	2018-10-23 20:17
advice.py	7.31 KB	-rw-r--r--	2018-10-23 20:17
declarations.py	30.85 KB	-rw-r--r--	2018-10-23 20:17
document.py	3.89 KB	-rw-r--r--	2018-10-23 20:17
exceptions.py	1.95 KB	-rw-r--r--	2018-10-23 20:17
interface.py	20.02 KB	-rw-r--r--	2018-10-23 20:17
interfaces.py	42.11 KB	-rw-r--r--	2018-10-23 20:17
registry.py	22.74 KB	-rw-r--r--	2018-10-23 20:17
ro.py	1.96 KB	-rw-r--r--	2018-10-23 20:17
verify.py	4.78 KB	-rw-r--r--	2018-10-23 20:17

Rename

##############################################################################
#
# 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
"""
__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)])