![]() |
Vcsn
2.0
Be Rational
|
#include <hash.hh>
Public Types | |
| using | ratexpset_t = RatExpSet |
| using | context_t = context_t_of< ratexpset_t > |
| using | weight_t = typename context_t::weightset_t::value_t |
| using | super_t = typename ratexpset_t::const_visitor |
| using | node_t = typename super_t::node_t |
| using | inner_t = typename super_t::inner_t |
| template<type_t Type> | |
| using | variadic_t = typename super_t::template variadic_t< Type > |
| template<type_t Type> | |
| using | unary_t = typename super_t::template unary_t< Type > |
| template<type_t Type> | |
| using | weight_node_t = typename super_t::template weight_node_t< Type > |
| using | leaf_t = typename super_t::leaf_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... | |
Private Types | |
| using | atom_t = typename super_t::atom_t |
| using | complement_t = typename super_t::complement_t |
| using | conjunction_t = typename super_t::conjunction_t |
| using | ldiv_t = typename super_t::ldiv_t |
| using | lweight_t = typename super_t::lweight_t |
| using | one_t = typename super_t::one_t |
| using | prod_t = typename super_t::prod_t |
| using | rweight_t = typename super_t::rweight_t |
| using | shuffle_t = typename super_t::shuffle_t |
| using | star_t = typename super_t::star_t |
| using | sum_t = typename super_t::sum_t |
| using | transposition_t = typename super_t::transposition_t |
| using | zero_t = typename super_t::zero_t |
Private Member Functions | |
| virtual void | visit (const atom_t &v) |
| virtual void | visit (const complement_t &v) |
| virtual void | visit (const conjunction_t &v) |
| virtual void | visit (const ldiv_t &v) |
| virtual void | visit (const lweight_t &v) |
| virtual void | visit (const one_t &v) |
| virtual void | visit (const prod_t &v) |
| virtual void | visit (const rweight_t &v) |
| virtual void | visit (const shuffle_t &v) |
| virtual void | visit (const star_t &v) |
| virtual void | visit (const sum_t &v) |
| virtual void | visit (const transposition_t &v) |
| virtual void | visit (const zero_t &v) |
| void | combine_type (const node_t &node) |
| Update res_ by hashing the node type; this is needed for any node. More... | |
| void | visit_nullary (const node_t &v) |
Traverse a nullary node (atom, \z, \e). More... | |
| template<rat::exp::type_t Type> | |
| void | visit_unary (const unary_t< Type > &v) |
Traverse a unary node (*, {c}). More... | |
| template<rat::exp::type_t Type> | |
| void | visit_variadic (const variadic_t< Type > &v) |
Traverse an n-ary node (+, concatenation, &, :). More... | |
| template<rat::exp::type_t Type> | |
| void | visit_weight_node (const weight_node_t< Type > &v) |
| Traverse a weight node (lweight, rweight). More... | |
Private Attributes | |
| size_t | res_ |
|
private |
|
private |
|
private |
| using vcsn::rat::hash< RatExpSet >::context_t = context_t_of<ratexpset_t> |
| using vcsn::rat::hash< RatExpSet >::inner_t = typename super_t::inner_t |
|
private |
| using vcsn::rat::hash< RatExpSet >::leaf_t = typename super_t::leaf_t |
|
private |
| using vcsn::rat::hash< RatExpSet >::node_t = typename super_t::node_t |
|
private |
|
private |
| using vcsn::rat::hash< RatExpSet >::ratexpset_t = RatExpSet |
|
private |
|
private |
|
private |
|
private |
| using vcsn::rat::hash< RatExpSet >::super_t = typename ratexpset_t::const_visitor |
|
private |
| using vcsn::rat::hash< RatExpSet >::unary_t = typename super_t::template unary_t<Type> |
| using vcsn::rat::hash< RatExpSet >::variadic_t = typename super_t::template variadic_t<Type> |
| using vcsn::rat::hash< RatExpSet >::weight_node_t = typename super_t::template weight_node_t<Type> |
| using vcsn::rat::hash< RatExpSet >::weight_t = typename context_t::weightset_t::value_t |
|
private |
|
inlineprivate |
|
inline |
Entry point: return the hash of v.
Definition at line 33 of file hash.hh.
References vcsn::rat::hash< RatExpSet >::res_.
Referenced by vcsn::rat::hash< RatExpSet >::operator()().
|
inline |
Entry point: return the hash of v.
Definition at line 42 of file hash.hh.
References vcsn::rat::hash< RatExpSet >::operator()().
|
inlineprivatevirtual |
|
inlineprivatevirtual |
Definition at line 54 of file hash.hh.
References vcsn::rat::hash< RatExpSet >::visit_unary().
|
inlineprivatevirtual |
Definition at line 55 of file hash.hh.
References vcsn::rat::hash< RatExpSet >::visit_variadic().
|
inlineprivatevirtual |
Definition at line 56 of file hash.hh.
References vcsn::rat::hash< RatExpSet >::visit_variadic().
|
inlineprivatevirtual |
|
inlineprivatevirtual |
Definition at line 58 of file hash.hh.
References vcsn::rat::hash< RatExpSet >::visit_nullary().
|
inlineprivatevirtual |
Definition at line 59 of file hash.hh.
References vcsn::rat::hash< RatExpSet >::visit_variadic().
|
inlineprivatevirtual |
|
inlineprivatevirtual |
Definition at line 61 of file hash.hh.
References vcsn::rat::hash< RatExpSet >::visit_variadic().
|
inlineprivatevirtual |
Definition at line 62 of file hash.hh.
References vcsn::rat::hash< RatExpSet >::visit_unary().
|
inlineprivatevirtual |
Definition at line 63 of file hash.hh.
References vcsn::rat::hash< RatExpSet >::visit_variadic().
|
inlineprivatevirtual |
Definition at line 64 of file hash.hh.
References vcsn::rat::hash< RatExpSet >::visit_unary().
|
inlineprivatevirtual |
|
inlineprivate |
Traverse a nullary node (atom, \z, \e).
Definition at line 49 of file hash.hxx.
Referenced by vcsn::rat::hash< RatExpSet >::visit().
|
inlineprivate |
Traverse a unary node (*, {c}).
Definition at line 58 of file hash.hxx.
Referenced by vcsn::rat::hash< RatExpSet >::visit().
|
inlineprivate |
Traverse an n-ary node (+, concatenation, &, :).
Definition at line 79 of file hash.hxx.
Referenced by vcsn::rat::hash< RatExpSet >::visit().
|
inlineprivate |
|
private |
Definition at line 87 of file hash.hh.
Referenced by vcsn::rat::hash< RatExpSet >::operator()().