church 0.1.6 → 0.1.7

data/README.md

@@ -18,4 +18,4 @@ EACH[[1, 2, 3], &-> e { p e } ]
 
 ### Why?
 
-The point of writing everything using Procs, for me at least, is to eventually transform programs into [non-alphanumeric](threeifbywhiskey.github.io/2014/03/05/non-alphanumeric-ruby-for-fun-and-not-much-else/) versions of themselves. Church's design goal is to make that an easier process.
+The point of writing everything using Procs, for me at least, is to eventually transform programs into [non-alphanumeric](https://threeifbywhiskey.github.io/2014/03/05/non-alphanumeric-ruby-for-fun-and-not-much-else/) versions of themselves. Church's design goal is to make that an easier process.

data/lib/church/array.rb

@@ -103,4 +103,11 @@ module Church
       coll[i] == elem ? i : i > SIZE[coll] ? nil : indexer[i + 1]
     })[0]
   }
+
+  # Returns the product of two arrays
+  PRODUCT = -> a, b {
+    REDUCE[MAP[[*0...SIZE[a]],
+               &-> x { MAP[[*0...SIZE[b]],
+                           &-> y { [a[x], b[y]] }] }], &:+]
+  }
 end

data/lib/church/range.rb

@@ -1,4 +1,5 @@
 module Church
+  # Returns an array containing the numbers from start to finish, inclusive, incremented by step
   RANGE = -> start, finish, step = 1 {
     (ranger = -> ret {
       start >= finish ? ret : ranger[ret << start += step]

data/lib/church/version.rb

@@ -1,3 +1,3 @@
 module Church
-  VERSION = "0.1.6"
+  VERSION = "0.1.7"
 end

data/spec/array_spec.rb

@@ -122,3 +122,13 @@ describe 'INDEX' do
     expect(INDEX[[1, 2, 3], 4]).to be nil
   end
 end
+
+describe 'PRODUCT' do
+  let(:a) { [1, 2, :potato] }
+  let(:b) { [3, 4] }
+
+  it "should return the product of two arrays" do
+    expect(PRODUCT[a, b]).to eq a.product b
+    expect(PRODUCT[b, a]).to eq b.product a
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: church
 version: !ruby/object:Gem::Version
-  version: 0.1.6
+  version: 0.1.7
   prerelease: 
 platform: ruby
 authors: