cellular_automata 0.1.0 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 39fe07d2e8c8d0a1108c4cdd4bafe42016fb1814
-  data.tar.gz: 775052c3229724fdc2aff5ec27c59c45d831c156
+  metadata.gz: ebba5fb93b878df9d9d9e87e16301f9df0c32cae
+  data.tar.gz: 505da2bb9ad0ed69bc29c8acc86f67ad7a8df745
 SHA512:
-  metadata.gz: bd59f7522b9cc0c6695dc6f04f3f67ad227e0e4c851a7c0c2a42d113249b7d7892c0d116d1bc6f9882ca6d72fb24c9bf16d6b54d86943ad943225d60aa5078b0
-  data.tar.gz: b9aed23d3eb5e69ad623000dfc7e04ce5722deb2ecc9c43b43a2af832f6e8a850833aafccb971f8a71b7994d01d5c524f42a998fb73c28ea9abe68b5adef4d81
+  metadata.gz: 2846a0d673eb8cb36ec8d30225bd7cdc5615621c05bb91f6645024e5206f06e7618f5a802966b86d70d03fb36d1c97a5b48fc261dd7bca1816cd8a4a3d41a19f
+  data.tar.gz: 5628a93b80ec95eca7d7ebf03b4d9f6360852da1d55e8c147c30edf8b30c8768a8d5bca3b475131ba656cb47cc7b5cf892e5e453fa1928e53d36d0d134f0b509

data/README.md

@@ -1,7 +1,7 @@
 # CellularAutomata
 
-This is yet another cellular automata implementation.  First Conway's, and then
-we'll see where it goes.
+This is yet another cellular automata implementation.  Public API is liable to
+break until 0.2.0.
 
 ## Installation
 

data/bin/cell

@@ -1,5 +1,48 @@
 #!/usr/bin/env ruby
 
 require 'cellular_automata'
+require 'optparse'
 
-CellularAutomata::Animator.animate
+def opts_from_cli
+  options = {}
+  opt_parser = OptionParser.new do |opts|
+    opts.program_name = File.basename(__FILE__)
+    opts.banner = "#{opts.program_name} [options] RULE"
+    opts.on('-w WIDTH', '--width WIDTH', 'Set width') { |w| options[:width] = w.to_i }
+    opts.on('-h HEIGHT', '--height HEIGHT', 'Set height') { |h| options[:height] = h.to_i }
+    opts.on('-r REFRESH', '--refresh REFRESH', 'Set refresh rate in seconds') { |r| options[:refresh] = r.to_f }
+    opts.on('-v', '--version', 'Print version information') do
+      puts "#{File.basename(__FILE__)} #{CellularAutomata::VERSION}"
+      exit true
+    end
+    opts.on('--help', 'Display this screen') do
+      puts opts
+      exit true
+    end
+  end
+  begin
+    opt_parser.parse!
+  rescue OptionParser::InvalidOption => e
+    puts e.message
+    exit false
+  end
+  options
+end
+
+opts = opts_from_cli
+opts[:width]  ||= 120
+opts[:height] ||= 30
+opts[:refresh] ||= 0.1
+rule = ARGV[0] || 'B3S2'
+board = CellularAutomata::Board.new(width: opts[:width], height: opts[:height], rule: rule)
+
+trap 'SIGINT' do
+  exit
+end
+
+while true do
+  puts "\e[H\e[2J"
+  board.tick!
+  puts board.to_s
+  sleep opts[:refresh]
+end

data/cellular_automata.gemspec

@@ -10,7 +10,7 @@ Gem::Specification.new do |spec|
   spec.email         = ["ffleming@gmail.com"]
 
   spec.summary       = %q{A simulation of cellular automata}
