C# Class Microsoft.Automata.BDD

Represents a Binary Decision Diagram.

Mostrar archivo Open project: AutomataDotNet/Automata Class Usage Examples

Public Properties

Property	Type	Description
One	BDD
Ordinal	int
Zero	BDD

Protected Properties

Property	Type	Description
algebra	IBDDAlgebra

Public Methods

Method	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

Protected Methods

Method	Description
PrintLeaf ( ) : string

Private Methods

Method	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 method

public And ( BDD other ) : BDD
other	BDD
return	BDD

CountNodes() public method

Counts the number of nodes (both terminals and nonterminals) in the BDD.

public CountNodes ( ) : int
return	int

Diff() public method

public Diff ( BDD other ) : BDD
other	BDD
return	BDD

GetMin() public method

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
return	ulong

Not() public method

public Not ( ) : BDD
return	BDD

Or() public method

public Or ( BDD other ) : BDD
other	BDD
return	BDD

PrintLeaf() protected method

protected PrintLeaf ( ) : string
return	string

ShiftLeft() public method

Increment the ordinals of all nodes by k, k must be nonnegative.

public ShiftLeft ( int k = 1 ) : BDD
k	int	offset
return	BDD

ShiftRight() public method

Decrement the ordinals of all nodes by k, k must be nonnegative.

public ShiftRight ( int k = 1 ) : BDD
k	int	offset
return	BDD

ToDot() public method

Store the BDD as a graph in the given file.

public ToDot ( string file ) : void
file	string
return	void

ToRanges() public method

public ToRanges ( int bound ) : uint>[].Pair
bound	int
return	uint>[].Pair

ToString() public method

public ToString ( ) : string
return	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
return	BDD

Ordinal public_oe property

Ordinal of this bit if nonleaf

public int Ordinal
return	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
return	BDD

algebra protected_oe property

protected IBDDAlgebra algebra
return	IBDDAlgebra