facets 1.0.3 → 1.1.0

data/packages/more/lib/facet/interval.rb

@@ -1,426 +0,0 @@
-#--
-# Interval
-#
-# Copyright (c) 2004,2005 Thomas Sawyer
-#
-# Ruby License
-#
-# This module is free software. You may use, modify, and/or redistribute this
-# software under the same terms as Ruby.
-#
-# This program 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.
-#
-#
-# ==========================================================================
-# Revision History ::
-# --------------------------------------------------------------------------
-#  04.06   Trans    * Minor modifications to documentation.
-# ==========================================================================
-#
-# NOTE Still need to tie in Infinity.
-#
-#++
-
-#:title: Interval
-#
-# While Ruby support the Range class out of the box, is does not quite
-# fullfil the role od a real Interval class. For instance, it does
-# not support excluding the front sentinel. This is because Range
-# also tries to do triple duty as a simple Sequence and as a simple Tuple-Pair,
-# thus limiting its potential as an Interval. The Interval class remedies
-# the situation by commiting to interval behavior, and then extends the class'
-# capabilites beyond that of the standard Range in ways that naturally
-# fall out of that.
-#
-# Range depends on two methods: #succ and #<=>. If numeric
-# ranges were the only concern, those could just as well be #+ and #<=>,
-# but esoteric forms make that unfeasible --the obvious example being a String
-# range. But a proper Interval class requires mathematical continuation,
-# thus the Interval depends on #+ and #<=>, as well as #- as the inverse of #+.
-#
-# == Synopsis
-#
-#   require 'calibre/interval'
-#
-#   i = Interval.new(1,5)
-#   i.to_a       #=> [1,2,3,4,5]
-#
-#   i = Interval[0,5]
-#   i.to_a(2)    #=> [0,2,4]
-#
-#   i = Interval[1,5]
-#   i.to_a(-1)   #=> [5,4,3,2,1]
-#
-#   i = Interval[1,3]
-#   i.to_a(1,2)  #=> [1.0,1.5,2.0,2.5,3.0]
-#
-# == Author(s)
-#
-# * Thomas Sawyer
-#
-
-require 'facet/multiton'
-require 'facet/enumerablepass'
-#require 'facet/infinity'
-
-class Interval
-
-  include Multiton
-  include EnumerablePass
-
-  def self.[]( *args )
-    self.new( *args )
-  end
-
-  def initialize(first, last, exclude_first=false, exclude_last=false )
-    raise ArgumentError, "bad value for interval" if first.class != last.class
-    @first = first
-    @last = last
-    @exclude_first = exclude_first
-    @exclude_last = exclude_last
-    @direction = (@last <=> @first)
-  end
-
-  # Returns a two element array of first and last sentinels.
-  #
-  #  (0..10).sentinels   #=> [0,10]
-  #
-  def sentinels
-    return [@first, @last]
-  end
-
-  # Returns the first or last sentinal of the interval.
-  def first ; @first ; end
-  def last ; @last ; end
-
-  #
-  def exclude_first? ; @exclude_first ; end
-  def exclude_last? ; @exclude_last ; end
-
-  # (IMHO) these should be deprectated
-  alias_method( :begin, :first )
-  alias_method( :end, :last )
-  alias_method( :exclude_begin?, :exclude_first? )
-  alias_method( :exclude_end?, :exclude_last? )
-
-  # Returns +true+ if the start and end sentinels are equal and the interval is closed; otherwise +false+.
-  def degenerate? ; @direction == 0 and ! (@exclusive_first or @exclusive_last) ;  end
-
-  # Returns +true+ if the start and end sentinels are equal and the interval is open; otherwise +false+.
-  def null? ; @direction == 0 and @exclusive_first and @exclusive_last ; end
-
-  # Returns the direction of the interval indicated by +1, 0 or -1.
-  #
-  #   (1..5).direction  #=> 1
-  #   (5..1).direction  #=> -1
-  #   (1..1).direction  #=> 0
-  #
-  def direction ; @direction ; end
-
-  # Returns a new interval inclusive of of both sentinels.
-  def closed; Interval.new(@first, @last, true, true) ; end
-
-  # Returns a new interval exclusive of both sentinels.
-  def opened; Interval.new(@first, @last, true, true) ; end
-
-  # Returns a new interval with either the first or the last sentinel exclusive.
-  # If the parameter is false, the deafult, then the first sentinel is excluded;
-  # if the parameter is true, the last sentinel is excluded.
-  def half_closed(e=false)
-    e ? Interval.new(@first, @last, true, false) : Interval.new(@first, @last, false, true)
-  end
-
-  # Returns a new interval with one of the two sentinels opened or closed
-  def first_closed ; Interval.new(@first, @last, false, true) ; end
-  def last_closed ; Interval.new(@first, @last, true, false) ; end
-  def first_opened ; Interval.new(@first, @last, true, false) ; end
-  def last_opened ; Interval.new(@first, @last, false, true) ; end
-
-  # Unary shorthands. These return a new interval exclusive of first,
-  # last or both sentinels, repectively.
-  def +@ ; Interval.new(first, last, true, false) ; end
-  def -@ ; Interval.new(first, last, false, true) ; end
-  def ~@ ; Interval.new(first, last, true, true) ; end
-
-  # Returns a new interval with the sentinels reversed.
-  #
-  #   (0..10).reversed  #=> 10..0
-  #
-  def reversed
-    Interval.new(@last, @first, true, true)
-  end
-
-  # Returns the length of the interval as the difference between
-  # the first and last elements. Returns +nil+ if the sentinal objects
-  # do not support distance comparison (#distance).
-  # TODO: Add +n+ parameter to count segmentations like those produced by #each.
-  def distance
-    @last - @first
-    #if @last.respond_to?( :distance )
-    #  @last.distance( @first )
-    #else
-    #  #self.to_a.length
-    #end
-  end
-  alias_method( :length, :distance )
-  alias_method( :size, :distance )
-
-  # Returns the lesser of the first and last sentinals.
-  def min
-    ((@first <=> @last) == -1) ? @first : @last
-  end
-
-  # Returns the greater of the first and last sentinals.
-  def max
-    ((@first <=> @last) == 1) ? @first : @last
-  end
-
-  # Returns true or false if the element is part of the interval.
-  def include?(x)
-    # todo: infinity?   
-    tf = exclude_first? ? 1 : 0
-    tl = exclude_last? ? -1 : 0
-    (x <=> first) >= tf and (x <=> last) <= tl
-  end
-  alias_method( :===, :include? )
-  alias_method( :member?, :include? )
-
-=begin
-#     def include?(x)
-#       tf = exclude_first? ? 1 : 0
-#       tl = exclude_last? ? -1 : 0
-#       # if other classes handled Infinity in their <=> method
-#       # (which probably they should) this clause would not be required
-#       if first.kind_of?(InfinityClass)
-#         ft = ((first <=> x) <= tf)
-#       else
-#         ft = (x <=> first) >= tf
-#       end
-#       if last.kind_of?(InfinityClass)
-#         fl = ((last <=> x) >= tl)
-#       else
-#         fl = (x <=> last) <= tl
-#       end
-#       ft && fl
-#     end
-=end
-
-  # Iterates over the interval, passing each _n_th element to the block. 
-  # If n is not given then n defaults to 1. Each _n_th step is determined
-  # by invoking +\++ or +\-+ n, depending on the direction of the interval.
-  # If n is negative the iteration is preformed in reverse form end sentinal
-  # to front sentinal. A second parameter, d, can be given in which case
-  # the applied step is calculated as a fraction of the interval's length
-  # times n / d. This allows iteration over the whole interval in equal sized
-  # segments.
-  #
-  #   1..5.each { |e| ... }        #=> 1 2 3 4 5
-  #   1..5.each(2) { |e| ... }     #=> 1 3 5
-  #   1..5.each(1,2) { |e| ... }   #=> 1.0 1.5 2.0 2.5 3.0 3.5 4.0 4.5 5.0
-  #
-  def each(n=1, d=nil)  # :yield:   
-    return (n < 0 ? @last : @first) if degenerate?  # is this right for all values of n ?
-    s = d ? self.length.to_f * (n.to_f / d.to_f) : n.abs
-    raise "Cannot iterate over zero length steps." if s == 0
-    s = s * @direction
-    if n < 0
-      e = @exclude_last ? @last - s : @last
-      #e = @exclude_last ? @last.pred(s) : @last
-      t = @exlude_last ? 1 : 0
-      #while e.cmp(@first) >= t
-      while (e <=> @first) >= t
-        yield(e)
-        e -= s
-        #e = e.pred(s)
-      end
-    else
-      e = @exclude_first ? @first + s : @first
-      #e = @exclude_first ? @first.succ(s) : @first
-      t = @exlude_last ? -1 : 0
-      #while e.cmp(@last) <= t
-      while (e <=> @last) <= t
-        yield(e)
-        e += s
-        #e = e.succ(s)
-      end
-    end
-  end
-  alias_method( :step, :each )
-
-  # Should there be a #reverse_each ?
-  # Since #each can now take a negative argument, this isn't really needed.
-  # Should it exist anyway and routed to #each?
-  # Also, alias_method( :reverse_step, :reverse_each )
-
-  # Compares two intervals to see if they are equal
-  def eql?(other)
-    return false unless @first == other.first
-    return false unless @last == other.last
-    return false unless @exclude_first == other.exclude_first?
-    return false unless @exclude_last == other.exclude_last?
-    true
-  end
-
-end
-
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-
-=begin testing
-
-  require 'test/unit'
-
-  class InclusiveTest < Test::Unit::TestCase
-
-    def setup
-      @a = Interval.new( 1, 10 )
-      @b = Interval.new( 1, 10, true, false )
-      @c = Interval.new( 1, 10, false, true )
-      @d = Interval.new( 1, 10, true, true )
-    end
-
-    def test_001A ; assert_equal( false, @a.include?(0)  ) ; end
-    def test_002A ; assert_equal( true,  @a.include?(1)  ) ; end
-    def test_003A ; assert_equal( true,  @a.include?(2)  ) ; end
-    def test_004A ; assert_equal( true,  @a.include?(9)  ) ; end
-    def test_005A ; assert_equal( true,  @a.include?(10) ) ; end
-    def test_006A ; assert_equal( false, @a.include?(11) ) ; end
-
-    def test_001B ; assert_equal( false, @b.include?(0)  ) ; end
-    def test_002B ; assert_equal( false, @b.include?(1)  ) ; end
-    def test_003B ; assert_equal( true,  @b.include?(2)  ) ; end
-    def test_004B ; assert_equal( true,  @b.include?(9)  ) ; end
-    def test_005B ; assert_equal( true,  @b.include?(10) ) ; end
-    def test_006B ; assert_equal( false, @b.include?(11) ) ; end
-
-    def test_001C ; assert_equal( false, @c.include?(0)  ) ; end
-    def test_002C ; assert_equal( true,  @c.include?(1)  ) ; end
-    def test_003C ; assert_equal( true,  @c.include?(2)  ) ; end
-    def test_004C ; assert_equal( true,  @c.include?(9)  ) ; end
-    def test_005C ; assert_equal( false, @c.include?(10) ) ; end
-    def test_006C ; assert_equal( false, @c.include?(11) ) ; end
-
-    def test_001D ; assert_equal( false, @d.include?(0)  ) ; end
-    def test_002D ; assert_equal( false, @d.include?(1)  ) ; end
-    def test_003D ; assert_equal( true,  @d.include?(2)  ) ; end
-    def test_004D ; assert_equal( true,  @d.include?(9)  ) ; end
-    def test_005D ; assert_equal( false, @d.include?(10) ) ; end
-    def test_006D ; assert_equal( false, @d.include?(11) ) ; end
-
-  end
-
-  class LrgNumericTest < Test::Unit::TestCase
-
-    def setup
-      @a = Interval.new(0,100000000)
-      @b = Interval.new(0,100000000)
-    end
-
-    def test_001A ; assert_equal( true,  @a.include?(0)         ) ; end
-    def test_002A ; assert_equal( true,  @a.include?(1000)      ) ; end
-    def test_003A ; assert_equal( true,  @a.include?(1000000)   ) ; end
-    def test_004A ; assert_equal( true,  @a.include?(100000000) ) ; end
-    #def test_005A ; assert_equal( false, @a.include?(INFINITY)  ) ; end
-
-    def test_001B ; assert_equal( true,  @b.include?(0)         ) ; end
-    def test_002B ; assert_equal( true,  @b.include?(5)         ) ; end
-    def test_002B ; assert_equal( true,  @b.include?(70007)     ) ; end
-    def test_002B ; assert_equal( true,  @b.include?(5000005)   ) ; end
-    #def test_002B ; assert_equal( false, @b.include?(INFINITY)  ) ; end
-
-  end
-
-  class SelectTest < Test::Unit::TestCase
-
-    def setup
-      @a = Interval.new( 0,10 )
-    end
-
-    def test_001
-      b = @a.collect( 2 ){ |n| n }
-      assert_equal( [0,2,4,6,8,10], b )
-    end
-
-    def test_002
-      b = @a.select{ |n| n % 2 == 0 }
-      assert_equal( [0,2,4,6,8,10], b )
-    end
-
-    def test_003
-      b = @a.collect( 1,2 ){ |n| n }
-      assert_equal( [0,5,10], b )
-    end
-
-    def test_004
-      b = @a.select( 1,2 ){ |n| n % 2 == 0 }
-      assert_equal( [0,10], b )
-    end
-
-  end
-
-  class ArrayTest < Test::Unit::TestCase
-
-    def setup
-      @a = Interval.new( 0,10 ) 
-      @b = Interval.new( 0,1 ) 
-    end
-
-    def test_001A ; assert_equal( [0,5,10], @a.to_a(1,2) ) ; end
-
-    def test_001B ; assert_equal( [0, 0.25, 0.5, 0.75, 1.0], @b.to_a(1,4) ) ; end
-
-  end
-
-=end
-
-=begin
-  class InfTest < Test::Unit::TestCase
-
-    def setup
-      @a = Interval.new( -INFINITY, -3 )
-      @b = Interval.new( -INFINITY, -3, true, false )
-      @c = Interval.new( -3, INFINITY )
-      @d = Interval.new( -INFINITY, INFINITY )
-      @e = Interval.new( -3, -2 )
-    end
-
-    def test_001A ; assert_equal( true,  @a.include?(-INFINITY) ) ; end
-    def test_002A ; assert_equal( true,  @a.include?(-4)        ) ; end
-    def test_003A ; assert_equal( true,  @a.include?(-3)        ) ; end
-    def test_004A ; assert_equal( false, @a.include?(-2)        ) ; end
-    def test_005A ; assert_equal( false, @a.include?(INFINITY)  ) ; end
-
-    def test_001B ; assert_equal( true,  @b.include?(-INFINITY) ) ; end
-    def test_002B ; assert_equal( true,  @b.include?(-4)        ) ; end
-    def test_003B ; assert_equal( false, @b.include?(-3)        ) ; end
-    def test_004B ; assert_equal( false, @b.include?(-2)        ) ; end
-    def test_005B ; assert_equal( false, @b.include?(INFINITY)  ) ; end
-
-    def test_001C ; assert_equal( false, @c.include?(-INFINITY) ) ; end
-    def test_002C ; assert_equal( false, @c.include?(-4)        ) ; end
-    def test_003C ; assert_equal( true,  @c.include?(-3)        ) ; end
-    def test_004C ; assert_equal( true,  @c.include?(-2)        ) ; end
-    def test_005C ; assert_equal( true,  @c.include?(INFINITY)  ) ; end
-
-    def test_001D ; assert_equal( true,  @d.include?(-INFINITY) ) ; end
-    def test_002D ; assert_equal( true,  @d.include?(-4)        ) ; end
-    def test_003D ; assert_equal( true,  @d.include?(-3)        ) ; end
-    def test_004D ; assert_equal( true,  @d.include?(-2)        ) ; end
-    def test_005D ; assert_equal( true,  @d.include?(INFINITY)  ) ; end
-
-    def test_001E ; assert_equal( false, @e.include?(-INFINITY) ) ; end
-    def test_002E ; assert_equal( false, @e.include?(-4)        ) ; end
-    def test_003E ; assert_equal( true,  @e.include?(-3)        ) ; end
-    def test_004E ; assert_equal( true,  @e.include?(-2)        ) ; end
-    def test_005E ; assert_equal( false, @e.include?(INFINITY)  ) ; end
-
-  end
-=end

