File Manager

X7ROOT File Manager

Current Path: /opt/alt/ruby18/lib64/ruby/1.8

opt / alt / ruby18 / lib64 / ruby / 1.8 /

ðŸ“ ..
ðŸ“„ English.rb(5.6 KB)
ðŸ“„ Env.rb(274 B)
ðŸ“„ abbrev.rb(2.5 KB)
ðŸ“„ base64.rb(3.37 KB)
ðŸ“„ benchmark.rb(17.73 KB)
ðŸ“ bigdecimal
ðŸ“ cgi
ðŸ“„ cgi-lib.rb(6.89 KB)
ðŸ“„ cgi.rb(73.74 KB)
ðŸ“„ complex.rb(12.84 KB)
ðŸ“„ csv.rb(24.46 KB)
ðŸ“ date
ðŸ“„ date.rb(53.02 KB)
ðŸ“„ date2.rb(128 B)
ðŸ“„ debug.rb(20.61 KB)
ðŸ“„ delegate.rb(8.81 KB)
ðŸ“ digest
ðŸ“„ digest.rb(1.12 KB)
ðŸ“ dl
ðŸ“ drb
ðŸ“„ drb.rb(19 B)
ðŸ“„ e2mmap.rb(4.04 KB)
ðŸ“„ erb.rb(21.38 KB)
ðŸ“„ eregex.rb(487 B)
ðŸ“„ expect.rb(633 B)
ðŸ“„ fileutils.rb(42.23 KB)
ðŸ“„ finalize.rb(5.38 KB)
ðŸ“„ find.rb(1.84 KB)
ðŸ“„ forwardable.rb(6.16 KB)
ðŸ“„ ftools.rb(6.17 KB)
ðŸ“„ generator.rb(8.1 KB)
ðŸ“„ getoptlong.rb(14.88 KB)
ðŸ“„ getopts.rb(2.25 KB)
ðŸ“„ gserver.rb(6.43 KB)
ðŸ“„ importenv.rb(590 B)
ðŸ“ io
ðŸ“„ ipaddr.rb(21.96 KB)
ðŸ“ irb
ðŸ“„ irb.rb(7.43 KB)
ðŸ“„ jcode.rb(4.3 KB)
ðŸ“„ kconv.rb(8.12 KB)
ðŸ“„ logger.rb(17.59 KB)
ðŸ“„ mailread.rb(1.28 KB)
ðŸ“„ mathn.rb(5.42 KB)
ðŸ“„ matrix.rb(27.21 KB)
ðŸ“„ md5.rb(411 B)
ðŸ“„ mkmf.rb(50.65 KB)
ðŸ“„ monitor.rb(7.93 KB)
ðŸ“„ mutex_m.rb(2.07 KB)
ðŸ“ net
ðŸ“„ observer.rb(5.15 KB)
ðŸ“„ open-uri.rb(20.49 KB)
ðŸ“„ open3.rb(2.1 KB)
ðŸ“ openssl
ðŸ“„ openssl.rb(575 B)
ðŸ“ optparse
ðŸ“„ optparse.rb(47.12 KB)
ðŸ“„ ostruct.rb(3.35 KB)
ðŸ“„ parsearg.rb(1.55 KB)
ðŸ“„ parsedate.rb(1.33 KB)
ðŸ“„ pathname.rb(29.39 KB)
ðŸ“„ ping.rb(1.48 KB)
ðŸ“„ pp.rb(15.97 KB)
ðŸ“„ prettyprint.rb(18.33 KB)
ðŸ“„ profile.rb(90 B)
ðŸ“„ profiler.rb(1.59 KB)
ðŸ“„ pstore.rb(11.15 KB)
ðŸ“ racc
ðŸ“„ rational.rb(12.05 KB)
ðŸ“ rdoc
ðŸ“„ readbytes.rb(835 B)
ðŸ“„ resolv-replace.rb(1.55 KB)
ðŸ“„ resolv.rb(56.83 KB)
ðŸ“ rexml
ðŸ“ rinda
ðŸ“ rss
ðŸ“„ rss.rb(504 B)
ðŸ“„ rubyunit.rb(180 B)
ðŸ“ runit
ðŸ“„ scanf.rb(20.63 KB)
ðŸ“„ securerandom.rb(4.27 KB)
ðŸ“„ set.rb(27.08 KB)
ðŸ“„ sha1.rb(418 B)
ðŸ“ shell
ðŸ“„ shell.rb(4.66 KB)
ðŸ“„ shellwords.rb(3.99 KB)
ðŸ“„ singleton.rb(8.08 KB)
ðŸ“ soap
ðŸ“„ sync.rb(6.09 KB)
ðŸ“„ tempfile.rb(4.86 KB)
ðŸ“ test
ðŸ“„ thread.rb(104 B)
ðŸ“„ thwait.rb(4.32 KB)
ðŸ“„ time.rb(31.58 KB)
ðŸ“„ timeout.rb(3 KB)
ðŸ“„ tmpdir.rb(3.69 KB)
ðŸ“„ tracer.rb(2.73 KB)
ðŸ“„ tsort.rb(7.99 KB)
ðŸ“„ un.rb(4.54 KB)
ðŸ“ uri
ðŸ“„ uri.rb(710 B)
ðŸ“„ weakref.rb(2.68 KB)
ðŸ“ webrick
ðŸ“„ webrick.rb(811 B)
ðŸ“ wsdl
ðŸ“ x86_64-linux
ðŸ“ xmlrpc
ðŸ“ xsd
ðŸ“ yaml
ðŸ“„ yaml.rb(12.36 KB)

