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

Programmer Humor

32710 readers
870 users here now

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

Rules:

founded 5 years ago
MODERATORS
[email protected]
[email protected]
334
Oh boy what a beautiful regex. I'm sure it does something logical and easy to understand. (lemmy.world)
submitted 2 months ago* (last edited 2 months ago) by NateNate60 to c/[email protected]
83 comments fedilink hide all child comments
 

^.?$|^(..+?)\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
[โ€“] thevoidzero 1 points 2 months ago* (last edited 2 months ago) (1 children)

\1 is group 1 which is inside (), so second part is repeated 2 or more times of 2 or more char.

[โ€“] [email protected] 1 points 2 months ago

Interesting.

So that means match any string that is made entirely of a single repeating sequence, where repititon is possible.