spot  0.8.1
Public Member Functions | Protected Attributes
spot::state_bdd Class Reference

#include <tgba/statebdd.hh>

Inheritance diagram for spot::state_bdd:
Inheritance graph
[legend]
Collaboration diagram for spot::state_bdd:
Collaboration graph
[legend]

List of all members.

Public Member Functions

 state_bdd (bdd s)
virtual bdd as_bdd () const
 Return the BDD part of the state.
virtual int compare (const state *other) const
 Compares two states (that come from the same automaton).
virtual size_t hash () const
 Hash a state.
virtual state_bddclone () const
 Duplicate a state.
virtual void destroy () const
 Release a state.

Protected Attributes

bdd state_
 BDD representation of the state.

Detailed Description

A state whose representation is a BDD.


Constructor & Destructor Documentation

spot::state_bdd::state_bdd ( bdd  s) [inline]

Member Function Documentation

virtual bdd spot::state_bdd::as_bdd ( ) const [inline, virtual]

Return the BDD part of the state.

References state_.

virtual state_bdd* spot::state_bdd::clone ( ) const [virtual]

Duplicate a state.

Implements spot::state.

virtual int spot::state_bdd::compare ( const state other) const [virtual]

Compares two states (that come from the same automaton).

This method returns an integer less than, equal to, or greater than zero if this is found, respectively, to be less than, equal to, or greater than other according to some implicit total order.

This method should not be called to compare states from different automata.

See also:
spot::state_ptr_less_than

Implements spot::state.

virtual void spot::state::destroy ( ) const [inline, virtual, inherited]

Release a state.

Methods from the tgba or tgba_succ_iterator always return a new state that you should deallocate with this function. Before Spot 0.7, you had to "delete" your state directly. Starting with Spot 0.7, you update your code to this function instead (which simply calls "delete"). In a future version, some subclasses will redefine destroy() to allow better memory management (e.g. no memory allocation for explicit automata).

Reimplemented in spot::state_kripke, spot::state_explicit, and spot::state_product.

Referenced by spot::power_map::canonicalize(), spot::shared_state_deleter(), and spot::power_map::~power_map().

virtual size_t spot::state_bdd::hash ( ) const [virtual]

Hash a state.

This method returns an integer that can be used as a hash value for this state.

Note that the hash value is guaranteed to be unique for all equal states (in compare()'s sense) for only has long has one of these states exists. So it's OK to use a spot::state as a key in a hash_map because the mere use of the state as a key in the hash will ensure the state continues to exist.

However if you create the state, get its hash key, delete the state, recreate the same state, and get its hash key, you may obtain two different hash keys if the same state were not already used elsewhere. In practice this weird situation can occur only when the state is BDD-encoded, because BDD numbers (used to build the hash value) can be reused for other formulas. That probably doesn't matter, since the hash value is meant to be used in a hash_map, but it had to be noted.

Implements spot::state.


Member Data Documentation

bdd spot::state_bdd::state_ [protected]

BDD representation of the state.

Referenced by as_bdd().


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

Please comment this page and report errors about it on the RefDocComments page.
Generated on Sun Dec 18 2011 12:57:16 for spot by doxygen 1.7.6.1