## 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.

## Examples

// on the XFastTrie all expect uint64, so we expect a uint in the // constructor for consistency's sake. func (xft *XFastTrie) init(intType interface{}) { bits := uint8(0) switch intType.(type) {

// Exists returns a bool indicating if the provided // key exists in the trie. This is an O(1) operation. func (xft *XFastTrie) Exists(key uint64) bool { // the bottom hashmap of the trie has every entry // in it.

// Len returns the number of items in this trie. This is an // O(1) operation. func (xft *XFastTrie) Len() uint64 { return xft.num }

## XFastTrie is referenced in 1 repository

**github.com/Workiva/go-datastructures**

- 20 references in trie/xfast/xfast.go
- 6 references in trie/xfast/xfast_test.go
- 1 reference in trie/yfast/yfast.go