OpenMS
2.8.0

#include <OpenMS/ANALYSIS/ID/AhoCorasickAmbiguous.h>
Classes  
struct  DepthHits 
internal struct to steal one bit from depth to use as hit indicator More...  
Public Types  
using  ChildCountType = uint8_t 
Public Member Functions  
ACNode ()  
Default C'tor. More...  
ACNode (const AA label, const uint8_t depth)  
C'tor from an edge label (from parent to this node) and a depth in the tree. More...  
Public Attributes  
Index  suffix {0} 
which node is our suffix? More...  
Index  first_child {0} 
which node contains our first child node (if tree is in BFS order) More...  
AA  edge {0} 
what is the edge label (from parent to this node) More...  
ChildCountType  nr_children = 0 
number of children (if tree is in BFS order); // we could also go with a bitfield of size 22, but that would cost extra 3 bytes per node More...  
DepthHits  depth_and_hits 
depth of node in the tree and one bit if a needle ends in this node or any of its suffices More...  
A node in the AhoCorasick trie. Internally manages the suffix link and an index where its children start (this relies on the trie being stored in BFS order)
using ChildCountType = uint8_t 

inline 
Default C'tor.
C'tor from an edge label
(from parent to this node) and a depth
in the tree.
DepthHits depth_and_hits 
depth of node in the tree and one bit if a needle ends in this node or any of its suffices
AA edge {0} 
what is the edge label (from parent to this node)
Index first_child {0} 
which node contains our first child node (if tree is in BFS order)
ChildCountType nr_children = 0 
number of children (if tree is in BFS order); // we could also go with a bitfield of size 22, but that would cost extra 3 bytes per node
Index suffix {0} 
which node is our suffix?