facets 2.9.2 → 2.9.3

data/src/core/facets/indexable.rb

@@ -1,270 +0,0 @@
-# = Indexable
-#
-# Indexable is a mixin that provides index based methods,
-# working soley with four methods: #index, #slice, #splice
-# and #size.
-#
-# These methods work in harmony. Where #index returns a
-# position of a given element, #slice returns elements
-# for given positions. #splice is like #slice but replaces
-# the given position with new values. This mehtod is not
-# part of ruby core, but it generally just an alias for #[]=,
-# just as #slice is an alias of #[]. #size of course simply
-# returns the total length of the indexable object.
-#
-# NOTE: To test the folowing methods Indexable needs to be
-# included into Array and array must have #splice defined.
-#
-#   require 'facets/array/splice'
-#
-#   class ::Array
-#     include Indexable
-#   end
-# 
-# CREDIT: Thomas Sawyer
-
-module Indexable
-
-  # Like #first but returns the first element
-  # in a new array.
-  #
-  #   [1,2,3].head  #=> [1]
-  #
-  def head
-    slice(0,1)
-  end
-
-  # Returns an array from second element to last element.
-  #
-  #   [1,2,3].tail  #=> [2,3]
-  #
-  def tail
-    slice(1,length-1)
-  end
-
-  # Like #last, returning the last element
-  # in an array.
-  #
-  #   [1,2,3].foot  #=> [3]
-  #
-  def foot
-    slice(-1,1)
-  end
-
-  # Returns an array of the first element upto,
-  # but not including, the last element.
-  #
-  #   [1,2,3].body  #=> [1,2]
-  #
-  #--
-  # Better name for this? (bulk, perhaps?)
-  #++
-  #
-  def body
-    slice(0,size-1)
-  end
-
-  # Returns the middle element of an array, or the element offset
-  # from middle if the parameter is given. Even-sized arrays,
-  # not having an exact middle, return the middle-right element.
-  #
-  #   [1,2,3,4,5].mid        #=> 3
-  #   [1,2,3,4,5,6].mid      #=> 4
-  #   [1,2,3,4,5,6].mid(-1)  #=> 3
-  #   [1,2,3,4,5,6].mid(-2)  #=> 2
-  #   [1,2,3,4,5,6].mid(1)   #=> 5
-  #
-  # In other words, If there are an even number of elements the
-  # higher-indexed of the two center elements is indexed as
-  # orgin (0).
-  #
-  def mid(offset=0)
-    slice((size / 2) + offset)
-  end
-
-  # Returns an Array of the middle element(s) of an array.
-  # Even-sized arrays, not having an exact middle, return
-  # a two-element array of the two middle elements.
-  #
-  #   [1,2,3,4,5].middle        #=> [3]
-  #   [1,2,3,4,5,6].middle      #=> [3,4]
-  #
-  # A +birth+ can be give to widen the middle on either side.
-  #
-  #   [1,2,3,4,5].middle(1)   #=> [2,3,4]
-  #   [1,2,3,4,5,6].middle(1)   #=> [2,3,4,5]
-  #
-  # In contrast to #mid which utilizes an offset.
-  #
-  def middle(birth=0)
-    i = size / 2 - birth
-    if size % 2 == 0
-      slice(i - 1, 2 + (2 * birth))
-    else
-      slice(i, 1 + (2 * birth))
-    end
-  end
-
-  # Fetch values from a start index thru an end index.
-  #
-  #   [1,2,3,4,5].thru(0,2)  #=> [1,2,3]
-  #   [1,2,3,4,5].thru(2,4)  #=> [3,4,5]
-  #
-  #   [1,2,3,4,5].thru(2)  #=> [1,2,3]
-  #   [1,2,3,4,5].thru(4)  #=> [1,2,3,4,5]
-  #
-  def thru(from, to=nil)
-    from, to = 0, from unless to
-    to = size - 1 if to >= size
-    a = []
-    i = from
-    while i <= to
-      a << slice(i)
-      i += 1
-    end
-    a
-  end
-
-  # Returns last _n_ elements.
-  #
-  #   %w{W o r l d}.from(3)  #=> %w{l d}
-  #
-  def from(i)
-    return self if i >= size
-    slice(i, size - i) #slice(-n..-1)
-  end
-
-  ## DEPRECATED: use #thru instead
-  ## Returns first _n_ elements.
-  ##
-  ##   %w{H e l l o}.upto(3)  #=> %w{H e l l}
-  ##
-  ##def upto(n)
-  ##  slice(0, n.to_i+1)
-  ##end
-
-  # Returns first _n_ elements.
-  #
-  #   %w{H e l l o}.first(3)  #=> %w{H e l}
-  #
-  def first(n=1)
-    slice(0, n.to_i)
-  end
-
-  # Returns last _n_ elements.
-  #
-  #   %w{H e l l o}.last(3)  #=> %w{l l o}
-  #
-  def last(n=1)
-    n = n.to_i
-    return self if n > size
-    slice(-n, n) #slice(-n..-1)
-  end
-
-  # Change the first element.
-  #
-  #   a = ["a","y","z"]
-  #   a.first = "x"
-  #   a           #=> ["x","y","z"]
-  #
-  def first=(x)
-    splice(0,x)
-  end
-
-  # Change the last element.
-  #
-  #   a = [1,2,5]
-  #   a.last = 3
-  #   a           #=> [1,2,3]
-
-  def last=(x)
-    splice(-1,x)
-  end
-
-  # Remove and return the first element.
-  #
-  #   a = [1,2,3]
-  #   a.first!      #=> 1
-  #   a             #=> [2,3]
-  #
-  def first!
-    splice(0)
-  end
-
-  # Remove and return the last element.
-  #
-  #   a = [1,2,3]
-  #   a.last!       #=> 3
-  #   a             #=> [1,2]
-  #
-  def last!
-    splice(-1)
-  end
-
-  # A shorting of "ends at", returns the
-  # last index of the indexable object.
-  # Returns nil if there are no elements.
-  #
-  #   [1,2,3,4,5].ends  #=> 4
-  #
-  # This nearly equivalent to +size - 1+.
-  #
-  def ends
-    return nil if size == 0
-    size - 1
-  end
-
-  # Returns the positive ordinal index given
-  # a cardinal position, 1 to n or -n to -1.
-  #
-  #   [1,2,3,4,5].pos(1)   #=> 0
-  #   [1,2,3,4,5].pos(-1)  #=> 4
-  #
-  def pos(i)
-    if i > 0
-      return i - 1
-    else
-      size + i
-    end
-  end
-
-  # Returns the index of the first element equal to the
-  # given object or satisfying the block condition.
-  #
-  #   [1,2,3,4].index{ |e| e == 3 }  #=> 2
-  #   [1,2,3,4].index{ |e| e > 3 }   #=> 3
-  #
-  def index(obj=nil, &block)
-    if block_given?
-      size.times do |i|
-        return i if yield(slice(i))
-      end
-    else
-      size.times do |i|
-        return i if obj == slice(i)
-      end
-    end
-    nil
-  end
-
-  # to be deprecated
-  alias_method :index_of, :index
-
-  # TODO Maybe #range could use a little error catch code (todo).
-
-  # Returns the index range between two elements. If no elements are
-  # given, returns the range from first to last.
-  #
-  #   ['a','b','c','d'].range            #=> (0..3)
-  #   ['a','b','c','d'].range('b','d')   #=> (1..3)
-  #
-  def range(a=nil,z=-1)
-    if a
-      index(a)..index(z)
-    else
-      (0..(size-1))
-    end
-  end
-
-end
-

