perf(parse/tailwind): use compact trie for lexing base names instead of linear search

[dyc3]

Summary

This optimizes how the tailwind parser searches for base names. Instead of a linear search, it uses a compact trie to prune possible base names.

The trie data structure was mostly generated with AI.

Test Plan

CI remains green, biome_tailwind_parser should see a 2x perf improvement.

Docs

[changeset-bot]

⚠️ No Changeset found

Latest commit: 13c964b

Merging this PR will not cause a version bump for any packages. If these changes should not result in a new version, you're good to go. If these changes should result in a version bump, you need to add a changeset.

This PR includes no changesets

When changesets are added to this PR, you'll see the packages that this PR includes changesets for and the associated semver types

Click here to learn what changesets are, and how to add one.

Click here if you're a maintainer who wants to add a changeset to this PR

[dyc3]

Warning

This pull request is not mergeable via GitHub because a downstack PR is open. Once all requirements are satisfied, merge this PR as a stack on Graphite.
Learn more

• perf(parse/tailwind): use compact trie for lexing base names instead of linear search #7977 👈 (View in Graphite)
• feat(parse/tailwind): add benchmark #7976
• fix(parse/tailwind): fix lexing inset-x, border-slate-500, and others #7975
• main

This stack of pull requests is managed by Graphite. Learn more about stacking.

[ematipico]

biome_tailwind_parser should see a 2x perf improvement.

Do you have any benchmarks to share? I don't think we have any benches in codspeed

[dyc3]

See the previous PR in this stack: #7976

let me know if i need to do anything for those benches to show up in codspeed