pattern-proc 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 570c658ac139da0ade4f67576ec391963253c432
+  data.tar.gz: c59c291c8cc567c685fe42c907c79eecee31f985
+SHA512:
+  metadata.gz: f767b258e7adb44cc7c114dcc5f139dc560ea1554fc60cdc2d3eb1f9bc8dba25e1069b0601071df0ce7b0c7b3e21ebb4a809728a03f8106058e61066062f0369
+  data.tar.gz: fab0de65a0e2215f50119a4bae8883b8c4ff14f97392a8af839066314c18e3a1eb5a492aa68b1880fe5ab01ce44e3ec6d2bbd667bb6b391fe71bbec279003225

data/LICENSE

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014 William Pleasant-Ryan
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/README.md

@@ -0,0 +1,4 @@
+pattern-proc
+============
+
+pattern matching Proc definitions

data/lib/pattern_proc.rb

@@ -0,0 +1,146 @@
+class PatternProc
+
+  def initialize(cases = [])
+    @arity = -1
+    @cases = []
+    cases.each do |c| add_case c end
+  end
+
+  def with(*args, &block)
+    case_obj = PatternProcCase.new(args, &block)
+    add_case case_obj
+    case_obj
+  end
+
+  def to_proc
+    ->(*args) { call(args) }
+  end
+
+  private
+  def add_case(case_obj)
+    if @arity == -1
+      @arity = case_obj.arity
+    elsif @arity != case_obj.arity
+      raise "mismatched arity"
+    end
+    @cases << case_obj
+  end
+
+
+  def call(args)
+    if args.size == @arity
+      best_match = find_matches(args, true).first
+      if best_match
+        best_match.to_proc.call(args)
+      else
+        raise "no match"
+      end
+    elsif args.size < @arity
+      sliced_cases = find_matches(args, false)
+      if sliced_cases.size > 0
+        PatternProc.new(sliced_cases).to_proc
+      else
+        raise "no match"
+      end
+    else
+      raise "too many args"
+    end
+  end
+
+  def find_matches(args, stop_at_first_match)
+    results = []
+    sorted_cases = @cases.sort do |case_obj_1, case_obj_2|
+      case_obj_1.specificity <=> case_obj_2.specificity
+    end.reverse
+    sorted_cases.each do |case_obj|
+      result = case_obj.make_subcase(args)
+      if result
+        results << result
+        if stop_at_first_match
+          break
+        end
+      end
+    end
+    results
+  end
+end
+
+class PatternProcCase
+
+  attr_reader :proc_applied_level
+  attr_reader :proc_arity
+
+  def initialize(args, previous_specificity = 0, proc_arity = 0, &block)
+    @expected_args = args
+    @proc = block
+    @proc_arity = proc_arity
+    @previous_specificity = previous_specificity || 0
+    if block.present? && block.arity > 0
+      @proc_arity = block.arity
+    end
+  end
+
+  def returns(value)
+    @return_value = value
+    self
+  end
+
+  # private ish
+  def expected_arity
+    @expected_args.size || 0
+  end
+
+  def arity
+    expected_arity + proc_arity
+  end
+
+  def specificity
+    expected_arity + @previous_specificity
+  end
+
+  def make_subcase(args)
+    match_len = [args.size, @expected_args.size].min
+    expected = @expected_args.take(match_len)
+    actual = args.take(match_len)
+    if expected == actual
+      new_proc = to_proc.curry
+      curry_count = args.size - @expected_args.size
+      new_arity = proc_arity
+      if curry_count > 0
+        send_args = args.drop(match_len).take(curry_count)
+        new_proc = new_proc.call(*send_args)
+        new_arity -= curry_count
+        if new_arity == 0
+          return PatternProcCase.new([], specificity).returns(new_proc)
+        elsif !(new_proc.is_a?(Proc))
+          raise "uh oh"
+        end
+      end
+      PatternProcCase.new(@expected_args.drop(match_len), specificity, new_arity, &new_proc).returns(@return_value)
+    else
+      nil
+    end
+  end
+
+  def to_proc
+    @proc || ->(*args) { @return_value }
+  end
+end
+
+class Object
+  def partials(method)
+    @__partials ||= {}
+    unless @__partials[method] 
+      proc_obj = ComposableProc.new
+      metaclass = class << self; self; end
+      metaclass.class_eval do
+        define_method(method) do |*args|
+          curried_method = proc_obj.to_proc.curry
+          curried_method[*args]
+        end
+      end
+      @__partials[method] = proc_obj
+    end
+    @__partials[method]
+  end
+end

data/pattern-proc.gemspec

@@ -0,0 +1,14 @@
+Gem::Specification.new do |s|
+  s.name        = 'pattern-proc'
+  s.version     = '0.0.1'
+  s.date        = '2014-07-01'
+  s.summary     = 'Pattern Proc'
+  s.description = 'define a Proc with pattern matching "re-declaration" ala Haskell'
+  s.authors     = ['William Pleasant-Ryan']
+  s.email       = ['krelian18@gmail.com']
+  s.files       = `git ls-files`.split("\n")
+  s.files.delete(".gitignore")
+  s.homepage    = "http://rubygems.org/gems/pattern-proc"
+  s.license     = "MIT"
+end
+

data/spec/pattern_proc_spec.rb

@@ -0,0 +1,54 @@
+describe PatternProc do
+  subject { described_class.new }
+
+  it "simple" do
+    subject.with(3,4).returns(12)
+
+    prc = subject.to_proc
+    prc.(3,4).should == 12
+    prc.(3).(4).should == 12
+  end
+
+  it "works" do
+    subject.with(3,1,2).returns(12)
+    subject.with(4,4,1).returns(10)
+    subject.with(7,7,7).returns(777)
+    subject.with(7,7) do |l_arg|
+      140 + l_arg
+    end
+    subject.with(7,3,4).returns(11)
+    subject.with(2) do |x, y| 2 * x * y end
+    subject.with do |x, y, z| 
+      x * (y + z) 
+    end
+
+    prc = subject.to_proc
+
+    prc.(3,1,2).should == 12
+    prc.(3).(1,2).should == 12
+    prc.(3).(1).(2).should == 12
+    prc.(3,1).(2).should == 12
+
+    prc.(4,4,1).should == 10
+    prc.(4,4,2).should == 24
+    prc.(4,4).(2).should == 24
+    prc.(4).(4,2).should == 24
+
+    prc.(7,7,7).should == 777
+    prc.(7).(7).(7).should == 777
+    prc.(7).(7,7).should == 777
+
+    prc.(7,7,3).should == 143
+    prc.(7).(7,3).should == 143
+    prc.(7,7).(3).should == 143
+    prc.(7).(7).(3).should == 143
+
+    prc.(2,1,1).should == 2
+    prc.(2,3).(8).should == 48
+
+    prc.(5,6,7).should == 65
+    prc.(5).(6,7).should == 65
+    prc.(5).(6).(7).should == 65
+    prc.(5,6).(7).should == 65
+  end
+end

metadata

@@ -0,0 +1,49 @@
+--- !ruby/object:Gem::Specification
+name: pattern-proc
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- William Pleasant-Ryan
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-07-01 00:00:00.000000000 Z
+dependencies: []
+description: define a Proc with pattern matching "re-declaration" ala Haskell
+email:
+- krelian18@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- LICENSE
+- README.md
+- lib/pattern_proc.rb
+- pattern-proc.gemspec
+- spec/pattern_proc_spec.rb
+homepage: http://rubygems.org/gems/pattern-proc
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.2
+signing_key: 
+specification_version: 4
+summary: Pattern Proc
+test_files: []