ada_truthy 1.0.0 → 1.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 5f60c11c32eb2f78bf12f596577d76cf7800f9f4a555c0bd68ab9ea2d9f5ddea
-  data.tar.gz: 86a813a004e5c51817a5bd7ab31d96bc8cfbed92e081d418b80f30d2dd06329a
+  metadata.gz: 9410ea5b7b775f817f02da291cfc63c9af895d2b2599c42eed5f5eb7100fcfaa
+  data.tar.gz: a10674f3776820c10bd7dd4e1d5002bb78006db2ef52a072f7df888b44b158c5
 SHA512:
-  metadata.gz: 1e3f39e7f20a550147c303383d4c4f1f6ab7c2066c53cfa914ec168acd5e0ff466e77f218e0b947a5f2a6a6a9b1e687abc550d645062dbd8bbbffe651a3b6245
-  data.tar.gz: 30065c106ffe083fa2e8f285d831a8bb97eaa586a57aa5e63fce4848ad8f32b61b8132a8534b565b765e09b0e3b81c83a1591bc21906496f4b9e482f476ffc39
+  metadata.gz: 911ec53c15825ca5821f229e8f86813a0437dcf390d3c3a0dad80f2003b934baddff5787ff66d80b234833db2741e449077542d43687dc3a2c4b6061a7c8eefa
+  data.tar.gz: ca1a86932ee59d704a64eae301504df72680dd104daea056fe1ec7824e642696f95e66f29607e7ee73be1cc52471a2c0105b9db09275eec869cbc661039e480d

data/.idea/.gitignore

@@ -0,0 +1,8 @@
+# Default ignored files
+/shelf/
+/workspace.xml
+# Editor-based HTTP Client requests
+/httpRequests/
+# Datasource local storage ignored files
+/dataSources/
+/dataSources.local.xml

data/.idea/modules.xml

@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/truthy.iml" filepath="$PROJECT_DIR$/.idea/truthy.iml" />
+      <module fileurl="file://$PROJECT_DIR$/../.idea/truthy_gem.iml" filepath="$PROJECT_DIR$/../.idea/truthy_gem.iml" />
+    </modules>
+  </component>
+</project>

data/.idea/truthy.iml

@@ -0,0 +1,24 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="RUBY_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/features" isTestSource="true" />
+      <sourceFolder url="file://$MODULE_DIR$/spec" isTestSource="true" />
+      <sourceFolder url="file://$MODULE_DIR$/test" isTestSource="true" />
+    </content>
+    <orderEntry type="jdk" jdkName="rbenv: 2.7.7" jdkType="RUBY_SDK" />
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="library" scope="PROVIDED" name="minitest (v5.18.0, rbenv: 2.7.7) [gem]" level="application" />
+    <orderEntry type="library" scope="PROVIDED" name="rake (v13.0.1, rbenv: 2.7.7) [gem]" level="application" />
+  </component>
+  <component name="RakeTasksCache">
+    <option name="myRootTask">
+      <RakeTaskImpl id="rake">
+        <subtasks>
+          <RakeTaskImpl description="Run tests" fullCommand="default" id="default" />
+          <RakeTaskImpl description="Run tests" fullCommand="test" id="test" />
+        </subtasks>
+      </RakeTaskImpl>
+    </option>
+  </component>
+</module>

data/.idea/vcs.xml

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$/.." vcs="Git" />
+  </component>
+</project>

data/Gemfile

@@ -0,0 +1,7 @@
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in ada_numbers.gemspec
+gemspec
+
+gem "rake", "~> 12.0"
+gem "minitest", "~> 5.0"

data/Rakefile

@@ -0,0 +1,12 @@
+require "bundler/gem_tasks"
+require 'rake/testtask'
+
+Rake::TestTask.new do |t|
+  t.libs << "test"
+  t.libs << "lib"
+  t.test_files = FileList["test/**/*_test.rb"]
+  #t.pattern = "test/*_test.rb"
+end
+
+desc "Run tests"
+task :default => :test

data/ada_truthy.gemspec