-  spec.description   = %q{A superset of 0-player games, of which Conway's Game of Life is a member.}
+  spec.description   = %q{A set of 0-player games, of which Conway's Game of Life is a member.}
   spec.homepage      = "https://github.com/ffleming/cellular_automata"
 
   spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
@@ -22,4 +22,7 @@ Gem::Specification.new do |spec|
 
   spec.add_development_dependency "bundler", "~> 1", ">= 1.8"
   spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency 'pry', '~> 0.10'
+  spec.add_development_dependency 'byebug', '~> 4'
+  spec.add_development_dependency 'pry-byebug', '~> 3.1'
 end

data/lib/cellular_automata/board.rb

@@ -1,17 +1,17 @@
 class CellularAutomata::Board
-  attr_reader :width, :height
-  def initialize(width: 80, height: 20)
-    @height            = height
-    @width             = width
-    @array             = build_array
-    CellularAutomata::Cell::array        = @array
+  attr_reader :width, :height, :rule
+  def initialize(rule: 'B3S2', width: 80, height: 20)
+    @height = height
+    @width  = width
+    @state  = build_array
+    @rule   = CellularAutomata::Rule.new(rule)
     seed!
   end
 
   def to_s
     line = '+' << ('-' * width) << "+\n"
     ret = '' << line
-    @array.each do |row|
+    @state.each do |row|
       ret << "|"
       row.each do |cell|
         ret << cell.to_s
@@ -21,56 +21,56 @@ class CellularAutomata::Board
     ret << line
   end
 
-  def cycle!
+  def tick!
+    next_state = Marshal.load(Marshal.dump @state)
     each_cell do |cell|
-      case cell.live_neighbors.length
-      when 0..1
-        cell.die!
-      when 3
-        cell.live!
-      when 4..8
-        cell.die!
-      end
-    end
-  end
-
-  def animate(steps=1000, refresh=0.1)
-    (1..steps).each do |i|
-      puts "\e[H\e[2J"
-      cycle!
-      puts self.to_s
-      sleep refresh
+      next_state[cell.y][cell.x].send rule.process(neighbor_population_of cell) #= next_cell #cell.send(rule.process(adj_pop))
     end
+    @state = next_state
   end
 
   private
 
   def each_cell
-    (0..height-1).each do |row|
-      (0..width-1).each do |col|
-        yield @array[row][col]
+    (0..height-1).each do |y|
+      (0..width-1).each do |x|
+        yield @state[y][x]
       end
     end
-
   end
 
   def seed!
-    (0..height-1).each do |row|
-      (0..width-1).each do |col|
-        @array[row][col].live! if rand < 0.2
-      end
-    end
+    each_cell { |c| c.live! if rand < 0.1 }
   end
 
   def build_array
     arr = []
-    (0..height-1).each do |i|
-      arr[i] = []
-      (0..width-1).each do |j|
-        arr[i][j] = CellularAutomata::Cell.new(row: i, column: j)
+    (0..height-1).each do |y|
+      arr[y] = []
+      (0..width-1).each do |x|
+        arr[y][x] = CellularAutomata::Cell.new(row: y, column: x, alive: false)
       end
     end
     return arr
   end
+
+  def neighbor_population_of(cell)
+    neighbors_of(cell).select(&:alive?).length
+  end
+
+  def cell_at(y, x)
+    return nil if x  < 0 || y < 0
+    return nil if y > @state.length-1
+    return nil if x > @state[0].length-1
+    return @state[y][x]
+  end
+
+  def neighbors_of(cell)
+    y = cell.y ; x = cell.x
+    [ cell_at(y-1, x-1), cell_at(y-1, x  ), cell_at(y-1, x+1),
+      cell_at(y,   x+1),                    cell_at(y  , x-1),
+      cell_at(y+1, x-1), cell_at(y+1, x  ), cell_at(y+1, x+1) ].compact
+  end
+
 end
 

data/lib/cellular_automata/cell.rb

@@ -1,31 +1,12 @@
 class CellularAutomata::Cell
-  class << self
-    attr_accessor :array
-  end
-
-  attr_accessor :row, :column
-  attr_reader :alive
+  attr_reader :alive, :row, :column
   alias x column
-  alias x= column=
   alias y row
-  alias y= row=
   alias alive? alive
-  def initialize(row: , column: )
+  def initialize(alive: false, row: , column:)
+    @alive = alive
     @row = row
     @column = column
-    @alive = false
-  end
-
-  def die!
-    @alive = false
-  end
-
-  def live!
-    @alive = true
-  end
-
-  def dead?
-    !alive?
   end
 
   def to_s
@@ -33,60 +14,22 @@ class CellularAutomata::Cell
     '*'
   end
 
-  def live_neighbors
-    neighbors.select {|n| n.alive? }
-  end
-
-  private
-
-  def neighbors
-    [
-      n_neighbor,
-      ne_neighbor,
-      e_neighbor,
-      se_neighbor,
-      s_neighbor,
-      sw_neighbor,
-      w_neighbor,
-      nw_neighbor
-    ].compact
-  end
-
-  def n_neighbor
-    neighbor(y-1, x)
-  end
-
-  def ne_neighbor
-    neighbor(y-1, x+1)
-  end
-
-  def e_neighbor
-    neighbor(y, x+1)
-  end
-
-  def se_neighbor
-    neighbor(y+1, x+1)
-  end
-
-  def s_neighbor
-    neighbor(y+1, x)
+  def live!
+    @alive = true
   end
 
-  def sw_neighbor
-    neighbor(y+1, x-1)
+  def die!
+    @alive = false
   end
 
-  def w_neighbor
-    neighbor(y, x+1)
+  def survive!
   end
 
-  def nw_neighbor
-    neighbor(y-1, x-1)
+  def dead?
+    !alive?
   end
 
-  def neighbor(r, c)
-    raise StandardError.new("Cell::array not initialized") if CellularAutomata::Cell::array.nil?
-    return nil if r  < 0 || c < 0
-    return CellularAutomata::Cell::array[r][c] rescue nil
+  def copy
+    self.class.new(alive: alive?, row: row, column: column)
   end
 end

data/lib/cellular_automata/rule.rb

@@ -0,0 +1,27 @@
+class CellularAutomata::Rule
+  def initialize(rule_string)
+    @rule_hash = process_rule! rule_string
+  end
+
+  def process(input)
+    return @rule_hash[input] || raise(ArgumentError.new("I don't know what to do with #{input.class} #{input}"))
+  end
+
+  def process2(input)
+    @rule_hash[input] != :die!
+  end
+
+  private
+
+  def process_rule!(rule_string)
+    rules = rule_string.scan(/[BS]\d+/)
+    raise ArgumentError.new('Invalid rule string') if rules.length != 2
+    birth_string = rules.select {|s| s.start_with?('B')}.first
+    survive_string = rules.select {|s| s.start_with?('S')}.first
+    (birth, survive) = [birth_string, survive_string].map { |s| s[1..-1].split('').map(&:to_i) }
+    death = ((0..8).to_a - birth) - survive
+    {live!: birth, survive!: survive, die!: death}.each_with_object({}) do |(k, v), ret|
+      v.each {|int| ret[int] = k}
+    end
+  end
+end

data/lib/cellular_automata/version.rb

@@ -1,3 +1,3 @@
 module CellularAutomata
-  VERSION = "0.1.0"
+  VERSION = "0.1.1"
 end

data/lib/cellular_automata.rb

@@ -1,7 +1,10 @@
+require 'pry'
+require 'byebug'
+require 'pry-byebug'
 require "cellular_automata/version"
 require "cellular_automata/cell"
+require "cellular_automata/rule"
 require "cellular_automata/board"
-require "cellular_automata/animator"
 
 module CellularAutomata
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: cellular_automata
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - Forrest Fleming
@@ -44,13 +44,53 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '10.0'
-description: A superset of 0-player games, of which Conway's Game of Life is a member.
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.10'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.10'
+- !ruby/object:Gem::Dependency
+  name: byebug
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '4'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '4'
+- !ruby/object:Gem::Dependency
+  name: pry-byebug
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.1'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.1'
+description: A set of 0-player games, of which Conway's Game of Life is a member.
 email:
 - ffleming@gmail.com
 executables:
 - cell
-- console
-- setup
 extensions: []
 extra_rdoc_files: []
 files:
@@ -61,13 +101,11 @@ files:
 - README.md
 - Rakefile
 - bin/cell
-- bin/console
-- bin/setup
 - cellular_automata.gemspec
 - lib/cellular_automata.rb
-- lib/cellular_automata/animator.rb
 - lib/cellular_automata/board.rb
 - lib/cellular_automata/cell.rb
+- lib/cellular_automata/rule.rb
 - lib/cellular_automata/version.rb
 homepage: https://github.com/ffleming/cellular_automata
 licenses:

data/bin/console

@@ -1,14 +0,0 @@
-#!/usr/bin/env ruby
-
-require "bundler/setup"
-require "cellular_automata"
-
-# You can add fixtures and/or initialization code here to make experimenting
-# with your gem easier. You can also use a different console, if you like.
-
-# (If you use this, don't forget to add pry to your Gemfile!)
-# require "pry"
-# Pry.start
-
-require "irb"
-IRB.start

data/bin/setup

@@ -1,7 +0,0 @@
-#!/bin/bash
-set -euo pipefail
-IFS=$'\n\t'
-
-bundle install
-
-# Do any other automated setup that you need to do here

data/lib/cellular_automata/animator.rb

@@ -1,16 +0,0 @@
-module CellularAutomata::Animator
-  class << self
-    attr_accessor :board
-    def board
-      @board ||= CellularAutomata::Board.new(width: 120, height: 30)
-    end
-    def animate(steps=1000, refresh=0.1)
-      (1..steps).each do
-        puts "\e[H\e[2J"
-        board.cycle!
-        puts board.to_s
-        sleep refresh
-      end
-    end
-  end
-end