fwt 0.2.1 → 1.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 46983f7b164a5ba936747fd3b8a143e45e65b78e
-  data.tar.gz: 6c092163b85d8bb1f2a9515dd4fbe4f07153b9ea
+  metadata.gz: fc144da4af3fc808cc68b7d0076a31bd3b1e35ce
+  data.tar.gz: 267e98bc7c5cb063a5d60dfcd51149e3064e361c
 SHA512:
-  metadata.gz: 817725fed18aa2dfd3bc91719ab57ea1d99606c8816f3de015448afc7c66d0e98c09b38e8c82cdfa949efb5b2ff9d97b2ffe801a0465a0cc37460a70eb3995e5
-  data.tar.gz: 6a9f1e54075aa06bb01f72cceaf9870b07c10225b2df3ec541bc86ae1ebac7bd164a3bd9120aec6d3051ebe191ff5c3a803740d42fc6598fd41329324e35b551
+  metadata.gz: 1b10014fc405e7675c82e80013bbc0c879f579a4d1708840a47835fb7454c431b2e1426dd9f8bee4151bbb4d6f2d4db28db5ddcff22def78ad885f616914097f
+  data.tar.gz: 69a995a36d714b6052c62a1be6b30f0f940be2e062078baf4dbff4a6e923bb1096d15a75af60bef40a2645e49af1cfb56ae577af9d039af6d6febe571e72995e

data/fwt.gemspec

@@ -1,13 +1,13 @@
 # -*- ruby -*-
-_VERSION = "0.2.1"
+_VERSION = "1.0.0"
 
 Gem::Specification.new do |s|
   s.name = "fwt"
   s.version = _VERSION
-  s.date = "2013-03-03"
+  s.date = "2013-03-09"
   s.summary = "Fast Walsh Transform native Ruby implementations."
   s.email = "pjs@alum.mit.edu"
-  s.description = "Implements Hadamard- and sequency-ordered Fast Walsh Transforms as extensions of class Array."
+  s.description = "Implements Hadamard- and sequency-ordered Fast Walsh Transforms as extensions of class Array.  Adds a boolean power_of_2? method to class Integer."
   s.author = "Paul J Sanchez"
   s.files = %w[
     fwt.gemspec

data/lib/fwt.rb

@@ -12,9 +12,8 @@ class Array
   # Perform a fast Walsh transformation using a Manz sequency ordered
   # in-place algorithm. The array is modified by this algorithm.
   def sequency
-    raise Exception.new(
-        "#{self.class}.#{__method__}: array length must be a power of 2"
-      ) unless length.power_of_2?
+    raise "#{self.class}.#{__method__}: array length must be a power of 2" \
+      unless length.power_of_2?
     j = 0
     0.upto(length - 3) do |i|  # Bit reversal sorting
       self[i], self[j] = self[j], self[i] if (i < j)
@@ -34,13 +33,9 @@ class Array
           j = i + group * offset
           k = j + lag
           if (group.odd?)
-            temp = self[j]
-            self[j] -= self[k]
-            self[k] += temp
+            self[j], self[k] = self[j] - self[k], self[j] + self[k]
           else
-            temp = self[j]
-            self[j] += self[k]
-            self[k] = temp - self[k]
+            self[j], self[k] = self[j] + self[k], self[j] - self[k]
           end
         end
       end
@@ -52,9 +47,8 @@ class Array
   # Perform a fast Walsh transformation using a Hadamard (natural) ordered
   # in-place algorithm. The array is modified by this algorithm.
   def hadamard
-    raise Exception.new(
-        "#{self.class}.#{__method__}: array length must be a power of 2"
-      ) unless length.power_of_2?
+    raise "#{self.class}.#{__method__}: array length must be a power of 2" \
+      unless length.power_of_2?
     lag = 1
     while lag < length
       offset = lag << 1
@@ -63,9 +57,7 @@ class Array
         lag.times do |base|
           j = base + group * offset
           k = j + lag
-          temp = self[j]
-          self[j] += self[k]
-          self[k] = temp - self[k]
+          self[j], self[k] = self[j] + self[k], self[j] - self[k]
         end
       end
       lag = offset

data/tests/test_fwt.rb

@@ -15,7 +15,7 @@ class FWT_test < Test::Unit::TestCase
     assert_equal [0,0,0,0,0,0,0,1].hadamard, [1, -1, -1, 1, -1, 1, 1, -1]
     assert_equal [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1].sequency,
       [1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1]
-    assert_raise Exception do   # non-power-of-2 array
+    assert_raise RuntimeError do   # non-power-of-2 array
       [0,0,1].hadamard
     end
   end
@@ -31,10 +31,10 @@ class FWT_test < Test::Unit::TestCase
     assert_equal [0,0,0,0,0,0,0,1].sequency, [1, -1, 1, -1, 1, -1, 1, -1]
     assert_equal [0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0].sequency,
       [1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1]
-    assert_raise Exception do   # non-power-of-2 array
+    assert_raise RuntimeError do   # non-power-of-2 array
       [0,0,1].sequency
     end
-    assert_raise Exception do   # empty array
+    assert_raise RuntimeError do   # empty array
       [].sequency
     end
   end

metadata

@@ -1,17 +1,17 @@
 --- !ruby/object:Gem::Specification
 name: fwt
 version: !ruby/object:Gem::Version
-  version: 0.2.1
+  version: 1.0.0
 platform: ruby
 authors:
 - Paul J Sanchez
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-03-03 00:00:00.000000000 Z
+date: 2013-03-09 00:00:00.000000000 Z
 dependencies: []
 description: Implements Hadamard- and sequency-ordered Fast Walsh Transforms as extensions
-  of class Array.
+  of class Array.  Adds a boolean power_of_2? method to class Integer.
 email: pjs@alum.mit.edu
 executables: []
 extensions: []
@@ -41,8 +41,9 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.0.0
+rubygems_version: 2.0.2
 signing_key: 
 specification_version: 4
 summary: Fast Walsh Transform native Ruby implementations.
 test_files: []
+has_rdoc: