package bap-std

Key requirements. Key is a sequence of tokens of the specified length. It is better to use contiguous data structures, like arrays as keys, otherwise you can end up with a slow implementation (i.e., don't use lists or sequences as keys, use strings, bitstrings, arrays, etc).

Prefix trie interface.

Create a trie for a given Key

Minimum required interface for a token data type

Prefix and suffix tries for specified token types.

Predefined prefix and suffix string tries.