@@ -0,0 +1,26 @@
+require_relative 'lib/ada_truthy/version'
+
+Gem::Specification.new do |spec|
+  spec.name                        = "ada_truthy"
+  spec.version                     = AdaTruthy::VERSION
+  spec.summary                     = "Create truth tables and operate with logical gates."
+  spec.description                 = "Create truth tables and let truthy handle the annoying part. Also, operate with logical gates like AND and OR."
+  spec.authors                     = ["Roberto W. P. Ribeiro"]
+  spec.email                       = ["rober.will@hotmail.com"]
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  end
+
+  spec.homepage                    = "https://github.com/roberwil/truthy_gem"
+  spec.metadata["homepage_uri"]    = spec.homepage
+  spec.metadata["source_code_uri"] = "https://github.com/roberwil/truthy_gem"
+  spec.metadata["changelog_uri"]   = "https://github.com/roberwil/truthy_gem/blob/main/CHANGELOG.md"
+  spec.licenses                    = ["MIT"]
+  spec.required_ruby_version       = Gem::Requirement.new(">= 2.7.7")
+
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+end

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "ada_truthy"
+
+# 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(__FILE__)

data/bin/setup

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

data/lib/ada_truthy/logical_gates/logical_gate.rb

@@ -0,0 +1,62 @@
+module AdaTruthy
+  class LogicalGate
+    def self.not(a)
+      return inot(a) if a.is_a? Integer
+      return !a
+    end
+
+    def self.and(a, b, *others)
+      return self.iand(a, b, others) if a.is_a? Integer
+      return false if (others.include?(false) || !a || !b)
+      return true
+    end
+
+    def self.nand(a, b, *others)
+      self.not self.and(a, b, others)
+    end
+
+    def self.or(a, b, *others)
+      return self.ior(a, b, others) if a.is_a? Integer
+      return true if others.include?(true) || a || b
+      return false
+    end
+
+    def self.nor(a, b, *others)
+      self.not self.or(a, b, others)
+    end
+
+    def self.xor(a, b, *others)
+      result = self.base_xor a, b
+
+      others.each do |term|
+        result = base_xor(result, term)
+      end
+
+      return result
+    end
+
+    def self.xnor(a, b, *others)
+      return !self.xor(a, b, others)
+    end
+
+    private
+
+    def self.base_xor(a, b)
+      a != b
+    end
+
+    def self.inot(a)
+      a == 1 ? 0 : 1
+    end
+
+    def self.iand(a, b, *others)
+      return 0 if others.include?(0) || a == 0 || b == 0
+      return 1
+    end
+
+    def self.ior(a, b, *others)
+      return 1 if others.include?(1) || a == 1 || b == 1
+      return 0
+    end
+  end
+end

data/lib/{logical_gates → ada_truthy/logical_gates}/logical_gate_extension.rb

@@ -1,6 +1,7 @@
 require_relative 'logical_gate'
 
 class TrueClass
+  LogicalGate = AdaTruthy::LogicalGate
   def not
     LogicalGate.not self
   end
@@ -31,6 +32,7 @@ class TrueClass
 end
 
 class FalseClass
+  LogicalGate = AdaTruthy::LogicalGate
   def not
     LogicalGate.not self
   end

data/lib/ada_truthy/truth_table/truth_table.rb

