syn.sets.b package

Submodules

syn.sets.b.base module

class syn.sets.b.base.SetNode(**kwargs)

Bases: syn.tree.b.node.Node

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: ()
  • autodoc: True
  • coerce_args: False
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: None
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
complement(universe)
difference(other)
display(**kwargs)

Returns a pretty string representation of the set.

enumerate(**kwargs)
expected_size()
get_one(**kwargs)

Return one element from the set, regardless of sampling bias, without evaluating any sets.

hasmember(item)
intersection(*args)
issubset(other)
issuperset(other)
lazy_enumerate(**kwargs)

Enumerate without evaluating any sets.

lazy_sample(**kwargs)

Sample without evaluating any sets.

sample(**kwargs)

Return a random element from the set. Method should try to avoid introducing a sampling bias.

simplify()
size()

Returns the cardinality of the set.

size_limits()

Returns the lower and upper bounds of set size.

to_set(**kwargs)
union(*args)

syn.sets.b.leaf module

class syn.sets.b.leaf.SetLeaf(**kwargs)

Bases: syn.sets.b.base.SetNode

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: ()
  • autodoc: True
  • coerce_args: True
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: 0
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
class syn.sets.b.leaf.SetWrapper(set, **kwargs)

Bases: syn.sets.b.leaf.SetLeaf

Positional Arguments:

set: set

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: (‘set’,)
  • autodoc: True
  • coerce_args: True
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: 0
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent, set
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
complement(*args, **kwargs)
difference(*args, **kwargs)
display(**kwargs)
enumerate(**kwargs)
hasmember(item)
intersection(*args, **kwargs)
issubset(*args, **kwargs)
issuperset(*args, **kwargs)
sample(**kwargs)
size()
to_set(**kwargs)
union(*args, **kwargs)
class syn.sets.b.leaf.TypeWrapper(type, **kwargs)

Bases: syn.sets.b.leaf.SetLeaf

The idea is that a type implicitly represents the set of all of its
valid instances.

Positional Arguments:

type: Type

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: (‘type’,)
  • autodoc: True
  • coerce_args: False
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: 0
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent, type
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
display(**kwargs)
enumerate(**kwargs)
hasmember(item)
sample(**kwargs)
size()
to_set(**kwargs)
class syn.sets.b.leaf.ClassWrapper(type, **kwargs)

Bases: syn.sets.b.leaf.SetLeaf

The idea is that a type implicitly represents the set of all of its
subclasses, including itself.

Positional Arguments:

type: type

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

subclasses: list (type)

Class Options:

  • args: (‘type’,)
  • autodoc: True
  • coerce_args: True
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: 0
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent, subclasses, type
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
display(**kwargs)
enumerate(**kwargs)
hasmember(item)
sample(**kwargs)
size()
to_set(**kwargs)
class syn.sets.b.leaf.Special(**kwargs)

Bases: syn.sets.b.leaf.SetLeaf

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: ()
  • autodoc: True
  • coerce_args: True
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: 0
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
class syn.sets.b.leaf.Empty(**kwargs)

Bases: syn.sets.b.leaf.Special

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: ()
  • autodoc: True
  • coerce_args: True
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: 0
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
display(**kwargs)
enumerate(**kwargs)
hasmember(other)
issubset(other)
issuperset(other)
overlaps(other)
size()
to_set(**kwargs)

syn.sets.b.operators module

class syn.sets.b.operators.SetOperator(**kwargs)

Bases: syn.sets.b.base.SetNode

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: ()
  • autodoc: True
  • coerce_args: False
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: None
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
display(**kwargs)
enumerate(**kwargs)
get_one(**kwargs)
sample(**kwargs)
size()
symbol = None
class syn.sets.b.operators.Union(**kwargs)

Bases: syn.sets.b.operators.SetOperator

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: ()
  • autodoc: True
  • coerce_args: False
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: None
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
enumerate(**kwargs)
hasmember(other)
sample(**kwargs)
size_limits()
symbol = '|'
to_set(**kwargs)
class syn.sets.b.operators.Intersection(**kwargs)

