Arc

Start position in the FST.BytesReader of the presence bits for a direct addressing node, aka the bit-table

First label of a direct addressing node.

Index of the current label of a direct addressing node. While .arcIdx is the current index in the label range, .presenceIndex is its corresponding index in the list of actually present labels. It is equal to the number of bits set before the bit at .arcIdx in the bit-table. This field is a cache to avoid to count bits set repeatedly when iterating the next arcs.

Where we are in the array; only valid if bytesPerArc != 0.

Non-zero if this arc is part of a node with fixed length arcs, which means all arcs for the node are encoded with a fixed number of bytes so that we binary search or direct address. We do when there are enough arcs leaving one node. It wastes some bytes but gives faster lookups.

Returns this

First label of a direct addressing node. Only valid if nodeFlags == .ARCS_FOR_DIRECT_ADDRESSING or .ARCS_FOR_CONTINUOUS.

Address (into the byte[]) of the next arc - only for list of variable length arc. Or ord/address to the next node if label == .END_LABEL.

Node header flags. Only meaningful to check if the value is either .ARCS_FOR_BINARY_SEARCH or .ARCS_FOR_DIRECT_ADDRESSING or .ARCS_FOR_CONTINUOUS (other value when bytesPerArc == 0).

How many arcs; only valid if bytesPerArc != 0 (fixed length arcs). For a node designed for binary search this is the array size. For a node designed for direct addressing, this is the label range.

Where the first arc in the array starts; only valid if bytesPerArc != 0

Ord/address to target node.