Fzy algorithm port for Crystal language.

[hugopl]

Hi, not really an issue, just to let you know I created a port of Fyz algorithm for the Crystal language.

https://github.com/hugopl/fzy

And thanks for the very good work!!

[pepe]

I just came to investigate, cause I would like to wrap fzy match into Janet lang, and found this. Do you have any benchmarks of cr vs c? Just for my amazement. Feel free to ignore this.

Anyway thanks for this as I probably first verbatim copy your code to Janet and see how it fares.

[hugopl]

No, I haven't, but I guess it should be the same (or almost?), I'm already using it on https://github.com/hugopl/tijolo and it's pretty fast even compiled in debug mode for searches on a 10K entries collection.

[pepe]

Great! I went with the copying of the fzy.js instead. Thanks for the answer.

[hugopl]

Nice, I started this way too, I even ported the tests. The fzy.js code base is smaller and easier to find/understand things, but is exactly the same of the C version, IIRC just the matching function is different, using regular expressions.

[pepe]

Yep. The thing is that there is actually hasMatch fn in the index.js, but it is not used in the example. I guess Regexp is still faster. Thanks for the info :-). út 21. 7. 2020 v 15:26 odesílatel Hugo Parente Lima < notifications@github.com> napsal:

…

Nice, I started this way too, I even ported the tests. The fzy.js code base is smaller and easier to find/understand things, but is exactly the same of the C version, IIRC just the matching function is different, using regular expressions. — You are receiving this because you commented. Reply to this email directly, view it on GitHub <#137 (comment)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AAAAZBGVCQ7TZWRDZGPYTNTR4WJQLANCNFSM4KLBC57A> .

-- Ing. Josef Pospíšil LastStar.eu - CTO +420774278707 - iMessage, Telegram @damnpepe - Twitter