Public Types | Public Member Functions

polybori::BooleSet Class Reference

#include <BooleSet.h>

Inheritance diagram for polybori::BooleSet:
polybori::CDDInterface< CuddLikeZDD > polybori::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.
Members from base

self subset0 (idx_type idx) const
self subset1 (idx_type idx) const
self change (idx_type idx) const
self unite (const self &rhs) const
self diff (const self &rhs) const
self diffConst (const self &rhs) const
self intersect (const self &rhs) const
self product (const self &rhs) const
self dotProduct (const self &rhs) const
self Xor (const self &rhs) const
self ddDivide (const self &rhs) const
self weakDivide (const self &rhs) const
self divideFirst (const self &rhs) const
selfsubset0Assign (idx_type idx)
selfsubset1Assign (idx_type idx)
selfchangeAssign (idx_type idx)
selfuniteAssign (const self &rhs)
selfdiffAssign (const self &rhs)
selfdiffConstAssign (const self &rhs)
selfintersectAssign (const self &rhs)
selfproductAssign (const self &rhs)
selfdotProductAssign (const self &rhs)
selfddDivideAssign (const self &rhs)
selfweakDivideAssign (const self &rhs)
selfdivideFirstAssign (const self &rhs)

Member Typedef Documentation

Generic access to base type.

Reimplemented from polybori::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.

Iterator type for navigation throught Cudd's ZDDs structure.

Reimplemented from polybori::CDDInterface< CuddLikeZDD >.

Type for Boolean polynomial rings (without ordering).

Generic access to type of *this.

Reimplemented from polybori::CDDInterface< CuddLikeZDD >.


Constructor & Destructor Documentation

polybori::BooleSet::BooleSet (  ) 

Default constructor.

References PBORI_TRACE_FUNC.

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

Copy constructor.

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

Copy constructor.

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

Construct new node.

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

Construct new node (using navigator nodes).

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

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

polybori::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

polybori::BooleSet::~BooleSet (  )  [inline]

Destructor.


Member Function Documentation

BooleSet polybori::BooleSet::add ( const term_type rhs  )  const

Add given monomial to sets.

References polybori::BooleMonomial::diagram(), PBORI_TRACE_FUNC, and uniteAssign().

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

Add given monomial to sets and assign.

References operator=(), and PBORI_TRACE_FUNC.

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

Cartesean product.

self& polybori::BooleSet::changeAssign ( idx_type  idx  )  [inline]
BooleSet::size_type polybori::BooleSet::countIndex ( idx_type  idx  )  const

Count terms containing BooleVariable(idx).

double polybori::BooleSet::countIndexDouble ( idx_type  idx  )  const

Count many terms containing BooleVariable(idx).

self polybori::BooleSet::ddDivide ( const self rhs  )  const [inline]
self& polybori::BooleSet::ddDivideAssign ( const self rhs  )  [inline]
const dd_type& polybori::BooleSet::diagram (  )  const [inline]

Access internal decision diagram.

self polybori::BooleSet::diff ( const self rhs  )  const [inline]
self& polybori::BooleSet::diffAssign ( const self rhs  )  [inline]
self polybori::BooleSet::diffConst ( const self rhs  )  const [inline]
self& polybori::BooleSet::diffConstAssign ( const self rhs  )  [inline]
BooleSet polybori::BooleSet::divide ( const term_type rhs  )  const

Division by given term.

BooleSet & polybori::BooleSet::divideAssign ( const term_type rhs  ) 

Division with assignment by given term.

self polybori::BooleSet::divideFirst ( const self rhs  )  const [inline]
self& polybori::BooleSet::divideFirstAssign ( const self rhs  )  [inline]
BooleSet polybori::BooleSet::divisorsOf ( const exp_type rhs  )  const

Compute intersection with divisors of rhs.

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

BooleSet polybori::BooleSet::divisorsOf ( const term_type rhs  )  const

Compute intersection with divisors of rhs.

