facets 2.9.2 → 2.9.3

data/src/standard/facets/math/atkinson_index.rb

@@ -1,16 +0,0 @@
-require 'facets/math/theil_index'
-
-module Math
-
-  # Closely related to the Theil index and easily expressible
-  # in terms of it.
-  #
-  # AI = 1-e^{theil_index}
-  #
-  # http://en.wikipedia.org/wiki/Atkinson_index
-  def self.atkinson_index(array)
-    t = theil_index(array)
-    (t < 0) ? -1 : 1-Math::E**(-t)
-  end
-
-end

data/src/standard/facets/math/beta.rb

@@ -1,9 +0,0 @@
-module Math
-
-  # Beta function of +x+ and +y+ - <code>beta(+x+, +y+) =
-  # tgamma(+x+) * tgamma(+y+) / tgamma(+x+ + +y+)</code>
-  def self.beta(x, y)
-    exp(lgamma(x) + lgamma(y) - lgamma(x+y))
-  end
-
-end

data/src/standard/facets/math/cdf.rb

@@ -1,10 +0,0 @@
-module Math
-
-  # Returns the Cumulative Density Function of this
-  # sample (normalised to a fraction of 1.0).
-  def self.cdf(array, normalised=1.0)
-    s = sum(array).to_f
-    array.sort.inject([0.0]) { |c,d| c << c[-1] + normalised*d.to_f/s }
-  end
-
-end

data/src/standard/facets/math/ceil.rb

@@ -1,8 +0,0 @@
-module Math
-
-  # Smallest integer not smaller than +x+.
-  def self.ceil(x)
-    x.ceil
-  end
-
-end

data/src/standard/facets/math/cot.rb

@@ -1,8 +0,0 @@
-module Math
-
-  # Cotangens of +x+
-  def self.cot(x)
-    tan((PI * 0.5) - x)
-  end
-
-end

data/src/standard/facets/math/coth.rb

@@ -1,8 +0,0 @@
-module Math
-
-  # Cotangens hyperbolicus of +x+
-  def self.coth(x)
-    1.0 / tanh(x)
-  end
-
-end

data/src/standard/facets/math/csc.rb

@@ -1,8 +0,0 @@
-module Math
-
-  # Cosecans of +x+
-  def self.csc(x)
-    1.0 / sin(x)
-  end
-
-end

data/src/standard/facets/math/csch.rb

@@ -1,8 +0,0 @@
-module Math
-
-  # Cosecans hyperbolicus of +x+
-  def self.csch(x)
-    1.0 / sinh(x)
-  end
-
-end

data/src/standard/facets/math/delta.rb

@@ -1,9 +0,0 @@
-module Math
-
-  # Kronecker symbol of +i+ and +j+.
-  # Returns 1 if +i+ and +j+ are equal, 0 otherwise.
-  def self.delta(i, j)
-    return Integer(i) == Integer(j) ? 1 : 0
-  end
-
-end

data/src/standard/facets/math/epsilon.rb

@@ -1,21 +0,0 @@
-module Math
-
-  # Levi-Civita symbol of +i+, +j+, and +k+ - 1 if (+i+, +j+, +k+)
-  # is (1, 2, 3), (2, 3, 1), or (3, 1, 2), -1 if it is (1, 3, 2),
-  # (2, 1, 3), or (3, 2, 1), 0 as long as +i+, +j+, and +k+ are
-  # all elements of {1, 2, 3}, otherwise returns <code>nil</code>.
-  def self.epsilon(i, j, k)
-    i = Integer(i)
-    return nil if i < 1 or i > 3
-    j = Integer(j)
-    return nil if j < 1 or j > 3
-    k = Integer(k)
-    return nil if k < 1 or k > 3
-    case i * 16 + j * 4 + k
-      when 27, 45, 54 then return  1
-      when 30, 39, 57 then return -1
-    end
-    0
-  end
-
-end

data/src/standard/facets/math/exp10.rb

@@ -1,8 +0,0 @@
-module Math
-
-  # 10 to the power +x+
-  def self.exp10(x)
-    10.0 ** x
-  end
-
-end

data/src/standard/facets/math/exp2.rb

@@ -1,8 +0,0 @@
-module Math
-
-  # 2 to the power +x+
-  def self.exp2(x)
-    2.0 ** x
-  end
-
-end

data/src/standard/facets/math/factorial.rb

