dictionary_tree

A very simple dictionary implementation using a trie for auto-completion in C++17.

This is quite likely not the fastest implementation. But it's simple and usable.

Basic Usage

spl::trie trie;
trie.insert("tes"); // will not be in auto complete list
trie.insert("test");
trie.insert("test String 3");
trie.insert("test String 4!");

std::vector<std::string> auto_complete_list;
trie.auto_complete("tes", auto_complete_list, 5); // auto complete with a limit of 5

// Example for iterating over each entry starting with "te"
trie.each("te", [](const std::string &str){
	std::cout << str << '\n';
});