typos

actions/typos

Fork 0

mirror of https://github.com/crate-ci/typos.git synced 2025-02-22 21:11:02 -05:00

Commit graph

Author	SHA1	Message	Date
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	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

Author

SHA1

Message

Date

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

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

3 commits