ugly.automata 0.1.0

data/lib/automata.rb

@@ -0,0 +1 @@
+require 'automata/elementary'

data/lib/automata/elementary.rb

@@ -0,0 +1,41 @@
+require 'enumerator'
+
+module Automata
+  class Elementary
+    # This elegantly simple algorithm and code is from Jesse Merriman written for
+    #   Ruby Quiz 134: Cellular Automata. see: http://www.rubyquiz.com/quiz134.html
+    def self.transformer(rule_num)
+      rule = rule_num.to_s 2
+      rule = ('0' * (2**3 - rule.length) + rule).reverse.split(//)
+      lambda { |hood| rule[hood.join.to_i(2)] }
+    end
+
+    def self.step(state, trans)
+      new_state = []
+      ([0,0] + state + [0,0]).each_cons(3) do |hood|
+        new_state << trans[hood]
+      end
+      new_state
+    end
+  
+    attr_reader :rule, :steps, :state
+    def initialize(rule, state = ['1'])
+      @rule, @state = rule, state
+    end
+    
+    def run(steps)
+      trans = Elementary.transformer(@rule)
+      steps.times do |s|
+        @state = Elementary.step(@state, trans)
+      end
+      self
+    end
+    
+    def to_s
+      @state.join('')
+    end
+  end
+end
+
+
+

data/lib/automata/version.rb

@@ -0,0 +1,3 @@
+module Automata
+  VERSION = '0.1.0'
+end

metadata

@@ -0,0 +1,50 @@
+--- !ruby/object:Gem::Specification
+name: ugly.automata
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+  prerelease: 
+platform: ruby
+authors:
+- Michael Garriss
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2011-12-27 00:00:00.000000000Z
+dependencies: []
+description: ! 'A collection of algorithms for generating cellular automata. Currently
+  only contains "elementary cellular automata" or aka the cool pictures from the Wolfram
+  book.  Provides a Automata::Elementary class that takes rule number, initial state
+  along with a #run(steps) method. Produces an array of strings as a result.'
+email: mgarriss@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/automata/elementary.rb
+- lib/automata/version.rb
+- lib/automata.rb
+homepage: http://github.com/mgarriss/ugly.automata
+licenses: []
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.11
+signing_key: 
+specification_version: 3
+summary: A collection of algorithms for generating cellular automata.
+test_files: []