briandoll-greatest_common_factor 0.0.1 → 0.0.2

data/History.txt

@@ -1,3 +1,9 @@
 == 0.0.1 / 2008-09-19
-
 * Initial release
+
+== 0.0.2 / 2008-10.10
+* Added speed improvements when dealing with arrays containing a large
+spread of numbers
+* Added benchmarking code to compare 2-digit array calculation with
+basic ruby
+* Added fuzzy gcf calculations

data/README.txt

@@ -10,11 +10,15 @@ This gem provides that same ability on arrays of integers.
 == FEATURES:
  * Calculate the GCF on an array of integers
  * Factor the array of integers by the GCF
+ * Calculate non-exact GCF with a specified tolerance
 
 == SYNOPSIS:
  * [12,16,8,40].greatest_common_factor => 4
  * [12,16,8,40].gcf => 4
  * [12,16,8,40].factored_by_gcf => [3, 4, 2, 10]
+ * Fuzzy:
+ * [28,38,73,93].factored_by_gcf => nil
+ * [28,38,73,93].factored_by_gcf(1) => [14, 19, 36, 46]
 
 == REQUIREMENTS:
 

data/greatest_common_factor.gemspec

@@ -1,6 +1,6 @@
 Gem::Specification.new do |s|
   s.name     = "greatest_common_factor"
-  s.version  = "0.0.1"
+  s.version  = "0.0.2"
   s.date     = "2008-09-19"
   s.summary  = "Find the greatest common factor between sets of numbers.  Can also factor the array by the gcf."
   s.email    = "brian@emphaticsolutions.com"

data/lib/greatest_common_factor.rb

@@ -2,8 +2,8 @@ module BrianDoll
   module GreatestCommonFactor
 
     # Factor this all-integer array by the GCF and return the result
-    def factored_by_gcf
-      gcf = greatest_common_factor
+    def factored_by_gcf(tolerance=0)
+      gcf = greatest_common_factor(tolerance)
       unless gcf.nil?        
         self.collect { |e| e / gcf }
       else
@@ -12,12 +12,12 @@ module BrianDoll
     end
 
     # Determine the GCF across each element of this all-integer array
-    def greatest_common_factor
+    def greatest_common_factor(tolerance=0)
       gcf = nil
       if all_ints? self
         dupe_self = self.dup
         dupe_self.delete(0)
-        factor_sets = find_factor_sets(dupe_self)
+        factor_sets = find_factor_sets(dupe_self, tolerance)
         ampersand_sets = ""      
         factor_sets.each_with_index do |set,i|
           if i == 0
@@ -49,17 +49,18 @@ module BrianDoll
     private    
     
     # Find all factors for each element in the array
-    def find_factor_sets(collection)
-      collection.collect { |n| find_all_factors(n) }
+    def find_factor_sets(collection,tolerance)
+      smallest_number = collection.sort.first
+      collection.collect { |n| find_all_factors(n,smallest_number,tolerance) }
     end
     
     # Brute force approach to finding all factors for an integer
-    def find_all_factors(n)
+    def find_all_factors(n,starting_with=n,tolerance=0)
       n = n.to_i
-      factor = n - 1
+      factor = (n.eql? starting_with) ? (n - 1) : starting_with
       factors = []
-      while factor > 1
-        if ((n % factor) == 0)
+       while factor > 1
+        if ((n % factor) <= tolerance)
           factors << factor
         end
         factor -= 1

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: briandoll-greatest_common_factor
 version: !ruby/object:Gem::Version 
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors: 
 - Brain Doll