facets 1.0.0 → 1.0.1

data/lib/facet/hash/traverse.rb

@@ -1,63 +0,0 @@
-
-class Hash
-
-  # Returns a new hash created by traversing the hash and its subhashes,
-  # executing the given block on the key and value. The block should
-  # return a 2-element array of the form +[key, value]+.
-  #
-  #   h = { "A"=>"A", "B"=>"B" }
-  #   h.traverse { |k,v| [k.downcase, v] }
-  #   h  #=> { "a"=>"A", "b"=>"B" }
-  #
-  def traverse(&b)
-    inject({}) do |h,(k,v)|
-      nk, nv = b[k,v]
-      h[nk] = ( Hash === v ? v.traverse(&b) : nv )
-      h
-    end
-  end
-
-  # In place version of traverse, which traverses the hash and its
-  # subhashes, executing the given block on the key and value.
-  #
-  #   h = { "A"=>"A", "B"=>"B" }
-  #   h.traverse! { |k,v| [k.downcase, v] }
-  #   h  #=> { "a"=>"A", "b"=>"B" }
-  #
-  def traverse!( &yld )
-    self.replace( self.traverse( &yld ) )
-  end
-
-end
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCHash < Test::Unit::TestCase
-
-    def test_traverse
-      h = { "A" => "x", "B" => "y" }
-      h2 = h.traverse { |k,v| [k.downcase, v.upcase] }
-      e = { "a" => "X", "b" => "Y" }
-      assert_not_equal( h, h2 )
-      assert_equal( e, h2 )
-    end
-
-    def test_traverse!
-      h = { "A" => "x", "B" => "y" }
-      h.traverse! { |k,v| [k.downcase, v.upcase] }
-      e = { "a" => "X", "b" => "Y" }
-      assert_equal( e, h )
-    end
-
-  end
-
-=end

data/lib/facet/hash/update_each.rb

@@ -1,43 +0,0 @@
-class Hash
-
-  # Iterates through each pair and updates a the hash
-  # in place. This is formally equivalent to #collate!
-  # But does not use #collate to accomplish the task.
-  # Hence #update_each is probably a bit faster.
-  #
-  #   # TODO
-  #
-  #--
-  # Note that this may get some fine tuning as currently
-  # it expects the block to return a "mini-hash" pair.
-  #++
-  def update_each  # :yield:
-    dup.each_pair{ |k,v| update( yield(k,v) ); }
-    self
-  end
-
-end
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCHash < Test::Unit::TestCase
-
-    def test_update_each
-      a = { :a => 1, :b => 2, :c => 3 }
-      e = { :a => 2, :b => 3, :c => 4 }
-      a.update_each{ |k,v| { k => v+1 } }
-      assert_equal( e, a )
-    end
-
-  end
-
-=end

data/lib/facet/hash/update_keys.rb

@@ -1,31 +0,0 @@
-
-class Hash
-
-  def update_keys
-    each{ |k,v| delete(k) ; store( yield(k), v ) }
-  end
-
-end
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCHash < Test::Unit::TestCase
-
-    def test_001
-      h = { 'A' => 1, 'B' => 2 }
-      h.update_keys{ |k| k.downcase }
-      assert_equal( { 'a' => 1, 'b' => 2 }, h)
-    end
-
-  end
-
-=end

data/lib/facet/hash/update_values.rb

@@ -1,32 +0,0 @@
-
-class Hash
-
-  def update_values
-    each{ |k,v| store( k, yield(v) ) }
-  end
-
-end
-
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCHash < Test::Unit::TestCase
-
-    def test_001
-      h = { 1 => 'A', 2 => 'B' }
-      h.update_values{ |v| v.downcase }
-      assert_equal( { 1 => 'a', 2 => 'b' }, h )
-    end
-
-  end
-
-=end

data/lib/facet/hash/variablize_keys.rb

@@ -1,2 +0,0 @@
-# stub
-require 'facet/hash/keys_to_iv'

data/lib/facet/hash/weave.rb

@@ -1,88 +0,0 @@
-
-class Hash
-
-  # Weaves two hashes producing a new hash. The two hashes need
-  # to be compatible according to the following rules for each node:
-  #
-  #   <tt>
-  #   hash, hash => hash (recursive +)
-  #   hash, array => error
-  #   hash, value => error
-  #   array, hash => error
-  #   array, array => array + array
-  #   array, value => array << value
-  #   value, hash => error
-  #   value, array => array.unshift(valueB)
-  #   valueA, valueB => valueB
-  #   </tt>
-  #
-  # Example:
-  #
-  #   # to do
-  #
-  def weave(h)
-    raise ArgumentError, "Hash expected" unless h.kind_of?(Hash)
-    s = self.clone
-    h.each { |k,node|
-      node_is_hash = node.kind_of?(Hash)
-      node_is_array = node.kind_of?(Array)
-      if s.has_key?(k)
-        self_node_is_hash = s[k].kind_of?(Hash)
-        self_node_is_array = s[k].kind_of?(Array)
-        if self_node_is_hash
-          if node_is_hash
-            s[k] = s[k].weave(node)
-          elsif node_is_array
-            raise ArgumentError, 'Incompatible hash addition' #self[k] = node
-          else
-            raise ArgumentError, 'Incompatible hash addition' #self[k] = node
-          end
-        elsif self_node_is_array
-          if node_is_hash
-            raise ArgumentError, 'Incompatible hash addition' #self[k] = node
-          elsif node_is_array
-            s[k] += node
-          else
-            s[k] << node
-          end
-        else
-          if node_is_hash
-            raise ArgumentError, 'Incompatible hash addition' #self[k] = node
-          elsif node_is_array
-            s[k].unshift( node )
-          else
-            s[k] = node
-          end
-        end
-      else
-        s[k] = node
-      end
-    }
-    s
-  end
-
-end
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCHash < Test::Unit::TestCase
-
-    def test_weave
-      b = { :a=>1, :b=>[1,2,3], :c=>{ :x=>'X' } }
-      c = { :a=>2, :b=>[4,5,6], :c=>{ :x=>'A', :y => 'B' } }
-      r = { :a=>2, :b=>[1,2,3,4,5,6], :c=>{ :x => 'A', :y => 'B' } }
-      assert_equal( r, b.weave(c) )
-    end
-
-  end
-
-=end