Editing: generator.rb

#!/usr/bin/env ruby
#--
# $Idaemons: /home/cvs/rb/generator.rb,v 1.8 2001/10/03 08:54:32 knu Exp $
# $RoughId: generator.rb,v 1.10 2003/10/14 19:36:58 knu Exp $
# $Id: generator.rb 15954 2008-04-10 10:52:50Z knu $
#++
#
# = generator.rb: convert an internal iterator to an external one
#
# Copyright (c) 2001,2003 Akinori MUSHA <knu@iDaemons.org>
#
# All rights reserved.  You can redistribute and/or modify it under
# the same terms as Ruby.
#
# == Overview
#
# This library provides the Generator class, which converts an
# internal iterator (i.e. an Enumerable object) to an external
# iterator.  In that form, you can roll many iterators independently.
#
# The SyncEnumerator class, which is implemented using Generator,
# makes it easy to roll many Enumerable objects synchronously.
#
# See the respective classes for examples of usage.

#
# Generator converts an internal iterator (i.e. an Enumerable object)
# to an external iterator.
#
# Note that it is not very fast since it is implemented using
# continuations, which are currently slow.
#
# == Example
#
#   require 'generator'
#
#   # Generator from an Enumerable object
#   g = Generator.new(['A', 'B', 'C', 'Z'])
#
#   while g.next?
#     puts g.next
#   end
#
#   # Generator from a block
#   g = Generator.new { |g|
#     for i in 'A'..'C'
#       g.yield i
#     end
#
#     g.yield 'Z'
#   }
#
#   # The same result as above
#   while g.next?
#     puts g.next
#   end
#   
class Generator
  include Enumerable

# Creates a new generator either from an Enumerable object or from a
  # block.
  #
  # In the former, block is ignored even if given.
  #
  # In the latter, the given block is called with the generator
  # itself, and expected to call the +yield+ method for each element.
  def initialize(enum = nil, &block)
    if enum
      @block = proc { |g|
	enum.each { |x| g.yield x }
      }
    else
      @block = block
    end

@index = 0
    @queue = []
    @cont_next = @cont_yield = @cont_endp = nil

if @cont_next = callcc { |c| c }
      @block.call(self)

@cont_endp.call(nil) if @cont_endp
    end

self
  end

# Yields an element to the generator.
  def yield(value)
    if @cont_yield = callcc { |c| c }
      @queue << value
      @cont_next.call(nil)
    end

self
  end

# Returns true if the generator has reached the end.
  def end?()
    if @cont_endp = callcc { |c| c }
      @cont_yield.nil? && @queue.empty?
    else
      @queue.empty?
    end
  end

# Returns true if the generator has not reached the end yet.
  def next?()
    !end?
  end

# Returns the current index (position) counting from zero.
  def index()
    @index
  end

# Returns the current index (position) counting from zero.
  def pos()
    @index
  end

# Returns the element at the current position and moves forward.
  def next()
    if end?
      raise EOFError, "no more elements available"
    end

if @cont_next = callcc { |c| c }
      @cont_yield.call(nil) if @cont_yield
    end

@index += 1

@queue.shift
  end

# Returns the element at the current position.
  def current()
    if @queue.empty?
      raise EOFError, "no more elements available"
    end

@queue.first
  end

# Rewinds the generator.
  def rewind()
    initialize(nil, &@block) if @index.nonzero?

self
  end

# Rewinds the generator and enumerates the elements.
  def each
    rewind

until end?
      yield self.next
    end

self
  end
end

class Enumerable::Enumerator
  def __generator
    @generator ||= Generator.new(self)
  end
  private :__generator

# call-seq:
  #   e.next   => object
  #
  # Returns the next object in the enumerator, and move the internal
  # position forward.  When the position reached at the end, internal
  # position is rewinded then StopIteration is raised.
  #
  # Note that enumeration sequence by next method does not affect other
  # non-external enumeration methods, unless underlying iteration
  # methods itself has side-effect, e.g. IO#each_line.
  #
  # Caution: This feature internally uses Generator, which uses callcc
  # to stop and resume enumeration to fetch each value.  Use with care
  # and be aware of the performance loss.
  def next
    g = __generator
    return g.next unless g.end?