@@ -1,37 +0,0 @@
-module Math
-
-  # First 16 factorials.
-  FACTORIALS = [
-    1,
-    1,
-    2,
-    6,
-    24,
-    120,
-    720,
-    5_040,
-    40_320,
-    362_880,
-    3_628_800,
-    39_916_800,
-    479_001_600,
-    6_227_020_800,
-    87_178_291_200,
-    1_307_674_368_000
-  ]
-
-  # 1 * 2 * ... * +n+, <code>nil</code> for negative numbers
-  def self.factorial(n)
-    n = Integer(n)
-    if n < 0
-      nil
-    elsif FACTORIALS.length > n
-      FACTORIALS[n]
-    else
-      h = FACTORIALS.last
-      (FACTORIALS.length .. n).each { |i| FACTORIALS.push h *= i }
-      h
-    end
-  end
-
-end

data/src/standard/facets/math/floor.rb

@@ -1,8 +0,0 @@
-module Math
-
-  # Largest integer not larger than +x+.
-  def self.floor(x)
-    x.floor
-  end
-
-end

data/src/standard/facets/math/gamma.rb

@@ -1,12 +0,0 @@
-require 'facets/math/lgamma'
-
-module Math
-
-  unless defined?(gamma)
-    #
-    def self.gamma(x)
-      exp(lgamma(x))
-    end
-  end
-
-end

data/src/standard/facets/math/gcd.rb

@@ -1,23 +0,0 @@
-module Math
-
-  # Greatest common divisor of +m+ and +n+, +nil+ for non-positive
-  # numbers - gcd is computed by means of the Euclidian algorithm.
-  def self.gcd(m, n)
-    m = Integer(m)
-    n = Integer(n)
-    if m <= 0 || n <= 0
-      return nil
-    end
-    loop {
-      if m < n
-        m, n = n, m
-      end
-      if (l = m % n) == 0
-        break
-      end
-      m = l
-    }
-    n
-  end
-
-end

data/src/standard/facets/math/gini_coefficient.rb

@@ -1,33 +0,0 @@
-require 'facets/math/approx_equal'
-
-module Math
-
-  # Calculates the Gini Coefficient (a measure of inequality of a distribution
-  # based on the area between the Lorenz curve and the uniform curve).
-  #
-  # http://en.wikipedia.org/wiki/Gini_coefficient
-  #
-  # This is a slightly cleaner way of calculating the Gini Coefficient then
-  # the previous implementationj.
-  #
-  #   GC = \frac{\sum_{i=1}^N (2i-N-1)x_i}{N^2-\bar{x}}
-  #
-  def self.gini_coefficient(array)
-    return -1 if size <= 0 or any? { |x| x < 0 }
-    return 0 if size < 2 or all? { |x| approx_equal(x,0) }
-    s = 0
-    sort.each_with_index { |li,i| s += (2*i+1-size)*li }
-    s.to_f/(size**2*mean).to_f
-  end
-
-  ## OLD WAY
-  ##   GC = \frac{1}{N} \left ( N+1-2\frac{\sum_{i=1}^N (N+1-i)y_i}{\sum_{i=1}^N y_i} \right )
-  ## def self.gini_coefficient2(array)
-  ##   return -1 if size <= 0 or any? { |x| x < 0 }
-  ##   return 0 if size < 2 or all? { |x| Math::float_equal(x,0) }
-  ##   s = 0
-  ##   sort.each_with_index { |yi,i| s += (size - i)*yi }
-  ##   (size+1-2*(s.to_f/sum.to_f)).to_f/size.to_f
-  ## end
-
-end

data/src/standard/facets/math/kldivergence.rb

@@ -1,19 +0,0 @@
-module Math
-
-  # The Kullback-Leibler divergence from this array to that of +q+.
-  #
-  # NB: You will possibly want to sort both P and Q before calling this
-  # depending on what you're actually trying to measure.
-  #
-  # http://en.wikipedia.org/wiki/Kullback-Leibler_divergence
-  #
-  def self.kldivergence(array, q)
-    fail "Buggy."
-    fail "Cannot compare differently sized arrays." unless size = q.size
-    kld = 0
-    each_with_index { |pi,i| kld += pi*Math::log(pi.to_f/q[i].to_f) }
-    kld
-  end
-
-end
-

data/src/standard/facets/math/lcm.rb

@@ -1,15 +0,0 @@
-module Math
-
-  # Least common multiple of +m+ and +n+, computed by multiplying
-  # +m+ and +n+ and dividing the product by the gcd of +m+ and +n+,
-  # +nil+ for non-positive numbers.
-  def self.lcm(m, n)
-    m = Integer(m)
-    n = Integer(n)
-    if m <= 0 || n <= 0
-      return nil
-    end
-    m / gcd(m, n) * n
-  end
-
-end

