New in Version 0.9.397
Released 26 Jul 2012
- New unique table.
- New iterator implementation for dd_edgeclass.
- Using fine-grained identity reduction rules.
- Lots of code reorganization and cleanup.
Simple Interface Changes
- Iterators have been replaced with enumerators.
The old code segment
    for (dd_edge::const_iterator i = e.begin(); i; ++i)should be replaced by for (enumerator i(e); i; ++i)and most other iteratorfunctionality has been included in theenumeratorclass.
- 
    Removed findFirstElementmethods, the same behavior can be obtained with enumerators.
- Removed createSubmatrixmethods, the same behavior can be obtained with the cross product and intersection operators.
Expert Interface Changes
- 
    Added node_buildersubclass, updated operations to use it. This is the mechanism to use for building new nodes.
- 
    Added node_readersubclass, updated operations to use it. This is the mechanism to use for reading nodes in a forest.
- 
    Removed most of the old interface for accessing nodes. 
- 
    Removed temporary edges.