NateNate60@lemmy.world to Programmer Humor@lemmy.ml · edit-214 days agoOh boy what a beautiful regex. I'm sure it does something logical and easy to understand.lemmy.worldimagemessage-square83fedilinkarrow-up1338arrow-down110file-text
arrow-up1328arrow-down1imageOh boy what a beautiful regex. I'm sure it does something logical and easy to understand.lemmy.worldNateNate60@lemmy.world to Programmer Humor@lemmy.ml · edit-214 days agomessage-square83fedilinkfile-text
^.?$|^(..+?)\1+$ <answer> Matches strings of any character repeated a non-prime number of times https://www.youtube.com/watch?v=5vbk0TwkokM
minus-squarePeriodicallyPedantic@lemmy.calinkfedilinkarrow-up4arrow-down1·14 days agoEmpty input Or input of exactly 1 character Or input of at least 2 characters, followed by at least 1 something (idk what \1 matches) Did I get it (almost)?
minus-squarethevoidzero@lemmy.worldlinkfedilinkarrow-up1·edit-214 days ago\1 is group 1 which is inside (), so second part is repeated 2 or more times of 2 or more char.
minus-squarePeriodicallyPedantic@lemmy.calinkfedilinkarrow-up1·13 days agoInteresting. So that means match any string that is made entirely of a single repeating sequence, where repititon is possible.
Empty input Or input of exactly 1 character Or input of at least 2 characters, followed by at least 1 something (idk what \1 matches)
Did I get it (almost)?
\1 is group 1 which is inside
(), so second part is repeated 2 or more times of 2 or more char.Interesting.
So that means match any string that is made entirely of a single repeating sequence, where repititon is possible.