Awali
Another Weighted Automata library
|
The abstract parameterized, root for all rational expression types. More...
#include <ratexp.hh>
Public Types | |
using | const_visitor = sttc::rat::const_visitor< label_t, weight_t > |
using | label_t = Label |
using | node_t = rat::node< label_t, weight_t > |
using | ratexps_t = std::vector< value_t > |
using | value_t = std::shared_ptr< const node_t > |
using | weight_t = Weight |
using | wvalue_t = std::shared_ptr< node_t > |
Same as value_t, but writable. Use with care. More... | |
Public Types inherited from awali::sttc::rat::exp | |
using | type_t = rat::type_t |
The possible types of ratexps. More... | |
Public Member Functions | |
virtual void | accept (const_visitor &v) const =0 |
Public Member Functions inherited from awali::sttc::rat::exp | |
virtual | ~exp ()=default |
bool | is_leaf () const |
Whether a leaf of the ratexp tree. More... | |
bool | is_unary () const |
Whether star, complement. More... | |
virtual type_t | type () const =0 |
The type of this node. More... | |
The abstract parameterized, root for all rational expression types.
using awali::sttc::rat::node< Label, Weight >::const_visitor = sttc::rat::const_visitor<label_t, weight_t> |
using awali::sttc::rat::node< Label, Weight >::label_t = Label |
using awali::sttc::rat::node< Label, Weight >::node_t = rat::node<label_t, weight_t> |
using awali::sttc::rat::node< Label, Weight >::ratexps_t = std::vector<value_t> |
using awali::sttc::rat::node< Label, Weight >::value_t = std::shared_ptr<const node_t> |
using awali::sttc::rat::node< Label, Weight >::weight_t = Weight |
using awali::sttc::rat::node< Label, Weight >::wvalue_t = std::shared_ptr<node_t> |
Same as value_t, but writable. Use with care.
|
pure virtual |