Description

XFastTrie is a datastructure for storing integers in a known universe, where universe size is determined by the bit size of the desired keys. This structure should be faster than binary search tries for very large datasets and slower for smaller datasets.

XFastTrie is referenced in 1 repository

github.com/Workiva/go-datastructures