@@ -0,0 +1,219 @@
+require_relative 'truthy_exception'
+require_relative '../logical_gates/logical_gate_extension'
+
+module AdaTruthy
+  class TruthTable
+    @@letters = %w[A B C D E F G H I J]
+
+    @@combinations = {
+      2 => 04, 3 => 8, 4 => 16,
+      5 => 32, 6 => 64, 7 => 128,
+      8 => 256, 9 => 512, 10 => 1024
+    }
+
+    MAX_LIMIT = 6
+    MIN_LIMIT = 2
+    SELF = 'S'
+    COMPLEMENT = 'C'
+    TRUE_VALUE = 'T'
+    FALSE_VALUE = 'F'
+
+    def initialize(number_of_terms)
+      case number_of_terms
+      when number_of_terms > MAX_LIMIT
+        raise TruthyException, "The maximum number of terms is #{MAX_LIMIT}"
+      when number_of_terms < MIN_LIMIT
+        raise TruthyException, "The minimum number of terms is #{MIN_LIMIT}"
+      end
+
+      @number_of_terms = number_of_terms
+      @number_of_combinations = @@combinations[number_of_terms]
+
+      @cache = Hash.new
+      @formula = Array.new
+      @rows = Array.new
+
+      @using_sum_of_products = true
+      @using_product_of_sums = false
+
+      @number_of_zeros = 0
+      @number_of_ones = 0
+    end
+
+    def add_row(*terms)
+      table_has_enough_rows = @rows.size == @number_of_combinations
+
+      if table_has_enough_rows
+        raise TruthyException, "There should be only #{@number_of_combinations} rows."
+      end
+
+      right_number_of_terms = terms.size == @number_of_terms + 1
+
+      unless right_number_of_terms
+        raise TruthyException, "There should be only #{@number_of_terms} terms."
+      end
+
+      row = terms
+
+      unless row_is_valid? row
+        raise TruthyException, "The combination #{row} has been used already."
+      end
+
+      @cache = {}
+
+      row_output = row[-1]
+      change_algorithm = (@rows.size == 0).and(row_output == 0)
+
+      use_product_of_sums if change_algorithm
+
+      @rows << row
+      (row_output == 1) ? @number_of_ones += 1 : @number_of_zeros += 1
+
+      compute row
+    end
+
+    def check(*terms)
+      has_right_number_of_terms = terms.size == @number_of_terms
+
+      unless has_right_number_of_terms
+        raise TruthyException, "There should be only #{@number_of_terms} terms."
+      end
+
+      change_algorithm_if_needed
+
+      cache_code = TruthTable.get_row_cache_code terms
+      cache_result = @cache[cache_code]
+
+      return cache_result unless cache_result.nil?
+
+      terms_cursor = 0
+      partial_result = true
+      result = false
+
+      if @using_product_of_sums
+        partial_result = false
+        result = true
+      end
+
+      @formula.each do |t|
+        if @using_sum_of_products
+          partial_result = (t == SELF ? partial_result.and(terms[terms_cursor]) :
+                              partial_result.and(!terms[terms_cursor]))
+        else
+          partial_result = (t == SELF ? partial_result.or(terms[terms_cursor]) :
+                              partial_result.or(!terms[terms_cursor]))
+        end
+
+        terms_cursor += 1
+        next if terms_cursor != @number_of_terms
+        terms_cursor = 0
+
+        if (@using_sum_of_products)
+          return true if partial_result
+          result = result.or(partial_result)
+          partial_result = true
+        else
+          return false if not partial_result
+          result = result.and(partial_result)
+          partial_result = false
+        end
+      end
+
+      @cache[cache_code] = result
+      return result
+    end
+
+    def to_s
+      terms_cursor = 0
+      partial_result = ''
+      result = ''
+
+      @formula.each do |t|
+        if @using_sum_of_products
+          partial_result += (t == SELF ? "#{@@letters[terms_cursor]}." : "~#{@@letters[terms_cursor]}.")
+        else
+          partial_result += (t == SELF ? "#{@@letters[terms_cursor]}+" : "~#{@@letters[terms_cursor]}+")
+        end
+
+        terms_cursor += 1
+        next if terms_cursor != @number_of_terms
+        terms_cursor = 0
+
+        result += (@using_sum_of_products ? "(#{partial_result[0...-1]})+" : "(#{partial_result[0...-1]}).")
+        partial_result = ''
+      end
+
+      result[0...-1]
+    end
+
+    private
+
+    def row_is_valid?(row)
+      @rows.each do |existing_row|
+        is_equal = true
+
+        (0..existing_row.size - 1).each do |i|
+          is_equal = is_equal.and(row[i] == existing_row[i])
+        end
+
+        return false if is_equal
+      end
+
+      return true
+    end
+
+    def compute(row)
+      row_output = row[-1]
+
+      return if @using_sum_of_products.and(row_output != 1)
+      return if @using_product_of_sums.and(row_output != 0)
+
+      (0...row.size - 1).each do |i|
+        if @using_sum_of_products
+          @formula << (row[i] == 1 ? SELF : COMPLEMENT)
+        else
+          @formula << (row[i] == 1 ? COMPLEMENT : SELF)
+        end
+      end
+    end
+
+    def change_algorithm_if_needed
+      no_need_to_change = @using_sum_of_products.and(@number_of_zeros == 0).
+        or(@using_product_of_sums.and(@number_of_ones == 0))
+
+      return if no_need_to_change
+
+      more_zeros = @number_of_zeros > @number_of_ones
+
+      no_need_to_change = @using_sum_of_products.and(more_zeros).
+        or(@using_product_of_sums.and(!more_zeros))
+
+      return if no_need_to_change
+
+      more_zeros ? use_sum_of_products : use_product_of_sums
+
+      @formula = []
+      @cache = {}
+
+      @rows.each do |row|
+        compute row
+      end
+    end
+
+    def use_sum_of_products
+      @using_sum_of_products = true
+      @using_product_of_sums = false
+    end
+
+    def use_product_of_sums
+      @using_sum_of_products = false
+      @using_product_of_sums = true
+    end
+
+    def self.get_row_cache_code(terms)
+      code = ''
+      terms.each { |term| code += (term ? TRUE_VALUE : FALSE_VALUE) }
+      return code
+    end
+  end
+end