data/lib/facet/integer.rb

@@ -1,8 +0,0 @@
-require 'nano/integer/even'
-require 'nano/integer/fact'
-require 'nano/integer/factorial'
-require 'nano/integer/multiple'
-require 'nano/integer/odd'
-require 'nano/integer/ordinal'
-require 'nano/integer/times_collect'
-require 'nano/integer/times_map'

data/lib/facet/integer/even.rb

@@ -1,2 +0,0 @@
-# stub
-require 'facet/integer/multiple'

data/lib/facet/integer/fac.rb

@@ -1,2 +0,0 @@
-# stub
-require 'facet/integer/factorial'

data/lib/facet/integer/fact.rb

@@ -1,2 +0,0 @@
-# stub
-require 'facet/integer/factorial'

data/lib/facet/integer/factorial.rb

@@ -1,61 +0,0 @@
-#--
-# Credit: Malte Milatz
-#++
-
-class Integer
-
-  # Calculate the factorial of an integer.
-  #
-  #   2.factorial  #=> 2
-  #   3.factorial  #=> 6
-  #   3.factorial  #=> 24
-  #
-
-  def factorial
-    return 1 if zero?
-    f = 1
-    2.upto(self) { |n| f *= n }
-    f
-  end
-
-  #--
-  # TODO Pick one of these and deprecate the other. But which?
-  #++
-  alias_method( :fac, :factorial )
-  alias_method( :fact, :factorial )
-
-  #-- OLD CODE
-  #def factorial
-  #  return 1 if self == 0
-  #  #self == 0 ? 1 : ( self * (self-1).factorial )
-  #  f = (1..self.abs).inject { |state, item| state * item }
-  #  return self < 0 ? -f : f
-  #end
-  #++
-
-end
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCInteger < Test::Unit::TestCase
-
-    def test_factorial
-      assert_equal(  1, 0.factorial )
-      assert_equal(  1, 1.factorial )
-      assert_equal(  2, 2.factorial )
-      assert_equal(  6, 3.factorial )
-      assert_equal( 24, 4.factorial )
-    end
-
-  end
-
-=end

data/lib/facet/integer/multiple.rb

@@ -1,69 +0,0 @@
-
-class Integer
-
-  # Is an integer odd?
-  #
-  #   2.odd?  #=> false
-  #   3.odd?  #=> true
-  #
-  def odd?
-    self % 2 == 1
-  end
-
-  # Is an integer even?
-  #
-  #   2.even?  #=> true
-  #   3.even?  #=> false
-  #
-  def even?
-    self % 2 == 0
-  end
-
-  # Is is a multiple of a given number?
-  #
-  #   7.multiple?(2)  #=> false
-  #   8.multiple?(2)  #=> true
-  #
-  def multiple?(number)
-    self % number == 0
-  end
-
-end
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCInteger < Test::Unit::TestCase
-
-    def test_odd?
-      assert( ! 0.odd? )
-      assert(   1.odd? )
-      assert( ! 2.odd? )
-      assert(   3.odd? )
-    end
-
-    def test_even?
-      assert(   0.even? )
-      assert( ! 1.even? )
-      assert(   2.even? )
-      assert( ! 3.even? )
-    end
-
-    def test_multiple?
-      assert( ! 1.multiple?(2) )
-      assert(   2.multiple?(2) )
-      assert( ! 5.multiple?(3) )
-      assert(   6.multiple?(3) )
-    end
-
-  end
-
-=end

data/lib/facet/integer/odd.rb

@@ -1,2 +0,0 @@
-# stub
-require 'facet/integer/multiple'

data/lib/facet/integer/ordinal.rb

@@ -1,41 +0,0 @@
-
-class Integer
-
-  def ordinal
-    if (11..13).include?(self % 100)
-      "#{self}th"
-    else
-      case self % 10
-        when 1: "#{self}st"
-        when 2: "#{self}nd"
-        when 3: "#{self}rd"
-        else    "#{self}th"
-      end
-    end
-  end
-
-end
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCInteger < Test::Unit::TestCase
-
-    def test_ordinal
-      assert_equal( '1st', 1.ordinal )
-      assert_equal( '2nd', 2.ordinal )
-      assert_equal( '3rd', 3.ordinal )
-      assert_equal( '4th', 4.ordinal )
-    end
-
-  end
-
-=end