data/src/standard/facets/math/lgamma.rb

@@ -1,21 +0,0 @@
-module Math
-
-  unless defined?(lgamma)
-
-    # Logarithmus naturalis of gamma function of +x+
-    def self.lgamma(x)
-      h  = x + 5.5
-      h -= (x + 0.5) * log(h)
-      sum  =  1.000_000_000_190_015
-      sum += 76.180_091_729_471_46	     / (x + 1.0)
-      sum -= 86.505_320_329_416_77	     / (x + 2.0)
-      sum += 24.014_098_240_830_91	     / (x + 3.0)
-      sum -=  1.231_739_572_450_155	     / (x + 4.0)
-      sum +=  0.120_865_097_386_617_9e-2 / (x + 5.0)
-      sum -=  0.539_523_938_495_3e-5     / (x + 6.0)
-      -h + log(2.506_628_274_631_000_5 * sum / x)
-    end
-
-  end
-
-end

data/src/standard/facets/math/linsolve.rb

@@ -1,10 +0,0 @@
-module Math
-
-  # Returns real solution(s) of <code>+a+x + +b+ = +c+</code> or +nil+
-  # if no or an infinite number of solutions exist. If
-  # <code>c</code> is missing it is assumed to be 0.
-  def self.linsolve(a, b, c = 0.0)
-    a == 0 ? nil : (c - b) / a
-  end
-
-end

data/src/standard/facets/math/log2.rb

@@ -1,14 +0,0 @@
-module Math
-
-  INVERSE_LN_2 = 1.0 / ::Math.log(2.0)
-
-  unless defined?(log2)
-
-    # Logarithmus dualis of +x+.
-    def self.log2(x)
-      Math.log(x) * INVERSE_LN_2
-    end
-
-  end
-
-end

data/src/standard/facets/math/max.rb

@@ -1 +0,0 @@
-require 'facets/math/min'

data/src/standard/facets/math/mean.rb

@@ -1,16 +0,0 @@
-require  'facets/math/sum'
-
-module Math
-
-  # Mean average.
-  def self.mean(array, &blk)
-    s = array.size
-    return 0.0 if s == 0
-    sum(array, &blk) / s
-  end
-
-  class << self
-    alias_method :mean_average, :mean
-  end
-
-end

data/src/standard/facets/math/median.rb

@@ -1,15 +0,0 @@
-module Math
-
-  #
-  def self.median(array)
-    return 0 if array.size == 0
-    tmp = array.sort
-    mid = tmp.size / 2
-    if (tmp.size % 2) == 0
-	    (tmp[mid-1] + tmp[mid]).to_f / 2
-    else
-	    tmp[mid]
-    end
-  end
-
-end

data/src/standard/facets/math/min.rb

@@ -1,35 +0,0 @@
-module Math
-
-  #
-  def self.min(array, &block)
-    if block_given?
-      if min = array.find{ |i| i }
-        min = yield(min)
-        array.each do |i|
-          j = yield(i)
-          min = j if min > j
-        end
-        min
-      end
-    else
-      array.min
-    end
-  end
-
-  #
-  def self.max(array, block)
-    if block_given?
-      if max = find{|i| i}
-        max = yield(max)
-        each{|i|
-          j = yield(i)
-          max = j if max < j
-        }
-        max
-      end
-    else
-      array.max
-    end
-  end
-
-end

data/src/standard/facets/math/pow.rb

@@ -1,8 +0,0 @@
-module Math
-
-  # +x+ to the power +y+
-  def self.pow(x, y)
-    x ** y
-  end
-
-end

data/src/standard/facets/math/pstd.rb

@@ -1 +0,0 @@
-require 'facets/math/std'

data/src/standard/facets/math/pvariance.rb

@@ -1 +0,0 @@
-require 'facets/math/variance'

data/src/standard/facets/math/rmd.rb

@@ -1,16 +0,0 @@
-require 'facets/math/approx_equal'
-
-module Math
-
-  # Calculates the relative mean difference of this sample.
-  # Makes use of the fact that the Gini Coefficient is half the RMD.
-  def self.rmd(array)
-    return 0.0 if approx_equal(mean(array), 0.0)
-    gini_coefficient(array) * 2
-  end
-
-  class << self
-    alias_method  :relative_mean_difference, :rmd
-  end
-
-end