chrislo-sourceclassifier 0.2.0

data/sources/ruby/regexdna.ruby-2.ruby

@@ -0,0 +1,38 @@
+# The Computer Language Benchmarks Game
+# http://shootout.alioth.debian.org/
+#
+# contributed by Steve Fisher
+
+dirty_seq = $stdin.readlines.join
+seq = dirty_seq.gsub( /(?:^>.*)?\n/, "" )
+
+def count( rx, str )
+  total = 0
+  rx.split( '|' ).each{|s|
+    x = s.sub(/\[.*\]/, " ").size
+    total += (str.size - str.gsub(/#{s}/i, "").size)/x }
+  total
+end
+
+puts [
+  'agggtaaa|tttaccct',
+  '[cgt]gggtaaa|tttaccc[acg]',
+  'a[act]ggtaaa|tttacc[agt]t',
+  'ag[act]gtaaa|tttac[agt]ct',
+  'agg[act]taaa|ttta[agt]cct',
+  'aggg[acg]aaa|ttt[cgt]ccct',
+  'agggt[cgt]aa|tt[acg]accct',
+  'agggta[cgt]a|t[acg]taccct',
+  'agggtaa[cgt]|[acg]ttaccct'
+].map{|s| "#{ s } #{ count( s, seq ) }" }
+
+puts
+puts dirty_seq.size, seq.size
+
+puts(
+{
+'B' => '(c|g|t)', 'D' => '(a|g|t)', 'H' => '(a|c|t)', 'K' => '(g|t)',
+'M' => '(a|c)', 'N' => '(a|c|g|t)', 'R' => '(a|g)', 'S' => '(c|t)',
+'V' => '(a|c|g)', 'W' => '(a|t)', 'Y' => '(c|t)'
+}.inject(seq){|s,ary| s.gsub( *ary ) }.size )
+

data/sources/ruby/regexmatch.ruby

@@ -0,0 +1,33 @@
+#!/usr/bin/ruby
+# -*- mode: ruby -*-
+# $Id: regexmatch.ruby,v 1.2 2005-05-17 05:20:31 bfulgham Exp $
+# http://shootout.alioth.debian.org/
+# modified by: Jon-Carlos Rivera
+
+re = Regexp.new(
+    '(?:^|[^\d\(])' +			# must be preceeded by non-digit
+    '(?:\((\d\d\d)\)|(\d\d\d))' +	# match 1 or 2: area code is 3 digits
+    '[ ]' +				# area code followed by one space
+    '(\d\d\d)' +			# match 3: prefix of 3 digits
+    '[ -]' +				# separator is either space or dash
+    '(\d\d\d\d)' +			# match 4: last 4 digits
+    '\D'				# must be followed by a non-digit
+)
+
+num = Integer(ARGV[0] || 1)
+
+phones = STDIN.readlines
+
+phonenum, count = "", 0
+
+(1..num).each do |iter|
+  phones.each do |line|
+	  if line =~ re 
+	    phonenum = "(#{($1 || $2)}) #{$3}-#{$4}";
+	    if iter == num
+		    count += 1
+		    puts "#{count}: #{phonenum}"
+	    end
+	  end
+  end
+end

data/sources/ruby/revcomp.ruby

@@ -0,0 +1,28 @@
+#!/usr/bin/ruby
+# The Great Computer Language Shootout
+# http://shootout.alioth.debian.org/
+#
+# Contributed by Peter Bjarke Olsen
+# Modified by Doug King
+
+seq=Array.new
+
+def revcomp(seq)
+  seq.reverse!.tr!('wsatugcyrkmbdhvnATUGCYRKMBDHVN','WSTAACGRYMKVHDBNTAACGRYMKVHDBN')
+  stringlen=seq.length
+  0.step(stringlen-1,60) {|x| print seq.slice(x,60) , "\n"}
+end
+
+while STDIN.gets
+  if $_ =~ />/
+    if seq.length != 0
+      revcomp(seq.join)
+      seq=Array.new
+    end
+    puts $_
+  else
+    sub(/\n/,'')
+    seq.push $_
+  end
+end
+revcomp(seq.join)

data/sources/ruby/reversefile.ruby

@@ -0,0 +1,7 @@
+#!/usr/bin/ruby
+# -*- mode: ruby -*-
+# $Id: reversefile.ruby,v 1.1.1.1 2004-05-19 18:12:18 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+
+print STDIN.readlines().reverse()
+

data/sources/ruby/sieve.ruby

@@ -0,0 +1,30 @@
+#!/usr/bin/ruby
+# -*- mode: ruby -*-
+# $Id: sieve.ruby,v 1.4 2004-11-10 06:48:59 bfulgham Exp $
+# http://shootout.alioth.debian.org/
+#
+# Revised implementation by Paul Sanchez
+
+NUM = Integer(ARGV.shift || 1)
+
+max, flags = 8192, nil
+flags0 = Array.new(max+1)
+for i in 2 .. max
+  flags0[i] = i
+end
+
+i=j=0
+
+NUM.times do
+    flags = flags0.dup
+    #for i in 2 .. Math.sqrt(max)	#<-- This is much faster
+    for i in 2 .. 8192 
+	next unless flags[i]
+	# remove all multiples of prime: i
+	(i+i).step(max, i) do |j|
+	    flags[j] = nil
+	end
+    end
+end
+
+print "Count: ", flags.compact.size, "\n"

data/sources/ruby/spectralnorm.ruby

@@ -0,0 +1,48 @@
+# The Computer Language Shootout
+# http://shootout.alioth.debian.org/
+# Contributed by Sokolov Yura
+
+def eval_A(i,j)
+	return 1.0/((i+j)*(i+j+1)/2+i+1)
+end
+
+def eval_A_times_u(u)
+        v, i = nil, nil
+	(0..u.length-1).collect { |i|
+                v = 0
+		for j in 0..u.length-1
+			v += eval_A(i,j)*u[j]
+                end
+                v
+        }
+end
+
+def eval_At_times_u(u)
+	v, i = nil, nil
+	(0..u.length-1).collect{|i|
+                v = 0
+		for j in 0..u.length-1
+			v += eval_A(j,i)*u[j]
+                end
+                v
+        }
+end
+
+def eval_AtA_times_u(u)
+	return eval_At_times_u(eval_A_times_u(u))
+end
+
+n = ARGV[0].to_i
+u=[1]*n
+for i in 1..10
+        v=eval_AtA_times_u(u)
+        u=eval_AtA_times_u(v)
+end
+vBv=0
+vv=0
+for i in 0..n-1
+        vBv += u[i]*v[i]
+        vv += v[i]*v[i]
+end
+print "%0.9f" % (Math.sqrt(vBv/vv)), "\n"
+

data/sources/ruby/spellcheck.ruby

@@ -0,0 +1,18 @@
+#!/usr/bin/ruby
+# -*- mode: ruby -*-
+# $Id: spellcheck.ruby,v 1.3 2005-06-21 05:36:55 igouy-guest Exp $
+# http://shootout.alioth.debian.org/
+# Revised by Dave Anderson 
+
+dict = Hash.new
+l = ""
+
+IO.foreach("Usr.Dict.Words") do |l|
+  dict[l.chomp!] = 1
+end 
+
+STDIN.each do |l|
+  unless dict.has_key? l.chomp!
+    puts l
+  end
+end

data/sources/ruby/strcat.ruby

@@ -0,0 +1,12 @@
+#!/usr/bin/ruby
+# -*- mode: ruby -*-
+# $Id: strcat.ruby,v 1.1.1.1 2004-05-19 18:13:35 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+# based on code from Aristarkh A Zagorodnikov and Dat Nguyen
+
+STUFF = "hello\n"
+hello = ''
+(ARGV.first.to_i || 1).times do
+    hello << STUFF
+end
+puts hello.length

data/sources/ruby/strcat.ruby-2.ruby

@@ -0,0 +1,12 @@
+#!/usr/bin/ruby
+# -*- mode: ruby -*-
+# $Id: strcat.ruby-2.ruby,v 1.1 2004-11-10 06:44:59 bfulgham Exp $
+# http://shootout.alioth.debian.org/
+
+n = Integer(ARGV.shift || 1)
+
+str = ''
+for i in 1 .. n
+    str += "hello\n"
+end
+puts str.length

data/sources/ruby/sumcol.ruby

@@ -0,0 +1,12 @@
+#!/usr/bin/ruby
+# -*- mode: ruby -*-
+# $Id: sumcol.ruby,v 1.2 2004-11-10 06:43:14 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+# from: Mathieu Bouchard, revised by Dave Anderson
+
+count = 0
+l=""
+STDIN.each{ |l|
+    count += l.to_i
+}
+puts count

data/sources/ruby/sumcol.ruby-2.ruby

@@ -0,0 +1,5 @@
+# The Computer Language Benchmarks Game
+# http://shootout.alioth.debian.org/
+# contributed by Pavel Valodzka
+ 
+ puts STDIN.inject(0){|a,v| a + v.to_i }

data/sources/ruby/takfp.ruby

@@ -0,0 +1,15 @@
+#!/usr/bin/ruby
+#  The Great Computer Language Shootout
+#  http://shootout.alioth.debian.org/
+#
+#  contributed by Gabriele Renzi 
+
+def takfp x, y, z
+  return z unless y < x
+  takfp( takfp(x-1.0, y, z),
+    takfp(y-1.0, z, x),
+    takfp(z-1.0, x, y))
+end
+
+n=Float(ARGV[0])
+puts takfp(n*3.0, n*2.0, n*1.0)

data/sources/ruby/tcpecho.ruby

@@ -0,0 +1,45 @@
+#!/usr/bin/ruby
+#### The Great Computer Language Shootout
+#### http://shootout.alioth.debian.org/
+#### 
+#### Contributed by Robbert Haarman
+#### Modified by Ian Osgood
+
+require 'socket'
+
+N = Integer(ARGV[0] || 10)
+M = 6400
+REPLY_SIZE = 64
+REQUEST_SIZE = 1
+Host = 'localhost'
+Port = 12345
+
+sock = TCPServer.new Host, Port
+if fork
+	# Parent process
+	conn = sock.accept
+	reply = 'x' * REPLY_SIZE
+	while true
+		request = conn.read REQUEST_SIZE
+		break if request == nil
+		conn.write reply
+	end
+else
+	# Child process
+	conn = TCPSocket.new Host, Port
+	replies = 0
+	bytes = 0
+	n = N * M
+	request = 'x' * REQUEST_SIZE
+	while n > 0
+		n = n - 1
+		conn.write request
+		reply = conn.read REPLY_SIZE
+		replies = replies + 1
+		bytes = bytes + reply.length
+	end
+	conn.close
+	puts "replies: #{replies}\tbytes: #{bytes}"
+end
+
+sock.close

data/sources/ruby/tcprequest.ruby

@@ -0,0 +1,45 @@
+#!/usr/bin/ruby
+#### The Great Computer Language Shootout
+#### http://shootout.alioth.debian.org/
+#### 
+#### Contributed by Robbert Haarman 
+#### Modified by Ian Osgood
+
+require 'socket'
+
+N = Integer(ARGV[0] || 10)
+M = 100
+REPLY_SIZE = 4096
+REQUEST_SIZE = 1
+Host = 'localhost'
+Port = 12345
+
+sock = TCPServer.new Host, Port
+if fork
+	# Parent process
+	conn = sock.accept
+	reply = 'x' * REPLY_SIZE
+	while true
+		request = conn.read REQUEST_SIZE
+		break if request == nil
+		conn.write reply
+	end
+else
+	# Child process
+	conn = TCPSocket.new Host, Port
+	replies = 0
+	bytes = 0
+	n = N * M
+	request = 'x' * REQUEST_SIZE
+	while n > 0
+		n = n - 1
+		conn.write request
+		reply = conn.read REPLY_SIZE
+		replies = replies + 1
+		bytes = bytes + reply.length
+	end
+	conn.close
+	puts "replies: #{replies}\tbytes: #{bytes}"
+end
+
+sock.close

data/sources/ruby/tcpstream.ruby

@@ -0,0 +1,45 @@
+#!/usr/bin/ruby
+#### The Great Computer Language Shootout
+#### http://shootout.alioth.debian.org/
+#### 
+#### Contributed by Robbert Haarman
+#### Modified by Ian Osgood
+
+require 'socket'
+
+N = Integer(ARGV[0] || 10)
+M = 1
+REPLY_SIZE = 409600
+REQUEST_SIZE = 1
+Host = 'localhost'
+Port = 12345
+
+sock = TCPServer.new Host, Port
+if fork
+	# Parent process
+	conn = sock.accept
+	reply = 'x' * REPLY_SIZE
+	while true
+		request = conn.read REQUEST_SIZE
+		break if request == nil
+		conn.write reply
+	end
+else
+	# Child process
+	conn = TCPSocket.new Host, Port
+	replies = 0
+	bytes = 0
+	n = N * M
+	request = 'x' * REQUEST_SIZE
+	while n > 0
+		n = n - 1
+		conn.write request
+		reply = conn.read REPLY_SIZE
+		replies = replies + 1
+		bytes = bytes + reply.length
+	end
+	conn.close
+	puts "replies: #{replies}\tbytes: #{bytes}"
+end
+
+sock.close

data/sources/ruby/threadring.ruby

@@ -0,0 +1,61 @@
+#
+# The Computer Language Benchmarks Game
+# http://shootout.alioth.debian.org/
+# contributed by Klaus Friedel
+#
+
+require "thread"
+
+THREAD_COUNT = 503
+
+class Receiver
+  @next
+  @mailbox
+
+  def initialize(name)
+    @name = name
+    @mailbox = Queue.new
+  end
+
+  def next=(n)
+    @next = n
+  end
+
+  def put(msg)
+    @mailbox.push(msg)
+  end
+
+  def messageloop
+    while true
+      hopsRemaining = @mailbox.pop
+      if(hopsRemaining == 0)
+        print @name, "\n"
+        exit(0)
+      end
+      @next.put(hopsRemaining - 1)
+    end
+  end
+end
+
+##########
+#  Main  #
+##########
+receivers = []
+for i in 0..THREAD_COUNT-1
+  receivers[i] = Receiver.new(i+1)
+  if(i > 0)
+    receivers[i-1].next = receivers[i]
+  end
+end
+#close the ring
+receivers[THREAD_COUNT-1].next = receivers[0]
+
+# start the threads
+for i in 0..THREAD_COUNT-1
+  Thread.start(i){|k| receivers[k].messageloop}
+end
+
+receivers[0].put(ARGV[0].to_i)
+
+sleep
+