class documentation

class _CMASolutionDict_functional(_SolutionDict):

Constructor: _CMASolutionDict_functional(*args, **kwargs)

View In Hierarchy

Undocumented

Method __init__ Undocumented
Method insert insert an entry with key key and value value if value is not None else {'geno':key} and self[key]['kwarg'] = kwarg if kwarg is not None for the further kwargs.
Instance Variable last_iteration Undocumented
Instance Variable last_solution_index Undocumented

Inherited from SolutionDict:

Method __contains__ Undocumented
Method __delitem__ remove only most current key-entry of list with same keys
Method __getitem__ define access self[key]
Method __setitem__ define self[key] = value
Method key compute key of x
Method truncate truncate to max_len/2 when len(self) > max_len.
Method truncate_to truncate to length len_ removing the oldest entries
Instance Variable data_with_same_key Undocumented
Instance Variable _unhashed_keys Undocumented

Inherited from DerivedDictBase (via SolutionDict):

Method __iter__ Undocumented
Method __len__ Undocumented
Instance Variable data Undocumented
def __init__(self, *args, **kwargs):
def insert(self, key, geno=None, iteration=None, fitness=None, value=None, cma_norm=None):

insert an entry with key key and value value if value is not None else {'geno':key} and self[key]['kwarg'] = kwarg if kwarg is not None for the further kwargs.

TODO: this looks overdesigned. Only the keyword iteration is currently used and not even necessary anymore because SolutionDict is now ordered. Just using SolutionDict would be good enough with insertions done using a dict as value if desired, or a single info argument could be implemented in SolutionDict for any additional information.

last_iteration =
last_solution_index: int =

Undocumented