Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
-
@12bitfloat compare nullesness first, then - length, and then - what you've said. Considering that length is a property of string and not smth you have to calculate each time
-
@netikras You're right. Forgot about that part
-
@netikras dont you need to go through every character to calculate the hash?
-
@12bitfloat although comparing byte-by-byte and failing at a first mismatch is likely to be faster than digesting the whole stringS in a first place..
-
@Pyjong You do. It's only beneficial for multilpe compares
-
@12bitfloat since java strings are immutable.. Doesn't java.lang.String calc hash at construction time and cache it locally? I've got to admit I've never checked
-
@netikras It calculates it the first time it's needed IIRC, so in the first call to hashcode()
-
@12bitfloat right makes sense
when your code is a mess but everything work out in the end
When you keep getting +1s on a rant you posted a month ago.
Go big or go home.
What is the best string comparison algorithm ?
Example Use case: group messages from your telco into groups of related messages.
I have gone through the various algos and implanted them. I just want your opinion if you have experience on this.
rant
algorithm
string