Succinct Data Structure Trie

Implementation of Succinct Trie ¹ in Go.

The trie structure is great for fast lookup of dictionary words, but if the vocabulary of the dictionary is big, it may takes a lot of space to store the constructed trie. For this reason, succinct data structure is applied to the trie strcuture and we can both have fast lookup and small space requirement.

Usage

Basic example: basic usage
Advanced example: pali dir

UNLICENSE

Released in public domain. See UNLICENSE.

References

Succinct Data Structures: Cramming 80,000 words into a Javascript file. (source code)↩

Name		Name	Last commit message	Last commit date
Latest commit History 30 Commits
.github/workflows		.github/workflows
example		example
reference		reference
.gitignore		.gitignore
Makefile		Makefile
README.rst		README.rst
UNLICENSE		UNLICENSE
alphabet.go		alphabet.go
alphabet_test.go		alphabet_test.go
base64.go		base64.go
bitstring.go		bitstring.go
bitwriter.go		bitwriter.go
frozentrie.go		frozentrie.go
frozentrie_test.go		frozentrie_test.go
go.mod		go.mod
rankdirectory.go		rankdirectory.go
search.go		search.go
search_test.go		search_test.go
trie.go		trie.go
trie_test.go		trie_test.go

License

siongui/go-succinct-data-structure-trie

Folders and files

Latest commit

History

Repository files navigation

Usage

UNLICENSE

References

About

Topics

Resources

License

Stars

Watchers

Forks

Languages