329

Oh boy what a beautiful regex. I'm sure it does something logical and easy to understand.(lemmy.world)

posted
*
by
Avatar
NateNate60@lemmy.world
in
Avatar
programmerhumor@lemmy.ml
83 comments
hidereport

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

<answer>

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

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

Sort:
HotTopControversialNewOld
You are viewing a single thread.
View all comments View context
Avatar
gwilikers@lemmy.ml
6 points

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.

permalink
report
parent
reply

Programmer Humor

!programmerhumor@lemmy.ml

Create post

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

Rules:

  • Posts must be relevant to programming, programmers, or computer science.
  • No NSFW content.
  • Jokes must be in good taste. No hate speech, bigotry, etc.

Community stats

  • 5.4K

    Monthly active users

  • 887

    Posts

  • 9K

    Comments

Community moderators