internal/

Package art summarizes the functions and inverse functions for mapping between a prefix and a baseIndex.

Package bitset provides a compact and efficient implementation of a fixed-length bitset for the range [0..255].

Package lpm (longest-prefix-match) contains the lookup table with which the backtracking for the lpm in the complete binary tree of the prefixes can be replaced by a fast bitset operation.

Package sparse provides a compact and efficient sparse array implementation for addressable key ranges from [0..255].

Package value provides runtime utilities for working with generic type parameters as payload values in bart data structures.