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 not deleted
user 76540
A tree-like data structure used to hold an associative array, also called a Prefix Tree.
7
votes
1
answer
883
views
Checking for spelling errors with a trie
& prefix) const;
};
Trie.cpp
#include "Trie.hpp"
Trie::Trie() {
head = std::make_unique<Node>();
head->isEnd = false;
head->prefixCount = 0;
for (int i = 0; i < ALPHABETSIZE; ++i) { … (), ::tolower);
auto beenHere = false;
//Add every word to the trie. …
- 295