This little snippet will print the first 'x' primes, with 'x' being a number supplied as the argument to the snippet (defaults to 10). It relies on Abigail-II's one-line prime number test and iterators as described in Dominus upcoming book.
#!/usr/bin/perl use warnings; use strict; sub NEXT ($) { $_[0]->() } sub prime_iterator { my $num = 0; sub { do { $num++; } until ( (1 x $num) !~ /^(11+)\1+$/); return $num; } } my $prime = prime_iterator; print NEXT $prime, "\n" for (1 .. shift || 10);
In reply to Prime Iterator by Ovid
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |