4 ms·
Thank you for your comment! The power of Egison's pattern matching becomes more obvious when we consider more general pattern such as (p, p+ 100) not only (p,
by egi 8y ago
Thank you for your comment!
The power of Egison's pattern matching becomes more obvious when we consider more general pattern such as (p, p+ 100) not only (p, p+2).
We can write the first 5 prime pairs whose form is (p, p+100) with a small modification for pattern matching for twin primes.
(take 5
(match-all primes (list integer)
[<join _ <cons $p <join _ <cons ,(+ p 100) _>>>>
[p (+ p 100)]]))
;=>{[3 103] [7 107] [13 113] [31 131] [37 137]}
- nerdponx 8y agoI still don't see how this should require nested cons-es and 3 different types of enclosing braces. Not only that, but you have redundancy between the ,(+ p n) part of the pattern and the emitted result of [p (+ p n)]. Point being: I applaud the attempt here, but it's not something I'll ever want to use.
- sp332 8y agoI guess I had just lost the context. It's pretty cool as a pattern-matching demo.