class documentation

class Q(tree.Node):

View In Hierarchy

Encapsulate filters as objects that can then be combined logically (using & and |).
Constant AND Undocumented
Constant OR Undocumented
Method __and__ Undocumented
Method __init__ Construct a new Node. If no connector is given, use the default.
Method __invert__ Undocumented
Method __or__ Undocumented
Method ​_combine Undocumented
Method deconstruct Undocumented
Method resolve​_expression Undocumented
Class Variable conditional Undocumented

Inherited from Node:

Class Method ​_new​_instance No summary
Method __bool__ Return whether or not this node has children.
Method __contains__ Return True if 'other' is a direct child of this instance.
Method __deepcopy__ Undocumented
Method __eq__ Undocumented
Method __hash__ Undocumented
Method __len__ Return the number of children this node has.
Method __repr__ Undocumented
Method __str__ Undocumented
Method add 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.
Method negate Negate the sense of the root connector.
Class Variable default Undocumented
Instance Variable children Undocumented
Instance Variable connector Undocumented
Instance Variable negated Undocumented
AND: str =

Undocumented

Value
'AND'
OR: str =

Undocumented

Value
'OR'
def __and__(self, other):

Undocumented

def __init__(self, *args, _connector=None, _negated=False, **kwargs):
Construct a new Node. If no connector is given, use the default.
def __invert__(self):

Undocumented

def __or__(self, other):

Undocumented

def _combine(self, other, conn):

Undocumented

def deconstruct(self):

Undocumented

def resolve_expression(self, query=None, allow_joins=True, reuse=None, summarize=False, for_save=False):

Undocumented

conditional: bool =

Undocumented