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 answers only
not deleted
user 58193
A tree-like data structure used to hold an associative array, also called a Prefix Tree.
8
votes
Accepted
Spell checker using trie
Buffer overflow
This line is vulnerable to buffer overflow:
while (fgets(word, sizeof(word)+1, in)) {
I'm not sure why you added one here, but it makes it possible to overflow the buffer by one chara …
- 28.6k
2
votes
Cache aware, Key/value dictionary based on 4-bit(16-slot) Trie (Prefix Tree), with deferred ...
You are using each 4 bits of a variable length key as a "character" of a "trie". … Loading each byte twice
In both your addNode() and findNode() functions, you load a byte from the key and either use its upper or lower half (4 bits per trie depth). …
- 28.6k