pattern-match 0.0.1

data/.gitignore

@@ -0,0 +1,4 @@
+.bundle
+Gemfile.lock
+pkg/*
+vendor/*

data/.travis.yml

@@ -0,0 +1,4 @@
+rvm:
+  - 1.9.2
+  - 1.9.3
+  - ruby-head

data/BSDL

@@ -0,0 +1,22 @@
+Copyright (C) 2012 Kazuki Tsujimoto, All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+notice, this list of conditions and the following disclaimer in the
+documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.

data/COPYING

@@ -0,0 +1,57 @@
+Copyright (C) 2012 Kazuki Tsujimoto, All rights reserved.
+
+You can redistribute it and/or modify it under either the terms of the
+2-clause BSDL (see the file BSDL), or the conditions below:
+
+  1. You may make and give away verbatim copies of the source form of the
+     software without restriction, provided that you duplicate all of the
+     original copyright notices and associated disclaimers.
+
+  2. You may modify your copy of the software in any way, provided that
+     you do at least ONE of the following:
+
+       a) place your modifications in the Public Domain or otherwise
+          make them Freely Available, such as by posting said
+	  modifications to Usenet or an equivalent medium, or by allowing
+	  the author to include your modifications in the software.
+
+       b) use the modified software only within your corporation or
+          organization.
+
+       c) give non-standard binaries non-standard names, with
+          instructions on where to get the original software distribution.
+
+       d) make other distribution arrangements with the author.
+
+  3. You may distribute the software in object code or binary form,
+     provided that you do at least ONE of the following:
+
+       a) distribute the binaries and library files of the software,
+	  together with instructions (in the manual page or equivalent)
+	  on where to get the original distribution.
+
+       b) accompany the distribution with the machine-readable source of
+	  the software.
+
+       c) give non-standard binaries non-standard names, with
+          instructions on where to get the original software distribution.
+
+       d) make other distribution arrangements with the author.
+
+  4. You may modify and include the part of the software into any other
+     software (possibly commercial).  But some files in the distribution
+     are not written by the author, so that they are not under these terms.
+
+     For the list of those files and their copying conditions, see the
+     file LEGAL.
+
+  5. The scripts and library files supplied as input to or produced as
+     output from the software do not automatically fall under the
+     copyright of the software, but belong to whomever generated them,
+     and may be sold commercially, and may be aggregated with this
+     software.
+
+  6. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
+     IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+     WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+     PURPOSE.

data/Gemfile

@@ -0,0 +1,3 @@
+source "http://rubygems.org"
+
+gemspec

data/README.rdoc

@@ -0,0 +1,28 @@
+= pattern-match
+== About
+A pattern matching library for Ruby.
+
+==  Installation
+ $ git clone git://github.com/k-tsj/pattern-match.git
+ $ cd pattern-match
+ $ gem build pattern-match.gemspec
+ $ gem install pattern-match-*.gem
+
+or
+
+ $ gem install bundler (if you need)
+ $ echo "gem 'pattern-match', :git => 'git://github.com/k-tsj/pattern-match.git'" > Gemfile
+ $ bundle install --path vendor/bundle
+
+== Example
+See test/test_pattern-match.rb.
+
+== Development
+ $ git clone git://github.com/k-tsj/pattern-match.git
+ $ cd pattern-match
+ $ gem install bundler (if you need)
+ $ bundle install --path vendor/bundle
+ $ rake test (or simply type "rake")
+ $ rake build
+
+== Travis Build Status {<img src="https://secure.travis-ci.org/k-tsj/pattern-match.png"/>}[http://travis-ci.org/k-tsj/pattern-match]

data/Rakefile

@@ -0,0 +1,10 @@
+ENV['BUNDLE_GEMFILE'] = File.expand_path('../Gemfile', __FILE__)
+require 'bundler/setup'
+require "bundler/gem_tasks"
+
+require "rake/testtask"
+task :default => :test
+Rake::TestTask.new do |t|
+  t.libs << "lib"
+  t.test_files = FileList["test/test_*.rb"]
+end

data/lib/pattern-match.rb

@@ -0,0 +1,480 @@
+# pattern-match.rb
+#
+# Copyright (C) 2012 Kazuki Tsujimoto, All rights reserved.
+
+require 'pattern-match/version'
+
+module PatternMatch
+  if Module.private_method_defined? :refine
+    SUPPORT_REFINEMENTS = true
+  else
+    SUPPORT_REFINEMENTS = false
+    Module.module_eval {
+      private
+
+      def refine(klass, &block)
+        klass.class_eval(&block)
+      end
+
+      def using(klass)
+      end
+    }
+  end
+
+  module Extractable
+    def call(*subpatterns)
+      if Object == self
+        raise MalformedPatternError unless subpatterns.length == 1
+        PatternObject.new(subpatterns[0])
+      else
+        PatternExtractor.new(self, *subpatterns)
+      end
+    end
+
+    if SUPPORT_REFINEMENTS
+      alias [] call
+    end
+  end
+
+  module NameSpace
+    refine Class do
+      include Extractable
+
+      private
+
+      def accept_self_instance_only(val)
+        raise PatternNotMatch unless val.is_a?(self)
+      end
+    end
+
+    refine Array.singleton_class do
+      def extract(val)
+        accept_self_instance_only(val)
+        val
+      end
+    end
+
+    refine Struct.singleton_class do
+      def extract(val)
+        accept_self_instance_only(val)
+        val.values
+      end
+    end
+
+    if SUPPORT_REFINEMENTS
+      def Struct.method_added(name)
+        if name == members[0]
+          this = self
+          PatternMatch::NameSpace.module_eval {
+            refine this.singleton_class do
+              include Extractable
+            end
+          }
+        end
+      end
+
+      refine Proc do
+        include Extractable
+
+        def extract(val)
+          [self === val]
+        end
+      end
+
+      refine Symbol do
+        include Extractable
+
+        def extract(val)
+          [self.to_proc === val]
+        end
+      end
+    end
+
+    refine Symbol do
+      def call(*args)
+        Proc.new {|obj| obj.send(self, *args) }
+      end
+    end
+
+    refine Regexp do
+      include Extractable
+
+      def extract(val)
+        m = Regexp.new("\\A#{source}\\z", options).match(val.to_s)
+        raise PatternNotMatch unless m
+        m.captures.empty? ? [m[0]] : m.captures
+      end
+    end
+  end
+
+  class Pattern
+    attr_accessor :parent, :next, :prev
+    attr_writer :pattern_match_env
+
+    def initialize(*subpatterns)
+      @parent = nil
+      @next = nil
+      @prev = nil
+      @pattern_match_env = nil
+      @subpatterns = subpatterns.map {|i| i.is_a?(Pattern) ? i : PatternValue.new(i) }
+      set_subpatterns_relation
+    end
+
+    def vars
+      @subpatterns.map(&:vars).inject([], :concat)
+    end
+
+    def binding
+      vars.each_with_object({}) {|v, h| h[v.name] = v.val }
+    end
+
+    def &(pattern)
+      PatternAnd.new(self, pattern)
+    end
+
+    def |(pattern)
+      PatternOr.new(self, pattern)
+    end
+
+    def !@
+      PatternNot.new(self)
+    end
+
+    def to_a
+      [self, PatternQuantifier.new(0)]
+    end
+
+    def quantified?
+      @next.is_a?(PatternQuantifier) || (root? ? false : @parent.quantified?)
+    end
+
+    def root?
+      @parent == nil
+    end
+
+    def validate
+      if root?
+        dup_vars = vars - vars.uniq {|i| i.name }
+        raise MalformedPatternError, "duplicate variables: #{dup_vars.map(&:name).join(', ')}" unless dup_vars.empty?
+      end
+      raise MalformedPatternError if @subpatterns.count {|i| i.is_a?(PatternQuantifier) } > 1
+      @subpatterns.each(&:validate)
+    end
+
+    def pattern_match_env
+      @pattern_match_env || @parent.pattern_match_env
+    end
+
+    private
+
+    def set_subpatterns_relation
+      @subpatterns.each do |i|
+        i.parent = self
+      end
+      @subpatterns.each_cons(2) do |a, b|
+        a.next = b
+        b.prev = a
+      end
+    end
+
+    def ancestors
+      ary = []
+      pat = self
+      until pat == nil
+        ary << pat
+        pat = pat.parent
+      end
+      ary
+    end
+  end
+
+  class PatternObject < Pattern
+    def initialize(spec)
+      raise MalformedPatternError unless spec.is_a?(Hash)
+      super(*spec.values)
+      @spec = spec.map {|k, pat| [k.to_proc, pat] }
+    rescue
+      raise MalformedPatternError
+    end
+
+    def match(val)
+      @spec.all? {|k, pat| pat.match(k.(val)) rescue raise PatternNotMatch }
+    end
+  end
+
+  class PatternExtractor < Pattern
+    def initialize(extractor, *subpatterns)
+      super(*subpatterns)
+      @extractor = extractor
+    end
+
+    def match(val)
+      extracted_vals = pattern_match_env.call_refined_method(@extractor, :extract, val)
+      k = extracted_vals.length - (@subpatterns.length - 2)
+      quantifier = @subpatterns.find {|i| i.is_a?(PatternQuantifier) }
+      if quantifier
+        return false unless quantifier.min_k <= k
+      else
+        return false unless @subpatterns.length == extracted_vals.length
+      end
+      @subpatterns.flat_map do |pat|
+        case
+        when pat.next.is_a?(PatternQuantifier)
+          []
+        when pat.is_a?(PatternQuantifier)
+          pat.prev.vars.each {|v| v.set_bind_to(pat) }
+          Array.new(k, pat.prev)
+        else
+          [pat]
+        end
+      end.zip(extracted_vals).all? do |pat, v|
+        pat.match(v)
+      end
+    end
+  end
+
+  class PatternQuantifier < Pattern
+    attr_reader :min_k
+
+    def initialize(min_k)
+      super()
+      @min_k = min_k
+    end
+
+    def match(val)
+      raise PatternMatchError, 'must not happen'
+    end
+
+    def validate
+      super
+      raise MalformedPatternError unless @prev
+      raise MalformedPatternError unless @parent.is_a?(PatternExtractor)
+    end
+  end
+
+  class PatternVariable < Pattern
+    attr_reader :name, :val
+
+    def initialize(name)
+      super()
+      @name = name
+      @val = nil
+      @bind_to = nil
+    end
+
+    def match(val)
+      bind(val)
+      true
+    end
+
+    def vars
+      [self]
+    end
+
+    def set_bind_to(quantifier)
+      if @val
+        outer = @val
+        (nest_level(quantifier) - 1).times do
+          outer = outer[-1]
+        end
+        @bind_to = []
+        outer << @bind_to
+      else
+        @val = @bind_to = []
+      end
+    end
+
+    private
+
+    def bind(val)
+      if quantified?
+        @bind_to << val
+      else
+        @val = val
+      end
+    end
+
+    def nest_level(quantifier)
+      qs = ancestors.map {|i| i.next.is_a?(PatternQuantifier) ? i.next : nil }.find_all {|i| i }.reverse
+      qs.index(quantifier) || (raise PatternMatchError)
+    end
+  end
+
+  class PatternValue < Pattern
+    def initialize(val)
+      super()
+      @val = val
+    end
+
+    def match(val)
+      @val === val
+    end
+  end
+
+  class PatternAnd < Pattern
+    def match(val)
+      @subpatterns.all? {|i| i.match(val) }
+    end
+  end
+
+  class PatternOr < Pattern
+    def match(val)
+      @subpatterns.find do |i|
+        begin
+          i.match(val)
+        rescue PatternNotMatch
+          false
+        end
+      end
+    end
+
+    def validate
+      super
+      raise MalformedPatternError unless vars.length == 0
+    end
+  end
+
+  class PatternNot < Pattern
+    def initialize(subpattern)
+      super
+    end
+
+    def match(val)
+      ! @subpatterns[0].match(val)
+    rescue PatternNotMatch
+      true
+    end
+
+    def validate
+      super
+      raise MalformedPatternError unless vars.length == 0
+    end
+  end
+
+  class Env < BasicObject
+    attr_reader :ret
+
+    def initialize(ctx, val)
+      @ctx = ctx
+      @val = val
+      @matched = false
+      @ret = nil
+    end
+
+    private
+
+    def with(pat_or_val, guard_proc = nil, &block)
+      pat = pat_or_val.is_a?(Pattern) ? pat_or_val : PatternValue.new(pat_or_val)
+      pat.validate
+      pat.pattern_match_env = self
+      if (! @matched) and pat.match(@val) and (guard_proc ? with_tmpbinding(@ctx, pat.binding, &guard_proc) : true)
+        @matched = true
+        @ret = with_tmpbinding(@ctx, pat.binding, &block)
+      end
+    rescue PatternNotMatch
+    end
+
+    def guard(&block)
+      block
+    end
+
+    def method_missing(name, *)
+      case name.to_s
+      when '___'
+        PatternQuantifier.new(0)
+      when /\A__(\d+)\z/
+        PatternQuantifier.new($1.to_i)
+      else
+        PatternVariable.new(name)
+      end
+    end
+
+    def _(*vals)
+      case vals.length
+      when 0
+        uscore = PatternVariable.new(:_)
+        uscore.pattern_match_env = self
+        class << uscore
+          def [](*args)
+            pattern_match_env.call_refined_method(::Array, :call, *args)
+          end
+
+          def match(val)
+            true
+          end
+
+          def vars
+            []
+          end
+        end
+        uscore
+      when 1
+        PatternValue.new(vals[0])
+      else
+        raise MalformedPatternError
+      end
+    end
+
+    alias __ _
+    alias _l _
+
+    def with_tmpbinding(obj, binding, &block)
+      tmpbinding_module(obj).instance_eval do
+        begin
+          binding.each do |name, val|
+            define_method(name) { val }
+            private name
+          end
+          obj.instance_eval(&block)
+        ensure
+          binding.each do |name, _|
+            remove_method(name) if private_method_defined? name
+          end
+        end
+      end
+    end
+
+    class TmpBindingModule < ::Module
+    end
+
+    def tmpbinding_module(obj)
+      m = obj.singleton_class.ancestors.find {|i| i.is_a? TmpBindingModule }
+      unless m
+        m = TmpBindingModule.new
+        obj.extend(m)
+      end
+      m
+    end
+  end
+
+  class PatternNotMatch < Exception; end
+  class PatternMatchError < StandardError; end
+  class MalformedPatternError < PatternMatchError; end
+end
+
+module Kernel
+  private
+
+  def match(*vals, &block)
+    do_match = Proc.new do |val|
+      env = PatternMatch::Env.new(self, val)
+      class << env
+        using ::PatternMatch::NameSpace
+
+        def call_refined_method(obj, name, *args)
+          obj.send(name, *args)
+        end
+      end
+      env.instance_eval(&block)
+      env.ret
+    end
+    case vals.length
+    when 0
+      do_match
+    when 1
+      do_match.(vals[0])
+    else
+      raise ArgumentError, "wrong number of arguments (#{vals.length} for 0..1)"
+    end
+  end
+end

data/lib/pattern-match/version.rb

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

data/pattern-match.gemspec

@@ -0,0 +1,22 @@
+$:.push File.expand_path('../lib', __FILE__)
+require 'pattern-match/version'
+
+Gem::Specification.new do |s|
+  s.name        = 'pattern-match'
+  s.version     = PatternMatch::VERSION
+  s.authors     = ['Kazuki Tsujimoto']
+  s.email       = ['kazuki@callcc.net']
+  s.homepage    = 'https://github.com/k-tsj/pattern-match'
+  s.summary     = %q{A pattern matching library}
+  s.description = %w{
+    A pattern matching library.
+  }.join(' ')
+
+  s.files            = `git ls-files`.split("\n")
+  s.test_files       = `git ls-files -- {test,spec,features}/*`.split("\n")
+  s.executables      = `git ls-files -- bin/*`.split("\n").map{|f| File.basename(f) }
+  s.require_paths    = ['lib']
+  s.add_development_dependency 'rake'
+  s.extra_rdoc_files = ['README.rdoc']
+  s.rdoc_options     = ['--main', 'README.rdoc']
+end

data/test/test_pattern-match.rb

@@ -0,0 +1,376 @@
+require 'test/unit'
+require_relative '../lib/pattern-match'
+
+class TestPatternMatch < Test::Unit::TestCase
+  def test_basic
+    this = self
+    ret = match([0, 1, 2, 3]) {
+      with(nil) { flunk }
+      with(_[a, Fixnum , 2, b]) {
+        assert_equal(this, self)
+        assert_equal(0, a)
+        assert_equal(3, b)
+        4
+      }
+      with(_) { flunk }
+    }
+    assert_equal(4, ret)
+    assert_raise(NameError) { a }
+    assert_raise(NameError) { b }
+
+    ret = match(0) {
+      with(1) { flunk }
+      with(2) { flunk }
+    }
+    assert_nil(ret)
+
+    match(0) {
+      with(i, guard { i.odd? }) { flunk }
+      with(i, guard { i.even? }) { pass }
+      with(_) { flunk }
+    }
+
+    assert_raise(PatternMatch::MalformedPatternError) {
+      match(0) {
+        with(_[a, a]) {}
+      }
+    }
+  end
+
+  def test_variable_shadowing
+    skip 'not implemented yet'
+    match(0) {
+      with(a) {
+        match(1) {
+          with(a) {
+            assert_equal(1, a)
+          }
+        }
+        assert_equal(0, a)
+      }
+    }
+  end
+
+  def test_uscore
+    match([0, 1]) {
+      with(_[_, ! _(Float)]) {
+        assert_raise(NameError) { _ }
+      }
+      with(_) { flunk }
+    }
+  end
+
+  def test_splat
+    match([0, 1, 2]) {
+      with(_[a, *b]) {
+        assert_equal(0, a)
+        assert_equal([1, 2], b)
+      }
+      with(_) { flunk }
+    }
+
+    match([0, 1]) {
+      with(_[a, *b, c]) {
+        assert_equal(0, a)
+        assert_equal([], b)
+        assert_equal(1, c)
+      }
+      with(_) { flunk }
+    }
+
+    match([0, 1, 2]) {
+      with(_[a, *b, c]) {
+        assert_equal(0, a)
+        assert_equal([1], b)
+        assert_equal(2, c)
+      }
+      with(_) { flunk }
+    }
+
+    match([[0], [1], [2]]) {
+      with(_[*_[a]]) {
+        assert_equal([0, 1, 2], a)
+      }
+      with(_) { flunk }
+    }
+
+    assert_raise(PatternMatch::MalformedPatternError) {
+      match(0) {
+        with(_[*a, *b]) {}
+      }
+    }
+  end
+
+  def test_quantifier
+    match([0]) {
+      with(_[a, _[b, c], ___]) {
+        assert_equal(0, a)
+        assert_equal([], b)
+        assert_equal([], c)
+      }
+      with(_) { flunk }
+    }
+
+    match([0, [1, 2], [3, 4]]) {
+      with(_[a, _[b, c], ___]) {
+        assert_equal(0, a)
+        assert_equal([1, 3], b)
+        assert_equal([2, 4], c)
+      }
+      with(_) { flunk }
+    }
+
+    match([0, [1, 2], [3, 4]]) {
+      with(_[a, _[b, c], ___, d]) {
+        assert_equal(0, a)
+        assert_equal([1], b)
+        assert_equal([2], c)
+        assert_equal([3, 4], d)
+      }
+      with(_) { flunk }
+    }
+
+    match([0, [1, 2], [3, 4]]) {
+      with(_[a, _[b, c], __3]) { flunk }
+      with(_[a, _[b, c], __2]) {
+        assert_equal(0, a)
+        assert_equal([1, 3], b)
+        assert_equal([2, 4], c)
+      }
+      with(_) { flunk }
+    }
+
+    match([0, [1, 2], [3, 4]]) {
+      with(_[a, _[b, ___], ___]) {
+        assert_equal(0, a)
+        assert_equal([[1, 2], [3, 4]], b)
+      }
+      with(_) { flunk }
+    }
+
+    match([[0, [1, 2], [3, 4]], [5, [6, 7], [8, 9]], [10, [11, 12], [13, 14]]]) {
+      with(_[_[a, _[b, ___], ___], ___]) {
+        assert_equal([0, 5, 10], a)
+        assert_equal([[[1, 2], [3, 4]], [[6, 7], [8, 9]], [[11, 12], [13, 14]]], b)
+      }
+      with(_) { flunk }
+    }
+
+    assert_raise(PatternMatch::MalformedPatternError) {
+      match(0) {
+        with(_[___]) {}
+      }
+    }
+
+    assert_raise(PatternMatch::MalformedPatternError) {
+      match(0) {
+        with(_[_[___]]) {}
+      }
+    }
+
+    assert_raise(PatternMatch::MalformedPatternError) {
+      match(0) {
+        with(_[a, ___, ___]) {}
+      }
+    }
+
+    assert_raise(PatternMatch::MalformedPatternError) {
+      match(0) {
+        with(_[a, ___, *b]) {}
+      }
+    }
+  end
+
+  def test_and_or_not
+    match(1) {
+      with(_(0) & _(1)) { flunk }
+      with(_) { pass }
+    }
+
+    match(1) {
+      with(_(0) | _(1)) { pass }
+      with(_) { flunk }
+    }
+
+    match(1) {
+      with(_[] | _(1)) { pass }
+      with(_) { flunk }
+    }
+
+    match(1) {
+      with(! _(0)) { pass }
+      with(_) { flunk }
+    }
+
+    match(1) {
+      with(! _[]) { pass }
+      with(_) { flunk }
+    }
+
+    match(1) {
+      with(a & b) {
+        assert_equal(1, a)
+        assert_equal(1, b)
+      }
+      with(_) { flunk }
+    }
+
+    match(1) {
+      with(_(0) | _(1)) { pass }
+      with(_) { flunk }
+    }
+
+    assert_raise(PatternMatch::MalformedPatternError) {
+      match(1) {
+        with(a | b) {}
+      }
+    }
+
+    match(1) {
+      with(! _(0)) { pass }
+      with(_) { flunk }
+    }
+
+    assert_raise(PatternMatch::MalformedPatternError) {
+      match(1) {
+        with(! a) {}
+      }
+    }
+
+    assert_raise(PatternMatch::MalformedPatternError) {
+      match(1) {
+        with(a | ___) {}
+      }
+    }
+
+    assert_raise(PatternMatch::MalformedPatternError) {
+      match(1) {
+        with(a & ___) {}
+      }
+    }
+  end
+
+  def test_match_without_argument
+    assert_equal(1, 2.times.find(&match { with(1) { true } }))
+  end
+
+  def test_extractor_class_struct
+    s = Struct.new(:a, :b, :c)
+    match(s[0, 1, 2]) {
+      with(s.(a, b, c)) {
+        assert_equal(0, a)
+        assert_equal(1, b)
+        assert_equal(2, c)
+      }
+      with(_) { flunk }
+    }
+  end
+
+  def test_extractor_struct_with_refinements
+    skip 'refinements not supported' unless PatternMatch::SUPPORT_REFINEMENTS
+    s = Struct.new(:a, :b, :c)
+    match(s[0, 1, 2]) {
+      with(s[a, b, c]) {
+        assert_equal(0, a)
+        assert_equal(1, b)
+        assert_equal(2, c)
+      }
+      with(_) { flunk }
+    }
+  end
+
+  def test_extractor_obj_regexp
+    match('abc') {
+      with(/./.(a)) { flunk }
+      with(a & /.../.(b)) {
+        assert_equal('abc', a)
+        assert_equal('abc', b)
+      }
+      with(_) { flunk }
+    }
+
+    match('abc') {
+      with(a & /(.)(.)(.)/.(b, c ,d)) {
+        assert_equal('abc', a)
+        assert_equal('a', b)
+        assert_equal('b', c)
+        assert_equal('c', d)
+      }
+      with(_) { flunk }
+    }
+  end
+
+  def test_extractor_obj_regexp_with_refinements
+    skip 'refinements not supported' unless PatternMatch::SUPPORT_REFINEMENTS
+    match('abc') {
+      with(/./[a]) { flunk }
+      with(a & /.../[b]) {
+        assert_equal('abc', a)
+        assert_equal('abc', b)
+      }
+      with(_) { flunk }
+    }
+
+    match('abc') {
+      with(a & /(.)(.)(.)/[b, c ,d]) {
+        assert_equal('abc', a)
+        assert_equal('a', b)
+        assert_equal('b', c)
+        assert_equal('c', d)
+      }
+      with(_) { flunk }
+    }
+  end
+
+  def test_extractor_obj_proc_with_refinements
+    skip 'refinements not supported' unless PatternMatch::SUPPORT_REFINEMENTS
+    match(0) {
+      with((Proc.new {|i| i + 1 })[a]) {
+        assert_equal(1, a)
+      }
+      with(_) { flunk }
+    }
+  end
+
+  def test_extractor_obj_symbol_with_refinements
+    skip 'refinements not supported' unless PatternMatch::SUPPORT_REFINEMENTS
+    match(0) {
+      with(:to_s[a]) {
+        assert_equal('0', a)
+      }
+      with(_) { flunk }
+    }
+  end
+
+  def test_object
+    match(10) {
+      with(Object.(:to_i => a, :to_s.(16) => b, :no_method => c)) { flunk }
+      with(Object.(:to_i => a, :to_s.(16) => b)) {
+        assert_equal(10, a)
+        assert_equal('a', b)
+      }
+      with(_) { flunk }
+    }
+
+    assert_raise(PatternMatch::MalformedPatternError) {
+      match(10) {
+        with(Object.(a, b)) {}
+      }
+    }
+  end
+
+  def test_refine_after_requiring_library
+    c = Class.new
+    ::PatternMatch::NameSpace.module_eval {
+      refine c.singleton_class do
+        def extract(*)
+          [:c]
+        end
+      end
+    }
+    match(:c) {
+      with(c.(a)) { assert_equal(:c, a) }
+      with(_) { flunk }
+    }
+  end
+end

metadata

@@ -0,0 +1,76 @@
+--- !ruby/object:Gem::Specification
+name: pattern-match
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+  prerelease: 
+platform: ruby
+authors:
+- Kazuki Tsujimoto
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-03-03 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: &8351800 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: *8351800
+description: A pattern matching library.
+email:
+- kazuki@callcc.net
+executables: []
+extensions: []
+extra_rdoc_files:
+- README.rdoc
+files:
+- .gitignore
+- .travis.yml
+- BSDL
+- COPYING
+- Gemfile
+- README.rdoc
+- Rakefile
+- lib/pattern-match.rb
+- lib/pattern-match/version.rb
+- pattern-match.gemspec
+- test/test_pattern-match.rb
+homepage: https://github.com/k-tsj/pattern-match
+licenses: []
+post_install_message: 
+rdoc_options:
+- --main
+- README.rdoc
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
+      - 0
+      hash: 2652740272817572795
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
+      - 0
+      hash: 2652740272817572795
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.11
+signing_key: 
+specification_version: 3
+summary: A pattern matching library
+test_files: []