mack-facets 0.8.2 → 0.8.3

data/lib/gems/facets-2.4.5/lib/more/facets/progressbar.rb

@@ -1,253 +0,0 @@
-# = Progressbar
-#
-# ProgressBar is a text-based progressbar library.
-#
-# == Usage
-#
-#   pbar = ProgressBar.new( "Demo", 100 )
-#   100.times { pbar.inc }
-#   pbar.finish
-#
-# == Copying
-#
-# Copyright (C) 2001 Satoru Takabayashi
-#
-# 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.
-#
-# == Author
-#
-# * Satoru Takabayashi
-
-# = ProgressBar
-#
-# ProgressBar is a text-based progressbar library.
-#
-#   pbar = ProgressBar.new( "Demo", 100 )
-#   100.times { pbar.inc }
-#   pbar.finish
-#
-class ProgressBar
-
-  def initialize(title, total, out = STDERR)
-    @title = title
-    @total = total
-    @out = out
-    @bar_length = 80
-    @bar_mark = "o"
-    @total_overflow = true
-    @current = 0
-    @previous = 0
-    @is_finished = false
-    @start_time = Time.now
-    @format = "%-14s %3d%% %s %s"
-    @format_arguments = [:title, :percentage, :bar, :stat]
-    show_progress
-  end
-
-  private
-  def convert_bytes (bytes)
-    if bytes < 1024
-      sprintf("%6dB", bytes)
-    elsif bytes < 1024 * 1000 # 1000kb
-      sprintf("%5.1fKB", bytes.to_f / 1024)
-    elsif bytes < 1024 * 1024 * 1000  # 1000mb
-      sprintf("%5.1fMB", bytes.to_f / 1024 / 1024)
-    else
-      sprintf("%5.1fGB", bytes.to_f / 1024 / 1024 / 1024)
-    end
-  end
-
-  def transfer_rate
-    bytes_per_second = @current.to_f / (Time.now - @start_time)
-    sprintf("%s/s", convert_bytes(bytes_per_second))
-  end
-
-  def bytes
-    convert_bytes(@current)
-  end
-
-  def format_time(t)
-    t = t.to_i
-    sec = t % 60
-    min  = (t / 60) % 60
-    hour = t / 3600
-    sprintf("%02d:%02d:%02d", hour, min, sec);
-  end
-
-  # ETA stands for Estimated Time of Arrival.
-  def eta
-    if @current == 0
-      "ETA:  --:--:--"
-    else
-      elapsed = Time.now - @start_time
-      eta = elapsed * @total / @current - elapsed;
-      sprintf("ETA:  %s", format_time(eta))
-    end
-  end
-
-  def elapsed
-    elapsed = Time.now - @start_time
-    sprintf("Time: %s", format_time(elapsed))
-  end
-
-  def stat
-    if @is_finished then elapsed else eta end
-  end
-
-  def stat_for_file_transfer
-    if @is_finished then 
-      sprintf("%s %s %s", bytes, transfer_rate, elapsed)
-    else 
-      sprintf("%s %s %s", bytes, transfer_rate, eta)
-    end
-  end
-
-  def eol
-    if @is_finished then "\n" else "\r" end
-  end
-
-  def bar
-    len = percentage * @bar_length / 100
-    sprintf("|%s%s|", @bar_mark * len, " " *  (@bar_length - len))
-  end
-
-  def percentage
-    if @total.zero?
-      100
-    else
-      @current  * 100 / @total
-    end
-  end
-
-  def title
-    @title[0,13] + ":"
-  end
-
-  def get_width
-    # FIXME: I don't know how portable it is.
-    default_width = 80
-    begin
-      tiocgwinsz = 0x5413
-      data = [0, 0, 0, 0].pack("SSSS")
-      if @out.ioctl(tiocgwinsz, data) >= 0 then
-        rows, cols, xpixels, ypixels = data.unpack("SSSS")
-        if cols >= 0 then cols else default_width end
-      else
-        default_width
-      end
-    rescue Exception
-      default_width
-    end
-  end
-
-  def show
-    arguments = @format_arguments.map{|method| send(method)}
-    line = sprintf(@format, *arguments)
-
-    width = get_width
-    if line.length == width - 1
-      @out.print(line + eol)
-    elsif line.length >= width
-      @bar_length = [@bar_length - (line.length - width + 1), 0].max
-      if @bar_length == 0 then @out.print(line + eol) else show end
-    else #line.length < width - 1
-      @bar_length += width - line.length + 1
-      show
-    end
-  end
-
-  def show_progress
-    if @total.zero?
-      cur_percentage = 100
-      prev_percentage = 0
-    else
-      cur_percentage  = (@current  * 100 / @total).to_i
-      prev_percentage = (@previous * 100 / @total).to_i
-    end
-
-    if cur_percentage > prev_percentage || @is_finished
-      show
-    end
-  end
-
-  public
-  def file_transfer_mode
-    @format_arguments = [:title, :percentage, :bar, :stat_for_file_transfer]
-  end
-
-  def title=(str)
-    @title = str
-  end
-
-  def bar_mark=(mark)
-    @bar_mark = String(mark)[0..0]
-  end
-
-  def total_overflow=(boolv)
-    @total_overflow = boolv ? true : false
-  end
-
-  def format=(format)
-    @format = format
-  end
-
-  def format_arguments=(arguments)
-    @format_arguments = arguments
-  end
-
-  def finish
-    @current = @total
-    @is_finished = true
-    show_progress
-  end
-
-  def flush
-    @out.flush
-  end
-
-  def halt
-    @is_finished = true
-    show_progress
-  end
-
-  def set(count)
-    if count < 0
-      raise "invalid count less than zero: #{count}"
-    elsif count > @total
-      if @total_overflow
-        @total = count + 1
-      else
-        raise "invalid count greater than total: #{count}"
-      end
-    end
-    @current = count
-    show_progress
-    @previous = @current
-  end
-
-  def inc(step = 1)
-    @current += step
-    @current = @total if @current > @total
-    show_progress
-    @previous = @current
-  end
-
-  def inspect
-    "(ProgressBar: #{@current}/#{@total})"
-  end
-
-end
-
-
-module Console #:nodoc:
-  # For backward compatibility
-  ProgressBar = ::ProgressBar
-end
-

