sequence 0.2.1 → 0.2.2

data/History.txt

@@ -1,3 +1,9 @@
+=== 0.2.2 / 2009-08-05
+* 3 Minor Enhancements:
+  * mostly works in ruby 1.9, but still some bizarre unit test failures
+  * should now work in windows without a problem
+  * replaced (no longer working) Hoe/Rakefile with Makefile/gemspec
+
 === 0.2.1 / 2009-01-07
 * 1 Minor Enhancement:
   * WeakRefSet now conforms to Set's api and tests more closely.

data/Makefile

@@ -0,0 +1,32 @@
+.PHONY: all test docs gem tar pkg email
+all: test
+
+test:
+	ruby -Ilib test/test_all.rb
+
+docs:
+	rdoc lib/*
+
+pkg: gem tar
+
+gem:
+	gem build sequence.gemspec
+
+tar:
+	tar czf sequence-`ruby -r ./lib/sequence/version.rb -e 'puts Sequence::VERSION'`.tar.gz `git ls-files`
+
+email: README.txt History.txt
+	ruby -e ' \
+  require "rubygems"; \
+  load "./sequence.gemspec"; \
+  spec= Gem::Specification.list.find{|x| x.name=="sequence"}; \
+  puts "\
+Subject: [ANN] Sequence #{spec.version} Released \
+\n\nSequence version #{spec.version} has been released! \n\n\
+#{Array(spec.homepage).map{|url| " * #{url}\n" }} \
+ \n\
+#{Sequence::Description} \
+\n\nChanges:\n\n \
+#{Sequence::Latest_changes} \
+"\
+'

data/README.txt

@@ -1,6 +1,7 @@
 = sequence
 
 * http://sequence.rubyforge.org/
+* http://github.com/coatl/sequence
 
 == DESCRIPTION:
 Sequence provides a unified api for access to sequential data types, like

data/Rakefile

@@ -2,14 +2,16 @@
 # Distributed under the terms of Ruby's license.
 require 'rubygems'
 require 'hoe'
-require 'lib/sequence/version.rb'
- 
+require './lib/sequence/version.rb'
+require 'test/unit'
  
  if $*==["test"]
+  gem 'test-unit'
+  require 'test/unit'
   #hack to get 'rake test' to stay in one process
   #which keeps netbeans happy
   $:<<"lib"
-  require "test/test_all.rb"
+  require "./test/test_all.rb"
   Test::Unit::AutoRunner.run
   exit
 end

data/lib/sequence/buffered.rb

@@ -45,8 +45,6 @@ class Buffered < Sequence
     end
     def _default_maxmatchlen; @buffer_size/2 end
 
-    attr :pos
-    
     def _pos=(pos)
       if pos<@buffer_pos
         @pos=@input.pos=pos  #could raise exception, if @input doesn't support #pos=

data/lib/sequence/file.rb

@@ -17,8 +17,8 @@ class File < Sequence
     def initialize(file,mode="r")
 
       case file
-      when Integer:  file=IO.new(file,mode)
-      when String:   file=File.new(file,mode)
+      when Integer;  file=IO.new(file,mode)
+      when String;   file=File.new(file,mode)
       else #do nothing, file is of a right type (we hope) already
       end
       
@@ -169,4 +169,4 @@ class StringIO
     def to_sequence
        Sequence::File.new(self)
     end
-end
+end

data/lib/sequence/io.rb

@@ -12,7 +12,8 @@ class Sequence
 #At the moment, this even includes #scan and friends, tho I will try to make those work somewhat.
 #Also note that this is one of the few Sequence classes that might return less that the amount asked
 #for in a read, even if not at the end of file.
-#Due to use of nonblocking io, this might not work on windows.
+#Due to use of nonblocking io, this only works on windows when wrapping a socket, not a named pipe,
+#anonymous pipe, or device.
 #The value of #size in this sequence continually increases over its lifetime, and it isn't possible to 
 #know the final value beforehand. Likewise, #eof? may return false even tho it's destined to return
 #true at the same position. This is because the 'other end' may not have closed the IO, even if there's
@@ -25,10 +26,6 @@ class IO < Sequence
   def initialize(io)
     @io=io
     @pos=0
-    
-    @io.fcntl(::Fcntl::F_SETFL, ::Fcntl::O_NONBLOCK)
-    #I gather this won't work on windows....
-    
     @fragment=''
   end
   
@@ -42,14 +39,14 @@ class IO < Sequence
 
   def size
     #refill fragment if needed
-    @fragment=@io.sysread(4096) if @fragment.empty?
+    @fragment=readchunk(4096) if @fragment.empty?
 
     return @pos+@fragment.size 
   end
 
   def more_data?
     #refill fragment if needed
-    @fragment=@io.sysread(4096) if @fragment.empty?
+    @fragment=readchunk(4096) if @fragment.empty?
     
     return !eof 
   end
@@ -59,6 +56,14 @@ class IO < Sequence
       @io.eof?  
   end
   
+  def readchunk len
+    @fragment=@io.read_nonblock(len)
+  rescue IOError, EOFError
+    raise
+  rescue Exception
+    @fragment=''
+  end
+
   def read len
     if len<= @fragment.size
       @pos+=len
@@ -71,7 +76,7 @@ class IO < Sequence
       rem=len%4096
       rem.nonzero? and readlen+=4096-rem
       
-      @fragment=@io.sysread(readlen) 
+      @fragment=readchunk(readlen) 
       result+=@fragment.slice!(0,len)
       @pos+=result.size
       result
@@ -79,7 +84,11 @@ class IO < Sequence
   end
   
   def match pat
-    @fragment.size>=scanbuflen or @fragment<<@io.sysread(4096)
+    unless @fragment.size>=scanbuflen 
+      frag=@fragment
+      frag<<readchunk([4096,scanbuflen].max)
+    end
+    @fragment=frag
     result=@fragment.match(pat)
     result if result.begin(0).zero?
   end
@@ -93,8 +102,8 @@ class IO < Sequence
     else
       len=newpos-(@pos+@fragment.size)
       len > 10*4096 and raise ArgumentError
+      tossit=readchunk(len)
       @fragment=''
-      tossit=@io.sysread(len)
       @pos=newpos-(len-tossit.size)
     end
   end

data/lib/sequence/list.rb

@@ -76,9 +76,9 @@ class Sequence
         assert @start_pos[high]>pos
         mid=(low+high)/2
         case pos<=>@start_pos[mid]
-        when -1: high=mid
-        when  0: break low=mid
-        when  1: low=mid
+        when -1; high=mid
+        when  0; break low=mid
+        when  1; low=mid
         end
       end
       assert @start_pos[low]<=pos
@@ -91,8 +91,7 @@ class Sequence
       result=@list[idx][pos-@start_pos[idx],len] || new_data
       len-=result.size
       assert len>=0 
-      i=nil
-      (idx+1).upto(@list.size-1){|i| 
+      (idx+1).upto(@list.size-1){|i|
          break(result+=@list[i][0,len]) if len<@list[i].size          
          result+=@list[i].all_data
          len-=@list[i].size

data/lib/sequence/position.rb

@@ -70,7 +70,7 @@ class Position < UseData # :nodoc:
    def close
         @data._delete_position(self)
         super
-    end
+   end
 =begin ***
     protected
     def _deletion(pos,len=1,reverse=false,dummy=nil)

data/lib/sequence/shifting.rb

@@ -98,8 +98,8 @@ public
            diff=-diff
            @seq[x,diff] rescue
              case data_class
-             when ::Array:  [nil]
-             when ::String: "\0"
+             when ::Array;  [nil]
+             when ::String; "\0"
              else fail
              end*diff
         
@@ -116,8 +116,8 @@ public
        @data.prepend((
          @seq[x...offset] rescue
          case data_class
-         when ::Array:  [nil]
-         when ::String: "\0"
+         when ::Array;  [nil]
+         when ::String; "\0"
          else fail
          end*(offset-x)
        ))

data/lib/sequence/stringlike.rb

@@ -174,7 +174,7 @@ class Sequence
     (frags=newrex.split( /((?:[^\\(\[\]$^]+|\\(?:[CM]-)*[^CMZA])*)/ )).each_index{|i|
       frag=frags[i]
       case frag
-        when "\\": 
+        when "\\"
           if !incclass and frags[i+1][0,1]==buffanchor
             frags[i+1].slice! 0
             frag='(?!)'
@@ -191,9 +191,9 @@ class Sequence
             frag="(?=\n)"
             rewritten=true
           end
-        when "(": incclass or frags[i+1][0]==?? or groupnum+=1
-        when "[": incclass=true #ignore stuff til ]
-        when "]": incclass=false #stop ignoring stuff
+        when "("; incclass or frags[i+1][0]==?? or groupnum+=1
+        when "["; incclass=true #ignore stuff til ]
+        when "]"; incclass=false #stop ignoring stuff
       end
       result<<frag
     }
@@ -302,12 +302,12 @@ class Sequence
 
     def scan(pat)
       holding? {case pat
-        when Integer: 
+        when Integer 
           pat==read1 and pat.chr
-        #when SetOfChar: ...
-        when String:
+        #when SetOfChar; ...
+        when String
           pat==read(pat.size) and pat
-        when Regexp: 
+        when Regexp 
           if m=match(pat,true)
             goto m.end(0) 
             m.to_s
@@ -318,12 +318,12 @@ class Sequence
     
     def scanback(pat)
       holding? {case pat
-        when Integer: 
+        when Integer 
           pat==readback1 and pat.chr
-        #when SetOfChar: ...
-        when String:
+        #when SetOfChar; ...
+        when String
           pat==readback(pat.size) and pat
-        when Regexp: 
+        when Regexp 
           if m=matchback(pat,true) 
             goto m.begin(0) 
             m.to_s
@@ -335,14 +335,14 @@ class Sequence
     def scan_until(pat)
       at=index( pat,pos) or return
       newpos=case pat
-        when Regexp: 
+        when Regexp 
           m=last_match
           s=slice(pos...m.begin(0))
           m.set_pre_match_body{s}
           m.end(0)
-        when String: at+pat.size
-        when Integer: at+1
-        #when SetOfChar: huh
+        when String; at+pat.size
+        when Integer; at+1
+        #when SetOfChar; huh
         else raise ArgumentError
       end
       return( read newpos-pos)
@@ -364,7 +364,7 @@ class Sequence
             end
             nil
           }
-        #elsif SetOfChar===pat: ...
+        #elsif SetOfChar===pat; ...
         else #string or integer
           i=index(pat,pos)
           result=read(i-pos)<<pat
@@ -395,7 +395,7 @@ class Sequence
           m=matchback(pat,false) or break
           goto= m.begin(0)
           m.to_s+m.post_match
-        #elsif SetOfChar===pat: ...
+        #elsif SetOfChar===pat; ...
         else #string or integer
           i=rindex(pat,pos)
           result=readback(pos-i-pat.size)<<pat

data/lib/sequence/subseq.rb

@@ -6,6 +6,7 @@ require 'sequence/usedata'
 class Sequence
   class SubSeq < Sequence
     def initialize(seq, first,len)
+      assert first
       first+len-1>=seq.size and len=seq.size-first
       @data=seq
       @pos=0
@@ -14,9 +15,10 @@ class Sequence
 
       #ask for notifications on the parent seq...
       @data.on_change_notify self
+      assert @first
+      #p [:init,__id__]
     end
-    
-   
+
     def change_notification data,first,oldsize,newsize
       assert @data==data 
       old_first=@first
@@ -24,6 +26,8 @@ class Sequence
       @pos=(_adjust_pos_on_change @first+@pos,first,oldsize,newsize)-@first
       @size=(_adjust_pos_on_change @first+@size,first,oldsize,newsize)-@first
       @first=_adjust_pos_on_change @first,first,oldsize,newsize
+      assert @first
+      #p [:cn, __id__]
       
       notify_change(self, first-@first, oldsize, newsize)
     end
@@ -50,7 +54,7 @@ class Sequence
 
     def readback(len)
       result=readbehind(len)
-      move( -result.size)
+      move( -result.size )
       result
     end
 
@@ -69,6 +73,7 @@ class Sequence
     attr :data
 
     def subseq *args
+      #p [:subseq, __id__]
       first,len,only1=_parse_slice_args( *args)
       SubSeq.new(@data,@first+first,len)
     end

data/lib/sequence/version.rb

@@ -1,5 +1,5 @@
 # Copyright (C) 2006,2008  Caleb Clausen
 # Distributed under the terms of Ruby's license.
 class Sequence
-  VERSION='0.2.1'
+  VERSION='0.2.2'
 end

data/lib/sequence/weakrefset.rb

@@ -114,9 +114,17 @@ end
   alias eql? ==
 
   def hash
+    hashing=Thread.current[:$WeakRefSet_hashing]||=[]
+    return 0 if hashing.include? self
+    hashing<<self
+    
     result=0
     each{|x| result^=x.hash }
     result
+
+  ensure
+    hashing.delete(self)
+    Thread.current[:$WeakRefSet_hashing]=nil if hashing.empty?
   end
     
   # clear the set (return self)

data/lib/sequence.rb

@@ -47,7 +47,7 @@ class Sequence
       undef new #bye-bye
       def new(seq)
         case seq
-          when File,IO,Array,String,Enumerable:
+          when File,IO,Array,String,Enumerable
             seq.to_sequence
           else
             if seq.respond_to? :to_str
@@ -562,18 +562,18 @@ class Sequence
       assert !closed?
       size=self.size
       case r=args.first
-        when Range:
+        when Range
           asize==1 or raise ArgumentError 
           first,last=r.first,r.last
           first=_normalize_pos(first,size)
           last=_normalize_pos(last,size)
           len=last-first 
           r.exclude_end? or len+=1
-        when Integer: 
+        when Integer 
           asize<=2 or raise ArgumentError
           first=_normalize_pos(r,size)
           len=args[1] || (only1=1)
-        when nil:
+        when nil
           asize==0 or raise ArgumentError
           first=nil 
           len=only1=1

data/sequence.gemspec

@@ -0,0 +1,44 @@
+# -*- encoding: utf-8 -*-
+
+require './lib/sequence/version'
+Sequence::Description=open("README.txt"){|f| f.read[/^==+ ?description[^\n]*?\n *\n?(.*?\n *\n.*?)\n *\n/im,1] }
+Sequence::Latest_changes="###"+open("History.txt"){|f| f.read[/\A===(.*?)(?====)/m,1] }
+
+Gem::Specification.new do |s|
+  s.name = "sequence"
+  s.version = Sequence::VERSION
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Caleb Clausen"]
+  s.date = Time.now.strftime("%Y-%m-%d")
+  s.email = %q{caleb (at) inforadical (dot) net}
+  s.extra_rdoc_files = ["README.txt", "COPYING", "GPL"]
+  s.files = `git ls-files`.split
+  s.has_rdoc = true
+  s.homepage = %{http://github.com/coatl/sequence}
+  s.rdoc_options = %w[--inline-source --main README.txt]
+  s.require_paths = ["lib"]
+  s.rubyforge_project = %q{sequence}
+  s.rubygems_version = %q{1.3.0}
+  s.test_files = %w[test/test_all.rb]
+  s.summary = "A single api for reading and writing sequential data types."
+  s.description = Sequence::Description
+
+=begin
+  if s.respond_to? :specification_version then
+    current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
+    s.specification_version = 2
+
+    if Gem::Version.new(Gem::RubyGemsVersion) >= Gem::Version.new('1.2.0') then
+      s.add_runtime_dependency(%q<mime-types>, [">= 1.15"])
+      s.add_runtime_dependency(%q<diff-lcs>, [">= 1.1.2"])
+    else
+      s.add_dependency(%q<mime-types>, [">= 1.15"])
+      s.add_dependency(%q<diff-lcs>, [">= 1.1.2"])
+    end
+  else
+    s.add_dependency(%q<mime-types>, [">= 1.15"])
+    s.add_dependency(%q<diff-lcs>, [">= 1.1.2"])
+  end
+=end
+end

data/test/test_all.rb

@@ -1,6 +1,6 @@
 # Copyright (C) 2006  Caleb Clausen
 # Distributed under the terms of Ruby's license.
-require 'test/test_rexscan.rb'
-require 'test/test_seqrex.rb'
-require 'test/test_changes.rb'
+require './test/test_rexscan.rb'
+require './test/test_seqrex.rb'
+require './test/test_changes.rb'
 

data/test/test_rexscan.rb

@@ -2,7 +2,7 @@
 # Distributed under the terms of Ruby's license.
 $VERBOSE=1
 require 'test/unit'
-
+require 'socket'
 
       require 'sequence'
       require 'sequence/indexed'
@@ -143,6 +143,7 @@ $Debug=true
         @@seq and @@seq.data.close(true)    
 
         tf=::Tempfile.new("test_seq#@@count"); @@count+=1
+        tf.binmode
        
         tf.write DATA
 
@@ -239,8 +240,21 @@ $Debug=true
     end
     
     class IO < Indexed
+      def socketpair
+        BasicSocket.do_not_reverse_lookup=true
+        server_sock=TCPServer.new('127.0.0.1', 0xABCD)
+        client=TCPSocket.new('127.0.0.1', 0xABCD)
+        server=nil
+        begin
+          server.close if server
+          server=server_sock.accept
+        end until server.peeraddr==client.addr
+        return client,server
+      end
+
       def a_seq
-        r,w=::IO.pipe
+        r,w=socketpair #was: ::IO.pipe  #but windows doesn't allow nonblocking pipes
+        @closeit=w
         r=Sequence::IO[r]
         w.write DATA
         r.read(OFFSET)== DATA[0,OFFSET] or raise "predata mismatch inside pipe"
@@ -251,7 +265,7 @@ $Debug=true
       undef_method(*(MOVEPOSMETHODS+MODIFYMETHODS))
     end
     
-     module SmallScanBuffered
+    module SmallScanBuffered
       SequenceTests.constants.each{|k|
         xk= SequenceTests.const_get(k)
         next unless (xk.is_a? Class and xk<=::SequenceTests::Indexed)
@@ -345,6 +359,7 @@ $Debug=true
 =end
  
     class Indexed
+      undef_method(*(MOVEPOSMETHODS+MODIFYMETHODS))
     def test_optional_capture
        seq=a_seq
        word=seq.scan /(more of )?that (tough)/
@@ -365,7 +380,6 @@ $Debug=true
 
 
     RANDOMIZED_METHODS=[:test_slice,:test_insert,:test_delete,:test_modify]
-    undef test_randomized_methods_some_more
     def test_randomized_methods_some_more n=50
       RANDOMIZED_METHODS.each{|m| n.times{send m}}  
     end
@@ -379,7 +393,6 @@ $Debug=true
     end
     
     
-      undef_method(*(MOVEPOSMETHODS+MODIFYMETHODS))
     def test_pos_munging
       (1..3).each{|n|
       seq=a_seq
@@ -615,23 +628,23 @@ $Debug=true
     def verify_aftermatch_status(seq,pos,matches,starts,pre,post,eof)
       assert_equal pos, seq.pos
       assert       seq.last_match
-      i=nil
-      matches.each_with_index{|m,i| 
+      ii=nil
+      matches.each_with_index{|m,i| ii=i
         assert_equal m, seq.last_match[i]
       }
-      assert_equal nil, seq.last_match[i+1]
+      assert_equal nil, seq.last_match[ii+1]
       assert_equal matches.length, seq.last_match.length
       assert_equal matches, seq.last_match.to_a
-      starts.each_with_index{|start,i| 
+      starts.each_with_index{|start,i| ii=i
         assert_equal start, seq.last_match.begin(i)
         assert_equal start+matches[i].size, seq.last_match.end(i)
         
         assert_equal start, seq.last_match.offset(i).first
         assert_equal start+matches[i].size, seq.last_match.offset(i).last
       }
-      assert_equal nil, seq.last_match.begin(i+1)
-      assert_equal nil, seq.last_match.end(i+1)
-      assert_equal nil, seq.last_match.offset(i+1)
+      assert_equal nil, seq.last_match.begin(ii+1)
+      assert_equal nil, seq.last_match.end(ii+1)
+      assert_equal nil, seq.last_match.offset(ii+1)
       
       assert_equal pre, seq.last_match.pre_match[0..-1]
       assert_equal post, seq.last_match.post_match[0..-1]
@@ -685,7 +698,7 @@ $Debug=true
       }
     end
 
-     def test_scanning
+    def test_scanning
   
       assert_equal "that ", a_seq.readahead(5)
 

data/test/test_seqrex.rb

@@ -85,31 +85,31 @@ end
 oldVERBOSE=$VERBOSE
 $VERBOSE=nil
 eval <<'END'
-      _=@cu.group_anchors(/([\A[]|^asdf(df)s)/,true)
-      assert_equal "[/(?-mix:([\\A[]|(^)asdf(df)s))/, [2]]", _.inspect
+      _=@cu.group_anchors(/([\A[~]|^asdf(df)s)/,true)
+      assert_equal "[/(?-mix:([\\A[~]|(^)asdf(df)s))/, [2]]", _.inspect
 
-      _=@cu.group_anchors(/(\A|[z^[]asdf(df)s)/,nil)
-      assert_equal "[/(\\A|[z^[]asdf(df)s)/, []]", _.inspect
+      _=@cu.group_anchors(/(\A|[z^[~]asdf(df)s)/,nil)
+      assert_equal "[/(\\A|[z^[~]asdf(df)s)/, []]", _.inspect
 
-      _=@cu.group_anchors(/(\A|[z^[]asdf(df)s)/,true)
-      assert_equal "[/(?-mix:((?!)|[z^[]asdf(df)s))/, []]", _.inspect
+      _=@cu.group_anchors(/(\A|[z^[~]asdf(df)s)/,true)
+      assert_equal "[/(?-mix:((?!)|[z^[~]asdf(df)s))/, []]", _.inspect
 
-      _=@cu.group_anchors(/([\A[]|^asdf(df)s)/,nil)
-      assert_equal "[/([\\A[]|^asdf(df)s)/, []]", _.inspect
+      _=@cu.group_anchors(/([\A[~]|^asdf(df)s)/,nil)
+      assert_equal "[/([\\A[~]|^asdf(df)s)/, []]", _.inspect
 END
 $VERBOSE=oldVERBOSE
 
-      _=@cu.group_anchors(/([\A\[]|^asdf(df)s)/,true)
-      assert_equal "[/(?-mix:([\\A\\[]|(^)asdf(df)s))/, [2]]", _.inspect
+      _=@cu.group_anchors(/([\A\[~]|^asdf(df)s)/,true)
+      assert_equal "[/(?-mix:([\\A\\[~]|(^)asdf(df)s))/, [2]]", _.inspect
 
-      _=@cu.group_anchors(/(\A|[z^\[]asdf(df)s)/,nil)
-      assert_equal "[/(\\A|[z^\\[]asdf(df)s)/, []]", _.inspect
+      _=@cu.group_anchors(/(\A|[z^\[~]asdf(df)s)/,nil)
+      assert_equal "[/(\\A|[z^\\[~]asdf(df)s)/, []]", _.inspect
 
-      _=@cu.group_anchors(/(\A|[z^\[]asdf(df)s)/,true)
-      assert_equal "[/(?-mix:((?!)|[z^\\[]asdf(df)s))/, []]", _.inspect
+      _=@cu.group_anchors(/(\A|[z^\[~]asdf(df)s)/,true)
+      assert_equal "[/(?-mix:((?!)|[z^\\[~]asdf(df)s))/, []]", _.inspect
 
-      _=@cu.group_anchors(/([\A\[]|^asdf(df)s)/,nil)
-      assert_equal "[/([\\A\\[]|^asdf(df)s)/, []]", _.inspect
+      _=@cu.group_anchors(/([\A\[~]|^asdf(df)s)/,nil)
+      assert_equal "[/([\\A\\[~]|^asdf(df)s)/, []]", _.inspect
 
 
       _=@cu.group_anchors(/([\A(]|^asdf(df)s)/,true)

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: sequence
 version: !ruby/object:Gem::Version 
-  version: 0.2.1
+  version: 0.2.2
 platform: ruby
 authors: 
 - Caleb Clausen
@@ -9,30 +9,28 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2009-07-06 00:00:00 -07:00
+date: 2009-08-05 00:00:00 -07:00
 default_executable: 
-dependencies: 
-- !ruby/object:Gem::Dependency 
-  name: hoe
-  type: :development
-  version_requirement: 
-  version_requirements: !ruby/object:Gem::Requirement 
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        version: 1.12.2
-    version: 
-description: A unified wrapper api for accessing data in Strings, Arrays, Files, IOs,  and Enumerations. Each sequence encapsulates some data and a current position  within it. There are methods for moving the position, reading and writing data (with or without moving the position) forward or backward from the current position (or anywhere at all), scanning for patterns (like StringScanner, but  it works in Files too, among others), and saving a position that will remain valid even after data is deleted or inserted elsewhere within the sequence.   There are also some utility classes for making sequences reversed or circular, turning one-way sequences into two-way, buffering, and making sequences that are subsets or aggregations of existing sequences.
-email: sequence-owner @at@ inforadical .dot. net
+dependencies: []
+
+description: Sequence provides a unified api for access to sequential data types, like Strings, Arrays, Files, IOs, and Enumerations. Each sequence encapsulates some data and a current position within it. Some operations apply to data at (or relative to) the position, others are independant of position. The api contains operations for moving the position, reading and writing data (with or without moving the position) forward or backward from the current position or anywhere, scanning for patterns (like StringScanner, but it works in Files too, among others), and saving a position that will remain valid even after data is deleted or inserted elsewhere within the sequence.   There are also some utility classes for making sequences reversed or circular, turning one-way sequences into two-way, buffering, and making sequences that are subsets or aggregations of existing sequences.
+email: caleb (at) inforadical (dot) net
 executables: []
 
 extensions: []
 
 extra_rdoc_files: 
-- Manifest.txt
 - README.txt
-- History.txt
+- COPYING
+- GPL
 files: 
+- COPYING
+- GPL
+- History.txt
+- Makefile
+- Manifest.txt
+- README.txt
+- Rakefile
 - lib/assert.rb
 - lib/sequence.rb
 - lib/sequence/arraylike.rb
@@ -57,6 +55,7 @@ files:
 - lib/sequence/usedata.rb
 - lib/sequence/version.rb
 - lib/sequence/weakrefset.rb
+- sequence.gemspec
 - test/test.rb
 - test/test_all.rb
 - test/test_changes.rb
@@ -64,16 +63,11 @@ files:
 - test/test_rexscan.rb
 - test/test_seqrex.rb
 - test/test_sequences.rb
-- Rakefile
-- Manifest.txt
-- README.txt
-- COPYING
-- GPL
-- History.txt
 has_rdoc: true
-homepage: http://sequence.rubyforge.org/
+homepage: http://github.com/coatl/sequence
 post_install_message: 
 rdoc_options: 
+- --inline-source
 - --main
 - README.txt
 require_paths: