- Generated by
1.9.1
|
CAL
3.0.0
An External Memory Decision Diagram Library
|
This is the complete list of members for Cal, including all inherited members.
| And(const BDD &f, const BDD &g) | Cal | inline |
| And(IT begin, IT end) | Cal | inline |
| And(const Container &c) | Cal | inline |
| AssociationInit(IT begin, IT end, const bool pairs=false) | Cal | inline |
| AssociationQuit(int i) | Cal | inline |
| AssociationSetCurrent(int i) | Cal | inline |
| Between(const BDD &fMin, const BDD &fMax) | Cal | inline |
| BF enum value (defined in Cal) | Cal | |
| Cal() | Cal | inline |
| Cal(unsigned int numVars) | Cal | inline |
| Cal(const Cal &o)=delete (defined in Cal) | Cal | |
| Cal(Cal &&o) | Cal | inline |
| Cofactor(const BDD &f, const BDD &c) | Cal | inline |
| Compose(const BDD &f, const BDD &g, const BDD &h) | Cal | inline |
| CreateNewVarAfter(const BDD &x) | Cal | inline |
| CreateNewVarBefore(const BDD &x) | Cal | inline |
| CreateNewVarFirst() | Cal | inline |
| CreateNewVarLast() | Cal | inline |
| DependsOn(const BDD &f, const BDD &var) const | Cal | inline |
| DF enum value (defined in Cal) | Cal | |
| DynamicReordering(ReorderTechnique technique, ReorderMethod method=ReorderMethod::DF) | Cal | inline |
| Else(const BDD &f) | Cal | inline |
| Exists(const BDD &f) | Cal | inline |
| ForAll(const BDD &f) | Cal | inline |
| FunctionPrint(const BDD &f, std::string &name) const | Cal | inline |
| FunctionProfile(const BDD &f) const | Cal | inline |
| FunctionProfile(IT begin, IT end) const | Cal | inline |
| FunctionProfile(const Container &c) const | Cal | inline |
| GC() | Cal | inline |
| Id(Id_t id) const | Cal | inline |
| Identity(const BDD &f) | Cal | inline |
| If(const BDD &f) const | Cal | inline |
| IfId(const BDD &f) const | Cal | inline |
| IfIndex(const BDD &f) const | Cal | inline |
| Implies(const BDD &f, const BDD &g) | Cal | inline |
| Index(Index_t idx) const | Cal | inline |
| Intersects(const BDD &f, const BDD &g) | Cal | inline |
| IsConst(const BDD &f) const | Cal | inline |
| IsCube(const BDD &f) const | Cal | inline |
| IsEqual(const BDD &f, const BDD &g) const | Cal | inline |
| IsNull(const BDD &f) const | Cal | inline |
| IsOne(const BDD &f) const | Cal | inline |
| IsZero(const BDD &f) const | Cal | inline |
| ITE(const BDD &f, const BDD &g, const BDD &h) | Cal | inline |
| Nand(const BDD &f, const BDD &g) | Cal | inline |
| NodeLimit(long newLimit) | Cal | inline |
| Nodes() const | Cal | inline |
| None enum value (defined in Cal) | Cal | |
| Nor(const BDD &f, const BDD &g) | Cal | inline |
| Not(const BDD &f) | Cal | inline |
| Null() const | Cal | inline |
| One() const | Cal | inline |
| Or(const BDD &f, const BDD &g) | Cal | inline |
| Or(IT begin, IT end) | Cal | inline |
| Or(const Container &c) | Cal | inline |
| Overflow() const | Cal | inline |
| PairwiseAnd(IT begin, IT end) | Cal | inline |
| PairwiseAnd(const Container &c) | Cal | inline |
| PairwiseOr(IT begin, IT end) | Cal | inline |
| PairwiseOr(const Container &c) | Cal | inline |
| PairwiseXor(IT begin, IT end) | Cal | inline |
| PairwiseXor(const Container &c) | Cal | inline |
| Print(const BDD &f, FILE *fp=stdout) const | Cal | inline |
| PrintFunctionProfile(const BDD &f, int lineLength=79, FILE *fp=stdout) const | Cal | inline |
| PrintFunctionProfile(IT begin, IT end, int lineLength=79, FILE *fp=stdout) const | Cal | inline |
| PrintFunctionProfile(const Container &c, int lineLength=79, FILE *fp=stdout) const | Cal | inline |
| PrintProfile(const BDD &f, int lineLength=79, FILE *fp=stdout) const | Cal | inline |
| PrintProfile(IT begin, IT end, int lineLength=79, FILE *fp=stdout) const | Cal | inline |
| PrintProfile(const Container &c, int lineLength=79, FILE *fp=stdout) const | Cal | inline |
| Profile(const BDD &f, bool negout=true) const | Cal | inline |
| Profile(IT begin, IT end, bool negout=true) const | Cal | inline |
| Profile(const Container &c, bool negout=true) const | Cal | inline |
| Reduce(const BDD &f, const BDD &c) | Cal | inline |
| Regular(const BDD &f) | Cal | inline |
| RelProd(const BDD &f, const BDD &g) | Cal | inline |
| Reorder() | Cal | inline |
| ReorderMethod enum name | Cal | |
| ReorderTechnique enum name | Cal | |
| Satisfy(const BDD &f) | Cal | inline |
| SatisfyingFraction(const BDD &f) | Cal | inline |
| SatisfySupport(const BDD &f) | Cal | inline |
| SetGCLimit() | Cal | inline |
| SetGCMode(bool enableGC) | Cal | inline |
| SetParameters(long reorderingThreshold, long maxForwardedNodes, double repackAfterGCThreshold, double tableRepackThreshold) | Cal | inline |
| Sift enum value (defined in Cal) | Cal | |
| Size(const BDD &f, bool negout=true) | Cal | inline |
| Size(IT begin, IT end, bool negout=true) | Cal | inline |
| Size(Container c, bool negout=true) | Cal | inline |
| Stats(FILE *fp=stdout) const | Cal | inline |
| Substitute(const BDD &f) | Cal | inline |
| SwapVars(const BDD &f, const BDD &g, const BDD &h) | Cal | inline |
| TempAssociationAugment(IT begin, const IT end, const bool pairs=false) | Cal | inline |
| TempAssociationInit(IT begin, const IT end, const bool pairs=false) | Cal | inline |
| TempAssociationQuit() | Cal | inline |
| Then(const BDD &f) | Cal | inline |
| TotalSize() const | Cal | inline |
| Vars() const | Cal | inline |
| VarSubstitute(const BDD &f) (defined in Cal) | Cal | inline |
| Window enum value (defined in Cal) | Cal | |
| Xnor(const BDD &f, const BDD &g) | Cal | inline |
| Xor(const BDD &f, const BDD &g) | Cal | inline |
| Xor(IT begin, IT end) | Cal | inline |
| Xor(const Container &c) | Cal | inline |
| Zero() const | Cal | inline |
| ~Cal() | Cal | inline |
1.9.1