Expand description
Traits and implementations of truth-tables.
Modules§
- canonization
- Exact NPN (negation-permutation-negation) canonization of truth tables based on brute-force search. Boolean functions can be categorized in equivalence classes such that members of a class can be transformed into eachother by applying negations on the inputs, permuting the inputs and possibly negating the output. Each NPN class has the same combinational complexity, i.e. its members share the same size-optimal implementation as a boolean network.
- small_
lut - Represent boolean functions with few inputs and one output as truth tables which are compactly stored in the bits of machine-type integers.
Traits§
- Partial
Truth Table - Abstraction for accessing and evaluating a partially defined truth-table.
- Truth
Table - Abstraction for accessing and evaluating a truth-table.
- Truth
Table Edit - Abstraction for modifying a truth-table.