church 0.0.1

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in risper.gemspec
+gemspec

data/LICENSE

@@ -0,0 +1,13 @@
+            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+                    Version 2, December 2004
+
+ Copyright (C) 2004 Sam Hocevar <sam@hocevar.net>
+
+ Everyone is permitted to copy and distribute verbatim or modified
+ copies of this license document, and changing it is allowed as long
+ as the name is changed.
+
+            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. You just DO WHAT THE FUCK YOU WANT TO.

data/README.md

@@ -0,0 +1,3 @@
+# Church
+
+TODO: Write a gem description

data/Rakefile

@@ -0,0 +1,8 @@
+require 'bundler/gem_tasks'
+require 'rspec/core/rake_task'
+
+RSpec::Core::RakeTask.new(:spec) do |task|
+  task.rspec_opts = ['--color']
+end
+
+task :default => :spec

data/church.gemspec

@@ -0,0 +1,22 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'church/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "church"
+  spec.version       = Church::VERSION
+  spec.authors       = ["Three If By Whiskey"]
+  spec.email         = ["3ifbyw@gmail.com"]
+  spec.summary       = %q{Church provides top-level constant Procs to do various and sundry kinds of functional programming.}
+  spec.homepage      = ""
+  spec.license       = "WTFPL"
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.5"
+  spec.add_development_dependency "rake"
+end

data/lib/church/array.rb

@@ -0,0 +1,83 @@
+module Church
+  # Returns the size of an array or string using recursion.
+  SIZE = -> coll {
+    coll == [] || coll == '' ? 0 : 1 + SIZE[coll[1..-1]]
+  }
+
+  # Returns the size of an array or string using iteration.
+  ISIZE = -> coll {
+    sz = 0
+    (slicer = -> {
+      sz += 1
+      (coll = coll[1..-1]) == [] || coll == '' ? sz : slicer[]
+    })[]
+  }
+
+  # Maps fn over coll recursively.
+  MAP = -> coll, &fn {
+    coll == [] ? [] : [fn[coll[0]]] + MAP[coll[1..-1], &fn]
+  }
+
+  # Maps fn over coll iteratively.
+  IMAP = -> coll, &fn {
+    sz = SIZE[coll]
+    ret = []
+    i = 0
+
+    (mapper = -> {
+      ret[i] = fn[coll[i]]
+      (i += 1) == sz ? ret : mapper[]
+    })[]
+  }
+
+  # Maps fn over coll iteratively and in-place, modifying the original collection.
+  MAP_BANG = -> coll, &fn {
+    sz = SIZE[coll]
+    i = 0
+
+    (mapper = -> {
+      coll[i] = fn[coll[i]]
+      (i += 1) == sz ? coll : mapper[]
+    })[]
+  }
+
+  # Reduces fn over coll iteratively.
+  REDUCE = -> coll, &fn {
+    sz = SIZE[coll]
+    ret = coll[0]
+    i = 1
+
+    (reducer = -> {
+      ret = fn[ret, coll[i]]
+      (i += 1) == sz ? ret : reducer[]
+    })[]
+  }
+
+  # Filters coll through fn using recursion.
+  FILTER = -> coll, &fn {
+    coll == [] ? [] : (fn[coll[0]] ? [coll[0]] : []) + FILTER[coll[1..-1], &fn]
+  }
+
+  # Filters coll through fn using iteration.
+  IFILTER = -> coll, &fn {
+    sz = SIZE[coll]
+    ret = []
+    i = 0
+
+    (filterer = -> {
+      fn[coll[i]] ? ret << coll[i] : 0
+      (i += 1) == sz ? ret : filterer[]
+    })[]
+  }
+
+  # Performs fn with each element of coll in turn.
+  EACH = -> coll, &fn {
+    sz = SIZE[coll]
+    i = 0
+
+    (eacher = -> {
+      fn[coll[i]]
+      (i += 1) == sz ? coll : eacher[]
+    })[]
+  }
+end

data/lib/church/math.rb

@@ -0,0 +1,42 @@
+module Church
+  CMP = -> a, b {
+    a > b ? 1 : a < b ? -1 : 0
+  }
+
+  ADD = -> a, b {
+    b == 0 ? a : ADD[a + CMP[b, 0], b + CMP[0, b]]
+  }
+
+  SUB = -> a, b {
+    b == 0 ? a : SUB[a + (0 <=> b), b + (0 <=> b)]
+  }
+
+  MUL = -> a, b {
+    (mul_p = -> c, d {
+      d == b ? c + a * CMP[0, b] : mul_p[c + a * CMP[b, 0], d + CMP[b, 0]]
+    })[a * CMP[b, 0], 0]
+  }
+
+  DIV = -> a, b {
+    div_p = -> d {
+      d = ADD[d, CMP[b, 0]]
+      a = SUB[a, MUL[b, CMP[b, 0]]]
+      a >= MUL[b, CMP[b, 0]] ? div_p[d] : d
+    }
+    b > a ? 0 : div_p[0]
+  }
+
+  MOD = -> a, b {
+    MOD_p = -> {
+      a = SUB[a, MUL[b, CMP[b, 0]]]
+      a > b ? MOD_p[] : (b < 0 ? SUB[a, b] : a)
+    }
+    MOD_p[]
+  }
+
+  POW = -> a, b {
+    (POW_p = -> c, d {
+      d == b ? c : POW_p[MUL[a, c], ADD[d, 1]]
+    })[1, 0]
+  }
+end

