[WIP] add dominoes

bin/generate-dominoes

@@ -0,0 +1,7 @@
+#!/usr/bin/env ruby
+
+require_relative '../lib/helper'
+require 'generator'
+require 'dominoes_cases'
+
+Generator.new('dominoes', DominoesCases).generate

exercises/dominoes/.version

@@ -0,0 +1 @@
+2

exercises/dominoes/domino.rb

@@ -0,0 +1,16 @@
+class Domino
+  attr_reader :left, :right
+
+  def self.deep_copy(domino)
+    Domino.new(domino.left, domino.right)
+  end
+
+  def initialize(left, right)
+    @left = left
+    @right = right
+  end
+
+  def double?
+    left == right
+  end
+end

exercises/dominoes/dominoes.rb

@@ -0,0 +1,53 @@
+class Dominoes
+  require_relative 'domino'
+  attr_accessor :list
+
+  #[ArrayTuples], false => [Domino] or [Domino], true => [Domino]
+  def initialize( arr=[], already_dominoes= nil)
+    @list = []
+    arr.each do |item|
+      if !already_dominoes
+        @list << Domino.new(item[0], item[1])
+      else
+        @list << Domino.deep_copy(item)
+      end
+    end
+  end
+
+
+  # [Domino] => Bool
+  def can_chain?
+    result = false
+
+    return true if list.length.zero? # empty list
+    return (list.first.double?) if list.length == 1 #singletons
+
+    result
+  end
+
+  def first
+    @list[0]
+  end
+
+  # # [ArrayTuples] => Bool
+  # def can_chain_list?(arr_form_of_dominoes)
+  #   result = false
+
+  #   return true if arr_list.length.zero? # empty list
+  #   return (arr_list[0][0] == arr_list[0][1]) if arr_list.length == 1 #singletons
+
+  #   result
+  # end
+
+
+
+  # def self.make_dominoes!(arr_form_of_dominoes =[])
+  #   @list = []
+  #   if !arr_form_of_dominoes.empty?
+  #     arr_form_of_dominoes.each do |item|
+  #       @list << Domino.new(item[0], item[1])
+  #     end
+  #   end
+  # end
+
+end

exercises/dominoes/dominoes_test.rb

@@ -0,0 +1,99 @@
+#!/usr/bin/env ruby
+gem 'minitest', '>= 5.0.0'
+require 'minitest/autorun'
+require_relative 'dominoes'
+
+# Test data version:
+# 08a0cda
+class DominoesTest < Minitest::Test
+  def test_empty_input
+    actual = Dominoes.new([]).can_chain?
+    assert(actual)
+  end
+
+  def test_singleton_input_chainable
+    actual = Dominoes.new([[1, 1]]).can_chain?
+    assert(actual)
+  end
+
+  def test_singleton_input_not_chainable
+    actual = Dominoes.new([[1, 2]]).can_chain?
+    refute(actual)
+  end
+
+  def test_three_elements
+    skip
+    actual = Dominoes.new.can_chain?([[1, 2], [3, 1], [2, 3]])
+    assert(actual)
+  end
+
+  def test_can_reverse_dominoes
+    skip
+    actual = Dominoes.new.can_chain?([[1, 2], [1, 3], [2, 3]])
+    assert(actual)
+  end
+
+  def test_cant_be_chained
+    skip
+    actual = Dominoes.new.can_chain?([[1, 2], [4, 1], [2, 3]])
+    refute(actual)
+  end
+
+  def test_disconnected_simple
+    skip
+    actual = Dominoes.new.can_chain?([[1, 1], [2, 2]])
+    refute(actual)
+  end
+
+  def test_disconnected_double_loop
+    skip
+    actual = Dominoes.new.can_chain?([[1, 2], [2, 1], [3, 4], [4, 3]])
+    refute(actual)
+  end
+
+  def test_disconnected_single_isolated
+    skip
+    actual = Dominoes.new.can_chain?([[1, 2], [2, 3], [3, 1], [4, 4]])
+    refute(actual)
+  end
+
+  def test_need_backtrack
+    skip
+    actual = Dominoes.new.can_chain?([[1, 2], [2, 3], [3, 1], [2, 4], [2, 4]])
+    assert(actual)
+  end
+
+  def test_separate_loops
+    skip
+    actual = Dominoes.new.can_chain?([[1, 2], [2, 3], [3, 1], [1, 1], [2, 2], [3, 3]])
+    assert(actual)
+  end
+
+  def test_ten_elements
+    skip
+    actual = Dominoes.new.can_chain?([[1, 2], [5, 3], [3, 1], [1, 2], [2, 4], [1, 6], [2, 3], [3, 4], [5, 6]])
+    assert(actual)
+  end
+
+  # Problems in exercism evolve over time, as we find better ways to ask
+  # questions.
+  # The version number refers to the version of the problem you solved,
+  # not your solution.
+  #
+  # Define a constant named VERSION inside of the top level BookKeeping
+  # module, which may be placed near the end of your file.
+  #
+  # In your file, it will look like this:
+  #
+  # module BookKeeping
+  #   VERSION = 1 # Where the version number matches the one in the test.
+  # end
+  #
+  # If you are curious, read more about constants on RubyDoc:
+  # http://ruby-doc.org/docs/ruby-doc-bundle/UsersGuide/rg/constants.html
+
+  def test_bookkeeping
+    skip
+    assert_equal 2, BookKeeping::VERSION
+  end
+end

exercises/dominoes/example.rb

@@ -0,0 +1,14 @@
+module BookKeeping
+  VERSION = 2
+end
+
+class Dominoes
+
+  def can_chain?(dominoes_list = [])
+    false
+  end
+
+  def solve(dominoes_list = [])
+
+  end
+end

exercises/dominoes/example.tt

@@ -0,0 +1,21 @@
+#!/usr/bin/env ruby
+gem 'minitest', '>= 5.0.0'
+require 'minitest/autorun'
+require_relative 'dominoes'
+
+# Test data version:
+# <%= sha1 %>
+class DominoesTest < Minitest::Test<% test_cases.each do |test_case| %>
+  def <%= test_case.test_name %>
+    <%= test_case.skipped %>
+    expect = <%= test_case.expect %>
+    actual = <%= test_case.work_load %>
+    assert_equal(expect, actual)
+  end
+<% end %>
+<%= IO.read(XRUBY_LIB + '/bookkeeping.md') %>
+  def test_bookkeeping
+    skip
+    assert_equal <%= version.next %>, BookKeeping::VERSION
+  end
+end

lib/dominoes_cases.rb

@@ -0,0 +1,11 @@
+class DominoesCase < OpenStruct
+
+
+end
+
+DominoesCases = proc do |data|
+  JSON.parse(data)['cases'].map.with_index do |row, i|
+    row = row.merge('index' => i)
+    DominoesCase.new(row)
+  end
+end