DescriptionDevTools: introduce Trie data structure
This patch introduces uncompressed Trie implementation. Trie comes handy
to quickly answer questions of type "give me all words with given prefix".
Text editor autocomplete benefits immediately from the trie index.
The automapping algorithm prototype also relies heavily on the trie to
quickly query file paths.
The performance and memory analysis of the implementation:
https://goo.gl/UdgS4H
BUG=none
R=dgozman, pfeldman
Committed: https://crrev.com/d9cfae12769e0007cc132d25af708a7f8a802096
Cr-Commit-Position: refs/heads/master@{#422663}
Patch Set 1 #Patch Set 2 : use @dgozman's array implementation #Patch Set 3 : rebaseline #
Total comments: 8
Patch Set 4 : address comments #
Total comments: 8
Patch Set 5 : address comments #
Messages
Total messages: 28 (19 generated)
|