hungarian_algorithm_c 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 3131f481cd59f14347ab0881138cebeee3e426df
-  data.tar.gz: 8d5f3506ffe58e10ccb2bb5b550aaec1d3296a18
+  metadata.gz: a54ee73466778776258aa0601cd5a7f8c0ff8ae6
+  data.tar.gz: 66cfd028102d917ef159e45fda5836a9128d4dfa
 SHA512:
-  metadata.gz: 3f41e80045ae12207881e794037d078e890e60bae9045c363cd86c3716f148318204ed06bdd67b2f0ef0630ede36cf83cc3a048a7edcb7cf1a83dbd8b0f5a957
-  data.tar.gz: ea61a05071cab151bb5e867e535b6127351889f610671800e8c800996ad432fbb20151e2a86333a5bb9179457f33c47c2a46133b29b6815db03ad4010f9892cc
+  metadata.gz: cd8765887857a796dcedbf341058dd9630028762b37bafd3d5c16a3b3e0cf9edb605c1d3ee80374ef8971ec00c7c4df2fca70cc1a2cc7abf98a5020efa1d1381
+  data.tar.gz: fed0e9c37a870840477081d59beb4871cc0cb921decdc9bc025c7f92c3ccf530a00e8039adb894278e6d87e6764b9db12b97910626eea7e7e187dfb202dbadb1

data/ext/hungarian_algorithm_c/hungarian_algorithm_c.c

@@ -53,8 +53,8 @@ VALUE pairs(VALUE self, VALUE flattened_array_ruby, VALUE row_size_val) {
 
   int index;
   for (index = 0; index < array_size; index++) {
-    double element = 100 * NUM2DBL(rb_ary_entry(flattened_array_ruby, index));
-    int rounded_element = element;
+    long double element = 100 * NUM2DBL(rb_ary_entry(flattened_array_ruby, index));
+    long long int rounded_element = element;
     array_c[index] = rounded_element;
   }
 

data/lib/hungarian_algorithm_c/version.rb

@@ -1,3 +1,3 @@
 module HungarianAlgorithmC
-  VERSION = '0.0.1'
+  VERSION = '0.0.2'
 end

data/lib/hungarian_algorithm_c.rb

@@ -1,4 +1,4 @@
-require 'hungarian_algorithm_c.so'
+require_relative './hungarian_algorithm_c.so'
 
 module HungarianAlgorithmC
   class << self

data/spec/hungarian_algorithm_c_spec.rb

@@ -41,6 +41,22 @@ RSpec.describe HungarianAlgorithmC do
           [2, 1]
         ])
       end
+
+      context 'with very large numbers' do
+        let(:matrix_with_costs) { [
+          [4, 1, 7],
+          [Float::INFINITY, 3, 9],
+          [1, 2, 13]
+        ] }
+
+        it 'should output minimum cost pairs' do
+          should match_array([
+            [0, 2],
+            [1, 0],
+            [2, 1]
+          ])
+        end
+      end
     end
 
     context '4x4 array' do
@@ -59,6 +75,24 @@ RSpec.describe HungarianAlgorithmC do
           [3, 0]
         ])
       end
+
+      context 'with very large numbers' do
+        let(:matrix_with_costs) { [
+          [Float::INFINITY, 3, 10000000000000000000000000000000000, 3],
+          [10, 2, Float::INFINITY, 6],
+          [10, 3, 34, Float::INFINITY],
+          [99999999999999999999999, 13, 15, 6000000000000000]
+        ] }
+
+        it 'should output minimum cost pairs' do
+          should match_array([
+            [0, 2],
+            [1, 1],
+            [2, 3],
+            [3, 0]
+          ])
+        end
+      end
     end
   end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: hungarian_algorithm_c
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Syed Humza Shah