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

Programmer Humor

35579 readers
229 users here now

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

Rules:

founded 5 years ago
MODERATORS
 

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

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

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

(page 2) 33 comments
sorted by: hot top controversial new old
[–] Feathercrown@lemmy.world 3 points 6 months ago (4 children)

Is there a reason to use (..+?) instead of (.+) ?

load more comments (4 replies)
[–] ShaunaTheDead@fedia.io 2 points 6 months ago

It matches for non-primes and doesn't match for primes.

[–] JackbyDev@programming.dev 2 points 6 months ago

The pipe is throwing me off because usually I have to do parentheses for that to work...

[–] FourPacketsOfPeanuts@lemmy.world 1 points 5 months ago* (last edited 5 months ago)

I'm I the only one who pronounces regex with a soft g? Hard g feels so clunky

[–] Sylvartas@lemmy.world -2 points 6 months ago (3 children)

All my homies hate regexs. That's actually the best use case I found for LLMs so far : I just tell it what I want it to match or not match, and it usually spits out a decent one

load more comments (3 replies)
load more comments
view more: ‹ prev next ›