data/lib/gems/facets-2.4.5/lib/more/facets/prototype.rb

@@ -1,88 +0,0 @@
-# = Prototype
-#
-# Prototype-base Object-Oriented programming.
-#
-# == Copying
-#
-# Copyright (c) 2006, 2007 Thomas Sawyer
-
-
-# = Prototype
-#
-class Prototype
-
-  # New prototype object.
-
-  def initialize(&block)
-    @traits = []
-
-    instance_eval(&block)
-
-    h = {}
-    iv = instance_variables
-    iv.each { |k| h[k[1..-1].to_sym] = instance_eval{ instance_variable_get(k) } }
-    meta.class_eval do
-      h.each do |k,v|
-        case v
-        when Proc
-          #define_method(k){ |*args| v[*args] }
-          attr_reader k
-        else
-          attr_accessor k
-        end
-      end
-    end
-  end
-
-  def fn(&blk)
-    proc(&blk)
-  end
-
-  def new(o=nil)
-    return o.clone if o
-    return clone
-  end
-
-  def meta
-   (class << self; self; end)
-  end
-
-  def traits
-    @traits
-  end
-
-  def trait(obj)
-    traits << obj.new
-  end
-
-  def method_missing(s, *a, &b)
-    if trait = traits.find{ |t| t.method_defined?(s) }
-      trait.send(s,*a,&b)
-    else
-      super
-    end
-  end
-
-end
-
-
-module Kernel
-
-  def prototype(&block)
-    Prototype.new(&block)
-  end
-
-  #private
-
-  # Synonymous with #clone, this is an interesting
-  # method in that it promotes prototype-based Ruby.
-  # Now Classes aren't the only things that respond to #new.
-  #
-  #   "ABC".new  => "ABC"
-  #
-  def new(o=nil)
-    return o.clone if o
-    return clone
-  end
-
-end

