Class SolutionDict

source code

       object --+                
                |                
    _abcoll.Sized --+            
                    |            
       object --+   |            
                |   |            
 _abcoll.Iterable --+            
                    |            
       object --+   |            
                |   |            
_abcoll.Container --+            
                    |            
      _abcoll.Mapping --+        
                        |        
   _abcoll.MutableMapping --+    
                            |    
              DerivedDictBase --+
                                |
                               SolutionDict

Known Subclasses:

• CMASolutionDict

dictionary with computation of an hash key.

The hash key is generated from the inserted solution and a stack of previously inserted same solutions is provided. Each entry is meant to store additional information related to the solution.

>>> import cma, numpy as np
>>> d = cma.SolutionDict()
>>> x = np.array([1,2,4])
>>> d[x] = {'f': sum(x**2), 'iteration': 1}
>>> assert d[x]['iteration'] == 1
>>> assert d.get(x) == (d[x] if d.key(x) in d.keys() else None)

TODO: data_with_same_key behaves like a stack (see setitem and delitem), but rather should behave like a queue?! A queue is less consistent with the operation self[key] = ..., if self.data_with_same_key[key] is not empty.

TODO: iteration key is used to clean up without error management