g.rewind
    raise StopIteration, 'iteration reached at end' 
  end

# call-seq:
  #   e.rewind   => e
  #
  # Rewinds the enumeration sequence by the next method.
  def rewind
    __generator.rewind
    self
  end
end

#
# SyncEnumerator creates an Enumerable object from multiple Enumerable
# objects and enumerates them synchronously.
#
# == Example
#
#   require 'generator'
#
#   s = SyncEnumerator.new([1,2,3], ['a', 'b', 'c'])
#
#   # Yields [1, 'a'], [2, 'b'], and [3,'c']
#   s.each { |row| puts row.join(', ') }
#
class SyncEnumerator
  include Enumerable

# Creates a new SyncEnumerator which enumerates rows of given
  # Enumerable objects.
  def initialize(*enums)
    @gens = enums.map { |e| Generator.new(e) }
  end

# Returns the number of enumerated Enumerable objects, i.e. the size
  # of each row.
  def size
    @gens.size
  end

# Returns the number of enumerated Enumerable objects, i.e. the size
  # of each row.
  def length
    @gens.length
  end

# Returns true if the given nth Enumerable object has reached the
  # end.  If no argument is given, returns true if any of the
  # Enumerable objects has reached the end.
  def end?(i = nil)
    if i.nil?
      @gens.detect { |g| g.end? } ? true : false
    else
      @gens[i].end?
    end
  end

# Enumerates rows of the Enumerable objects.
  def each
    @gens.each { |g| g.rewind }

loop do
      count = 0

ret = @gens.map { |g|
	if g.end?
	  count += 1
	  nil
	else
	  g.next
	end
      }

if count == @gens.size
	break
      end

yield ret
    end

self
  end
end

if $0 == __FILE__
  eval DATA.read, nil, $0, __LINE__+4
end

__END__

require 'test/unit'

class TC_Generator < Test::Unit::TestCase
  def test_block1
    g = Generator.new { |g|
      # no yield's
    }

assert_equal(0, g.pos)
    assert_raises(EOFError) { g.current }
  end

def test_block2
    g = Generator.new { |g|
      for i in 'A'..'C'
        g.yield i
      end

g.yield 'Z'
    }

assert_equal(0, g.pos)
    assert_equal('A', g.current)

assert_equal(true, g.next?)
    assert_equal(0, g.pos)
    assert_equal('A', g.current)
    assert_equal(0, g.pos)
    assert_equal('A', g.next)

assert_equal(1, g.pos)
    assert_equal(true, g.next?)
    assert_equal(1, g.pos)
    assert_equal('B', g.current)
    assert_equal(1, g.pos)
    assert_equal('B', g.next)

assert_equal(g, g.rewind)

assert_equal(0, g.pos)
    assert_equal('A', g.current)

assert_equal(true, g.next?)
    assert_equal(0, g.pos)
    assert_equal('A', g.current)
    assert_equal(0, g.pos)
    assert_equal('A', g.next)

assert_equal(1, g.pos)
    assert_equal(true, g.next?)
    assert_equal(1, g.pos)
    assert_equal('B', g.current)
    assert_equal(1, g.pos)
    assert_equal('B', g.next)

assert_equal(2, g.pos)
    assert_equal(true, g.next?)
    assert_equal(2, g.pos)
    assert_equal('C', g.current)
    assert_equal(2, g.pos)
    assert_equal('C', g.next)

assert_equal(3, g.pos)
    assert_equal(true, g.next?)
    assert_equal(3, g.pos)
    assert_equal('Z', g.current)
    assert_equal(3, g.pos)
    assert_equal('Z', g.next)

assert_equal(4, g.pos)
    assert_equal(false, g.next?)
    assert_raises(EOFError) { g.next }
  end

def test_each
    a = [5, 6, 7, 8, 9]

g = Generator.new(a)

i = 0

g.each { |x|
      assert_equal(a[i], x)

i += 1

break if i == 3
    }

assert_equal(3, i)

i = 0

g.each { |x|
      assert_equal(a[i], x)

i += 1
    }

assert_equal(5, i)
  end
end

class TC_SyncEnumerator < Test::Unit::TestCase
  def test_each
    r = ['a'..'f', 1..10, 10..20]
    ra = r.map { |x| x.to_a }

a = (0...(ra.map {|x| x.size}.max)).map { |i| ra.map { |x| x[i] } }

s = SyncEnumerator.new(*r)

i = 0

s.each { |x|
      assert_equal(a[i], x)

i += 1

break if i == 3
    }

assert_equal(3, i)

i = 0

s.each { |x|
      assert_equal(a[i], x)

i += 1
    }

assert_equal(a.size, i)
  end
end

X7ROOT File Manager

Editing: generator.rb

Upload File

Create Folder