data/lib/gems/facets-2.4.5/lib/more/facets/random.rb

@@ -1,451 +0,0 @@
-# = Random
-#
-# Randomization core extension methods.
-#
-# This library extends Object, Array, String and Hash with randomization
-# methods. Most of the methods are of one of two kinds. Either they "pick"
-# a random element from the reciever or they randomly "shuffle" the reciever.
-#
-# The most common example is Array#shuffle, which simply randmomizes the
-# order of an array's elements.
-#
-#   [1,2,3].shuffle  #=> [2,3,1]
-#
-# The other methods do similar things for their respective classes.
-#
-# == Authors
-#
-# * Ilmari Heikkinen <mailto:kig@misfiring.net>
-# * Christian Neukirchen <mailto:chneukirchen@gmail.com>
-# * Thomas Sawyer
-#
-# == Copying
-#
-# Copyright (c) 2005 Ilmari Heikkinen, Christian Neukirchen, 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.
-
-require 'facets/hash/zipnew'
-require 'facets/string/shatter'
-
-# = Random
-#
-# Randomization core extension methods.
-#
-# This library extends Array, String and Hash with randomization methods.
-# Most of the methods are of one of two kinds. Either they "pick" a random
-# element from the reciever or they randomly "shuffle" the reciever.
-#
-# The most common example is Array#shuffle, which simply randmomizes the
-# order of an array's elements.
-#
-#   [1,2,3].shuffle  #=> [2,3,1]
-#
-# The other methods do similar things for their respective classes.
-#
-module Random
-
-  class << self
-    # alias to Kernel method #rand.
-    alias_method :number, :rand
-    public :number
-  end
-
-  #def self.number(*args)
-  #  ::Kernel.rand(*args)
-  #end
-
-  #
-  def self.append_features(mod)
-    if mod == ::Object
-      mod.send(:include, Random::Object)
-    elsif mod == ::Array
-      mod.send(:include, Random::Array)
-    elsif mod == ::Hash
-      mod.send(:include, Random::Hash)
-    elsif mod == ::String
-      mod.send(:include, Random::String)
-    else
-      raise TypeError
-    end
-  end
-
-  module Object
-
-    # Random generator that returns true or false.
-    # Can also take a block that has a 50/50 chance to being executed.
-    #
-    #   maybe  #=> true
-    #   maybe  #=> false
-    #
-    def maybe(chance = 0.5, &block)
-      if block then
-        yield if rand < chance
-      else
-        rand < chance
-      end
-    end
-
-  end
-
-  #
-
-  module Array
-
-    # Return a random element of the array.
-    #
-    #   [1, 2, 3, 4].at_rand           #=> 2
-    #   [1, 2, 3, 4].at_rand           #=> 4
-    #
-    def at_rand
-      at(Random.number(size))
-    end
-
-    # Same as #at_rand, but acts in place removing a
-    # random element from the array.
-    #
-    #   a = [1,2,3,4]
-    #   a.at_rand!       #=> 2
-    #   a                #=> [1,3,4]
-    #
-    def at_rand!
-      return delete_at( Random.number( size ) )
-    end
-
-    # Similar to #at_rand, but will return an array of randomly
-    # picked exclusive elements if given a number.
-    def pick(n=nil)
-      if n
-        a = self.dup
-        a.pick!(n)
-      else
-        at(Random.number(size))
-      end
-    end
-
-    # Similar to #at_rand!, but given a number will return
-    # an array of exclusive elements.
-    def pick!(n=nil)
-      if n
-        if n > self.size
-          r = self.dup
-          self.replace([])
-          r
-        else
-          r = []
-          n.times { r << delete_at(Random.number(size)) }
-          r
-        end
-      else
-        delete_at(Random.number(size))
-      end
-    end
-
-    # Random index.
-    #
-    def rand_index
-      Random.number(size)
-    end
-
-    # Returns a random subset of an Array. If a _number_
-    # of elements is specified then returns that number of
-    # elements, otherwise returns a random number of elements
-    # upto the size of the Array.
-    #
-    # By defualt the returned values are exclusive of
-    # each other, but if _exclusive_ is set to <tt>false</tt>,
-    # the same values can be choosen more than once.
-    #
-    # When _exclusive_ is <tt>true</tt> (the default) and the
-    # _number_ given is greater than the size of the array,
-    # then all values are returned.
-    #
-    #   [1, 2, 3, 4].rand_subset(1)        #=> [2]
-    #   [1, 2, 3, 4].rand_subset(4)        #=> [2, 1, 3, 4]
-    #   [1, 2, 3, 4].rand_subset           #=> [1, 3, 4]
-    #   [1, 2, 3, 4].rand_subset           #=> [2, 3]
-    #
-    def rand_subset( number=nil, exclusive=true )
-      number = Random.number(size) unless number
-      number = number.to_int
-      #return self.dup if (number >= size and exlusive)
-      return sort_by{rand}.slice(0,number) if exclusive
-      ri =[]; number.times { |n| ri << Random.number(size) }
-      return values_at(*ri)
-    end
-
-    # Randomize the order of an array.
-    #
-    #   [1,2,3,4].shuffle  #=> [2,4,1,3]
-    #
-    def shuffle
-      dup.shuffle!
-      #sort_by{Random.number}
-    end
-
-    # As with #shuffle but modifies the array in place.
-    # The algorithm used here is known as a Fisher-Yates shuffle.
-    #
-    #   a = [1,2,3,4]
-    #   a.shuffle!
-    #   a  #=> [2,4,1,3]
-    #
-    # CREDIT Niel Spring
-
-    def shuffle!
-      s = size
-      each_index do |j|
-        i = Random.number(s-j)
-        #self[j], self[j+i] = self[j+i], self[j]
-        tmp = self[j]
-        self[j] = self[j+i]
-        self[j+i] = tmp
-      end
-      self
-    end
-
-  end
-
-  #
-
-  module Hash
-
-    # Returns a random key.
-    #
-    #   {:one => 1, :two => 2, :three => 3}.pick_key  #=> :three
-    #
-    def rand_key
-      keys.at(Random.number(keys.size))
-    end
-
-    # Delete a random key-value pair, returning the key.
-    #
-    #   a = {:one => 1, :two => 2, :three => 3}
-    #   a.pick_key!  #=> :two
-    #   a            #=> {:one => 1, :three => 3}
-    #
-    def rand_key!
-      k,v = rand_pair
-      delete(k)
-      return k
-    end
-
-    alias_method( :pick_key, :rand_key! )
-
-    # Returns a random key-value pair.
-    #
-    #   {:one => 1, :two => 2, :three => 3}.pick  #=> [:one, 1]
-    #
-    def rand_pair
-      k = rand_key
-      return k, fetch(k)
-    end
-
-    # Deletes a random key-value pair and returns that pair.
-    #
-    #   a = {:one => 1, :two => 2, :three => 3}
-    #   a.rand_pair!  #=> [:two, 2]
-    #   a             #=> {:one => 1, :three => 3}
-    #
-    def rand_pair!
-      k,v = rand_pair
-      delete( k )
-      return k,v
-    end
-
-    alias_method( :pick_pair, :rand_pair! )
-
-    # Returns a random hash value.
-    #
-    #   {:one => 1, :two => 2, :three => 3}.rand_value  #=> 2
-    #   {:one => 1, :two => 2, :three => 3}.rand_value  #=> 1
-    #
-    def rand_value
-      fetch(rand_key)
-    end
-
-    # Deletes a random key-value pair and returns the value.
-    #
-    #   a = {:one => 1, :two => 2, :three => 3}
-    #   a.at_rand!  #=> 2
-    #   a           #=> {:one => 1, :three => 3}
-    #
-    def rand_value!
-      k,v = rand_pair
-      delete( k )
-      return v
-    end
-
-    alias_method( :pick, :rand_value! )
-
-    alias_method( :at_rand, :rand_value )
-    alias_method( :at_rand!, :rand_value! )
-
-    # Returns a copy of the hash with _values_ arranged
-    # in new random order.
-    #
-    #   h = {:a=>1, :b=>2, :c=>3}
-    #   h.shuffle_hash  #=> {:b=>2, :c=>1, :a>3}
-    #
-    def shuffle
-      ::Hash.zipnew( keys.sort_by{Random.number}, values.sort_by{Random.number} )
-    end
-
-    # Destructive shuffle_hash. Arrange the values in
-    # a new random order.
-    #
-    #   h = {:a => 1, :b => 2, :c => 3}
-    #   h.shuffle_hash!
-    #   h  #=> {:b=>2, :c=>1, :a=>3}
-    #
-    def shuffle!
-      self.replace(shuffle)
-    end
-
-  end
-
-  #
-
-  module String
-
-    def self.included(base)
-      base.extend(Self)
-    end
-
-    # Class-level methods.
-
-    module Self
-
-      # Returns a randomly generated string. One possible use is
-      # password initialization. Takes a max legnth of characters
-      # (default 8) and an optional valid char Regexp (default /\w\d/).
-      #
-      #--
-      # CREDIT George Moschovitis
-      #
-      # NOTE This is not very efficient. Better way?
-      #++
-
-      def random(max_length = 8, char_re = /[\w\d]/)
-        # gmosx: this is a nice example of input parameter checking.
-        # this is NOT a real time called method so we can add this
-        # check. Congrats to the author.
-        raise ArgumentError.new('char_re must be a regular expression!') unless char_re.is_a?(Regexp)
-        string = ""
-        while string.length < max_length
-            ch = Random.number(255).chr
-            string << ch if ch =~ char_re
-        end
-        return string
-      end
-
-      # Module method to generate a random letter.
-      #
-      #   String::Random.rand_letter  #=> "q"
-      #   String::Random.rand_letter  #=> "r"
-      #   String::Random.rand_letter  #=> "a"
-      #
-      def rand_letter
-        (Random.number(26) + (Random.number(2) == 0 ? 65 : 97) ).chr
-      end
-
-    end
-
-    # Return a random separation of the string.
-    # Default separation is by charaacter.
-    #
-    #   "Ruby rules".at_rand(' ')  #=> ["Ruby"]
-    #
-    def at_rand( separator=// )
-      #separator = self.class.patterns( separator )
-      self.split(separator,-1).at_rand
-    end
-
-    # Return a random separation while removing it
-    # from the string. Default separation is by character.
-    #
-    #   s = "Ruby rules"
-    #   s = at_rand!(' ')  #=> "Ruby"
-    #   s                  #=> "rules"
-    #
-    def at_rand!( separator=// )
-      #separator = self.class.patterns( separator )
-      a = self.shatter( separator )
-      w = []; a.each_with_index { |s,i| i % 2 == 0 ? w << s : w.last << s }
-      i = Random.number(w.size)
-      r = w.delete_at( i )
-      self.replace( w.join('') )
-      return r
-    end
-
-    # Return a random byte of _self_.
-    #
-    #   "Ruby rules".rand_byte  #=> 121
-    #
-    def rand_byte
-      self[Random.number(size)]
-    end
-
-    # Destructive rand_byte. Delete a random byte of _self_ and return it.
-    #
-    #   s = "Ruby rules"
-    #   s.rand_byte!      #=> 121
-    #   s                 #=> "Rub rules"
-    #
-    def rand_byte!
-      i = Random.number(size)
-      rv = self[i,1]
-      self[i,1] = ''
-      rv
-    end
-
-    # Return a random string index.
-    #
-    #   "Ruby rules".rand_index  #=> 3
-    #
-    def rand_index
-      Random.number(size)
-    end
-
-    # Return the string with seperated sections arranged
-    # in a random order. The default seperation is by character.
-    #
-    #   "Ruby rules".shuffle  #=> "e lybRsuur"
-    #
-    def shuffle(separator=//)
-      split(separator).shuffle.join('')
-    end
-
-    # In place version of shuffle.
-    #
-    def shuffle!(separator=//)
-      self.replace( shuffle(separator) )
-    end
-
-  end
-
-end
-
-class Object
-  include Random
-end
-
-class Array
-  include Random
-end
-
-class Hash
-  include Random
-end
-
-class String
-  include Random
-end
-