Register a *function* in the toolbox under the name *alias*. You may provide default arguments that will be passed automatically when

Appends a node to the end of the list at the given index.

Register a *function* that will be applied on the sequence each time :meth:`record` is called. :param name: The name of the statistic

Add primitive *primitive* with arity *arity* to the set. If a name *name* is provided, it will replace the attribute __name__ attribut

Apply to the input sequence *data* each registered function and return the results as a dictionary. :param data: Sequence of objects

Enter a record of event in the logbook as a list of key-value pairs. The information are appended chronologically to a list as a dictionary.

Return a list of values associated to the *names* provided in argument in each dictionary of the Statistics object list. One list per

Simplest evaluation function.

Extends the list at the given index with the nodes.

Update the current covariance matrix strategy from the *population*. :param population: A list of individuals from which to update th

Retrieve and delete element *index*. The header and stream will be adjusted to follow the modification. :param item: The index of the

Insert a new individual in the hall of fame using the :func:`~bisect.bisect_right` function. The inserted individual is inserted on th

Decorate *alias* with the specified *decorators*, *alias* has to be a registered function in the current toolbox. :param alias: The n

Register a *function* in each :class:`Statistics` object. :param name: The name of the statistics function as it would appear

Update the hall of fame with the *population* by replacing the worst individuals in it by the best individuals present in *population*

Add a terminal to the set.

Return true if each objective of *self* is not strictly worse than the corresponding objective of *other* and at least one objective is

Returns the index of the individual with the least the hypervolume contribution. The provided *front* should be a set of non-dominated individ

Return a slice object that corresponds to the range of values that defines the subtree which has the element with index *begin* as its

Sort the values in-place based on the connectors in the network.

Add an ephemeral constant to the set.

r"""Generate a population of :math:`\lambda` individuals of type *ind_init* from the current strategy. :param ind_init: A function ob

Add an Automatically Defined Function (ADF) to the set. :param adfset: PrimitiveSetTyped containing the primitives with which

Select two points (indices) in the individual, reverse the order of the attributes between these points [low, high] and return the mutated individ

Rename function arguments with new names from *kargs*.

Update the Pareto front hall of fame with the *population* by adding the individuals from the population that are not dominated by the hall

Return the height of the tree, or the depth of the deepest node.

Remove the specified *index* from the hall of fame. :param index: An integer giving which item to remove.

Add a primitive to the set. :param primitive: callable object or a function. :param in_types: list of primitives arguments' type

Try to sort the **cases** using the network, return the number of misses. If **cases** is None, test all possible cases according to t

Unregister *alias* from the toolbox. :param alias: The name of the operator to remove from the toolbox.

Update the history with the new *individuals*. The index present in their :attr:`history_index` attribute will be used to locate their

Order the peaks to change position, height, width and number.

Determines if the individual is close to valid.

A function returning a valid individual from an invalid one.

Expression generation stops when the depth is equal to height.

A distance function to the feasibility region.

Return an ASCII representation of the network.

Return an ASCII representation of the network.

Generate a tree as a list of primitives and terminals in a depth-first order. The tree is built from the root to the leaves, and it stops growing

Returns whether or not *wvalues2* dominates *wvalues1*. :param wvalues1: The weighted fitness values that would be dominated. :param wvalues2

Compute the match strength for the individual *x* on the string *y*.

Returns all visible maximums value and position sorted with the global maximum first.

Returns the median of *seq* - the numeric value separating the higher half of a sample from the lower half. If there is an even number of elem

Set the current rotation to *matrix*. After decorating the evaluation function, this function will be available directly from the func

Sort the values in-place based on the connectors in the network.

Sort *individuals* in pareto non-dominated fronts using the Generalized Reduced Run-Time Complexity Non-Dominated Sorting Algorithm presented by

Sort the first *k* *individuals* into different nondomination levels using the "Fast Nondominated Sorting Approach" proposed by Deb et al., se

r"""Part of an evolutionary algorithm applying only the variation part (crossover, mutation **or** reproduction). The modified individuals have

Evaluate a given *individual* with the current benchmark configuration. :param indidivudal: The individual to evaluate. :para

Computes the parameters depending on :math:`\lambda`. It needs to be called again if :math:`\lambda` changes during evolution.