Bases: syn.sets.b.operators.SetOperator

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: ()
  • autodoc: True
  • coerce_args: False
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: None
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
enumerate(**kwargs)
hasmember(other)
sample(**kwargs)
size_limits()
symbol = '&'
to_set(**kwargs)
class syn.sets.b.operators.Difference(**kwargs)

Bases: syn.sets.b.operators.SetOperator

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: ()
  • autodoc: True
  • coerce_args: False
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: 2
  • min_len: 2
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
A

itemgetter(item, ...) –> itemgetter object

Return a callable object that fetches the given item(s) from its operand. After f = itemgetter(2), the call f(r) returns r[2]. After g = itemgetter(2, 5, 3), the call g(r) returns (r[2], r[5], r[3])

B

itemgetter(item, ...) –> itemgetter object

Return a callable object that fetches the given item(s) from its operand. After f = itemgetter(2), the call f(r) returns r[2]. After g = itemgetter(2, 5, 3), the call g(r) returns (r[2], r[5], r[3])

enumerate(**kwargs)
hasmember(other)
sample(**kwargs)
size_limits()
symbol = '-'
to_set(**kwargs)
class syn.sets.b.operators.Product(**kwargs)

Bases: syn.sets.b.operators.SetOperator

Cartesian Product

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: ()
  • autodoc: True
  • coerce_args: False
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: None
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
enumerate(**kwargs)
hasmember(other)
sample(**kwargs)
size_limits()
symbol = 'x'
to_set(**kwargs)

syn.sets.b.range module

class syn.sets.b.range.Range(lb, ub, **kwargs)

Bases: syn.sets.b.leaf.SetLeaf

Positional Arguments:

lb: int
The lower bound
ub: int
The upper bound

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: (‘lb’, ‘ub’)
  • autodoc: True
  • coerce_args: True
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: 0
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent, lb, ub
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
complement(universe)
difference(other)
display(**kwargs)
enumerate(**kwargs)
hasmember(other)
intersection(*args)
issubset(other)
issuperset(other)
overlaps(other)
sample(**kwargs)
size()
to_set(**kwargs)
union(*args)
validate()
class syn.sets.b.range.IntRange(lb, ub, **kwargs)

Bases: syn.sets.b.range.Range

Positional Arguments:

lb: int
The lower bound
ub: int
The upper bound

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: (‘lb’, ‘ub’)
  • autodoc: True
  • coerce_args: True
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: 0
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent, lb, ub
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
hasmember(other)
class syn.sets.b.range.StrRange(lb=32, ub=126, **kwargs)

Bases: syn.sets.b.range.Range

Positional Arguments:

lb (default = 32): int
The lower bound
ub (default = 126): int
The upper bound

Keyword-Only Arguments:

_id [Optional]: int
Integer id of the node
_list: list
Child nodes
_name [Optional]: basestring
Name of the node (for display purposes)
_node_count: int
The number of nodes in the subtreerooted by this node.
_parent [Optional]: Node
Parent of this node

Class Options:

  • args: (‘lb’, ‘ub’)
  • autodoc: True
  • coerce_args: False
  • descendant_exclude: ()
  • id_equality: False
  • init_validate: False
  • make_hashable: False
  • make_type_object: True
  • max_len: 0
  • min_len: None
  • must_be_root: False
  • optional_none: True
  • register_subclasses: False
  • repr_template:
  • coerce_hooks: ()
  • create_hooks: ()
  • init_hooks: ()
  • init_order: ()
  • metaclass_lookup: (‘coerce_hooks’, ‘init_hooks’, ‘create_hooks’, ‘setstate_hooks’)
  • setstate_hooks: ()

Aliases:

  • _list: _children

Groups:

  • _all: _id, _list, _name, _node_count, _parent, lb, ub
  • copy_copy: _list
  • hash_exclude: _parent
  • generate_exclude: _node_count, _parent
  • _internal: _id, _list, _name, _node_count, _parent
  • repr_exclude: _list, _parent
  • eq_exclude: _parent
  • getstate_exclude: _parent
  • str_exclude: _id, _list, _name, _node_count, _parent
display(**kwargs)
enumerate(**kwargs)
hasmember(other)
sample(**kwargs)
to_set(**kwargs)

Module contents