actions/typos
1
0
Fork 0
mirror of https://github.com/crate-ci/typos.git synced 2024-12-22 23:52:12 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions
2215 commits 2 branches 509 tags 38 MiB
Commit graph

11 commits

Author SHA1 Message Date
Ed Page
9efaabdf84 style: Make clippy happy 2024-12-02 11:33:06 -06:00
Ed Page
267121b5d6 style: Make clippy happy 2024-07-26 16:08:02 -05:00
Ed Page
b6c895ea49 chore: Update from _rust/main template 2024-04-30 11:28:23 -05:00
Ed Page
0c05b217d4 style: Make clippy happy 2023-09-01 10:20:03 -05:00
Ed Page
2b667ffe55 fix: Correctly calculate trie 2022-10-04 10:57:28 -05:00
Ed Page
4c2f2c434a feat(dict): Shared PHF support 2021-07-01 11:14:30 -05:00
Ed Page
3b43272724 refactor(dict): Separate dictgen concerns 2021-07-01 11:00:33 -05:00
Ed Page
bbbf985777 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 21:03:57 -05:00
Ed Page
908f9d44eb refactor(dict): Be more cache concious 2021-06-30 19:56:03 -05:00
Ed Page
f176055834 refactor(dict): Make room for trie logic 2021-06-30 19:56:03 -05:00
Ed Page
a1e95bc7c0 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