data/src/core/facets/instance.rb

@@ -1,157 +0,0 @@
-module Kernel
-  INSTANCES = {}
-
-  # Returns an instance of Instance for +self+,
-  # which allows convenient access to an object's
-  # internals.
-
-  def instance
-    INSTANCES[self] ||= Instance.new(self)
-  end
-
-end
-
-# = Instance Class
-#
-#   class Friend
-#     attr_accessor :name, :age, :phone
-#     def initialize(name, age, phone)
-#       @name, @age, @phone = name, age, phone
-#     end
-#   end
-#
-#   f1 = Friend.new("John", 30, "555-1212")
-#   f1.instance
-#
-#   f1.instance.update({:name=>'Jerry'})
-#   f1.instance
-#
-class Instance
-
-  include Enumerable
-
-  #
-  def initialize(delegate)
-    @delegate = delegate
-  end
-
-  #
-  def instance_delegate
-    @delegate
-  end
-
-  #
-  def each
-    @delegate.instance_variables.each do |name|
-      yield(name[1..-1].to_sym, @delegate.instance_variable_get(name))
-    end
-  end
-
-  # Return instance variables with values as a hash.
-  #
-  #   class X
-  #     def initialize(a,b)
-  #       @a, @b = a, b
-  #     end
-  #   end
-  #
-  #   x = X.new(1,2)
-  #
-  #   x.instance.to_h  #=> { :a=>1, :b=>2 }
-  #
-  def to_h(at=false)
-    h = {}
-    if at
-      @delegate.instance_variables.each do |name|
-        h[name] = @delegate.instance_variable_get(name)
-      end
-    else
-      each do |key, value|
-        h[key] = value
-      end
-    end
-    h
-  end
-
-  # TODO: Not sure if this should be used.
-  alias_method :to_hash, :to_h
-
-  #
-  def [](name)
-    name = atize(name)
-    @delegate.instance_variable_get(name)
-  end
-
-  #
-  def []=(name, value)
-    name = atize(name)
-    @delegate.instance_variable_set(name,value)
-  end
-
-  #
-  def <<(pair)
-    name, value = *pair
-    name = atize(name)
-    @delegate.instance_variable_set(name, value)
-  end
-
-  # Set instance variables given a +hash+.
-  #
-  #   instance.update('@a'=>1, '@b'=>2)
-  #   @a   #=> 1
-  #   @b   #=> 2
-  #
-  # Also, +@+ sign is not neccessary.
-  #
-  #   instance.update(:a=>1, :b=>2)
-  #   @a   #=> 1
-  #   @b   #=> 2
-  #
-  def update(hash)
-    hash.each do |pair|
-      self << pair
-    end
-  end
-
-  # A hold-over from the the old #instance_assign method.
-  alias_method :assign, :update
-
-  # Same as #instance_variables.
-  def variables
-    @delegate.instance_variables
-  end
-
-  # Instance vairable names as symbols.
-  def keys
-    @delegate.instance_variables.collect do |name|
-      name[1..-1].to_sym
-    end
-  end
-
-  # Instance variable names as strings.
-  def names
-    @delegate.instance_variables.collect do |name|
-      name[1..-1]
-    end
-  end
-
-  # Instance variable values.
-  def values
-    @delegate.instance_variables.collect do |name|
-      @delegate.instance_variable_get(name)
-    end
-  end
-
-  # Instance evaluation.
-  def eval(*a,&b)
-    @delegate.instance_eval(*a,&b)
-  end
-
-  private
-
-    def atize(name)
-      name.to_s !~ /^@/ ? "@#{name}" : name
-    end
-
-end
-

data/src/core/facets/integer.rb

@@ -1,20 +0,0 @@
-# Load all Integer core extensions.
-
-if RUBY_VERSION < '1.9'
-<%=
-  path = __FILE__.chomp('.rb')
-  base = File.basename(path)
-  Dir[File.join(path, '*.rb')].map do |lib|
-    %Q{  require "facets/#{base}/#{File.basename(lib)}"}
-  end.sort.join("\n")
-%>
-else
-<%=
-  path = __FILE__.chomp('.rb')
-  base = File.basename(path)
-  Dir[File.join(path, '*.rb')].map do |lib|
-    %Q{  require_relative "#{base}/#{File.basename(lib)}"}
-  end.sort.join("\n")
-%>
-end
-

data/src/core/facets/integer/bit.rb

@@ -1 +0,0 @@
-require 'facets/integer/bitmask'