Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

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 primes.pl 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);


Comment on Re: Prime Number Finder
Download Code
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?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (11)
As of 2015-07-28 08:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (254 votes), past polls