chrislo-sourceclassifier 0.2.0
Sign up to get free protection for your applications and to get access to all the features.
- data/Manifest +325 -0
- data/README.textile +51 -0
- data/Rakefile +64 -0
- data/examples/example.rb +22 -0
- data/lib/sourceclassifier.rb +22 -0
- data/lib/trainer.rb +51 -0
- data/sourceclassifier.gemspec +35 -0
- data/sources/gcc/ackermann.gcc-2.gcc +93 -0
- data/sources/gcc/ackermann.gcc-3.gcc +20 -0
- data/sources/gcc/ary.gcc +40 -0
- data/sources/gcc/binarytrees.gcc +136 -0
- data/sources/gcc/binarytrees.gcc-2.gcc +140 -0
- data/sources/gcc/binarytrees.gcc-3.gcc +134 -0
- data/sources/gcc/chameneos.gcc +117 -0
- data/sources/gcc/chameneos.gcc-2.gcc +134 -0
- data/sources/gcc/chameneos.gcc-3.gcc +120 -0
- data/sources/gcc/chameneosredux.gcc +306 -0
- data/sources/gcc/echo.gcc +144 -0
- data/sources/gcc/except.gcc +52 -0
- data/sources/gcc/fannkuch.gcc +105 -0
- data/sources/gcc/fannkuch.gcc-2.gcc +94 -0
- data/sources/gcc/fasta.gcc +158 -0
- data/sources/gcc/fasta.gcc-2.gcc +132 -0
- data/sources/gcc/fasta.gcc-3.gcc +145 -0
- data/sources/gcc/fasta.gcc-4.gcc +141 -0
- data/sources/gcc/fibo.gcc +20 -0
- data/sources/gcc/harmonic.gcc +22 -0
- data/sources/gcc/hash.gcc +31 -0
- data/sources/gcc/hash2.gcc +38 -0
- data/sources/gcc/heapsort.gcc +72 -0
- data/sources/gcc/hello.gcc-2.gcc +12 -0
- data/sources/gcc/hello.gcc-3.gcc +20 -0
- data/sources/gcc/knucleotide.gcc +173 -0
- data/sources/gcc/knucleotide.gcc-2.gcc +168 -0
- data/sources/gcc/lists.gcc +226 -0
- data/sources/gcc/magicsquares.gcc +378 -0
- data/sources/gcc/mandelbrot.gcc +84 -0
- data/sources/gcc/mandelbrot.gcc-2.gcc +63 -0
- data/sources/gcc/mandelbrot.gcc-3.gcc +91 -0
- data/sources/gcc/mandelbrot.gcc-4.gcc +78 -0
- data/sources/gcc/matrix.gcc +66 -0
- data/sources/gcc/message.gcc-2.gcc +72 -0
- data/sources/gcc/message.gcc-3.gcc +64 -0
- data/sources/gcc/methcall.gcc +89 -0
- data/sources/gcc/moments.gcc +120 -0
- data/sources/gcc/nbody.gcc +142 -0
- data/sources/gcc/nbody.gcc-2.gcc +143 -0
- data/sources/gcc/nbody.gcc-3.gcc +142 -0
- data/sources/gcc/nestedloop.gcc +25 -0
- data/sources/gcc/nsieve.gcc +35 -0
- data/sources/gcc/nsievebits.gcc-2.gcc +37 -0
- data/sources/gcc/nsievebits.gcc-3.gcc +53 -0
- data/sources/gcc/objinst.gcc +95 -0
- data/sources/gcc/partialsums.gcc +86 -0
- data/sources/gcc/partialsums.gcc-3.gcc +81 -0
- data/sources/gcc/partialsums.gcc-4.gcc +68 -0
- data/sources/gcc/pidigits.gcc +105 -0
- data/sources/gcc/primes.gcc +75 -0
- data/sources/gcc/prodcons.gcc +86 -0
- data/sources/gcc/random.gcc +29 -0
- data/sources/gcc/raytracer.gcc +125 -0
- data/sources/gcc/raytracer.gcc-2.gcc +181 -0
- data/sources/gcc/recursive.gcc +68 -0
- data/sources/gcc/recursive.gcc-2.gcc +55 -0
- data/sources/gcc/regexdna.gcc-2.gcc +126 -0
- data/sources/gcc/regexmatch.gcc +136 -0
- data/sources/gcc/revcomp.gcc +85 -0
- data/sources/gcc/revcomp.gcc-2.gcc +88 -0
- data/sources/gcc/revcomp.gcc-4.gcc +71 -0
- data/sources/gcc/reversefile.gcc +103 -0
- data/sources/gcc/reversefile.gcc-2.gcc +56 -0
- data/sources/gcc/sieve.gcc +34 -0
- data/sources/gcc/spectralnorm.gcc +54 -0
- data/sources/gcc/spellcheck.gcc +72 -0
- data/sources/gcc/spellcheck.gcc-2.gcc +61 -0
- data/sources/gcc/strcat.gcc +38 -0
- data/sources/gcc/sumcol.gcc-2.gcc +98 -0
- data/sources/gcc/sumcol.gcc-3.gcc +22 -0
- data/sources/gcc/sumcol.gcc-4.gcc +18 -0
- data/sources/gcc/sumcol.gcc-5.gcc +32 -0
- data/sources/gcc/takfp.gcc +23 -0
- data/sources/gcc/tcp-stream.gcc +122 -0
- data/sources/gcc/tcpecho.gcc +122 -0
- data/sources/gcc/tcpecho.gcc-2.gcc +136 -0
- data/sources/gcc/tcprequest.gcc +122 -0
- data/sources/gcc/threadring.gcc +73 -0
- data/sources/gcc/wc.gcc +52 -0
- data/sources/gcc/wc.gcc-2.gcc +40 -0
- data/sources/gcc/wc.gcc-3.gcc +46 -0
- data/sources/gcc/wordfreq.gcc-2.gcc +85 -0
- data/sources/perl/ackermann.perl +28 -0
- data/sources/perl/ackermann.perl-2.perl +25 -0
- data/sources/perl/ackermann.perl-3.perl +20 -0
- data/sources/perl/ackermann.perl-4.perl +18 -0
- data/sources/perl/ary.perl +25 -0
- data/sources/perl/ary.perl-2.perl +23 -0
- data/sources/perl/binarytrees.perl +66 -0
- data/sources/perl/binarytrees.perl-2.perl +71 -0
- data/sources/perl/chameneos.perl +67 -0
- data/sources/perl/echo.perl +81 -0
- data/sources/perl/except.perl +73 -0
- data/sources/perl/fannkuch.perl +44 -0
- data/sources/perl/fannkuch.perl-2.perl +38 -0
- data/sources/perl/fasta.perl +112 -0
- data/sources/perl/fasta.perl-2.perl +135 -0
- data/sources/perl/fasta.perl-4.perl +122 -0
- data/sources/perl/fibo.perl +15 -0
- data/sources/perl/fibo.perl-2.perl +0 -0
- data/sources/perl/fibo.perl-3.perl +0 -0
- data/sources/perl/harmonic.perl +7 -0
- data/sources/perl/hash.perl +23 -0
- data/sources/perl/hash.perl-2.perl +17 -0
- data/sources/perl/hash.perl-3.perl +24 -0
- data/sources/perl/hash2.perl +16 -0
- data/sources/perl/heapsort.perl +65 -0
- data/sources/perl/heapsort.perl-2.perl +0 -0
- data/sources/perl/hello.perl +5 -0
- data/sources/perl/knucleotide.perl-2.perl +30 -0
- data/sources/perl/lists.perl +48 -0
- data/sources/perl/mandelbrot.perl-2.perl +32 -0
- data/sources/perl/matrix.perl +59 -0
- data/sources/perl/matrix.perl-2.perl +0 -0
- data/sources/perl/matrix.perl-3.perl +0 -0
- data/sources/perl/message.perl +27 -0
- data/sources/perl/methcall.perl +66 -0
- data/sources/perl/moments.perl +44 -0
- data/sources/perl/nbody.perl +108 -0
- data/sources/perl/nestedloop.perl +28 -0
- data/sources/perl/nsieve.perl-2.perl +41 -0
- data/sources/perl/nsieve.perl-4.perl +43 -0
- data/sources/perl/nsievebits.perl +37 -0
- data/sources/perl/objinst.perl +73 -0
- data/sources/perl/partialsums.perl-3.perl +31 -0
- data/sources/perl/pidigits.perl +52 -0
- data/sources/perl/pidigits.perl-2.perl +47 -0
- data/sources/perl/process.perl +50 -0
- data/sources/perl/prodcons.perl +47 -0
- data/sources/perl/random.perl-4.perl +17 -0
- data/sources/perl/recursive.perl-2.perl +57 -0
- data/sources/perl/regexdna.perl +48 -0
- data/sources/perl/regexdna.perl-2.perl +43 -0
- data/sources/perl/regexdna.perl-3.perl +50 -0
- data/sources/perl/regexdna.perl-4.perl +49 -0
- data/sources/perl/regexdna.perl-5.perl +42 -0
- data/sources/perl/regexdna.perl-6.perl +43 -0
- data/sources/perl/regexmatch.perl +35 -0
- data/sources/perl/revcomp.perl-2.perl +34 -0
- data/sources/perl/reversefile.perl +8 -0
- data/sources/perl/reversefile.perl-2.perl +0 -0
- data/sources/perl/reversefile.perl-3.perl +0 -0
- data/sources/perl/sieve.perl +23 -0
- data/sources/perl/spectralnorm.perl-2.perl +54 -0
- data/sources/perl/spellcheck.perl +24 -0
- data/sources/perl/strcat.perl +13 -0
- data/sources/perl/strcat.perl-2.perl +0 -0
- data/sources/perl/sumcol.perl +8 -0
- data/sources/perl/takfp.perl +23 -0
- data/sources/perl/takfp.perl-3.perl +20 -0
- data/sources/perl/tcpecho.perl +61 -0
- data/sources/perl/tcprequest.perl +61 -0
- data/sources/perl/tcpstream.perl +61 -0
- data/sources/perl/threadring.perl +55 -0
- data/sources/perl/threadring.perl-2.perl +43 -0
- data/sources/perl/wc.perl +20 -0
- data/sources/perl/wc.perl-2.perl +14 -0
- data/sources/perl/wordfreq.perl +22 -0
- data/sources/perl/wordfreq.perl-3.perl +0 -0
- data/sources/perl/wordfreq.perl3.perl +0 -0
- data/sources/python/ackermann.python +21 -0
- data/sources/python/ary.python +19 -0
- data/sources/python/binarytrees.python +39 -0
- data/sources/python/binarytrees.python-3.python +44 -0
- data/sources/python/chameneos.python-6.python +73 -0
- data/sources/python/chameneosredux.python +126 -0
- data/sources/python/chameneosredux.python-2.python +122 -0
- data/sources/python/dispatch.python +176 -0
- data/sources/python/dispatch.python-2.python +136 -0
- data/sources/python/echo.python +64 -0
- data/sources/python/except.python +62 -0
- data/sources/python/fannkuch.python +50 -0
- data/sources/python/fannkuch.python-2.python +54 -0
- data/sources/python/fasta.python-2.python +79 -0
- data/sources/python/fibo.python +17 -0
- data/sources/python/fibo.python-2.python +0 -0
- data/sources/python/fibo.python-3.python +0 -0
- data/sources/python/harmonic.python-2.python +9 -0
- data/sources/python/hash.python +21 -0
- data/sources/python/hash.python-2.python +0 -0
- data/sources/python/hash2.python +30 -0
- data/sources/python/heapsort.python-3.python +66 -0
- data/sources/python/hello.python +5 -0
- data/sources/python/implicitode.python +231 -0
- data/sources/python/knucleotide.python +55 -0
- data/sources/python/lists.python +44 -0
- data/sources/python/magicsquares.python +145 -0
- data/sources/python/mandelbrot.python +44 -0
- data/sources/python/mandelbrot.python-2.python +35 -0
- data/sources/python/mandelbrot.python-3.python +46 -0
- data/sources/python/matrix.python +34 -0
- data/sources/python/matrix.python-2.python +23 -0
- data/sources/python/message.python +24 -0
- data/sources/python/message.python-2.python +20 -0
- data/sources/python/message.python-3.python +19 -0
- data/sources/python/meteor.python +210 -0
- data/sources/python/meteor.python-2.python +192 -0
- data/sources/python/methcall.python +51 -0
- data/sources/python/moments.python +65 -0
- data/sources/python/nbody.python +123 -0
- data/sources/python/nbody.python-2.python +120 -0
- data/sources/python/nestedloop.python +24 -0
- data/sources/python/nsieve.python +27 -0
- data/sources/python/nsieve.python-2.python +23 -0
- data/sources/python/nsieve.python-4.python +25 -0
- data/sources/python/nsievebits.python +27 -0
- data/sources/python/nsievebits.python-2.python +43 -0
- data/sources/python/objinst.python +53 -0
- data/sources/python/partialsums.python +37 -0
- data/sources/python/partialsums.python-2.python +35 -0
- data/sources/python/partialsums.python-3.python +48 -0
- data/sources/python/pidigits.python +38 -0
- data/sources/python/pidigits.python-3.python +63 -0
- data/sources/python/pidigits.python-4.python +24 -0
- data/sources/python/process.python +51 -0
- data/sources/python/process.python-2.python +133 -0
- data/sources/python/prodcons.python +51 -0
- data/sources/python/prodcons.python-2.python +0 -0
- data/sources/python/random.python +27 -0
- data/sources/python/raytracer.python +203 -0
- data/sources/python/recursive.python +35 -0
- data/sources/python/regexdna.python +39 -0
- data/sources/python/regexdna.python-2.python +34 -0
- data/sources/python/regexmatch.python +36 -0
- data/sources/python/revcomp.python-3.python +31 -0
- data/sources/python/reversefile.python +13 -0
- data/sources/python/reversefile.python-2.python +0 -0
- data/sources/python/reversefile.python-3.python +0 -0
- data/sources/python/sieve.python +50 -0
- data/sources/python/spectralnorm.python-2.python +36 -0
- data/sources/python/spellcheck.python +17 -0
- data/sources/python/strcat.python +35 -0
- data/sources/python/strcat.python-2.python +0 -0
- data/sources/python/sumcol.python-2.python +0 -0
- data/sources/python/sumcol.python-3.python +0 -0
- data/sources/python/takfp.python +19 -0
- data/sources/python/tcpecho.python +67 -0
- data/sources/python/tcprequest.python +67 -0
- data/sources/python/tcpstream.python +67 -0
- data/sources/python/threadring.python +47 -0
- data/sources/python/threadring.python-2.python +40 -0
- data/sources/python/threadring.python-3.python +34 -0
- data/sources/python/wc.python-2.python +19 -0
- data/sources/python/wordfreq.python +43 -0
- data/sources/python/wordfreq.python-2.python +0 -0
- data/sources/python/wordfreq.python-3.python +28 -0
- data/sources/python/wordfreq.python-4.python +38 -0
- data/sources/python/wordfreq.python-5.python +39 -0
- data/sources/ruby/ackermann.ruby +17 -0
- data/sources/ruby/ackermann.ruby-5.ruby +153 -0
- data/sources/ruby/ary.ruby +22 -0
- data/sources/ruby/binarytrees.ruby-2.ruby +55 -0
- data/sources/ruby/chameneos.ruby-2.ruby +71 -0
- data/sources/ruby/dispatch.ruby +114 -0
- data/sources/ruby/echo.ruby +41 -0
- data/sources/ruby/except.ruby +61 -0
- data/sources/ruby/except.ruby-2.ruby +61 -0
- data/sources/ruby/fannkuch.ruby +42 -0
- data/sources/ruby/fasta.ruby +81 -0
- data/sources/ruby/fibo.ruby +15 -0
- data/sources/ruby/harmonic.ruby-2.ruby +15 -0
- data/sources/ruby/hash.ruby +19 -0
- data/sources/ruby/hash2.ruby +23 -0
- data/sources/ruby/heapsort.ruby +55 -0
- data/sources/ruby/hello.ruby +6 -0
- data/sources/ruby/knucleotide.ruby-2.ruby +44 -0
- data/sources/ruby/lists.ruby +46 -0
- data/sources/ruby/mandelbrot.ruby-3.ruby +63 -0
- data/sources/ruby/matrix.ruby +40 -0
- data/sources/ruby/matrix.ruby-2.ruby +30 -0
- data/sources/ruby/message.ruby +29 -0
- data/sources/ruby/message.ruby-2.ruby +24 -0
- data/sources/ruby/meteor.ruby +386 -0
- data/sources/ruby/meteor.ruby-2.ruby +561 -0
- data/sources/ruby/methcall.ruby +58 -0
- data/sources/ruby/methcall.ruby-2.ruby +54 -0
- data/sources/ruby/moments.ruby +64 -0
- data/sources/ruby/nbody.ruby-2.ruby +145 -0
- data/sources/ruby/nestedloop.ruby +22 -0
- data/sources/ruby/nsieve.ruby +36 -0
- data/sources/ruby/nsieve.ruby-2.ruby +25 -0
- data/sources/ruby/nsievebits.ruby-2.ruby +42 -0
- data/sources/ruby/objinst.ruby +58 -0
- data/sources/ruby/partialsums.ruby +39 -0
- data/sources/ruby/pidigits.ruby +92 -0
- data/sources/ruby/pidigits.ruby-2.ruby +109 -0
- data/sources/ruby/prodcons.ruby +41 -0
- data/sources/ruby/random.ruby +17 -0
- data/sources/ruby/recursive.ruby-2.ruby +53 -0
- data/sources/ruby/regexdna.ruby +32 -0
- data/sources/ruby/regexdna.ruby-2.ruby +38 -0
- data/sources/ruby/regexmatch.ruby +33 -0
- data/sources/ruby/revcomp.ruby +28 -0
- data/sources/ruby/reversefile.ruby +7 -0
- data/sources/ruby/sieve.ruby +30 -0
- data/sources/ruby/spectralnorm.ruby +48 -0
- data/sources/ruby/spellcheck.ruby +18 -0
- data/sources/ruby/spellcheck.ruby-2.ruby +0 -0
- data/sources/ruby/strcat.ruby +12 -0
- data/sources/ruby/strcat.ruby-2.ruby +12 -0
- data/sources/ruby/sumcol.ruby +12 -0
- data/sources/ruby/sumcol.ruby-2.ruby +5 -0
- data/sources/ruby/takfp.ruby +15 -0
- data/sources/ruby/tcpecho.ruby +45 -0
- data/sources/ruby/tcprequest.ruby +45 -0
- data/sources/ruby/tcpstream.ruby +45 -0
- data/sources/ruby/threadring.ruby +61 -0
- data/sources/ruby/threadring.ruby-2.ruby +33 -0
- data/sources/ruby/wc.ruby +15 -0
- data/sources/ruby/wordfreq.ruby +17 -0
- data/sources/ruby/wordfreq.ruby2.ruby +0 -0
- data/test/fixtures/sources/gcc/ackermann.gcc-2.gcc +93 -0
- data/test/fixtures/sources/python/ackermann.python +21 -0
- data/test/fixtures/sources/ruby/ackermann.ruby +17 -0
- data/test/test_source_classifier.rb +40 -0
- data/test/test_trainer.rb +34 -0
- data/trainer.bin +1193 -0
- metadata +393 -0
@@ -0,0 +1,47 @@
|
|
1
|
+
# The Computer Language Benchmarks Game
|
2
|
+
# http://shootout.alioth.debian.org/
|
3
|
+
#
|
4
|
+
# contributed by Robert Bradshaw
|
5
|
+
# modified by Ruud H.G.van Tol
|
6
|
+
# modified by Emanuele Zeppieri
|
7
|
+
# modified to use Math:GMP by Kuang-che Wu
|
8
|
+
|
9
|
+
use strict;
|
10
|
+
use Math::GMP;
|
11
|
+
|
12
|
+
my($z0, $z1, $z2) = map Math::GMP->new($_),1,0,1;
|
13
|
+
|
14
|
+
sub extract_digit { return ($z0*$_[0]+$z1)/$z2; }
|
15
|
+
|
16
|
+
sub compose {
|
17
|
+
if ( defined $_[3] ) {
|
18
|
+
$z1 = $z1*$_[0]+$_[1]*$z2;
|
19
|
+
} else {
|
20
|
+
$z1 = $z1*$_[2]+$_[1]*$z0;
|
21
|
+
}
|
22
|
+
$z0 = $z0*$_[0];
|
23
|
+
$z2 = $z2*$_[2];
|
24
|
+
return;
|
25
|
+
}
|
26
|
+
|
27
|
+
my $n = $ARGV[0];
|
28
|
+
($,, $\) = ("\t", "\n");
|
29
|
+
my ($i, $s, $d); my $k = 0;
|
30
|
+
|
31
|
+
# main loop
|
32
|
+
for $i (1..$n) {
|
33
|
+
while (
|
34
|
+
$z0>$z2 || ( $d = extract_digit(3) ) != extract_digit(4)
|
35
|
+
) {
|
36
|
+
# y not safe
|
37
|
+
$k++; compose($k, 4*$k+2, 2*$k+1)
|
38
|
+
}
|
39
|
+
compose(10, -10*$d, 1, 1);
|
40
|
+
$s .= $d;
|
41
|
+
|
42
|
+
unless ( $i % 10 ) { print $s, ":$i"; undef $s }
|
43
|
+
}
|
44
|
+
|
45
|
+
$s .= ' ' x (10-$i) if $i = $n % 10;
|
46
|
+
|
47
|
+
print $s, ":$n" if $s
|
@@ -0,0 +1,50 @@
|
|
1
|
+
#!/usr/bin/perl
|
2
|
+
|
3
|
+
# perl thread benchmark for The Great Computer Language Shootout
|
4
|
+
# http://shootout.alioth.debian.org/
|
5
|
+
# Contributed by Steve Clark
|
6
|
+
|
7
|
+
# perl threads creates an interpreter per thread so this won't
|
8
|
+
# be pretty.
|
9
|
+
use threads;
|
10
|
+
|
11
|
+
# The thread code blocks til it gets a message, then sends it
|
12
|
+
# Argument is reference to last thread
|
13
|
+
sub inc_thread {
|
14
|
+
my $thr = shift;
|
15
|
+
my ($num) = $thr->join;
|
16
|
+
$num++;
|
17
|
+
return ($num);
|
18
|
+
}
|
19
|
+
|
20
|
+
# special thread to kick off the chain
|
21
|
+
sub zero_thread {
|
22
|
+
return (0);
|
23
|
+
}
|
24
|
+
|
25
|
+
|
26
|
+
# Algorithm:
|
27
|
+
# Create n threads from 1 to n
|
28
|
+
# Each thread x has ref to thread x-1
|
29
|
+
# Creates extra zero_thread to send 0 to start of chain
|
30
|
+
# prints return of last thread created
|
31
|
+
|
32
|
+
sub dothread {
|
33
|
+
my $n = shift;
|
34
|
+
my $thread = threads->new(\&zero_thread);
|
35
|
+
|
36
|
+
for ($i = 1; $i <= $n; $i++) {
|
37
|
+
$thread = threads->new(\&inc_thread, $thread);
|
38
|
+
}
|
39
|
+
|
40
|
+
# Now wait for end
|
41
|
+
my $num = $thread->join;
|
42
|
+
|
43
|
+
# print the result
|
44
|
+
print "$num\n";
|
45
|
+
}
|
46
|
+
|
47
|
+
|
48
|
+
my $NUM = $ARGV[0];
|
49
|
+
$NUM = 1 if ($NUM < 1);
|
50
|
+
dothread ($NUM);
|
@@ -0,0 +1,47 @@
|
|
1
|
+
#!/usr/bin/perl
|
2
|
+
# $Id: prodcons.perl,v 1.3 2005-05-13 16:24:18 igouy-guest Exp $
|
3
|
+
# http://www.bagley.org/~doug/shootout/
|
4
|
+
|
5
|
+
use strict;
|
6
|
+
use Thread qw(cond_wait cond_signal);
|
7
|
+
|
8
|
+
my $count = 0;
|
9
|
+
my $data = 0;
|
10
|
+
my $produced = 0;
|
11
|
+
my $consumed = 0;
|
12
|
+
|
13
|
+
sub consumer {
|
14
|
+
my $n = shift;
|
15
|
+
while (1) {
|
16
|
+
lock($count);
|
17
|
+
cond_wait($count) while ($count == 0);
|
18
|
+
my $i = $data;
|
19
|
+
$count = 0;
|
20
|
+
$consumed++;
|
21
|
+
last if ($i == $n);
|
22
|
+
cond_signal($count);
|
23
|
+
}
|
24
|
+
}
|
25
|
+
|
26
|
+
sub producer {
|
27
|
+
my $n = shift;
|
28
|
+
for (my $i=1; $i<=$n; $i++) {
|
29
|
+
lock($count);
|
30
|
+
cond_wait($count) while ($count == 1);
|
31
|
+
$data = $i;
|
32
|
+
$count = 1;
|
33
|
+
$produced++;
|
34
|
+
cond_signal($count);
|
35
|
+
}
|
36
|
+
}
|
37
|
+
|
38
|
+
sub main {
|
39
|
+
my $n = ($ARGV[0] < 1) ? 1 : $ARGV[0];
|
40
|
+
my $p = Thread->new(\&producer, $n);
|
41
|
+
my $c = Thread->new(\&consumer, $n);
|
42
|
+
$p->join;
|
43
|
+
$c->join;
|
44
|
+
print "$produced $consumed\n";
|
45
|
+
}
|
46
|
+
|
47
|
+
&main();
|
@@ -0,0 +1,17 @@
|
|
1
|
+
# The Computer Language Shootout
|
2
|
+
# http://shootout.alioth.debian.org/
|
3
|
+
# Contributed by Kjetil Skotheim
|
4
|
+
|
5
|
+
use constant {IM => 139968, IA => 3877, IC => 29573};
|
6
|
+
my $LAST=42;
|
7
|
+
|
8
|
+
sub gen_random {
|
9
|
+
my ($n,$max) = @_;
|
10
|
+
use integer;
|
11
|
+
$LAST = ($LAST * IA + IC) % IM for 1..$n;
|
12
|
+
no integer;
|
13
|
+
return $max * $LAST / IM;
|
14
|
+
}
|
15
|
+
|
16
|
+
printf "%.9f\n", gen_random($ARGV[0] || 1, 100.0);
|
17
|
+
|
@@ -0,0 +1,57 @@
|
|
1
|
+
# The Computer Language Shootout
|
2
|
+
# http://shootout.alioth.debian.org/
|
3
|
+
# recursive test, by Andreas Koenig, Sep 24 2006
|
4
|
+
|
5
|
+
### Uses temp variables to help perl free memory earlier
|
6
|
+
|
7
|
+
use strict;
|
8
|
+
|
9
|
+
sub Ack
|
10
|
+
{
|
11
|
+
my ($x, $y) = @_;
|
12
|
+
|
13
|
+
return $y + 1 if $x == 0;
|
14
|
+
return Ack($x - 1, 1) if $y == 0;
|
15
|
+
|
16
|
+
my $y2 = Ack($x, $y - 1);
|
17
|
+
my $ret = Ack($x - 1, $y2);
|
18
|
+
return $ret;
|
19
|
+
}
|
20
|
+
|
21
|
+
sub Fib
|
22
|
+
{
|
23
|
+
my ($n) = @_;
|
24
|
+
|
25
|
+
return 1 if $n < 2;
|
26
|
+
|
27
|
+
my $f1 = Fib($n - 1);
|
28
|
+
my $f2 = Fib($n - 2);
|
29
|
+
return $f2 + $f1;
|
30
|
+
}
|
31
|
+
|
32
|
+
sub Tak
|
33
|
+
{
|
34
|
+
my ($x, $y, $z) = @_;
|
35
|
+
|
36
|
+
if ($y < $x) {
|
37
|
+
my $z1 = Tak($x - 1.0, $y, $z);
|
38
|
+
my $z2 = Tak($y - 1.0, $z, $x);
|
39
|
+
my $z3 = Tak($z - 1.0, $x, $y);
|
40
|
+
my $ret = Tak($z1, $z2, $z3);
|
41
|
+
return $ret;
|
42
|
+
} else {
|
43
|
+
return $z;
|
44
|
+
}
|
45
|
+
}
|
46
|
+
|
47
|
+
my $n = ($ARGV[0] || 0) - 1;
|
48
|
+
printf "Ack(%d,%d): %d\n",
|
49
|
+
3, $n + 1, Ack(3, $n + 1);
|
50
|
+
printf "Fib(%.1f): %.1f\n",
|
51
|
+
28.0 + $n, Fib(28.0 + $n);
|
52
|
+
printf "Tak(%d,%d,%d): %d\n",
|
53
|
+
$n * 3, $n * 2, $n, Tak($n * 3, $n * 2, $n);
|
54
|
+
printf "Fib(%d): %d\n",
|
55
|
+
3, Fib(3);
|
56
|
+
printf "Tak(%.1f,%.1f,%.1f): %.1f\n",
|
57
|
+
3.0,2.0,1.0, Tak(3.0,2.0,1.0);
|
@@ -0,0 +1,48 @@
|
|
1
|
+
# The Computer Language Benchmarks Game
|
2
|
+
# http://shootout.alioth.debian.org/
|
3
|
+
# contributed by Danny Sauer
|
4
|
+
# completely rewritten and
|
5
|
+
# cleaned up for speed and fun by
|
6
|
+
# Mirco Wahab (wahab@chemie.uni-halle.de)
|
7
|
+
#
|
8
|
+
# Rewritten by
|
9
|
+
# Emanuele Zeppieri
|
10
|
+
|
11
|
+
use strict;
|
12
|
+
|
13
|
+
my $input = do { local $/; <STDIN> };
|
14
|
+
my $file_length = length $input;
|
15
|
+
|
16
|
+
$input =~ s/^>.*$//mg;
|
17
|
+
$input =~ tr/\n//d;
|
18
|
+
|
19
|
+
my $seq_length = length $input;
|
20
|
+
|
21
|
+
for (
|
22
|
+
'agggtaaa|tttaccct',
|
23
|
+
'[cgt]gggtaaa|tttaccc[acg]',
|
24
|
+
'a[act]ggtaaa|tttacc[agt]t',
|
25
|
+
'ag[act]gtaaa|tttac[agt]ct',
|
26
|
+
'agg[act]taaa|ttta[agt]cct',
|
27
|
+
'aggg[acg]aaa|ttt[cgt]ccct',
|
28
|
+
'agggt[cgt]aa|tt[acg]accct',
|
29
|
+
'agggta[cgt]a|t[acg]taccct',
|
30
|
+
'agggtaa[cgt]|[acg]ttaccct'
|
31
|
+
) {
|
32
|
+
my ($r1, $r2) = split /\|/;
|
33
|
+
my $count;
|
34
|
+
$count++ while $input =~ /$r1/gi;
|
35
|
+
$count++ while $input =~ /$r2/gi;
|
36
|
+
print "$_ $count\n"
|
37
|
+
}
|
38
|
+
|
39
|
+
my %iub = (
|
40
|
+
B => '(c|g|t)', D => '(a|g|t)', H => '(a|c|t)' ,
|
41
|
+
K => '(g|t)' , M => '(a|c)' , N => '(a|c|g|t)',
|
42
|
+
R => '(a|g)' , S => '(c|g)' , V => '(a|c|g)' ,
|
43
|
+
W => '(a|t)' , Y => '(c|t)'
|
44
|
+
);
|
45
|
+
my $findiub = '([' . join('', keys %iub) . '])';
|
46
|
+
$input =~ s/$findiub/$iub{$1}/og;
|
47
|
+
|
48
|
+
printf "\n%d\n%d\n%d\n", $file_length, $seq_length, length $input;
|
@@ -0,0 +1,43 @@
|
|
1
|
+
# The Computer Language Shootout
|
2
|
+
# http://shootout.alioth.debian.org/
|
3
|
+
# contributed by Danny Sauer
|
4
|
+
# completely rewritten and
|
5
|
+
# cleaned up for speed and fun by
|
6
|
+
# Mirco Wahab (wahab@chemie.uni-halle.de)
|
7
|
+
|
8
|
+
use strict;
|
9
|
+
use warnings;
|
10
|
+
use re 'eval';
|
11
|
+
|
12
|
+
my $content = do { local $/; <STDIN> };
|
13
|
+
my $l_file = length $content;
|
14
|
+
my $dispose = qr/^>.*$|\n/m;
|
15
|
+
$content =~ s/$dispose//g;
|
16
|
+
my $l_code = length $content;
|
17
|
+
|
18
|
+
my @seq = ( 'agggtaaa|tttaccct',
|
19
|
+
'[cgt]gggtaaa|tttaccc[acg]',
|
20
|
+
'a[act]ggtaaa|tttacc[agt]t',
|
21
|
+
'ag[act]gtaaa|tttac[agt]ct',
|
22
|
+
'agg[act]taaa|ttta[agt]cct',
|
23
|
+
'aggg[acg]aaa|ttt[cgt]ccct',
|
24
|
+
'agggt[cgt]aa|tt[acg]accct',
|
25
|
+
'agggta[cgt]a|t[acg]taccct',
|
26
|
+
'agggtaa[cgt]|[acg]ttaccct' );
|
27
|
+
|
28
|
+
my @cnt = (0) x @seq;
|
29
|
+
for my $k (0..$#seq) {
|
30
|
+
++$cnt[$k] while $content=~/$seq[$k]/gi;
|
31
|
+
printf "$seq[$k] $cnt[$k]\n"
|
32
|
+
}
|
33
|
+
|
34
|
+
my %iub = ( B => '(c|g|t)', D => '(a|g|t)',
|
35
|
+
H => '(a|c|t)', K => '(g|t)', M => '(a|c)',
|
36
|
+
N => '(a|c|g|t)', R => '(a|g)', S => '(c|g)',
|
37
|
+
V => '(a|c|g)', W => '(a|t)', Y => '(c|t)' );
|
38
|
+
|
39
|
+
my $findiub = '(['.(join '', keys %iub).'])';
|
40
|
+
|
41
|
+
1 while $content =~ s/$findiub/$iub{$1}/og;
|
42
|
+
printf "\n%d\n%d\n%d\n", $l_file, $l_code, length $content;
|
43
|
+
|
@@ -0,0 +1,50 @@
|
|
1
|
+
# The Computer Language Shootout
|
2
|
+
# http://shootout.alioth.debian.org/
|
3
|
+
# contributed by Danny Sauer
|
4
|
+
# completely rewritten and
|
5
|
+
# cleaned up for speed and fun by
|
6
|
+
# Mirco Wahab (wahab@chemie.uni-halle.de)
|
7
|
+
#
|
8
|
+
# Rewritten for speed sextuplication by
|
9
|
+
# Emanuele Zeppieri
|
10
|
+
|
11
|
+
use strict;
|
12
|
+
|
13
|
+
my $input = do { local $/; <STDIN> };
|
14
|
+
my $file_length = length $input;
|
15
|
+
|
16
|
+
$input =~ s/^>.*$//mg;
|
17
|
+
$input =~ tr/\n//d;
|
18
|
+
|
19
|
+
my $seq_length = length $input;
|
20
|
+
|
21
|
+
my $input_lc = lc $input;
|
22
|
+
|
23
|
+
for (
|
24
|
+
'agggtaaa|tttaccct',
|
25
|
+
'[cgt]gggtaaa|tttaccc[acg]',
|
26
|
+
'a[act]ggtaaa|tttacc[agt]t',
|
27
|
+
'ag[act]gtaaa|tttac[agt]ct',
|
28
|
+
'agg[act]taaa|ttta[agt]cct',
|
29
|
+
'aggg[acg]aaa|ttt[cgt]ccct',
|
30
|
+
'agggt[cgt]aa|tt[acg]accct',
|
31
|
+
'agggta[cgt]a|t[acg]taccct',
|
32
|
+
'agggtaa[cgt]|[acg]ttaccct'
|
33
|
+
) {
|
34
|
+
my ($r1, $r2) = split /\|/;
|
35
|
+
my $count;
|
36
|
+
$count++ while $input_lc =~ /$r1/g;
|
37
|
+
$count++ while $input_lc =~ /$r2/g;
|
38
|
+
print "$_ $count\n"
|
39
|
+
}
|
40
|
+
|
41
|
+
my %iub = (
|
42
|
+
B => '(c|g|t)', D => '(a|g|t)', H => '(a|c|t)' ,
|
43
|
+
K => '(g|t)' , M => '(a|c)' , N => '(a|c|g|t)',
|
44
|
+
R => '(a|g)' , S => '(c|g)' , V => '(a|c|g)' ,
|
45
|
+
W => '(a|t)' , Y => '(c|t)'
|
46
|
+
);
|
47
|
+
my $findiub = '([' . join('', keys %iub) . '])';
|
48
|
+
$input =~ s/$findiub/$iub{$1}/og;
|
49
|
+
|
50
|
+
printf "\n%d\n%d\n%d\n", $file_length, $seq_length, length $input;
|
@@ -0,0 +1,49 @@
|
|
1
|
+
# The Computer Language Benchmarks Game
|
2
|
+
# http://shootout.alioth.debian.org/
|
3
|
+
# contributed by Danny Sauer
|
4
|
+
# completely rewritten and
|
5
|
+
# cleaned up for speed and fun by Mirco Wahab
|
6
|
+
# improved STDIN read, regex clean up by Jake Berner
|
7
|
+
|
8
|
+
use strict;
|
9
|
+
use warnings;
|
10
|
+
|
11
|
+
my $l_file = -s STDIN;
|
12
|
+
my $content; read STDIN, $content, $l_file;
|
13
|
+
# this is significantly faster than using <> in this case
|
14
|
+
|
15
|
+
my $dispose = qr/(^>.*)?\n/m; # slight performance gain here
|
16
|
+
$content =~ s/$dispose//g;
|
17
|
+
my $l_code = length $content;
|
18
|
+
|
19
|
+
my @seq = ( 'agggtaaa|tttaccct',
|
20
|
+
'[cgt]gggtaaa|tttaccc[acg]',
|
21
|
+
'a[act]ggtaaa|tttacc[agt]t',
|
22
|
+
'ag[act]gtaaa|tttac[agt]ct',
|
23
|
+
'agg[act]taaa|ttta[agt]cct',
|
24
|
+
'aggg[acg]aaa|ttt[cgt]ccct',
|
25
|
+
'agggt[cgt]aa|tt[acg]accct',
|
26
|
+
'agggta[cgt]a|t[acg]taccct',
|
27
|
+
'agggtaa[cgt]|[acg]ttaccct' );
|
28
|
+
|
29
|
+
my @cnt = (0) x @seq;
|
30
|
+
for my $k (0..$#seq) {
|
31
|
+
++$cnt[$k] while $content=~/$seq[$k]/gi;
|
32
|
+
printf "$seq[$k] $cnt[$k]\n"
|
33
|
+
}
|
34
|
+
|
35
|
+
my %iub = ( B => '(c|g|t)', D => '(a|g|t)',
|
36
|
+
H => '(a|c|t)', K => '(g|t)', M => '(a|c)',
|
37
|
+
N => '(a|c|g|t)', R => '(a|g)', S => '(c|g)',
|
38
|
+
V => '(a|c|g)', W => '(a|t)', Y => '(c|t)' );
|
39
|
+
|
40
|
+
# using $& and no submatch marginally improves the
|
41
|
+
# speed here, but mentioning $& causes perl to
|
42
|
+
# define that value for the @seq patterns too, which
|
43
|
+
# slows those down considerably. No change.
|
44
|
+
|
45
|
+
my $findiub = '(['.(join '', keys %iub).'])';
|
46
|
+
|
47
|
+
$content =~ s/$findiub/$iub{$1}/g;
|
48
|
+
|
49
|
+
printf "\n%d\n%d\n%d\n", $l_file, $l_code, length $content;
|
@@ -0,0 +1,42 @@
|
|
1
|
+
# The Computer Language Benchmarks Game
|
2
|
+
# http://shootout.alioth.debian.org/
|
3
|
+
# contributed by Danny Sauer
|
4
|
+
# modified by Mirco Wahab
|
5
|
+
# Sped up by 2^2 in 2007 by Steffen Mueller
|
6
|
+
|
7
|
+
use strict;
|
8
|
+
use warnings;
|
9
|
+
|
10
|
+
my $content = do { local $/; <STDIN> };
|
11
|
+
my $l_file = length $content;
|
12
|
+
my $dispose = qr/^>.*$|\n/m;
|
13
|
+
$content =~ s/$dispose//g;
|
14
|
+
my $l_code = length $content;
|
15
|
+
|
16
|
+
my @seq = ( 'agggtaaa|tttaccct',
|
17
|
+
'[cgt]gggtaaa|tttaccc[acg]',
|
18
|
+
'a[act]ggtaaa|tttacc[agt]t',
|
19
|
+
'ag[act]gtaaa|tttac[agt]ct',
|
20
|
+
'agg[act]taaa|ttta[agt]cct',
|
21
|
+
'aggg[acg]aaa|ttt[cgt]ccct',
|
22
|
+
'agggt[cgt]aa|tt[acg]accct',
|
23
|
+
'agggta[cgt]a|t[acg]taccct',
|
24
|
+
'agggtaa[cgt]|[acg]ttaccct' );
|
25
|
+
|
26
|
+
my @cnt = (0) x @seq;
|
27
|
+
for (0..$#seq) {
|
28
|
+
my ($l, $r) = map {qr/$_/} split /\|/, $seq[$_];
|
29
|
+
$cnt[$_] += (() = ($content=~/$l/gi, $content=~/$r/gi));
|
30
|
+
print $seq[$_], ' ', $cnt[$_], "\n";
|
31
|
+
}
|
32
|
+
|
33
|
+
my %iub = ( B => '(c|g|t)', D => '(a|g|t)',
|
34
|
+
H => '(a|c|t)', K => '(g|t)', M => '(a|c)',
|
35
|
+
N => '(a|c|g|t)', R => '(a|g)', S => '(c|g)',
|
36
|
+
V => '(a|c|g)', W => '(a|t)', Y => '(c|t)' );
|
37
|
+
|
38
|
+
my $findiub = '(['.(join '', keys %iub).'])';
|
39
|
+
|
40
|
+
$content =~ s/$findiub/$iub{$1}/g;
|
41
|
+
print "\n", $l_file, "\n", $l_code, "\n", length($content), "\n";
|
42
|
+
|