|
Adiar 2.1.0
An External Memory Decision Diagram Library
|
Predicative information on ZDDs. More...
Functions | |
| bool | adiar::zdd_iscanonical (const zdd &A) |
| Check whether a given ZDD is canonical. | |
| bool | adiar::zdd_isterminal (const zdd &A) |
| Whether this ZDD represents a terminal. | |
| bool | adiar::zdd_isfalse (const zdd &A) |
| Whether this ZDD is the false terminal. | |
| bool | adiar::zdd_isempty (const zdd &A) |
| Whether it is the empty family, i.e. Ø . | |
| bool | adiar::zdd_istrue (const zdd &A) |
| Whether this ZDD is the true terminal. | |
| bool | adiar::zdd_isnull (const zdd &A) |
| Whether it is the null family, i.e. { Ø } . | |
| bool | adiar::zdd_ispoint (const zdd &A) |
Whether it contains a single bit-vector a, i.e. A = { a }. | |
| bool | adiar::zdd_equal (const zdd &A, const zdd &B) |
| Whether they represent the same family. | |
| bool | adiar::operator== (const zdd &lhs, const zdd &rhs) |
| bool | adiar::zdd_unequal (const zdd &A, const zdd &B) |
| Whether they represent two different families. | |
| bool | adiar::operator!= (const zdd &lhs, const zdd &rhs) |
| bool | adiar::zdd_subseteq (const zdd &A, const zdd &B) |
| Whether one family is a subset or equal to the other. | |
| bool | adiar::operator<= (const zdd &lhs, const zdd &rhs) |
| bool | adiar::operator>= (const zdd &lhs, const zdd &rhs) |
| bool | adiar::zdd_subset (const zdd &A, const zdd &B) |
| Whether one family is a strict subset of the other. | |
| bool | adiar::operator< (const zdd &lhs, const zdd &rhs) |
| bool | adiar::operator> (const zdd &lhs, const zdd &rhs) |
| bool | adiar::zdd_disjoint (const zdd &A, const zdd &B) |
| Whether the two families are disjoint. | |
Predicative information on ZDDs.
Whether it is the empty family, i.e. Ø .
If this is used as a branch conditional, then one can also resort to merely test on A itself. That is, one can write: if (A) then { /* !zdd_isempty(A) *‍/ } else { /* zdd_isempty(A) *‍/ }