data/lib/ada_truthy/truth_table/truthy_exception.rb

@@ -0,0 +1,4 @@
+module AdaTruthy
+  class TruthyException < StandardError
+  end
+end

data/lib/ada_truthy/version.rb

@@ -0,0 +1,3 @@
+module AdaTruthy
+  VERSION = "1.2.0"
+end

data/lib/ada_truthy.rb

@@ -1,4 +1,5 @@
-require_relative 'logical_gates/logical_gate_extension'
-require_relative 'truth_table/truth_table'
+require_relative 'ada_truthy/version'
+require_relative 'ada_truthy/logical_gates/logical_gate_extension'
+require_relative 'ada_truthy/truth_table/truth_table'
 
 

metadata

@@ -1,33 +1,45 @@
 --- !ruby/object:Gem::Specification
 name: ada_truthy
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 1.2.0
 platform: ruby
 authors:
 - Roberto W. P. Ribeiro
 autorequire: 
-bindir: bin
+bindir: exe
 cert_chain: []
-date: 2023-03-22 00:00:00.000000000 Z
+date: 2023-03-31 00:00:00.000000000 Z
 dependencies: []
 description: Create truth tables and let truthy handle the annoying part. Also, operate
-  with logical gates.
-email: rober.will@hotmail.com
+  with logical gates like AND and OR.
+email:
+- rober.will@hotmail.com
 executables: []
 extensions: []
-extra_rdoc_files:
-- GEM_README.md
+extra_rdoc_files: []
 files:
-- GEM_README.md
+- ".idea/.gitignore"
+- ".idea/modules.xml"
+- ".idea/truthy.iml"
+- ".idea/vcs.xml"
+- Gemfile
+- Rakefile
+- ada_truthy.gemspec
+- bin/console
+- bin/setup
 - lib/ada_truthy.rb
-- lib/logical_gates/logical_gate.rb
-- lib/logical_gates/logical_gate_extension.rb
-- lib/truth_table/truth_table.rb
-- lib/truth_table/truthy_exception.rb
+- lib/ada_truthy/logical_gates/logical_gate.rb
+- lib/ada_truthy/logical_gates/logical_gate_extension.rb
+- lib/ada_truthy/truth_table/truth_table.rb
+- lib/ada_truthy/truth_table/truthy_exception.rb
+- lib/ada_truthy/version.rb
 homepage: https://github.com/roberwil/truthy_gem
 licenses:
 - MIT
-metadata: {}
+metadata:
+  homepage_uri: https://github.com/roberwil/truthy_gem
+  source_code_uri: https://github.com/roberwil/truthy_gem
+  changelog_uri: https://github.com/roberwil/truthy_gem/blob/main/CHANGELOG.md
 post_install_message: 
 rdoc_options: []
 require_paths:

data/GEM_README.md

