reg 0.4.8 → 0.5.0a0

data/test/test_all.rb

@@ -0,0 +1,32 @@
+=begin copyright
+    reg - the ruby extended grammar
+    Copyright (C) 2016  Caleb Clausen
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2.1 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+=end
+$:.push File.expand_path(__FILE__+"/../..") 
+require 'test/test_reg'
+require 'test/regitem_thattest'
+$:.pop
+
+class Array
+
+  alias to_s_without_warn to_s
+
+  def to_s
+    warn "calling Array#to_s from #{caller[0]}; but semantics have changed in 1.9"
+    to_s_without_warn
+  end
+end

data/test/test_reg.rb

@@ -0,0 +1,19 @@
+=begin copyright
+    reg - the ruby extended grammar
+    Copyright (C) 2016  Caleb Clausen
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2.1 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+=end
+require 'test/regtest'

metadata

@@ -1,95 +1,130 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: reg
-version: !ruby/object:Gem::Version 
-  version: 0.4.8
+version: !ruby/object:Gem::Version
+  version: 0.5.0a0
 platform: ruby
-authors: 
+authors:
 - Caleb Clausen
 autorequire: 
 bindir: bin
 cert_chain: []
-
-date: 2010-01-03 00:00:00 -08:00
-default_executable: 
-dependencies: 
-- !ruby/object:Gem::Dependency 
+date: 2016-07-06 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
   name: sequence
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.2.4
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.2.4
+- !ruby/object:Gem::Dependency
+  name: Ron
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.1.2
   type: :runtime
-  version_requirement: 
-  version_requirements: !ruby/object:Gem::Requirement 
-    requirements: 
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
     - - ">="
-      - !ruby/object:Gem::Version 
-        version: 0.2.3
-    version: 
-description: 
-email: caleb @at@ inforadical.net
+      - !ruby/object:Gem::Version
+        version: 0.1.2
+description: "Reg is a library for pattern matching in ruby data structures. Reg provides
+  \nRegexp-like match and match-and-replace for all data structures (particularly\nArrays,
+  Objects, and Hashes), not just Strings.  \n\nReg is best thought of in analogy to
+  regular expressions; Regexps are special\ndata structures for matching Strings;
+  Regs are special data structures for\nmatching ANY type of ruby data (Strings included,
+  using Regexps). \n\n"
+email: caleb (at) inforadical (dot) net
 executables: []
-
 extensions: []
-
-extra_rdoc_files: []
-
-files: 
-- item_thattest.rb
-- regbackref.rb
-- regknows.rb
-- regtest.rb
-- numberset.rb
-- regbind.rb
-- reglogic.rb
-- regvar.rb
+extra_rdoc_files:
+- README
 - COPYING
-- parser.txt
-- regcase.rb
-- reglookab.rb
+files:
+- COPYING
+- History.txt
+- Makefile
 - README
-- regcore.rb
-- regold.rb
-- reg.gemspec
-- reggrid.csv
-- assert.rb
+- article.txt
+- lib/assert.rb
+- lib/reg.rb
+- lib/reg/version.rb
+- lib/regarray.rb
+- lib/regarrayold.rb
+- lib/regbackref.rb
+- lib/regbind.rb
+- lib/regcase.rb
+- lib/regcompiler.rb
+- lib/regcore.rb
+- lib/regdeferred.rb
+- lib/regevent.rb
+- lib/reggraphpoint.rb
+- lib/reghash.rb
+- lib/reginstrumentation.rb
+- lib/regitem_that.rb
+- lib/regknows.rb
+- lib/reglogic.rb
+- lib/reglookab.rb
+- lib/regmatchset.rb
+- lib/regold.rb
+- lib/regpath.rb
+- lib/regposition.rb
+- lib/regprogress.rb
+- lib/regrepeat.rb
+- lib/regreplace.rb
+- lib/regslicing.rb
+- lib/regsubseq.rb
+- lib/regsugar.rb
+- lib/regvar.rb
+- lib/regxform.rb
+- lib/trace_during.rb
+- lib/warning.rb
+- parser.txt
 - philosophy.txt
-- regdeferred.rb
-- regpath.rb
-- regposition.rb
-- trace.rb
-- calc.reg
-- reg.rb
+- reg.gemspec
 - regguide.txt
-- regprogress.rb
-- reghash.rb
-- regreplace.rb
-- forward_to.rb
-- regarray.rb
-- regarrayold.rb
-- regitem_that.rb
-- regsugar.rb
-has_rdoc: false
+- test/andtest.rb
+- test/regcompiler_test.rb
+- test/regdemo.rb
+- test/regitem_thattest.rb
+- test/regtest.rb
+- test/test_all.rb
+- test/test_reg.rb
 homepage: http://github.com/coatl/reg
+licenses:
+- LGPL-2.1
+metadata: {}
 post_install_message: 
