facets 1.0.0 → 1.0.1

data/lib/facet/enumerable/each_unique_pair.rb

@@ -1,66 +0,0 @@
-require 'facet/enumerable/each_combination'
-
-class Array
-
-  # Processes each unique pair (of indices, not value) 
-  # in the array by yielding them to the supplied block.
-  #
-  #   a = [1,2,3,4]
-  #   a.each_unique_pair{ |a,b| puts a+','+b }
-  #
-  # produces
-  #
-  #   1,2
-  #   1,3
-  #   1,4
-  #   2,3
-  #   2,4
-  #   3,4
-  #
-  # This does not guarantee the uniqueness of values. 
-  # For example:
-  #
-  #   a = [1,2,1]
-  #   a.each_unique_pair{ |a,b| puts a+','+b }
-  #
-  # prduces
-  #
-  #   1,2
-  #   1,1
-  #   2,1
-  #
-  # This is equivalent to <tt>each_combination(2){ ... }</tt>.
-  def each_unique_pair(&yld)
-    self.each_combination(2,&yld)
-    #s = self.to_a
-    #self.each_with_index{ |a,i|
-    #  self[(i+1)..-1].each{ |b| yield a,b }
-    #}
-  end
-
-end
-
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCEnumerable < Test::Unit::TestCase
-
-    def test_each_unique_pair
-      r = []
-      a = [1,2,3,4]
-      a.each_unique_pair{ |a,b| r << [a,b] }
-      assert_equal( [[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]], r )
-    end
-
-  end
-
-=end

data/lib/facet/enumerable/each_with_counter.rb

@@ -1,8 +0,0 @@
-
-module Enumerable
-
-  # More appropriate naming since an enumerable is not
-  # neccesarily "indexed", as is an Array or Hash.
-  alias_method :each_with_counter, :each_with_index
-
-end

data/lib/facet/enumerable/elementwise.rb

@@ -1,2 +0,0 @@
-# stub
-require 'facet/enumerable/ew'

data/lib/facet/enumerable/entropy.rb

