#include <OpenMS/ANALYSIS/ID/AhoCorasickAmbiguous.h>

Collaboration diagram for ACNode:

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
Bitset	children_bitset
	bitfield of children (if tree is in BFS order); 26 bits are enough to cover all AA incl. (B,J,X,Z) More...

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); (popcount on children_bitset will do the same but we have the space due to padding) 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...

Detailed Description

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)

Member Typedef Documentation

◆ ChildCountType

using ChildCountType = uint8_t

Constructor & Destructor Documentation

◆ ACNode() [1/2]

ACNode ( )

inline

Default C'tor.

◆ ACNode() [2/2]

ACNode	(	const AA	label,
		const uint8_t	depth
	)

inline

C'tor from an edge label (from parent to this node) and a depth in the tree.

Member Data Documentation

◆ children_bitset

Bitset children_bitset

bitfield of children (if tree is in BFS order); 26 bits are enough to cover all AA incl. (B,J,X,Z)

◆ depth_and_hits

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

◆ edge

AA edge {0}

what is the edge label (from parent to this node)

◆ first_child

Index first_child {0}

which node contains our first child node (if tree is in BFS order)

◆ nr_children

ChildCountType nr_children = 0

number of children (if tree is in BFS order); (popcount on children_bitset will do the same but we have the space due to padding)

◆ suffix

Index suffix {0}

which node is our suffix?

Classes

Public Types

Public Member Functions

Public Attributes