No such thing as a small change | |
PerlMonks |
Re^2: bit array comparisonby Amendil (Novice) |
on Oct 22, 2019 at 17:46 UTC ( [id://11107865]=note: print w/replies, xml ) | Need Help?? |
Very interesting! To be honest, I'm not really interested in space. It's just that my naive implementation is slow, and I want to see how fast it can be. I know that I lost a lot of performance when I started comparing list of strings. Thank you for making me learn a bit more about Perl today. edit: To reproduce what you did for Jaccard module, calling set_to_string first, I also did the same for your implementation. What's interesting is that it doubled the performance hash: 340k/s -> 420k/s, bits: 800k/s -> 1.7m/s
In Section
Seekers of Perl Wisdom
|
|