Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with trie
Search options questions only
not deleted
user 112094
A tree-like data structure used to hold an associative array, also called a Prefix Tree.
10
votes
2
answers
2k
views
Spell checker using trie
This program implements spell checking by loading a given dictionary file into a trie structure and comparing against a given text file: Usage: speller [dictionary] text. … char *word)
{
return Trie_search(&root, word);
}
bool load_dict(const char *dictionary)
{
// newlines
char word[LEN_MAX_WORD+2];
root = Trie_create();
check(root, "Failed to create Trie …
- 857