BooleSet Class Reference

#include <BooleSet.h>

Inheritance diagram for BooleSet:
CDDInterface< CuddLikeZDD > CDDInterfaceBase< CuddLikeZDD >

List of all members.

Public Types

typedef BooleSet self
 Generic access to type of *this.
typedef CTypes::dd_type base
 Generic access to base type.
typedef base dd_type
 Generic access to underlying diagram type.
typedef base::navigator navigator
 Iterator type for navigation throught Cudd's ZDDs structure.
typedef base::size_type size_type
 Define size type.
typedef base::idx_type idx_type
 Define index type.
typedef BooleMonomial term_type
 Type of terms.
typedef BooleExponent exp_type
 Fix type for treatment of exponent vectors.
typedef BooleRing ring_type
 Type for Boolean polynomial rings (without ordering).
typedef CGenericIter< LexOrder,
navigator, term_type
const_iterator
 Iterator type for iterating all monomials.
typedef CGenericIter< LexOrder,
navigator, exp_type
exp_iterator
 Iterator type for iterating all exponent vectors.

Public Member Functions

 BooleSet ()
 Default constructor.
 BooleSet (const self &rhs)
 Copy constructor.
 BooleSet (const base &rhs)
 Copy constructor.
 BooleSet (idx_type idx, const self &first, const self &second)
 Construct new node.
 BooleSet (idx_type idx, navigator first, navigator second, const ring_type &ring)
 Construct new node (using navigator nodes).
 BooleSet (idx_type idx, const self &rhs)
 Construct new node (using navigator for then and else-branches).
 BooleSet (navigator navi, const ring_type &ring)
 Construct one or zero set from constant.
 ~BooleSet ()
 Destructor.
const_iterator begin () const
 Start of iteration over terms.
const_iterator end () const
 Finish of iteration over terms.
exp_iterator expBegin () const
 Start of iteration over exponent vectors.
exp_iterator expEnd () const
 Finish of iteration over exponent vectors.
selfoperator= (const self &)
 Assignment operator.
term_type usedVariables () const
 Set of variables of the whole set.
exp_type usedVariablesExp () const
 Exponent vector of variables of the whole set.
selfaddAssign (const term_type &)
 Add given monomial to sets and assign.
self add (const term_type &) const
 Add given monomial to sets.
bool_type owns (const term_type &) const
 Check whether rhs is included in *this.
bool_type owns (const exp_type &) const
 Check whether rhs is included in *this.
term_type lastLexicographicalTerm () const
 Get last term (wrt. lexicographical order).
self divisorsOf (const term_type &rhs) const
 Compute intersection with divisors of rhs.
self divisorsOf (const exp_type &rhs) const
 Compute intersection with divisors of rhs.
self firstDivisorsOf (const self &rhs) const
 Intersection with divisors of first (lexicographical) term of rhs.
self multiplesOf (const term_type &rhs) const
 Compute intersection with multiples of rhs.
self divide (const term_type &rhs) const
 Division by given term.
selfdivideAssign (const term_type &rhs)
 Division with assignment by given term.
bool_type hasTermOfVariables (const term_type &rhs) const
 Check for empty intersection with divisors of rhs.
self minimalElements () const
 Get minimal elements wrt. inclusion.
bool_type isSingleton () const
 Test, whether we have one term only.
bool_type isSingletonOrPair () const
 Test, whether we have one or two terms only.
bool_type isPair () const
 Test, whether we have two terms only.
self existAbstract (const term_type &rhs) const
 Compute existential abstraction.
const dd_typediagram () const
 Access internal decision diagram.
self ite (const self &then_dd, const self &else_dd)
 If-Then-Else operation.
selfiteAssign (const self &then_dd, const self &else_dd)
 If-Then-Else operation with assignment.
self cartesianProduct (const self &rhs) const
 Cartesean product.
ostream_typeprint (ostream_type &) const
 Print current set to output stream.
self emptyElement () const
 Get corresponding zero element (may be removed in the future).
size_type countIndex (idx_type idx) const
 Count terms containing BooleVariable(idx).
double countIndexDouble (idx_type idx) const
 Count many terms containing BooleVariable(idx).
ring_type ring () const
 Access ring, where this belongs to.

Member Typedef Documentation

Generic access to base type.

Reimplemented from CDDInterface< CuddLikeZDD >.

Iterator type for iterating all monomials.

Generic access to underlying diagram type.

Iterator type for iterating all exponent vectors.

Fix type for treatment of exponent vectors.

Define index type.

Reimplemented from CDDInterface< CuddLikeZDD >.

Iterator type for navigation throught Cudd's ZDDs structure.

Reimplemented from CDDInterface< CuddLikeZDD >.

Type for Boolean polynomial rings (without ordering).

Generic access to type of *this.

Reimplemented from CDDInterface< CuddLikeZDD >.

Define size type.

Reimplemented from CDDInterface< CuddLikeZDD >.

Type of terms.


Constructor & Destructor Documentation

BooleSet::BooleSet (  ) 

Default constructor.

References PBORI_TRACE_FUNC.

BooleSet::BooleSet ( const self rhs  )  [inline]

Copy constructor.

BooleSet::BooleSet ( const base rhs  )  [inline]

Copy constructor.

BooleSet::BooleSet ( idx_type  idx,
const self first,
const self second 
) [inline]

Construct new node.

BooleSet::BooleSet ( idx_type  idx,
navigator  first,
navigator  second,
const ring_type ring 
) [inline]

