victory 0.3.1 → 0.4.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 9d60d4df31c72fa61641ad7e3c97bbdac72caed1b96bef00f249cf2597be6729
-  data.tar.gz: 474648ec1216b1106c3afabd005c642d690a7020f3bd7c664b463affa3780ddd
+  metadata.gz: e1ddbe3510c3b4bddd014951aa6aebaac3a702c39b752751270e212583b1abf9
+  data.tar.gz: b0e3f83beeb1bf0373fbdc1fbfdf3ba76ab1bda526a2cd1537a890c0145765dc
 SHA512:
-  metadata.gz: 51f99234f08eef7dc4d96d59db36d0ba70c8efe0b1b9046644197c4beb7cd84ec177a8cd9f224006c4cba4321ff5f807f33f3c8261c9988e927d0fd7bcea520d
-  data.tar.gz: 7f394a441ec4242808fbb38f130aac07e1238bcca08a1aaaf7a9e50f8948c73f0e6b13f7b47c86c9826c543f6944a9587d961ad2f701ed5418789941bb285de0
+  metadata.gz: 8aa93ef475b81c961405ebff72d5dca34ebb464425fd5cf842b5b29b2fbef7017032bdc8c92f696b409d9733e690250ec071c7099d1c30df3212b5700e5bc03d
+  data.tar.gz: 425a03ea2c788e42fdfab0ade46c285635b0072c1cb6d73833e40684e1833f7c2979c46257ffb8729fcd56a031213890022f8a249d03391e13107b90e2817b0f

data/.gitignore

