#include <InnerNodeSpecific.hpp>
Inheritance diagram for Bodon::InnerNodeSpecific< EDGELIST >:


Public Types | |
| typedef EDGELIST::iterator | iterator |
| typedef EDGELIST::const_iterator | const_iterator |
Public Member Functions | |
| InnerNodeSpecific () | |
| bool | isThereAnyCandidate () const |
| size_t | edgeNumber () |
Public Attributes | |
| EDGELIST | edgelist |
An edge has a label, and an edge points to a subtrie.
Definition at line 16 of file InnerNodeSpecific.hpp.
|
|||||
|
Definition at line 20 of file InnerNodeSpecific.hpp. |
|
|||||
|
Definition at line 19 of file InnerNodeSpecific.hpp. |
|
|||||||||
|
Definition at line 24 of file InnerNodeSpecific.hpp. |
|
|||||||||
|
Definition at line 32 of file InnerNodeSpecific.hpp. References Bodon::InnerNodeSpecific< EDGELIST >::edgelist. |
|
|||||||||
|
Definition at line 26 of file InnerNodeSpecific.hpp. References Bodon::InnerNodeSpecific< EDGELIST >::edgelist. |
|
|||||
|
Definition at line 22 of file InnerNodeSpecific.hpp. Referenced by Bodon::InnerNodeSpecific< EDGELIST >::edgeNumber(), Bodon::Trie< LEAF, EDGELIST >::isIncluded(), and Bodon::InnerNodeSpecific< EDGELIST >::isThereAnyCandidate(). |
1.4.4