-rdoc_options: []
-
-require_paths: 
-- .
-required_ruby_version: !ruby/object:Gem::Requirement 
-  requirements: 
+rdoc_options:
+- "--main"
+- README
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
   - - ">="
-    - !ruby/object:Gem::Version 
-      version: "0"
-  version: 
-required_rubygems_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"
-  version: 
-requirements: 
-- none
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
 rubyforge_project: reg
-rubygems_version: 1.3.1
+rubygems_version: 2.5.1
 signing_key: 
 specification_version: 2
-summary: The reg pattern matching/replacement language
-test_files: []
-
+summary: Reg is a library for pattern matching in ruby data structures.
+test_files:
+- test/test_all.rb

data/calc.reg

@@ -1,73 +0,0 @@
-=begin copyright
-    reg - the ruby extended grammar
-    Copyright (C) 2005  Caleb Clausen
-
-    This library is free software; you can redistribute it and/or
-    modify it under the terms of the GNU Lesser General Public
-    License as published by the Free Software Foundation; either
-    version 2.1 of the License, or (at your option) any later version.
-
-    This library is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-    Lesser General Public License for more details.
-
-    You should have received a copy of the GNU Lesser General Public
-    License along with this library; if not, write to the Free Software
-    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
-=end
-require 'reg'
-
-#warning: this code is untested
-#currently, it will not work because it depends on 
-#features of reg which do not exist (backreferences and substitutions). in addition,
-#it is likely to contain serious bugs, as it has
-#not been thoroughly tested or assured in any way.
-#nevertheless, it should give you a good idea of
-#how this sort of thing works.
-
-
-precedence={
-  :'('=>10, :p=>10,
-  :* =>9, :/ =>9,
-  :+ =>8, :- =>8,
-  :'='=>7,
-  :';'=>6
-}
-name=String.reg
-exp=name|PrintExp|OpExp|AssignExp|Number    #definitions of the expression classes ommitted for brevity
-leftop=/^[*\/;+-]$/
-rightop=/^=$/
-op=leftop|rightop
-def lowerop opname
-  regproc{
-    leftop & proceq(Symbol) {|v| precedence[opname] >= precedence[v] }
-  }
-end
-
-#last element is always lookahead
-Reduce=
-  -[ -[:p, '(', exp, ')'].sub {PrintExp.new BR[2]},  OB ] |                # p(exp)
-  -[ -['(', exp, ')']    .sub {BR[1]},               OB ] |                # (exp)
-  -[ -[exp, leftop, exp] .sub {OpExp.new *BR[0..2]}, lowerop(BR[1]) ] |    # exp+exp
-  -[ exp, -[';']         .sub [],                    :EOI ] |              #elide final trailing ;
-  -[ -[name, '=', exp]   .sub {AssignExp.new BR[0],BR[2]}, lowerop('=') ]  #name=exp
-
-#last element of stack is always lookahead
-def reduceloop(stack)
-  old_stack=stack
-  while stack.match +[OBS, Reduce]
-  end
-  stack.equal? old_stack or raise 'error'
-end
-
-#last element of stack is always lookahead
-def parse(input)
-  input<<:EOI
-  stack=[input.shift]
-  until input.empty? and +[OB,:EOI]===stack
-    stack.push input.shift  #shift
-    reduceloop stack
-  end
-  return stack.first
-end

data/forward_to.rb

@@ -1,49 +0,0 @@
-=begin copyright
-    reg - the ruby extended grammar
-    Copyright (C) 2005,2009  Caleb Clausen
-
-    This library is free software; you can redistribute it and/or
-    modify it under the terms of the GNU Lesser General Public
-    License as published by the Free Software Foundation; either
-    version 2.1 of the License, or (at your option) any later version.
-
-    This library is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-    Lesser General Public License for more details.
-
-    You should have received a copy of the GNU Lesser General Public
-    License along with this library; if not, write to the Free Software
-    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
-=end
-module Kernel
-  #forward or delegate one or more methods to
-  #something else. this is sort of like aliasing
-  #a method, but the receiver can be changed as well.
-  #target is where the methods are forwarded to.
-  #(the new receiver.)
-  #it may be a Module or Class or a String or Symbol
-  #containing the name of an instance, class, or
-  #global variable. actually, the target string
-  #may contain any code (to be evaluated in the context 
-  #of an object of the current class).
-  #multiple names to forward may be provided. if the
-  #hash slot is used, it may contain methods whose
-  #names are changed while forwarding, in the form
-  #       :localname=>:targetname
-protected
-  def forward_to(target,*names)
-    Module===target and target="::#{target}"
-    
-    eval names.pop.map{|myname,targetname| 
-      "def #{myname}(*args,&block) (#{target}).#{targetname}(*args,&block) end\n" 
-    }.join if Hash===names.last 
-    eval names.map{|name| 
-      "def #{name}(*args,&block) (#{target}).#{name}(*args,&block) end\n" 
-    }.join
-  end
-end
-
-class Module
-  public :forward_to
-end

