NateNate60@lemmy.world to Programmer Humor@lemmy.ml · edit-216 hours agoOh boy what a beautiful regex. I'm sure it does something logical and easy to understand.lemmy.worldimagemessage-square67fedilinkarrow-up1218arrow-down15file-text
arrow-up1213arrow-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-216 hours agomessage-square67fedilinkfile-text
^.?$|^(..+?)\1+$ <answer> Matches strings of any character repeated a non-prime number of times https://www.youtube.com/watch?v=5vbk0TwkokM
minus-squareexplore_broadenlinkfedilinkarrow-up3·4 hours agoYes, the first one matches only 2 more characters while the second matches 1 or more. Also the +? is a lazy quantifier so it will consume as little as possible.
minus-squareFeathercrown@lemmy.worldlinkfedilinkEnglisharrow-up2·4 hours agoAh, didn’t know +? was lazy, thanks
Yes, the first one matches only 2 more characters while the second matches 1 or more. Also the +? is a lazy quantifier so it will consume as little as possible.
Ah, didn’t know +? was lazy, thanks