Awali
Another Weighted Automata library
|
#include <hash.hh>
Public Types | |
using | context_t = context_t_of< ratexpset_t > |
using | inner_t = typename super_type::inner_t |
using | leaf_t = typename super_type::leaf_t |
using | node_t = typename super_type::node_t |
using | ratexpset_t = RatExpSet |
using | super_type = typename ratexpset_t::const_visitor |
template<type_t Type> | |
using | unary_t = typename super_type::template unary_t< Type > |
template<type_t Type> | |
using | variadic_t = typename super_type::template variadic_t< Type > |
template<type_t Type> | |
using | weight_node_t = typename super_type::template weight_node_t< Type > |
using | weight_t = typename context_t::weightset_t::value_t |
Public Member Functions | |
size_t | operator() (const node_t &v) |
Entry point: return the hash of v. More... | |
size_t | operator() (const std::shared_ptr< const node_t > &v) |
Entry point: return the hash of v. More... | |
using awali::sttc::rat::hash< RatExpSet >::context_t = context_t_of<ratexpset_t> |
using awali::sttc::rat::hash< RatExpSet >::inner_t = typename super_type::inner_t |
using awali::sttc::rat::hash< RatExpSet >::leaf_t = typename super_type::leaf_t |
using awali::sttc::rat::hash< RatExpSet >::node_t = typename super_type::node_t |
using awali::sttc::rat::hash< RatExpSet >::ratexpset_t = RatExpSet |
using awali::sttc::rat::hash< RatExpSet >::super_type = typename ratexpset_t::const_visitor |
using awali::sttc::rat::hash< RatExpSet >::unary_t = typename super_type::template unary_t<Type> |
using awali::sttc::rat::hash< RatExpSet >::variadic_t = typename super_type::template variadic_t<Type> |
using awali::sttc::rat::hash< RatExpSet >::weight_node_t = typename super_type::template weight_node_t<Type> |
using awali::sttc::rat::hash< RatExpSet >::weight_t = typename context_t::weightset_t::value_t |
size_t awali::sttc::rat::hash< RatExpSet >::operator() | ( | const node_t & | v | ) |
Entry point: return the hash of v.
size_t awali::sttc::rat::hash< RatExpSet >::operator() | ( | const std::shared_ptr< const node_t > & | v | ) |
Entry point: return the hash of v.