@@ -101,3 +101,4 @@ fabric.properties
 
 Gemfile.lock
 **/*.gem
+*.dylib

data/ext/containers/bitset/bitset.c

@@ -76,7 +76,7 @@ static VALUE rb_bitset_initialize(VALUE self, VALUE ary) {
     return self;
 }
 
-static VALUE rb_bitset_size(VALUE self, VALUE len) {
+static VALUE rb_bitset_size(VALUE self) {
     Bitset * bs = get_bitset(self);
     return INT2NUM(bs->len);
 }
@@ -141,6 +141,36 @@ static VALUE rb_bitset_set(int argc, VALUE * argv, VALUE self) {
     return Qtrue;
 }
 
+static VALUE rb_bitset_flip(int argc, VALUE * argv, VALUE self) {
+    int i;
+    Bitset * bs = get_bitset(self);
+
+    if (argc == 1 && rb_obj_is_kind_of(argv[0], rb_const_get(rb_cObject, rb_intern("Array")))) {
+        for(i = 0; i < RARRAY_LEN(argv[0]); i++) {
+            VALUE index = RARRAY_PTR(argv[0])[i];
+            int idx = NUM2INT(index);
+            validate_index(bs, idx);
+            if (_get_bit(bs, idx) == 0) {
+                _set_bit(bs, idx);
+            } else {
+                _clear_bit(bs, idx);
+            }
+        }
+    } else {
+        for(i = 0; i < argc; i++) {
+            VALUE index = argv[i];
+            int idx = NUM2INT(index);
+            validate_index(bs, idx);
+            if (_get_bit(bs, idx) == 0) {
+                _set_bit(bs, idx);
+            } else {
+                _clear_bit(bs, idx);
+            }
+        }
+    }
+    return Qtrue;
+}
+
 static VALUE rb_bitset_clear(int argc, VALUE * argv, VALUE self) {
     int i;
     Bitset * bs = get_bitset(self);
@@ -604,9 +634,11 @@ void Init_CBitset() {
     rb_define_method(cBitset, "initialize", rb_bitset_initialize, 1);
     rb_define_method(cBitset, "reset!", rb_bitset_reset, 0);
     rb_define_method(cBitset, "size", rb_bitset_size, 0);
+    rb_define_alias(cBitset, "length", "size");
     rb_define_method(cBitset, "[]", rb_bitset_aref, 1);
     rb_define_method(cBitset, "[]=", rb_bitset_aset, 2);
     rb_define_method(cBitset, "set", rb_bitset_set, -1);
+    rb_define_method(cBitset, "flip", rb_bitset_flip, -1);
     rb_define_method(cBitset, "clear", rb_bitset_clear, -1);
     rb_define_method(cBitset, "set?", rb_bitset_set_p, -1);
     rb_define_method(cBitset, "clear?", rb_bitset_clear_p, -1);
@@ -634,6 +666,7 @@ void Init_CBitset() {
     rb_define_method(cBitset, "hamming", rb_bitset_hamming, 1);
     rb_define_method(cBitset, "each", rb_bitset_each, 0);
     rb_define_method(cBitset, "to_s", rb_bitset_to_s, 0);
+    rb_define_alias(cBitset, "inspect", "to_s");
     rb_define_singleton_method(cBitset, "from_s", rb_bitset_from_s, 1);
     rb_define_method(cBitset, "marshal_dump", rb_bitset_marshall_dump, 0);
     rb_define_method(cBitset, "marshal_load", rb_bitset_marshall_load, 1);

data/lib/algorithms/genetic_algorithm/genetic_algorithm.rb

@@ -0,0 +1,71 @@
+module Algorithms::GeneticAlgorithm
+  module Solution
+    abstract_method :mutate, :crossover, :score
+    @data = nil
+    attr_reader :data
+
+    def valid?; true; end
+
+    def create_new_solution(data)
+      new_solution = self.clone
+      new_solution.instance_variable_set(:@data, data)
+      new_solution
+    end
+  end
+
+  # population = list of solutions
+  def self.init(population)
+    Engine.new(population)
+  end
+
+  class Engine
+    attr_reader :best_solution
+
+    def initialize(population)
+      @population = population
+      @best_solution = population.max_by(&:score)
+    end
+
+    def run(iterations, min_size: 100, generate_retry: 10)
+      @population = generate_until_minimum(@population, min_size)
+      iterations.times do
+        @population = @population.map do |solution|
+          generate_new_solution(solution, @population, generate_retry)
+        end
+        @best_solution = (@population + [@best_solution]).max_by(&:score)
+      end
+    end
+
+    private
+
+    def generate_until_minimum(population, min_size)
+      while population.size <= min_size
+        new_solutions = []
+        population.each_with_index do |solution, idx|
+          if idx % 2 == 0
+            new_solution = solution.mutate
+            new_solutions << new_solution if new_solution.valid?
+          else
+            other_solution = population.reject.with_index { |_, i| i == idx }.sample
+            new_solution = solution.crossover(other_solution)
+            new_solutions << new_solution if new_solution.valid?
+          end
+        end
+        population += new_solutions
+      end
+      population
+    end
+
+    def generate_new_solution(solution, population, generate_retry)
+      generate_retry.times do
+        new_solution = if rand < 0.5
+                         solution.mutate
+                       else
+                         solution.crossover(population.sample)
+                       end
+        return new_solution if new_solution.valid?
+      end
+      solution
+    end
+  end
+end

data/lib/algorithms/genetic_algorithm/solutions/array.rb

@@ -0,0 +1,31 @@
+class Algorithms::GeneticAlgorithm::ArraySolution
+  include Algorithms::GeneticAlgorithm::Solution
+
+  def initialize(array, possible_elements: [], mutate_change_rate: 0.5)
+    @data, @possible_elements, @mutate_change_rate = array, possible_elements, mutate_change_rate
+  end
+
+  def mutate
+    new_data = @data.map do |val|
+      if rand < @mutate_change_rate
+        (@possible_elements || @data).sample
+      else
+        val
+      end
+    end
+    create_new_solution(new_data)
+  end
+
+  def crossover(other_solution)
+    other_data = other_solution.data
+    indices = rand(@data.size / 10).times.map { rand(@data.size) }.sort.<<(@data.size).each
+    current_data = @data
+    new_data = @data.map.with_index do |_element, idx|
+      if idx == indices.peek
+        current_data = current_data == @data ? other_data : @data
+      end
+      current_data[idx]
+    end
+    create_new_solution(new_data)
+  end
+end

data/lib/algorithms/genetic_algorithm/solutions/bitset.rb

@@ -0,0 +1,28 @@
+class Algorithms::GeneticAlgorithm::BitsetSolution
+  include Algorithms::GeneticAlgorithm::Solution
+
+  def initialize(bitset, mutate_change_rate: 0.5)
+    @data, @mutate_change_rate = bitset, mutate_change_rate
+  end
+
+  def mutate
+    new_data = @data.dup
+    indices_to_change = []
+    (0...@data.size).each do |idx|
+      if rand < @mutate_change_rate
+        indices_to_change << idx
+      end
+    end
+    new_data.flip(indices_to_change)
+    create_new_solution(new_data)
+  end
+
+  def crossover(other_solution)
+    new_data = if rand < 0.5
+                 @data ^ other_solution.data
+               else
+                 @data - other_solution.data
+               end
+    create_new_solution(new_data)
+  end
+end

data/lib/algorithms/genetic_algorithm/solutions/combination.rb

@@ -0,0 +1,20 @@
+class Algorithms::GeneticAlgorithm::CombinationSolution
+  include Algorithms::GeneticAlgorithm::Solution
+
+  def initialize(possible_elements, size, data: possible_elements.sample(size))
+    @data, @possible_elements, @size = Set.new(data), possible_elements, size
+  end
+
+  def mutate
+    create_new_solution(Set.new(@possible_elements.sample(@size)))
+  end
+
+  def crossover(other_solution)
+    size = @data.size
+    common = @data & other_solution.data
+    sym_diff = @data ^ other_solution.data
+    sampled_sym_diff = Set.new(sym_diff.to_a.sample(size - common.size))
+    new_data = common.union(sampled_sym_diff)
+    create_new_solution(new_data)
+  end
+end

data/lib/algorithms/genetic_algorithm/solutions/permutation.rb

@@ -0,0 +1,22 @@
+class Algorithms::GeneticAlgorithm::PermutationSolution
+  include Algorithms::GeneticAlgorithm::Solution
+
+  def initialize(array)
+    @data = array
+  end
+
+  def mutate
+    create_new_solution(@data.shuffle)
+  end
+
+  def crossover(other_solution)
+    sampled_indices = @data.each_index.to_a.sample(@data.size / 2)
+    sampled_elements = sampled_indices.map { |i| @data[i] }
+    elements_from_other = other_solution.data.select { |el| sampled_elements.include?(el) }
+    new_data = @data.dup
+    sampled_indices.zip(elements_from_other).each do |idx, el|
+      new_data[idx] = el
+    end
+    create_new_solution(new_data)
+  end
+end

data/lib/algorithms/greedy.rb

@@ -1,6 +1,6 @@
-module Greedy
+module Algorithms::Greedy
   module Solution
-    attr_reader :score, :next_solutions
+    abstract_method  :score, :next_solutions
   end
 
   def self.init(solution)
@@ -19,7 +19,7 @@ module Greedy
       end
     end
 
-    def current_solution
+    def best_solution
       @solutions_history[-1]
     end
   end

data/lib/victory/version.rb

@@ -1,3 +1,3 @@
 module Victory
-  VERSION = '0.3.1'
+  VERSION = '0.4.0'
 end

data/lib/victory.rb

@@ -1,5 +1,7 @@
 require "victory/version"
 
+require 'abstract_method'
+
 module Algorithms; end
 module Containers; end
 
@@ -7,6 +9,11 @@ require 'algorithms/search'
 require 'algorithms/sort'
 require 'algorithms/string'
 require 'algorithms/greedy'
+require 'algorithms/genetic_algorithm/genetic_algorithm'
+require 'algorithms/genetic_algorithm/solutions/bitset'
+require 'algorithms/genetic_algorithm/solutions/array'
+require 'algorithms/genetic_algorithm/solutions/permutation'
+require 'algorithms/genetic_algorithm/solutions/combination'
 require 'containers/prefix_tree'
 require 'containers/heap'
 require 'containers/stack'

data/victory.gemspec

@@ -35,4 +35,5 @@ Gem::Specification.new do |spec|
 
   spec.add_runtime_dependency 'concurrent-ruby', '~> 1.1.6'
   spec.add_runtime_dependency 'rgl', '~> 0.5.4'
+  spec.add_runtime_dependency 'abstract_method'
 end

metadata

@@ -1,24 +1,24 @@
 --- !ruby/object:Gem::Specification
 name: victory
 version: !ruby/object:Gem::Version
-  version: 0.3.1
+  version: 0.4.0
 platform: ruby
 authors:
 - Arnold Szederjesi
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2020-02-15 00:00:00.000000000 Z
+date: 2020-02-17 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
-  prerelease: false
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '2.1'
   type: :development
+  prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
@@ -26,13 +26,13 @@ dependencies:
         version: '2.1'
 - !ruby/object:Gem::Dependency
   name: minitest
-  prerelease: false
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '5.0'
   type: :development
+  prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
@@ -40,13 +40,13 @@ dependencies:
         version: '5.0'
 - !ruby/object:Gem::Dependency
   name: rake
-  prerelease: false
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '10.0'
   type: :development
+  prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
@@ -54,13 +54,13 @@ dependencies:
         version: '10.0'
 - !ruby/object:Gem::Dependency
   name: rake-compiler
-  prerelease: false
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
+  prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
@@ -68,13 +68,13 @@ dependencies:
         version: '0'
 - !ruby/object:Gem::Dependency
   name: rspec
-  prerelease: false
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
+  prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
@@ -82,13 +82,13 @@ dependencies:
         version: '0'
 - !ruby/object:Gem::Dependency
   name: concurrent-ruby
-  prerelease: false
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
         version: 1.1.6
   type: :runtime
+  prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
@@ -96,18 +96,32 @@ dependencies:
         version: 1.1.6
 - !ruby/object:Gem::Dependency
   name: rgl
-  prerelease: false
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
         version: 0.5.4
   type: :runtime
+  prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
         version: 0.5.4
+- !ruby/object:Gem::Dependency
+  name: abstract_method
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
 description: 
 email:
 - szederjesiarnold@gmail.com
@@ -156,6 +170,11 @@ files:
 - ext/containers/xor_list/extconf.rb
 - ext/containers/xor_list/xor_list.c
 - extensions.rb
+- lib/algorithms/genetic_algorithm/genetic_algorithm.rb
+- lib/algorithms/genetic_algorithm/solutions/array.rb
+- lib/algorithms/genetic_algorithm/solutions/bitset.rb
+- lib/algorithms/genetic_algorithm/solutions/combination.rb
+- lib/algorithms/genetic_algorithm/solutions/permutation.rb
 - lib/algorithms/greedy.rb
 - lib/algorithms/search.rb
 - lib/algorithms/sort.rb
@@ -203,7 +222,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.0.3
+rubygems_version: 3.1.2
 signing_key: 
 specification_version: 4
 summary: A gem providing all useful algorithms and data structures for programming