| TeDDy 4.1.0
    Decision diagram library. | 
| Public Types | |
| using | son_container = decltype(make_son_container(int32(), Degree())) | 
| Public Member Functions | |
| node (int32 value) | |
| node (int32 index, son_container sons) | |
| node (node const &)=delete | |
| node (node &&)=delete | |
| auto | operator= (node const &)=delete | 
| auto | operator= (node &&)=delete | 
| template<class Foo  = void> requires (not utils::is_void<Data>::value) | |
| auto | get_data () -> utils::second_t< Foo, Data > & | 
| template<class Foo  = void> requires (not utils::is_void<Data>::value) | |
| auto | get_data () const -> utils::second_t< Foo, Data > const & | 
| auto | is_internal () const -> bool | 
| auto | is_terminal () const -> bool | 
| auto | is_used () const -> bool | 
| auto | is_marked () const -> bool | 
| auto | get_next () const -> node * | 
| auto | get_ref_count () const -> int32 | 
| auto | get_index () const -> int32 | 
| auto | get_sons () const -> son_container const & | 
| auto | get_son (int32 sonOrder) const -> node * | 
| auto | get_value () const -> int32 | 
| auto | set_next (node *next) -> void | 
| auto | set_unused () -> void | 
| auto | set_marked () -> void | 
| auto | set_notmarked () -> void | 
| auto | set_index (int32 index) -> void | 
| auto | set_sons (son_container const &sons) -> void | 
| auto | toggle_marked () -> void | 
| auto | inc_ref_count () -> void | 
| auto | dec_ref_count () -> void | 
| Static Public Member Functions | |
| template<int32 N> | |
| static auto | make_son_container (int32, degrees::fixed< N >) -> node_ptr_array< Data, Degree > | 
| static auto | make_son_container (int32 const domain, degrees::mixed) -> node ** | 
| static auto | delete_son_container (node **sons) -> void |