geneticengine.solutions.tree

Attributes

T

Classes

`LocalSynthesisContext`
`TreeNode`	Base class for protocol classes.
`PrettyPrintable`
`GengyList`	Built-in mutable sequence.

Module Contents

class geneticengine.solutions.tree.LocalSynthesisContext

depth: int

nodes: int

expansions: int

dependent_values: dict[str, Any]

parent_values: list[dict[str, Any]]

class geneticengine.solutions.tree.TreeNode

Bases: Protocol

Base class for protocol classes.

Protocol classes are defined as:

class Proto(Protocol):
    def meth(self) -> int:
        ...

Such classes are primarily used with static type checkers that recognize structural subtyping (static duck-typing).

For example:

class C:
    def meth(self) -> int:
        return 0

def func(x: Proto) -> int:
    return x.meth()

func(C())  # Passes static type check

See PEP 544 for details. Protocol classes decorated with @typing.runtime_checkable act as simple-minded runtime protocols that check only the presence of given attributes, ignoring their type signatures. Protocol classes can be generic, they are defined as:

class GenProto[T](Protocol):
    def meth(self) -> T:
        ...

gengy_labeled: bool

gengy_distance_to_term: int

gengy_nodes: int

gengy_weighted_nodes: int

gengy_types_this_way: dict[type, list[Any]]

gengy_init_values: tuple[Any]

gengy_synthesis_context: LocalSynthesisContext

class geneticengine.solutions.tree.PrettyPrintable

__repr__()

geneticengine.solutions.tree.T

class geneticengine.solutions.tree.GengyList(typ, vals)

Bases: list, Generic[T]

Built-in mutable sequence.

If no argument is given, the constructor creates a new empty list. The argument must be an iterable if specified.

Initialize self. See help(type(self)) for accurate signature.

typ

gengy_init_values

new_like(*newargs)

Return type:: GengyList[T]

__hash__()

__add__(value)

Return self+value.

Return type:: GengyList[T]