@@ -1,30 +0,0 @@
-# Truthy Gem
-
-### What is truthy anyway?
-
-Well, think of a truth table you just invented, you put your 1s and 0s and **Truthy** figures out which formula works
-for the table.
-
-| A   | B   | C   |
-|-----|-----|-----|
-| 0   | 0   | 1   |
-| 1   | 0   | 1   |
-| 1   | 1   | 0   |
-| 0   | 1   | 0   |
-
-If you create the above table with **Truthy**, it will know what to do so that your table makes sense.
-Also, **Truthy** has implementations for the following logical gates: `and`, `or`, `not`,
-`xor`, `nand`, `nor`, and `xnor`.
-
-### Where can I use it?
-
-- Access matrices are a good example;
-- Other examples are just day-to-day comparisons you do with booleans in your code.
-
-Let your imagination make good use of Truthy.
-
-### Where do I learn how to use it?
-
-Check the documentation [here](https://github.com/roberwil/truthy_gem/blob/main/README.md).
-Remember, **Truthy** is the way.
-

data/lib/logical_gates/logical_gate.rb

@@ -1,59 +0,0 @@
-class LogicalGate
-  def self.not(a)
-    return inot(a) if a.is_a? Integer
-    return !a
-  end
-
-  def self.and(a, b, *others)
-    return self.iand(a, b, others) if a.is_a? Integer
-    return false if (others.include?(false) || !a || !b)
-    return true
-  end
-
-  def self.nand(a, b, *others)
-    self.not self.and(a, b, others)
-  end
-
-  def self.or(a, b, *others)
-    return self.ior(a, b, others) if a.is_a? Integer
-    return true if others.include?(true) || a || b
-    return false
-  end
-
-  def self.nor(a, b, *others)
-    self.not self.or(a, b, others)
-  end
-
-  def self.xor(a, b, *others)
-    result = self.base_xor a, b
-
-    others.each do |term|
-      result = base_xor(result, term)
-    end
-
-    return result
-  end
-
-  def self.xnor(a, b, *others)
-    return !self.xor(a, b, others)
-  end
-
-  private
-  def self.base_xor(a, b)
-    a != b
-  end
-
-  def self.inot(a)
-    a == 1? 0 : 1
-  end
-
-  def self.iand(a, b, *others)
-    return 0 if others.include?(0) || a == 0 || b == 0
-    return 1
-  end
-
-  def self.ior(a, b, *others)
-    return 1 if others.include?(1) || a == 1 || b == 1
-    return 0
-  end
-end

data/lib/truth_table/truth_table.rb

@@ -1,216 +0,0 @@
-require_relative 'truthy_exception'
-require_relative '../logical_gates/logical_gate_extension'
-
-class TruthTable
-  @@letters = %w[A B C D E F G H I J]
-
-  @@combinations = {
-    2 =>  04, 3 =>   8,  4 =>   16,
-    5 =>  32, 6 =>  64,  7 =>  128,
-    8 => 256, 9 => 512, 10 => 1024
-  }
-
-  MAX_LIMIT   =  6
-  MIN_LIMIT   =  2
-  SELF        = 'S'
-  COMPLEMENT  = 'C'
-  TRUE_VALUE  = 'T'
-  FALSE_VALUE = 'F'
-
-  def initialize(number_of_terms)
-    case number_of_terms
-    when number_of_terms > MAX_LIMIT
-      raise TruthyException, "The maximum number of terms is #{MAX_LIMIT}"
-    when number_of_terms < MIN_LIMIT
-      raise TruthyException, "The minimum number of terms is #{MIN_LIMIT}"
-    end
-
-    @number_of_terms = number_of_terms
-    @number_of_combinations = @@combinations[number_of_terms]
-
-    @cache   = Hash.new
-    @formula = Array.new
-    @rows    = Array.new
-
-    @using_sum_of_products = true
-    @using_product_of_sums = false
-
-    @number_of_zeros = 0
-    @number_of_ones  = 0
-  end
-
-  def add_row(*terms)
-    table_has_enough_rows = @rows.size == @number_of_combinations
-
-    if table_has_enough_rows
-      raise TruthyException, "There should be only #{@number_of_combinations} rows."
-    end
-
-    right_number_of_terms = terms.size == @number_of_terms + 1
-
-    unless right_number_of_terms
-      raise TruthyException, "There should be only #{@number_of_terms} terms."
-    end
-
-    row = terms
-
-    unless row_is_valid? row
-      raise TruthyException, "The combination #{row} has been used already."
-    end
-
-    @cache = {}
-
-    row_output = row[-1]
-    change_algorithm = (@rows.size == 0).and(row_output == 0)
-
-    use_product_of_sums if change_algorithm
-
-    @rows << row
-    (row_output == 1)? @number_of_ones += 1 : @number_of_zeros += 1
-
-    compute row
-  end
-
-  def check(*terms)
-    has_right_number_of_terms = terms.size == @number_of_terms
-
-    unless has_right_number_of_terms
-      raise TruthyException, "There should be only #{@number_of_terms} terms."
-    end
-
-    change_algorithm_if_needed
-
-    cache_code   = TruthTable.get_row_cache_code terms
-    cache_result = @cache[cache_code]
-
-    return cache_result unless cache_result.nil?
-
-    terms_cursor = 0
-    partial_result = true
-    result = false
-
-    if @using_product_of_sums
-      partial_result = false
-      result = true
-    end
-
-    @formula.each do |t|
-      if @using_sum_of_products
-        partial_result = (t == SELF ? partial_result.and(terms[terms_cursor]) :
-                           partial_result.and(!terms[terms_cursor]))
-      else
-        partial_result = (t == SELF ? partial_result.or(terms[terms_cursor]) :
-                           partial_result.or(!terms[terms_cursor]))
-      end
-
-      terms_cursor += 1
-      next if terms_cursor != @number_of_terms
-      terms_cursor = 0
-
-      if (@using_sum_of_products)
-        return true if partial_result
-        result = result.or(partial_result)
-        partial_result = true
-      else
-        return false if not partial_result
-        result = result.and(partial_result)
-        partial_result = false
-      end
-    end
-
-    @cache[cache_code] = result
-    return result
-  end
-
-  def to_s
-    terms_cursor   = 0
-    partial_result = ''
-    result         = ''
-
-    @formula.each do |t|
-      if @using_sum_of_products
-        partial_result += (t == SELF ? "#{@@letters[terms_cursor]}." : "~#{@@letters[terms_cursor]}.")
-      else
-        partial_result += (t == SELF ? "#{@@letters[terms_cursor]}+" : "~#{@@letters[terms_cursor]}+")
-      end
-
-      terms_cursor += 1
-      next if terms_cursor != @number_of_terms
-      terms_cursor = 0
-
-      result += (@using_sum_of_products? "(#{partial_result[0...-1]})+" : "(#{partial_result[0...-1]}).")
-      partial_result = ''
-    end
-
-    result[0...-1]
-  end
-
-  private
-  def row_is_valid?(row)
-    @rows.each do |existing_row|
-      is_equal = true
-
-      (0..existing_row.size - 1).each do |i|
-        is_equal = is_equal.and(row[i] == existing_row[i])
-      end
-
-      return false if is_equal
-    end
-
-    return true
-  end
-
-  def compute(row)
-    row_output = row[-1]
-
-    return if @using_sum_of_products.and(row_output != 1)
-    return if @using_product_of_sums.and(row_output != 0)
-
-    (0...row.size - 1).each do |i|
-      if @using_sum_of_products
-        @formula << (row[i] == 1 ? SELF : COMPLEMENT)
-      else
-        @formula << (row[i] == 1 ? COMPLEMENT : SELF)
-      end
-    end
-  end
-
-  def change_algorithm_if_needed
-    no_need_to_change = @using_sum_of_products.and(@number_of_zeros == 0).
-      or(@using_product_of_sums.and(@number_of_ones == 0))
-
-    return if no_need_to_change
-
-    more_zeros = @number_of_zeros > @number_of_ones
-
-    no_need_to_change = @using_sum_of_products.and(more_zeros).
-      or(@using_product_of_sums.and(!more_zeros))
-
-    return if no_need_to_change
-
-    more_zeros ? use_sum_of_products : use_product_of_sums
-
-    @formula = []
-    @cache   = {}
-
-    @rows.each do |row|
-      compute row
-    end
-  end
-
-  def use_sum_of_products
-    @using_sum_of_products = true
-    @using_product_of_sums = false
-  end
-
-  def use_product_of_sums
-    @using_sum_of_products = false
-    @using_product_of_sums = true
-  end
-
-  def self.get_row_cache_code(terms)
-    code = ''
-    terms.each { |term| code += (term ? TRUE_VALUE : FALSE_VALUE) }
-    return code
-  end
-end

data/lib/truth_table/truthy_exception.rb

@@ -1,2 +0,0 @@
-class TruthyException < StandardError
-end