Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Re: Prime Number Finder

by Anonymous Monk
on Nov 01, 2013 at 14:25 UTC ( #1060766=note: print w/replies, xml ) Need Help??

in reply to Prime Number Finder

Straight from 'perlthrtut' of 5.18. Just throw two numbers at it: perl 2 100
#!/usr/bin/perl use strict; use warnings; use threads; use Thread::Queue; sub check_num { my ($upstream, $cur_prime) = @_; my $kid; my $downstream = Thread::Queue->new(); while (my $num = $upstream->dequeue()) { next unless ($num % $cur_prime); if ($kid) { $downstream->enqueue($num); } else { print("Found prime: $num\n"); $kid = threads->create(\&check_num, $downstream, $num); } } if ($kid) { $downstream->enqueue(undef); $kid->join(); } } my $stream = Thread::Queue->new(shift()..shift(), undef); check_num($stream, 2);

Replies are listed 'Best First'.
Re^2: Prime Number Finder
by Anonymous Monk on May 27, 2014 at 21:25 UTC
    TMTOWTDI :-)
    #!/usr/bin/perl s;; ;x; while() { print if (1 x++ $\) !~ m } { $|^(..+)\1+$|^$\$} }

      Can you please explain you code? I'm a noob, honestly i didn't understand your code but it works fine.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1060766]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (4)
As of 2021-05-10 22:47 GMT
Find Nodes?
    Voting Booth?
    Perl 7 will be out ...

    Results (108 votes). Check out past polls.