Програмиране с Ruby

Курс във Факултета по Математика и Информатика към СУ

Решение на Шеста задача от Диляна Тодорова

Обратно към всички решения

Към профила на Диляна Тодорова

Резултати

  • 6 точки от тестове
  • 0 бонус точки
  • 6 точки общо
  • 17 успешни тест(а)
  • 1 неуспешни тест(а)

Код

require 'enumerator'
module GameOfLife
class Board
include Enumerable
attr_accessor :alive_cells
attr_reader :expand_cells
def initialize(*alives)
@alive_cells = alives
@alive_cells.uniq!
@expand_cells = Array.new(Array.new)
end
def each
@alive_cells.each do | x,y |
yield x, y
end
end
def [] (x, y)
@alive_cells.any? { |point| point[0] == x and point[1] == y }
end
def count
@alive_cells.count
end
def next_generation
survives = @alive_cells.select { |cell| [2,3].include? neighbors(cell[0], cell[1]) }
prepare_to_born_new_cells
next_gen = survives + @expand_cells.select { |cell| neighbors(cell[0], cell[1]) == 3 }
Board.new(*next_gen.uniq!)
end
#generate neighbors of the cell
def generate_neigbors (x,y)
@expand_cells.concat([ [x - 1, y], [x + 1, y], [x, y - 1], [x, y + 1], [x + 1, y + 1],
[x - 1, y - 1], [x + 1, y - 1], [x - 1, y + 1]])
end
#prepare all new dead cells who can be born
def prepare_to_born_new_cells
self.each { |x, y| generate_neigbors(x, y) }
end
#calculate numbers of alive neighbors
def neighbors(x, y)
[[x - 1, y], [x + 1, y], [x, y - 1], [x, y + 1],
[x + 1, y + 1], [x - 1, y - 1], [x + 1, y - 1], [x - 1, y + 1]].inject(0) do
|sum, cell| self[cell[0], cell[1]] ? (sum + 1) : sum
end
end
end # of class Board
end

Лог от изпълнението

.................F

Failures:

  1) GameOfLife::Board GameOfLife::Board evolution rules keeps stable formations stable
     Failure/Error: board.count.should eq cells.count
       
       expected: 6
            got: 0
       
       (compared using ==)
     # /tmp/d20111221-3114-1ir89m0/spec.rb:172:in `expect_generation_in'
     # /tmp/d20111221-3114-1ir89m0/spec.rb:160:in `block (6 levels) in <top (required)>'
     # /tmp/d20111221-3114-1ir89m0/spec.rb:158:in `times'
     # /tmp/d20111221-3114-1ir89m0/spec.rb:158:in `block (5 levels) in <top (required)>'
     # /tmp/d20111221-3114-1ir89m0/spec.rb:155:in `each'
     # /tmp/d20111221-3114-1ir89m0/spec.rb:155:in `block (4 levels) in <top (required)>'
     # ./lib/homework/run_with_timeout.rb:5:in `block (3 levels) in <top (required)>'
     # ./lib/homework/run_with_timeout.rb:5:in `block (2 levels) in <top (required)>'

Finished in 0.36299 seconds
18 examples, 1 failure

Failed examples:

rspec /tmp/d20111221-3114-1ir89m0/spec.rb:151 # GameOfLife::Board GameOfLife::Board evolution rules keeps stable formations stable

История (1 версия и 1 коментар)

Диляна обнови решението на 20.12.2011 22:25 (преди около 13 години)

+require 'enumerator'
+
+module GameOfLife
+ class Board
+ include Enumerable
+ attr_accessor :alive_cells
+ attr_reader :expand_cells
+
+ def initialize(*alives)
+ @alive_cells = alives
+ @alive_cells.uniq!
+ @expand_cells = Array.new(Array.new)
+ end
+
+ def each
+ @alive_cells.each do | x,y |
+ yield x, y
+ end
+ end
+
+ def [] (x, y)
+ @alive_cells.any? { |point| point[0] == x and point[1] == y }
+ end
+
+ def count
+ @alive_cells.count
+ end
+
+ def next_generation
+ survives = @alive_cells.select { |cell| [2,3].include? neighbors(cell[0], cell[1]) }
+ prepare_to_born_new_cells
+ next_gen = survives + @expand_cells.select { |cell| neighbors(cell[0], cell[1]) == 3 }
+ Board.new(*next_gen.uniq!)
+ end
+
+ #generate neighbors of the cell
+ def generate_neigbors (x,y)
+ @expand_cells.concat([ [x - 1, y], [x + 1, y], [x, y - 1], [x, y + 1], [x + 1, y + 1],
+ [x - 1, y - 1], [x + 1, y - 1], [x - 1, y + 1]])
+end
+
+ #prepare all new dead cells who can be born
+ def prepare_to_born_new_cells
+ self.each { |x, y| generate_neigbors(x, y) }
+ end
+ #calculate numbers of alive neighbors
+ def neighbors(x, y)
+ [[x - 1, y], [x + 1, y], [x, y - 1], [x, y + 1],
+ [x + 1, y + 1], [x - 1, y - 1], [x + 1, y - 1], [x - 1, y + 1]].inject(0) do
+ |sum, cell| self[cell[0], cell[1]] ? (sum + 1) : sum
+ end
+ end
+ end # of class Board
+end
  • Не ти трябва да require-ваш enumerator
  • Идентация... Цялото тяло на класа Board трябва да е идентирано с едно ниво навътре. Някои методи са неправилно идентирани.

Разгледай решенията на колегите си. Има интересни неща, които могат да се видят там.