data/lib/church/version.rb

@@ -0,0 +1,3 @@
+module Church
+  VERSION = "0.0.1"
+end

data/lib/church.rb

@@ -0,0 +1,3 @@
+require 'church/version'
+require 'church/array'
+require 'church/math'

data/spec/array_spec.rb

@@ -0,0 +1,44 @@
+require 'spec_helper'
+
+include Church
+
+describe 'SIZE' do
+  it "should return the size of a String" do
+    expect(SIZE['abc']).to be 3
+  end
+
+  it "should return the size of an Array" do
+    expect(SIZE[[1, 2, 3]]).to be 3
+  end
+end
+
+describe 'MAP' do
+  it "should properly implement map as a top-level lambda" do
+    expect(MAP[[1, 2, 3], &-> c { c * 2 }]).to eq [2, 4, 6]
+  end
+
+  it "should work with to_proc'd Symbols" do
+    expect(MAP[[1, 2, 3], &:even?]).to eq [false, true, false]
+  end
+end
+
+describe 'MAP_BANG' do
+  let(:coll) { [1, 2, 3] }
+
+  it "should modify the original array" do
+    MAP_BANG[coll, &-> c { c * 2 }]
+    expect(coll).to eq [2, 4, 6]
+  end
+end
+
+describe 'REDUCE' do
+  it "should properly implement reduce as a top-level lambda" do
+    expect(REDUCE[[1, 2, 3, 4], &:+]).to be 10
+  end
+end
+
+describe 'FILTER' do
+  it "should properly filter elements from collections" do
+    expect(FILTER[[1, 2, 3, 4], &:even?]).to eq [2, 4]
+  end
+end

data/spec/math_spec.rb

@@ -0,0 +1,87 @@
+require 'spec_helper'
+
+include Church
+
+describe 'ADD' do
+  it "should work with an LHS of 0" do
+    expect(ADD[0, 2]).to be 2
+  end
+
+  it "should work with an RHS of 0" do
+    expect(ADD[3, 0]).to be 3
+  end
+
+  it "should work with a negative LHS" do
+    expect(ADD[-2, 4]).to be 2
+  end
+
+  it "should work with a negative RHS" do
+    expect(ADD[2, -4]).to be -2
+  end
+
+  it "should work with two negatives" do
+    expect(ADD[-2, -4]).to be -6
+  end
+end
+
+describe 'SUB' do
+  it "should work with an LHS of 0" do
+    expect(SUB[0, 2]).to be -2
+  end
+
+  it "should work with an RHS of 0" do
+    expect(SUB[3, 0]).to be 3
+  end
+
+  it "should work with a negative LHS" do
+    expect(SUB[-2, 4]).to be -6
+  end
+
+  it "should work with a negative RHS" do
+    expect(SUB[2, -4]).to be 6
+  end
+
+  it "should work with two negatives" do
+    expect(SUB[-2, -4]).to be 2
+  end
+end
+
+describe 'MUL' do
+  it "should work with an LHS of 0" do
+    expect(MUL[0, 2]).to be 0
+  end
+
+  it "should work with an RHS of 0" do
+    expect(MUL[3, 0]).to be 0
+  end
+
+  it "should work with a negative LHS" do
+    expect(MUL[-2, 4]).to be -8
+  end
+
+  it "should work with a negative RHS" do
+    expect(MUL[2, -4]).to be -8
+  end
+
+  it "should work with two negatives" do
+    expect(MUL[-2, -4]).to be 8
+  end
+end
+
+describe 'DIV' do
+  it "should work with an LHS of 0" do
+    expect(DIV[0, 2]).to be 0
+  end
+
+  it "should work with a negative RHS" do
+    expect(DIV[4, -2]).to be -2
+  end
+
+  it "should divide numbers into themselves once" do
+    expect(DIV[3, 3]).to be 1
+  end
+
+  it "should truncate" do
+    expect(DIV[3, 4]).to be 0
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1 @@
+require File.expand_path('../../lib/church', __FILE__)

metadata

@@ -0,0 +1,95 @@
+--- !ruby/object:Gem::Specification
+name: church
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+  prerelease: 
+platform: ruby
+authors:
+- Three If By Whiskey
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-03-17 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.5'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.5'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: 
+email:
+- 3ifbyw@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE
+- README.md
+- Rakefile
+- church.gemspec
+- lib/church.rb
+- lib/church/array.rb
+- lib/church/math.rb
+- lib/church/version.rb
+- spec/array_spec.rb
+- spec/math_spec.rb
+- spec/spec_helper.rb
+homepage: ''
+licenses:
+- WTFPL
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.23
+signing_key: 
+specification_version: 3
+summary: Church provides top-level constant Procs to do various and sundry kinds of
+  functional programming.
+test_files:
+- spec/array_spec.rb
+- spec/math_spec.rb
+- spec/spec_helper.rb