actions/typos
1
0
Fork 0
mirror of https://github.com/crate-ci/typos.git synced 2025-02-22 13:00:56 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions
typos/crates/dictgen/src/lib.rs

6 lines
57 B
Rust
Raw Normal View History

refactor(dict): Make room for trie logic
2021-06-30 10:46:22 -05:00
mod table;
perf(dict): Switch varcon to a burst-trie This cuts varcon lookup times in half but I still suspect slower than phf. Like with bsearch and unlike, the cost is consistent between hits and misses. At least this doesn't have the compile hit of PHF + unicase. Maybe I should experiment with integrating a non-const-fn variant of unicase with PHF and give up on all of this extra complexity.
2021-06-30 16:03:09 -05:00
mod trie;
refactor(dict): Pull out table-lookup logic Before, only some dicts did we guarentee were pre-sorted. Now, all are for-sure pre-sorted. This also gives each dict the size-check to avoid lookup. But this is really about refactoring in prep for playing with other lookup options, like tries.
2021-06-30 10:12:17 -05:00
refactor(dict): Make room for trie logic
2021-06-30 10:46:22 -05:00
pub use table::*;
perf(dict): Switch varcon to a burst-trie This cuts varcon lookup times in half but I still suspect slower than phf. Like with bsearch and unlike, the cost is consistent between hits and misses. At least this doesn't have the compile hit of PHF + unicase. Maybe I should experiment with integrating a non-const-fn variant of unicase with PHF and give up on all of this extra complexity.
2021-06-30 16:03:09 -05:00
pub use trie::*;
Reference in a new issue Copy permalink