move lib/compsci.rb code to lib/compsci/util.rb

Author: rickhull

lib/compsci.rb

@@ -1,10 +1 @@
-module CompSci
-  # thanks apeiros
-  # https://gist.github.com/rickhull/d0b579aa08c85430b0dc82a791ff12d6
-  def self.power_of?(num, base)
-    return false if base <= 1
-    mod = 0
-    num, mod = num.divmod(base) until (num == 1) || (mod > 0)
-    mod == 0
-  end
-end
+module CompSci; end

lib/compsci/util.rb

@@ -0,0 +1,10 @@
+module CompSci
+  # thanks apeiros
+  # https://gist.github.com/rickhull/d0b579aa08c85430b0dc82a791ff12d6
+  def self.power_of?(num, base)
+    return false if base <= 1
+    mod = 0
+    num, mod = num.divmod(base) until (num == 1) || (mod > 0)
+    mod == 0
+  end
+end

test/bench/complete_tree.rb

@@ -39,7 +39,7 @@
 puts <<EOF
 
 #
-# timing CompleteTree#push where N is the count of pushes
+# timing CompleteTree#push where N is the count of pushes per batch
 #
 
 EOF

test/compsci.rb test/util.rb

@@ -1,24 +1,24 @@
-require 'compsci'
+require 'compsci/util'
 require 'minitest/autorun'
 
 describe CompSci do
   parallelize_me!
 
-  it "must determine if num is a power of base" do
-    powers = {}
+  it "determines if num is a power of base" do
+    powers = Hash.new []
     basemax = 12
     expmax = 10
     2.upto(basemax) { |base|
       0.upto(expmax) { |exp|
-        powers[base] ||= []
-        powers[base] << base**exp
+        powers[base] += [base**exp]
       }
     }
 
     # 12k assertions below!
     2.upto(basemax) { |base|
       1.upto(2**expmax) { |num|
-        expect(CompSci.power_of?(num, base)).must_equal powers[base].include?(num)
+        x = powers[base].include?(num)
+        expect(CompSci.power_of?(num, base)).must_equal x
       }
     }
   end