Construct new node (using navigator nodes).

BooleSet::BooleSet ( idx_type  idx,
const self rhs 
) [inline]

Construct new node (using navigator for then and else-branches).

BooleSet::BooleSet ( navigator  navi,
const ring_type ring 
) [inline]

Construct one or zero set from constant.

Todo:
temporarily deactivated, as it slow downs procedures like term_accumulate, needs check, what happens to inlinings etc. in this case

Construct from navigator node

BooleSet::~BooleSet (  )  [inline]

Destructor.


Member Function Documentation

BooleSet BooleSet::add ( const term_type rhs  )  const
BooleSet & BooleSet::addAssign ( const term_type rhs  ) 

Add given monomial to sets and assign.

References operator=(), and PBORI_TRACE_FUNC.

BooleSet::const_iterator BooleSet::begin (  )  const
self BooleSet::cartesianProduct ( const self rhs  )  const [inline]

Cartesean product.

References CDDInterface< CuddLikeZDD >::unateProduct().

BooleSet::size_type BooleSet::countIndex ( idx_type  idx  )  const

Count terms containing BooleVariable(idx).

double BooleSet::countIndexDouble ( idx_type  idx  )  const

Count many terms containing BooleVariable(idx).

const dd_type& BooleSet::diagram (  )  const [inline]

Access internal decision diagram.

BooleSet BooleSet::divide ( const term_type rhs  )  const

Division by given term.

BooleSet & BooleSet::divideAssign ( const term_type rhs  ) 

Division with assignment by given term.

BooleSet BooleSet::divisorsOf ( const exp_type rhs  )  const

Compute intersection with divisors of rhs.

References BooleMonomial::diagram(), firstDivisorsOf(), and PBORI_TRACE_FUNC.

BooleSet BooleSet::divisorsOf ( const term_type rhs  )  const

Compute intersection with divisors of rhs.

self BooleSet::emptyElement (  )  const [inline]

Get corresponding zero element (may be removed in the future).

Reimplemented from CDDInterface< CuddLikeZDD >.

References CDDInterface< CuddLikeZDD >::emptyElement().

BooleSet::const_iterator BooleSet::end (  )  const

Finish of iteration over terms.

BooleSet BooleSet::existAbstract ( const term_type rhs  )  const

Compute existential abstraction.

BooleSet::exp_iterator BooleSet::expBegin (  )  const

Start of iteration over exponent vectors.

References PBORI_TRACE_FUNC.

Referenced by LexHelper::irreducible_lead().

BooleSet::exp_iterator BooleSet::expEnd (  )  const
BooleSet BooleSet::firstDivisorsOf ( const self rhs  )  const

Intersection with divisors of first (lexicographical) term of rhs.

References dd_last_lexicographical_term(), and PBORI_TRACE_FUNC.

Referenced by divisorsOf().

BooleSet::bool_type BooleSet::hasTermOfVariables ( const term_type rhs  )  const
bool_type BooleSet::isPair (  )  const [inline]

Test, whether we have two terms only.

References dd_is_pair(), and CDDInterface< CuddLikeZDD >::navigation().

bool_type BooleSet::isSingleton (  )  const [inline]

Test, whether we have one term only.

References dd_is_singleton(), and CDDInterface< CuddLikeZDD >::navigation().

bool_type BooleSet::isSingletonOrPair (  )  const [inline]

Test, whether we have one or two terms only.

References dd_is_singleton_or_pair(), and CDDInterface< CuddLikeZDD >::navigation().

self BooleSet::ite ( const self then_dd,
const self else_dd 
) [inline]

If-Then-Else operation.

References CDDInterface< CuddLikeZDD >::ite().

self& BooleSet::iteAssign ( const self then_dd,
const self else_dd 
) [inline]

If-Then-Else operation with assignment.

References CDDInterface< CuddLikeZDD >::iteAssign().

BooleSet::term_type BooleSet::lastLexicographicalTerm (  )  const

Get last term (wrt. lexicographical order).

References PBORI_TRACE_FUNC.

BooleSet BooleSet::minimalElements (  )  const

Get minimal elements wrt. inclusion.

Reimplemented from CDDInterface< CuddLikeZDD >.

BooleSet BooleSet::multiplesOf ( const term_type rhs  )  const

Compute intersection with multiples of rhs.

BooleSet & BooleSet::operator= ( const self rhs  ) 

Assignment operator.

Referenced by addAssign().

BooleSet::bool_type BooleSet::owns ( const exp_type rhs  )  const
BooleSet::bool_type BooleSet::owns ( const term_type rhs  )  const

Check whether rhs is included in *this.

References PBORI_TRACE_FUNC.

BooleSet::ostream_type & BooleSet::print ( ostream_type os  )  const

Print current set to output stream.

Reimplemented from CDDInterface< CuddLikeZDD >.

Referenced by operator<<().

ring_type BooleSet::ring (  )  const [inline]

Access ring, where this belongs to.

References CDDInterface< CuddLikeZDD >::manager().

Referenced by LiteralFactorization::LiteralFactorization().

BooleSet::term_type BooleSet::usedVariables (  )  const

Set of variables of the whole set.

Referenced by usedVariablesExp().

BooleSet::exp_type BooleSet::usedVariablesExp (  )  const

Exponent vector of variables of the whole set.

References PBORI_TRACE_FUNC, and usedVariables().


The documentation for this class was generated from the following files:
Generated on Tue May 4 08:19:03 2010 for PolyBoRi by  doxygen 1.6.3