Ed Page
0c05b217d4
style: Make clippy happy
2023-09-01 10:20:03 -05:00
renovate[bot]
6da9470ef9
chore(deps): update compatible
2023-09-01 01:11:49 +00:00
Ed Page
5a63cb3be6
chore: Release
2023-07-14 14:02:39 -05:00
Ed Page
9426924f8f
fix: Hide optional dependencies
2023-07-14 12:33:02 -05:00
Ed Page
39b28c3010
chore: Release
2022-11-03 22:28:10 -05:00
Ed Page
87a02e2a2a
chore: Switch to workspace inheritance
2022-11-01 14:20:38 -05:00
Ed Page
16ca0accbb
chore: Release
2022-10-06 08:26:11 -05:00
Ed Page
2b667ffe55
fix: Correctly calculate trie
2022-10-04 10:57:28 -05:00
Ed Page
f78135acd2
chore: Bump MSRV to 1.64.0
2022-10-04 10:51:03 -05:00
Ed Page
4d9c507595
chore: Release
2022-08-13 12:03:26 -05:00
Ed Page
80f1ed0290
chore: Bump MSRV to 1.60
2022-08-03 09:32:45 -05:00
Ed Page
ea38677643
chore: Update dependencies
2022-08-03 09:29:38 -05:00
Ed Page
aff7161142
chore: Release
2022-06-15 16:11:53 -05:00
Ed Page
7c953a71ec
chore: Upgrade to 2021 edition
2022-06-01 06:53:10 -05:00
Ed Page
b15558f0f3
chore: Set rust-version
2022-06-01 06:51:59 -05:00
Ed Page
469a9aedc2
chore: Release
2021-12-14 12:58:03 -06:00
Ed Page
c0e8a2c932
chore: Release
2021-11-16 07:46:33 -06:00
Ed Page
a8ae8a5c26
chore: Update boiletplate
2021-11-08 10:11:02 -06:00
Ed Page
153f570ec9
chore: Release
2021-11-03 11:48:12 -05:00
Ed Page
92e46848a3
chore: Update dependencies
2021-09-01 06:38:52 -05:00
Ed Page
dbea7ab1e0
chore: Release
2021-08-30 09:16:40 -05:00
Ed Page
613a0cba4b
chore: Iterate on release process
2021-08-16 11:23:25 -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