Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Optimize quadratic runtime algorithm with tries/suffix trees #410

Open
marfox opened this issue Jul 30, 2021 · 0 comments
Open

Optimize quadratic runtime algorithm with tries/suffix trees #410

marfox opened this issue Jul 30, 2021 · 0 comments
Labels
task Atomic activity
Projects
v2
Milestone
Refactoring & doc...

Comments

@marfox
Copy link
Member

marfox commented Jul 30, 2021

if this is a bottleneck you can make it faster via tries or suffix trees. a trie is rather easy to implement but limited to queries like a.startswith(b), while suffix trees are appropriate for full text search (pretty sure there's a library for that if you don't mind additional dependencies)

Originally posted by @e-dorigatti in #405 (comment)
@marfox marfox added the task Atomic activity label Jul 30, 2021
@marfox marfox added this to To do in v2 via automation Jul 30, 2021
@marfox marfox added this to the Validator v2 milestone Jul 30, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
task Atomic activity
Projects
v2
  
To do
Milestone
Refactoring & documentation
Development

No branches or pull requests
1 participant
@marfox