self polybori::BooleSet::dotProduct ( const self rhs  )  const [inline]
self& polybori::BooleSet::dotProductAssign ( const self rhs  )  [inline]
self polybori::BooleSet::emptyElement (  )  const [inline]

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

Reimplemented from polybori::CDDInterface< CuddLikeZDD >.

BooleSet::const_iterator polybori::BooleSet::end (  )  const

Finish of iteration over terms.

BooleSet polybori::BooleSet::existAbstract ( const term_type rhs  )  const

Compute existential abstraction.

BooleSet::exp_iterator polybori::BooleSet::expBegin (  )  const

Start of iteration over exponent vectors.

References PBORI_TRACE_FUNC.

Referenced by polybori::groebner::LexHelper::irreducible_lead().

BooleSet polybori::BooleSet::firstDivisorsOf ( const self rhs  )  const

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

References polybori::dd_last_lexicographical_term(), and PBORI_TRACE_FUNC.

Referenced by divisorsOf().

BooleSet::bool_type polybori::BooleSet::hasTermOfVariables ( const term_type rhs  )  const
self polybori::BooleSet::intersect ( const self rhs  )  const [inline]
self& polybori::BooleSet::intersectAssign ( const self rhs  )  [inline]
bool_type polybori::BooleSet::isPair (  )  const [inline]

Test, whether we have two terms only.

References polybori::dd_is_pair().

bool_type polybori::BooleSet::isSingleton (  )  const [inline]

Test, whether we have one term only.

References polybori::dd_is_singleton().

bool_type polybori::BooleSet::isSingletonOrPair (  )  const [inline]

Test, whether we have one or two terms only.

References polybori::dd_is_singleton_or_pair().

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

If-Then-Else operation.

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

If-Then-Else operation with assignment.

BooleSet::term_type polybori::BooleSet::lastLexicographicalTerm (  )  const

Get last term (wrt. lexicographical order).

References PBORI_TRACE_FUNC.

BooleSet polybori::BooleSet::minimalElements (  )  const

Get minimal elements wrt. inclusion.

Reimplemented from polybori::CDDInterface< CuddLikeZDD >.

BooleSet polybori::BooleSet::multiplesOf ( const term_type rhs  )  const

Compute intersection with multiples of rhs.

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

Assignment operator.

Referenced by addAssign().

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

Check whether rhs is included in *this.

References PBORI_TRACE_FUNC.

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

Print current set to output stream.

Reimplemented from polybori::CDDInterface< CuddLikeZDD >.

Referenced by polybori::operator<<().

self polybori::BooleSet::product ( const self rhs  )  const [inline]
self& polybori::BooleSet::productAssign ( const self rhs  )  [inline]
ring_type polybori::BooleSet::ring (  )  const [inline]

Access ring, where this belongs to.

Referenced by polybori::groebner::LiteralFactorization::LiteralFactorization().

self polybori::BooleSet::subset0 ( idx_type  idx  )  const [inline]
self& polybori::BooleSet::subset0Assign ( idx_type  idx  )  [inline]
Todo:
Do we really nee the assign variante here at high level?
self polybori::BooleSet::subset1 ( idx_type  idx  )  const [inline]
self& polybori::BooleSet::subset1Assign ( idx_type  idx  )  [inline]
self polybori::BooleSet::unite ( const self rhs  )  const [inline]
self& polybori::BooleSet::uniteAssign ( const self rhs  )  [inline]

Referenced by add().

BooleSet::term_type polybori::BooleSet::usedVariables (  )  const

Set of variables of the whole set.

Referenced by usedVariablesExp().

BooleSet::exp_type polybori::BooleSet::usedVariablesExp (  )  const

Exponent vector of variables of the whole set.

References PBORI_TRACE_FUNC, and usedVariables().

self polybori::BooleSet::weakDivide ( const self rhs  )  const [inline]
self& polybori::BooleSet::weakDivideAssign ( const self rhs  )  [inline]
self polybori::BooleSet::Xor ( const self rhs  )  const [inline]

The documentation for this class was generated from the following files: