Gecko [ fernandoquevedodop.com ]

Name	Size	Permission
__pycache__	[ DIR ]	drwxr-xr-x
translation	[ DIR ]	drwxr-xr-x
__init__.py	0 B	-rw-r--r--
_os.py	2.24 KB	-rw-r--r--
archive.py	7.88 KB	-rw-r--r--
asyncio.py	1.29 KB	-rw-r--r--
autoreload.py	23.67 KB	-rw-r--r--
baseconv.py	2.92 KB	-rw-r--r--
cache.py	15.88 KB	-rw-r--r--
connection.py	2.19 KB	-rw-r--r--
crypto.py	3.07 KB	-rw-r--r--
datastructures.py	9.66 KB	-rw-r--r--
dateformat.py	9.97 KB	-rw-r--r--
dateparse.py	4.78 KB	-rw-r--r--
dates.py	1.97 KB	-rw-r--r--
datetime_safe.py	2.79 KB	-rw-r--r--
deconstruct.py	1.93 KB	-rw-r--r--
decorators.py	6.67 KB	-rw-r--r--
deprecation.py	5.08 KB	-rw-r--r--
duration.py	1.21 KB	-rw-r--r--
encoding.py	9.2 KB	-rw-r--r--
feedgenerator.py	14.75 KB	-rw-r--r--
formats.py	8.82 KB	-rw-r--r--
functional.py	13.81 KB	-rw-r--r--
hashable.py	706 B	-rw-r--r--
html.py	15.19 KB	-rw-r--r--
http.py	17.29 KB	-rw-r--r--
inspect.py	2.23 KB	-rw-r--r--
ipv6.py	1.65 KB	-rw-r--r--
itercompat.py	184 B	-rw-r--r--
jslex.py	7.51 KB	-rw-r--r--
log.py	7.7 KB	-rw-r--r--
lorem_ipsum.py	4.66 KB	-rw-r--r--
module_loading.py	3.51 KB	-rw-r--r--
numberformat.py	3.53 KB	-rw-r--r--
regex_helper.py	12.44 KB	-rw-r--r--
safestring.py	1.72 KB	-rw-r--r--
termcolors.py	7.19 KB	-rw-r--r--
text.py	15.49 KB	-rw-r--r--
timesince.py	3.41 KB	-rw-r--r--
timezone.py	7.98 KB	-rw-r--r--
topological_sort.py	1.18 KB	-rw-r--r--
tree.py	4.8 KB	-rw-r--r--
version.py	3.34 KB	-rw-r--r--
xmlutils.py	1.12 KB	-rw-r--r--

Code Editor : tree.py

"""
A class for storing a tree graph. Primarily used for filter constructs in the
ORM.
"""

import copy

from django.utils.hashable import make_hashable

class Node:
    """
    A single internal node in the tree graph. A Node should be viewed as a
    connection (the root) with the children being either leaf nodes or other
    Node instances.
    """
    # Standard connector type. Clients usually won't use this at all and
    # subclasses will usually override the value.
    default = 'DEFAULT'

def __init__(self, children=None, connector=None, negated=False):
        """Construct a new Node. If no connector is given, use the default."""
        self.children = children[:] if children else []
        self.connector = connector or self.default
        self.negated = negated

# Required because django.db.models.query_utils.Q. Q. __init__() is
    # problematic, but it is a natural Node subclass in all other respects.
    @classmethod
    def _new_instance(cls, children=None, connector=None, negated=False):
        """
        Create a new instance of this class when new Nodes (or subclasses) are
        needed in the internal code in this class. Normally, it just shadows
        __init__(). However, subclasses with an __init__ signature that aren't
        an extension of Node.__init__ might need to implement this method to
        allow a Node to create a new instance of them (if they have any extra
        setting up to do).
        """
        obj = Node(children, connector, negated)
        obj.__class__ = cls
        return obj

def __str__(self):
        template = '(NOT (%s: %s))' if self.negated else '(%s: %s)'
        return template % (self.connector, ', '.join(str(c) for c in self.children))

def __repr__(self):
        return "<%s: %s>" % (self.__class__.__name__, self)

def __deepcopy__(self, memodict):
        obj = Node(connector=self.connector, negated=self.negated)
        obj.__class__ = self.__class__
        obj.children = copy.deepcopy(self.children, memodict)
        return obj

def __len__(self):
        """Return the number of children this node has."""
        return len(self.children)

def __bool__(self):
        """Return whether or not this node has children."""
        return bool(self.children)

def __contains__(self, other):
        """Return True if 'other' is a direct child of this instance."""
        return other in self.children

def __eq__(self, other):
        return (
            self.__class__ == other.__class__ and
            (self.connector, self.negated) == (other.connector, other.negated) and
            self.children == other.children
        )

def __hash__(self):
        return hash((self.__class__, self.connector, self.negated, *make_hashable(self.children)))

def add(self, data, conn_type, squash=True):
        """
        Combine this tree and the data represented by data using the
        connector conn_type. The combine is done by squashing the node other
        away if possible.

This tree (self) will never be pushed to a child node of the
        combined tree, nor will the connector or negated properties change.

Return a node which can be used in place of data regardless if the
        node other got squashed or not.

If `squash` is False the data is prepared and added as a child to
        this tree without further logic.
        """
        if self.connector == conn_type and data in self.children:
            return data
        if not squash:
            self.children.append(data)
            return data
        if self.connector == conn_type:
            # We can reuse self.children to append or squash the node other.
            if (isinstance(data, Node) and not data.negated and
                    (data.connector == conn_type or len(data) == 1)):
                # We can squash the other node's children directly into this
                # node. We are just doing (AB)(CD) == (ABCD) here, with the
                # addition that if the length of the other node is 1 the
                # connector doesn't matter. However, for the len(self) == 1
                # case we don't want to do the squashing, as it would alter
                # self.connector.
                self.children.extend(data.children)
                return self
            else:
                # We could use perhaps additional logic here to see if some
                # children could be used for pushdown here.
                self.children.append(data)
                return data
        else:
            obj = self._new_instance(self.children, self.connector,
                                     self.negated)
            self.connector = conn_type
            self.children = [obj, data]
            return data

def negate(self):
        """Negate the sense of the root connector."""
        self.negated = not self.negated

${this.title}

Code Editor : tree.py