data/packages/more/lib/facet/ioredirect.rb

@@ -1,130 +0,0 @@
-#--
-# IORedirect
-#
-# Copyright (C) 2002 Paul Brannan <paul@atdesk.com>
-# (Ported from Ruby Treasures)
-#
-# Ruby License
-#
-# This module is free software. You may use, modify, and/or redistribute this
-# software under the same terms as Ruby.
-#
-# This program 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.
-#
-#
-# ==========================================================================
-# Revision History ::
-# --------------------------------------------------------------------------
-#  2004-09  Trans    * Ported to Calibre.
-# ==========================================================================
-#++
-
-#:title: IORedirect
-#
-# A class to redirect $stdout, or other IO object, to a StringIO object,
-# or any other object with a write() method.
-#
-# == Synopsis
-#
-#   require 'mega/io-redirect'
-#
-#   s = StringIO.new
-#   r = Redirector.redirect($stdout, s) do
-#     $stdout.puts "this is a test"
-#   end
-#
-# == Author(s)
-#
-# * Paul Brannan
-#
-
-class IORedirect
-
-  # Start redirection from one IO object to any other object with a
-  # write() method. +from+ is the IO object to redirect from,
-  # and +to+ is the object to redirect to.
-  def initialize(from, to)
-    @from = from
-    @to = to
-    start()
-  end
-
-  # Start redirection, if it has not already been started.
-  def start
-    raise "Redirection already in progress" if @t
-    tmp = @from.dup        
-    r, w = IO.pipe
-    @from.reopen(w)
-    @t = Thread.new do
-      begin
-        loop do
-          s = r.read(1) # TODO: can I make this buffered?
-          @to.write(s)
-        end
-      ensure
-        @from.reopen(tmp)
-        @t = nil
-      end
-    end
-  end
-
-  # Stop redirection, if it is occurring
-  def stop
-    raise "Redirection already stopped" if not @t
-    @t.kill
-  end
-
-  # An exception-safe class method for redirection
-  def self.redirect(from, to)
-    s = self.new(from, to)
-    begin
-      yield
-    ensure
-      s.stop
-    end
-  end
-end
-
-
-# --- test ---
-
-if __FILE__ == $0 then
-  
-  class SimpleStringIO
-    attr_reader :str
-    def initialize; @str = ''; end
-    def write(str); @str << str; end
-  end
-
-  Thread.abort_on_exception = true
-  s = SimpleStringIO.new
-  r = Redirector.redirect($stdout, s) do
-    $stdout.puts "this is a test"
-    $stdout.puts "of the StringIO redirection system"
-  end
-  puts "Done redirecting."
-  puts "Result:\n#{s.str}"
-
-end
-
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-
-# TODO
-
-=begin #testing
-
-  require 'test/unit'
-
-=end
-
-
-