All Classes and Interfaces
Class
Description
Binary Decision Diagrams (BDDs) are used for efficient computation of many common problems.
Iterator that returns all satisfying assignments as byte arrays.
BDDIterator is used to iterate through the satisfying assignments of a BDD.
BDDToString is used to specify the printing behavior of BDDs with domains.
Bit vector implementation for BDDs.
Represents a domain of BDD variables.
An exception caused by an invalid BDD operation.
Interface for the creation and manipulation of BDDs.
Enumeration class for binary operations on BDDs.
Stores statistics about the operator cache.
Operator cache statistics callback.
Continuously BDD nodes usage and BDD operations statistics callback.
Stores statistics about garbage collections.
Garbage collection statistics callback.
LoadHash is used to hash during loading.
Stores statistics about the maximum memory usage.
Maximum memory usage statistics callback.
Stores statistics about the maximum BDD nodes usage.
Maximum BDD nodes usage statistics callback.
Enumeration class for method reordering techniques.
Stores statistics about the last variable reordering.
Variable reorder statistics callback.
Node table resize statistics callback.
Saturation callback with debug information, notably the BDDs before and after applying a transition.
Saturation callback with simple information.
A shared superclass for BDD factories that refer to BDDs as ints.
Encodes a table of variable pairs.
Some BDD methods, namely
exist(), forall(), unique(), relprod(), applyAll(),
applyEx(), applyUni(), and satCount() take a BDDVarSet argument.Default implementation of BDDVarSet based on BDDs.
BitString implements a vector of bits much like java.util.BitSet, except that this
implementation actually works.Abstract bit string iterator class.
Find best order.
This is a 100% Java implementation of the BDD factory.
Try var order.