data/numberset.rb

@@ -1,200 +0,0 @@
-=begin copyright
-    reg - the ruby extended grammar
-    Copyright (C) 2005  Caleb Clausen
-
-    This library is free software; you can redistribute it and/or
-    modify it under the terms of the GNU Lesser General Public
-    License as published by the Free Software Foundation; either
-    version 2.1 of the License, or (at your option) any later version.
-
-    This library is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-    Lesser General Public License for more details.
-
-    You should have received a copy of the GNU Lesser General Public
-    License along with this library; if not, write to the Free Software
-    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
-=end
-require "forward_to"
-
-SpaceshipPirate=proc{
-  alias spaceship__withoutpirates <=>
-  def <=>(other)
-    if NumberSet::Part===other 
-      res=other<=>self
-      res and -res    
-    else
-      spaceship__withoutpirates other
-    end
-  end
-}
-
-
-[Fixnum,Bignum,Float].each{|cl| cl.instance_eval SpaceshipPirate }
-
-class NumberSet
-  
-  def initialize(*pieces)
-    pieces.map {|r| self.insert r}
-  end
-  class<<self
-    alias [] new
-  end
-  
-  forward_to :@pieces, :[]
-  
-  def insert
-    mid=high-low/2
-    case 
-  end
-  
-  def ===(num)
-    @pieces.empty? and return 
-
-    low,high=0,@pieces.size-1
-
-    loop { 
-    case num <=> @pieces[mid=high-low/2]
-      when 1: low=mid+1
-      when 0: return true
-      when -1: high=mid-1
-      when nil: return false
-      else fail "didn't expect anything else from <=>"
-    end
-    (-1..1)===high-low and 
-    }
-  end
-
-  class Part
-    def initialize
-      abstract
-    end
-
-    def ===
-      abstract
-    end
-
-    def first
-      abstract
-    end
-
-    def last
-      abstract
-    end
-
-    def <=>(other)
-      if Part===other
-        result=(self<=>other.first)
-        return(result == (self<=>other.last) and result)
-      end
-    
-      if    first> other: -1
-      elsif last < other: 1
-      elsif self===other: 0
-      end
-      #else other's in our range, but not in the bitset, what else to do?
-    end
-    
-  end
-
-  class Range < Part
-    include Enumerable
-    
-    def initialize(first,last=nil,exclude_end=nil)
-      last or first,last,exclude_end=first.first,first.last,first.exclude_end?
-      @first,@last,@exclude_end=first,last,exclude_end||nil
-    end
-    class <<self; alias [] new; end
-    
-    attr_reader :first,:last
-    alias begin first
-    alias end last
-    
-    def exclude_end?; @exclude_end end
-    
-    def ===(num)
-      lt=@exclude_end && :< || :<=
-      num>=@first and num.send lt,@last
-    end
-    alias member? ===
-    alias include? ===
-    
-    def to_s
-      "#{@first}..#{@exclude_end && "."}#{@last}"
-    end
-    alias inspect to_s
-    
-    def eql?(other)
-      Range===other||::Range===other and
-      @first.eql? other.first and
-      @last.eql? other.last and
-      @exclude_end==other.exclude_end?
-    end
-    
-    def each
-      item=@first
-      until item==@last
-        yield item
-        item=item.succ!
-      end
-      yield item unless @exclude_end
-      return self
-    end
-    
-    def step(skipcnt)
-      item=@first
-      cnt=1
-      until item==@last
-        if (cnt-=1).zero?
-          cnt=skipcnt
-          yield item
-        end
-        item=item.succ!
-      end
-      yield item unless @exclude_end || cnt!=1
-      return self    
-    end
-  end
-
-
-  class Fragment < Part
-    include Enumerable
-    
-    attr_reader :base, :bits
-  
-  
-    def begin
-      assert @bits[0].nonzero?
-      @base+@bits[0].ffs-1
-    end
-    
-    def end
-      assert @bits[-1].fls.nonzero?
-      @base+ (@bits.length-1)*8 + @bits[-1].fls-1
-    end
-    
-    alias first begin
-    alias last end
-    
-    def ===(num)
-      num-=@base
-      num<0 and return false
-      bitidx=num&7
-      byteidx=(num&~7)>>3
-      (@bits[byteidx]&(1<<bitidx)).nonzero?
-    end
-    
-    def each
-      (0...@bits.size).each{|idx|
-        bits=@bits[idx]
-        until bits.zero?
-          bit=bits.ffs-1
-          yield @base + idx*8 + bit
-          bits &= ~(1<<bit)
-        end
-      }
-      return self
-    end
-  end
-end