C# Class Microsoft.Automata.BDD

Represents a Binary Decision Diagram.
Afficher le fichier Open project: AutomataDotNet/Automata Class Usage Examples

Méthodes publiques

Свойство Type Description
One BDD
Ordinal int
Zero BDD

Protected Properties

Свойство Type Description
algebra IBDDAlgebra

Méthodes publiques

Méthode Description
And ( BDD other ) : BDD
CountNodes ( ) : int

Counts the number of nodes (both terminals and nonterminals) in the BDD.
Diff ( BDD other ) : BDD
GetMin ( ) : ulong

Gets the lexicographically minimum bitvector in this BDD as a ulong. Assumes that this BDD is nonempty and that its ordinal is at most 63.
Not ( ) : BDD
Or ( BDD other ) : BDD
ShiftLeft ( int k = 1 ) : BDD

Increment the ordinals of all nodes by k, k must be nonnegative.
ShiftRight ( int k = 1 ) : BDD

Decrement the ordinals of all nodes by k, k must be nonnegative.
ToDot ( string file ) : void

Store the BDD as a graph in the given file.
ToRanges ( int bound ) : uint>[].Pair
ToString ( ) : string

Méthodes protégées

Méthode Description
PrintLeaf ( ) : string

Private Methods

Méthode Description
BDD ( ) : System
BDD ( IBDDAlgebra algebra, int ordinal ) : System
BDD ( IBDDAlgebra algebra, int ordinal, BDD one, BDD zero ) : System
EnumCases ( ) : IEnumerable
MkAny ( int k ) : string

Method Details

And() public méthode

public And ( BDD other ) : BDD
other BDD
Résultat BDD

CountNodes() public méthode

Counts the number of nodes (both terminals and nonterminals) in the BDD.
public CountNodes ( ) : int
Résultat int

Diff() public méthode

public Diff ( BDD other ) : BDD
other BDD
Résultat BDD

GetMin() public méthode

Gets the lexicographically minimum bitvector in this BDD as a ulong. Assumes that this BDD is nonempty and that its ordinal is at most 63.
public GetMin ( ) : ulong
Résultat ulong

Not() public méthode

public Not ( ) : BDD
Résultat BDD

Or() public méthode

public Or ( BDD other ) : BDD
other BDD
Résultat BDD

PrintLeaf() protected méthode

protected PrintLeaf ( ) : string
Résultat string

ShiftLeft() public méthode

Increment the ordinals of all nodes by k, k must be nonnegative.
public ShiftLeft ( int k = 1 ) : BDD
k int offset
Résultat BDD

ShiftRight() public méthode

Decrement the ordinals of all nodes by k, k must be nonnegative.
public ShiftRight ( int k = 1 ) : BDD
k int offset
Résultat BDD

ToDot() public méthode

Store the BDD as a graph in the given file.
public ToDot ( string file ) : void
file string
Résultat void

ToRanges() public méthode

public ToRanges ( int bound ) : uint>[].Pair
bound int
Résultat uint>[].Pair

ToString() public méthode

public ToString ( ) : string
Résultat string

Property Details

One public_oe property

The encoding of the set for lower ordinals for the case when the current bit is 1. The value is null iff IsLeaf is true.
public BDD,Microsoft.Automata One
Résultat BDD

Ordinal public_oe property

Ordinal of this bit if nonleaf
public int Ordinal
Résultat int

Zero public_oe property

The encoding of the set for lower ordinals for the case when the current bit is 0. The value is null iff IsLeaf is true.
public BDD,Microsoft.Automata Zero
Résultat BDD

algebra protected_oe property

protected IBDDAlgebra algebra
Résultat IBDDAlgebra