@@ -1,52 +0,0 @@
-#--
-# Credit goes to Derek.
-#++
-require 'facet/enumerable/ideal_entropy'
-require 'facet/enumerable/probability'
-
-module Enumerable
-  # Shannon's entropy for an array - returns the average
-  # bits per symbol required to encode the array.
-  # Lower values mean less "entropy" - i.e. less unique
-  # information in the array.
-  #
-  #   %w{ a b c d e e e }.entropy  #=>
-  #
-  def entropy
-    arr = self.to_a
-    probHash = arr.probability
-    # h is the Shannon entropy of the array
-    h = -1.to_f * probHash.keys.inject(0.to_f) do |sum, i|
-      sum + (probHash[i] * (Math.log(probHash[i])/Math.log(2.to_f)))
-    end
-    h
-  end
-end
-
-class String
-  def entropy
-    self.split(//).entropy
-  end
-end
-
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCEnumerable < Test::Unit::TestCase
-
-    def test_entropy
-      assert_equal( 1.0, %w{ a b }.entropy )
-    end
-
-  end
-
-=end

data/lib/facet/enumerable/every.rb

@@ -1,65 +0,0 @@
-
-begin
-  require 'calibre/functor'
-rescue LoadError
-  require 'facets/support/functor'
-end
-
-module Enumerable
-
-  # Returns an elementwise Functor. This allows
-  # you to map a method on to every element.
-  #
-  #   [1,2,3].every + 3           #=> [4,5,6]
-  #
-  #   ['a','b','c'].every.upcase  #=> ['A','B','C']
-  #
-  def every
-    Functor.new do |op,*args|
-      self.collect{ |a| a.send(op,*args) }
-    end
-  end
-
-end
-
-
-class Array
-
-  # In place version of #every.
-  def every!
-    Functor.new do |op,*args|
-      self.replace( self.collect{ |a| a.send(op,*args) } )
-    end
-  end
-
-end
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCEnumerable < Test::Unit::TestCase
-
-    def test_every_1
-      a = [1,2,3]
-      assert_equal( [4,5,6], a.every + 3 )
-      assert_equal( [0,1,2], a.every - 1 )
-      assert_equal( ['1','2','3'], a.every.to_s )
-    end
-
-    def test_every_2
-      a = [1,2,3]
-      a.every! + 3
-      assert_equal( [4,5,6], a )
-    end
-
-  end
-
-=end

data/lib/facet/enumerable/ew.rb

@@ -1,64 +0,0 @@
-
-begin
-  require 'calibre/functor'
-rescue LoadError
-  require 'facets/support/functor'
-end
-
-module Enumerable
-
-  # Returns an elementwise Functor designed to make R-like
-  # elementwise operations possible.
-  #
-  #   [1,2].ew + 3          #=> [4,5]
-  #   [1,2].ew + [4,5]      #=> [5,7]
-  #   [1,2].ew + [[4,5],3]  #=> [[5,7],[4,5]
-  #
-  #--
-  # Special thanks to Martin DeMello for helping to develop this.
-  #++
-  def elementwise
-    Functor.new do |op,*args|
-      a = args.collect do |arg|
-        if arg.kind_of?(Enumerable)
-          ln = ( arg.length > self.length ? self.length : arg.length )
-          self[0...ln].zip(arg[0...ln]).collect{ |a,b| a.send(op,b) }
-          #self[0...ln].zip(arg[0...1n]).collect{ |a,b| b ? a.send(op,b) : nil }
-        else
-          self.collect{ |a| a.send(op,arg) }
-        end
-      end
-      a.flatten! if args.length == 1
-      a
-    end
-  end
-
-  alias_method :ew, :elementwise
-
-end
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCEnumerable < Test::Unit::TestCase
-
-    def test_ew
-      a = [1,2,3]
-      b = [4,5]
-      assert_equal( [4,5,6], a.ew + 3 )
-      assert_equal( [5,7], a.ew + b )
-      assert_equal( [[5,7],[3,4,5]], a.ew.+(b,2) )
-      assert_equal( [[5,7],[4,5,6]], a.ew.+(b,3) )
-    end
-
-  end
-
-=end

data/lib/facet/enumerable/filter_collect.rb

@@ -1,58 +0,0 @@
-#--
-# Credit goes to Florian Gross.
-#++
-module Enumerable
-
-  # Collects/Maps and filters items out in one single step.
-  # You can use throw(:skip) in the supplied block to indicate that the
-  # current item should not end up in the resulting array.
-  #
-  #   # Return names of all person with an age of at least 18.
-  #   persons.filter_collect do |person|
-  #     throw(:skip) if person.age < 18
-  #     person.name
-  #   end
-  #
-  # Also see Enumerable#collect, Enumerable#find_all.
-  #
-  def filter_collect #:yield:
-    result = []
-    self.each do |item|
-      catch(:skip) do
-        new_item = yield(item)
-        result << new_item
-      end
-    end
-    return result
-  end
-
-  alias_method :filter_map, :filter_collect
-
-end #Enumerable
-
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCEnumerable < Test::Unit::TestCase
-
-    def test_filter_collect
-      e = [3,4]
-      a = [1,2,3,4].filter_collect { |n|
-        throw(:skip) if n < 3
-        n
-      }
-      assert_equal( e, a )
-    end
-
-  end
-
-=end

data/lib/facet/enumerable/filter_map.rb

@@ -1,2 +0,0 @@
-# stub
-require 'facet/enumerable/filter_collect'

data/lib/facet/enumerable/find_collisions.rb

@@ -1,41 +0,0 @@
-require 'facet/enumerable/commonality'
-
-module Enumerable
-
-  # Like commonality but returns an array if no block is given.
-  #
-  def find_collisions( &blk ) #:yield:
-    if block_given?
-      commonality( &blk )
-    else
-      commonality.values.flatten.uniq
-    end
-  end
-
-end
-
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCEnumerable < Test::Unit::TestCase
-
-    def test_find_collisions
-      a = [1,2,2,3,3,3]
-      assert_equal( [2,3], a.find_collisions )
-      a = [1,2,2,3,3,3]
-      r = {false=>[1, 2, 2], true=>[3, 3, 3]}
-      assert_equal( r, a.find_collisions { |x| x > 2 } )
-    end
-
-  end
-
-=end

data/lib/facet/enumerable/frequency.rb

@@ -1,39 +0,0 @@
-#--
-# Credit goes to Brian Schröder and Derek for inspiration.
-#++
-module Enumerable
-
-  # Generates a hash mapping each unique symbol in the array
-  # to the absolute frequency it appears.
-  def frequency
-    probs = Hash.new(0)
-    each do | e |
-      probs[e] += 1
-    end
-    probs
-  end
-
-end
-
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCEnumerable < Test::Unit::TestCase
-
-    def test_frequency
-      assert_equal( {'a'=>1,'b'=>1}, %w{a b}.frequency )
-      assert_equal( {'tom'=>1,'boy'=>1}, %w{tom boy}.frequency )
-    end
-
-  end
-
-=end

data/lib/facet/enumerable/graph.rb

@@ -1,59 +0,0 @@
-#--
-# Hash#graph! is only good for a Hash.
-#++
-require 'facet/hash/graph'
-
-module Enumerable
-
-  # Like <tt>#map</tt>/<tt>#collect</tt>, but it generates a Hash.  The block
-  # is expected to return two values: the key and the value for the new hash.
-  #
-  #   numbers  = (1..3)
-  #   squares  = numbers.graph { |n| [n, n*n] }   # { 1=>1, 2=>4, 3=>9 }
-  #   sq_roots = numbers.graph { |n| [n*n, n] }   # { 1=>1, 4=>2, 9=>3 }
-  #
-  #--
-  # Credits for original version goes to Zallus Kanite and Gavin Sinclair.
-  #++
-  def graph(&yld)
-    if yld
-      inject({}) do |h,kv|
-        nk, nv = yld[*kv]
-        h[nk] = nv
-        h
-      end
-    else
-      Hash[*self.to_a.flatten]
-    end
-  end
-
-  # no longer used
-  #alias_method( :build_hash, :graph )
-  #alias_method( :build_hash!, :graph! )
-end
-
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-=begin test
-
-  require 'test/unit'
-
-  class TCEnumerable < Test::Unit::TestCase
-
-    def test_graph
-      numbers  = (1..3)
-      squares  = numbers.graph{ |n| [n, n*n] }
-      assert_equal( {1=>1, 2=>4, 3=>9}, squares )
-      sq_roots = numbers.graph{ |n| [n*n, n] }
-      assert_equal( {1=>1, 4=>2, 9=>3}, sq_roots )
-    end
-
-  end
-
-=end