334
submitted 2 months ago* (last edited 2 months ago) by NateNate60@lemmy.world to c/programmerhumor@lemmy.ml

^.?$|^(..+?)\1+$

Matches strings of any character repeated a non-prime number of times

https://www.youtube.com/watch?v=5vbk0TwkokM

you are viewing a single comment's thread
view the rest of the comments
[-] yrmp@lemmy.world 5 points 2 months ago

Regex should generally be avoided wherever possible.

[-] NateNate60@lemmy.world 12 points 2 months ago

Yeah but it's just so tempting... It validates so many inputs so easily...

[-] yrmp@lemmy.world 12 points 2 months ago

And misses others you didn’t think about.

[-] gwilikers@lemmy.ml 6 points 2 months ago

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.

this post was submitted on 31 Oct 2024
334 points (97.7% liked)

Programmer Humor

32710 readers
8 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

founded 5 years ago
MODERATORS