NateNate60@lemmy.world to Programmer Humor · edit-212 hours agoOh boy what a beautiful regex. I'm sure it does something logical and easy to understand.lemmy.worldimagemessage-square54fedilinkarrow-up1179arrow-down14file-text
arrow-up1175arrow-down1imageOh boy what a beautiful regex. I'm sure it does something logical and easy to understand.lemmy.worldNateNate60@lemmy.world to Programmer Humor · edit-212 hours agomessage-square54fedilinkfile-text
^.?$|^(..+?)\1+$ <answer> Matches strings of any character repeated a non-prime number of times https://www.youtube.com/watch?v=5vbk0TwkokM
minus-squareNateNate60@lemmy.worldOPlinkfedilinkarrow-up12·8 hours agoYeah but it’s just so tempting… It validates so many inputs so easily…
minus-squareyrmp@lemmy.worldlinkfedilinkarrow-up12arrow-down1·8 hours agoAnd misses others you didn’t think about.
minus-squaregwilikerslinkfedilinkarrow-up6·7 hours agoYeah, I’ve found myself wasting quite a lot of time thinking of the ‘perfect regex’ for task X only to realise that I could have avoided doing so by simply taking a different approach.
Yeah but it’s just so tempting… It validates so many inputs so easily…
And misses others you didn’t think about.
Yeah, I’ve found myself wasting quite a lot of time thinking of the ‘perfect regex’ for task X only to realise that I could have avoided doing so by simply taking a different approach.