more_math 0.0.2 → 0.0.3

data/.gitignore

@@ -1,3 +1,5 @@
 .*.sw[pon]
+.rvmrc
 Gemfile.lock
+coverage
 pkg

data/CHANGES

@@ -1,2 +1,8 @@
+2011-10-08 (0.0.3)
+ * Add permutation and subset implementations
+2011-09-26 (0.0.2)
+ * Depend on tins library
+2011-07-17 (0.0.1)
+ * Use gem_hadar
 2010-11-01 (0.0.0)
   * Initial Version

data/Rakefile

@@ -10,7 +10,7 @@ GemHadar do
   summary     'Library that provides more mathematics.'
   description 'Library that provides more mathematical functions/algorithms than standard Ruby.'
   test_dir    'tests'
-  ignore      '.*.sw[pon]', 'pkg', 'Gemfile.lock'
+  ignore      '.*.sw[pon]', 'pkg', 'Gemfile.lock', 'coverage', '.rvmrc'
   readme      'README.rdoc'
   title       "#{name.camelize} -- More Math in Ruby"
 

data/VERSION

@@ -1 +1 @@
-0.0.2
+0.0.3

data/lib/more_math.rb

@@ -15,5 +15,7 @@ module MoreMath
   require 'more_math/numberify_string_function'
   require 'more_math/sequence'
   require 'more_math/string_numeral'
+  require 'more_math/permutation'
+  require 'more_math/subset'
   require 'more_math/version'
 end

data/lib/more_math/cantor_pairing_function.rb

@@ -4,7 +4,7 @@ module MoreMath
   module CantorPairingFunction
 
     module_function
-  
+
     def cantor_pairing(*xs)
       if xs.size == 1 and xs.first.respond_to?(:to_ary)
         xs = xs.first.to_ary
@@ -31,7 +31,7 @@ module MoreMath
       end
       v - 1
     end
-   
+
     def cantor_pairing_inv(c, n = 2)
       raise ArgumentError, "n is required to be >= 2" unless n >= 2
       result = []

data/lib/more_math/distributions.rb

@@ -111,7 +111,7 @@ module MoreMath
         end
       end
     end
-   
+
     # Returns the inverse cumulative probability (t-value) of the TDistribution
     # for the probability +p+.
     def inverse_probability(p)
@@ -120,7 +120,7 @@ module MoreMath
         -1 / 0.0
       when p >= 1
         1 / 0.0
-      else 
+      else
         begin
           bisect = NewtonBisection.new { |x| probability(x) - p }
           range = bisect.bracket(-10..10)

data/lib/more_math/functions.rb

@@ -60,7 +60,7 @@ module MoreMath
             -((a + m) * (a + b + m) * x) / ((a + 2 * m) * (a + 2 * m + 1))
           end
         end
-        exp(a * log(x) + b * log(1.0 - x) - log(a) - log_beta(a, b)) / 
+        exp(a * log(x) + b * log(1.0 - x) - log(a) - log_beta(a, b)) /
           fraction[x, epsilon, max_iterations]
       end
     rescue Errno::ERANGE, Errno::EDOM

data/lib/more_math/permutation.rb

@@ -0,0 +1,257 @@
+require 'more_math/ranking_common'
+
+module MoreMath
+  class Permutation
+    include Enumerable
+    include Comparable
+    include RankingCommon
+
+    # Creates a new Permutation instance of <code>size</code>
+    # (and ranked with <code>rank</code>).
+    def initialize(size, rank = 0)
+      @size, self.rank = size, rank
+      @last = factorial(size) - 1
+    end
+
+    # Creates a new Permutation instance from the Array
+    # <code>indices</code>, that should consist of a permutation of Fixnums
+    # in the range of <code>0</code> and <code>indices.size - 1</code>. This is
+    # for example the result of a call to the Permutation#value method.
+    def self.from_value(indices)
+      obj = new(indices.size)
+      obj.instance_eval do
+        self.rank = rank_indices(indices)
+      end
+      obj
+    end
+
+    # Creates a new Permutation instance from the Array of Arrays
+    # <code>cycles</code>. This is for example the result of a
+    # call to the Permutation#cycles method .
+    def self.from_cycles(cycles, max = 0)
+      indices = Array.new(max)
+      cycles.each do |cycle|
+        cycle.empty? and next
+        for i in 0...cycle.size
+          indices[ cycle[i - 1] ] = cycle[i]
+        end
+      end
+      indices.each_with_index { |r, i| r or indices[i] = i }
+      from_value(indices)
+    end
+
+    # A permutation instance of size collection.size is created with
+    # collection as the default Permutation#project data object. A
+    # collection should respond to size, [], and []=. The Permutation
+    # instance will default to rank 0 if none is given.
+    def self.for(collection, rank = 0)
+      perm = new(collection.size, rank)
+      perm.instance_variable_set(:@collection, collection)
+      perm
+    end
+
+    # Assigns <code>m</code> to the rank attribute of this Permutation
+    # instance. That implies that the indices produced by a call to the
+    # Permutation#value method of this instance is the permutation ranked with
+    # this new <code>rank</code>.
+    def rank=(m)
+      @rank = m % factorial(size)
+    end
+
+    # Returns the indices in the range of 0  to Permutation#size - 1
+    # of this permutation that is ranked with Permutation#rank.
+    #
+    # <b>Example:</b>
+    #  perm = Permutation.new(6, 312)
+    #  # => #<Permutation:0x6ae34 @last=719, @rank=312, @size=6>
+    #  perm.value
+    #  # => [2, 4, 0, 1, 3, 5]
+    def value
+      unrank_indices(@rank)
+    end
+
+    # Returns the projection of this instance's Permutation#value
+    # into the <code>data</code> object that should respond to
+    # the #[] method. If this Permutation inbstance was created
+    # with Permutation.for the collection used to create
+    # it is used as a data object.
+    #
+    # <b>Example:</b>
+    #  perm = Permutation.new(6, 312)
+    #  # => #<Permutation:0x6ae34 @last=719, @rank=312, @size=6>
+    #  perm.project("abcdef")
+    #  # => "ceabdf"
+    def project(data = @collection)
+      data or raise ArgumentError, "a collection is required to project"
+      raise ArgumentError, "data size is != #{size}!" if data.size != size
+      projection = data.clone
+      value.each_with_index { |i, j| projection[j] = data[i] }
+      projection
+    end
+
+    # Compares to Permutation instances according to their Permutation#size
+    # and the Permutation#rank.
+    #
+    # The mixed in methods from the Comparable module rely on this method.
+    def <=>(other)
+      size <=> other.size.zero? || rank <=> other.rank
+    end
+
+    # Returns true if this Permutation instance and the other have the same
+    # value, that is both Permutation instances have the same Permutation#size
+    # and the same Permutation#rank.
+    def eql?(other)
+      self.class == other.class && size == other.size && rank == other.rank
+    end
+
+    alias == eql?
+
+    # Computes a unique hash value for this Permutation instance.
+    def hash
+      size.hash ^ rank.hash
+    end
+
+    # Switchtes this Permutation instance to the inverted permutation.
+    # (See Permutation#compose for an example.)
+    def invert!
+      indices = unrank_indices(rank)
+      inverted = Array.new(size)
+      for i in 0...size
+        inverted[indices[i]] = i
+      end
+      self.rank = rank_indices(inverted)
+      self
+    end
+
+    # Returns the inverted Permutation of this Permutation instance.
+    # (See Permutation#compose for an example.)
+    def invert
+      clone.invert!
+    end
+
+    alias -@ invert
+
+    # Compose this Permutation instance and the other to
+    # a new Permutation. Note that a permutation
+    # composed with it's inverted permutation yields
+    # the identity permutation, the permutation with rank 0.
+    #
+    # <b>Example:</b>
+    #  p1 = Permutation.new(5, 42)
+    #  # => #<Permutation:0x75370 @last=119, @rank=42, @size=5>
+    #  p2 = p1.invert
+    #  # => #<Permutation:0x653d0 @last=119, @rank=51, @size=5>
+    #  p1.compose(p2)
+    #  => #<Permutation:0x639a4 @last=119, @rank=0, @size=5>
+    # Or a little nicer to look at:
+    #  p1 * -p1
+    #  # => #<Permutation:0x62004 @last=119, @rank=0, @size=5>
+    def compose(other)
+      size == other.size or raise ArgumentError,
+        "permutations of unequal sizes cannot be composed!"
+      indices = self.value
+      composed = other.value.map { |i| indices[i] }
+      klon = clone
+      klon.rank = rank_indices(composed)
+      klon
+    end
+
+    alias * compose
+
+    # Returns the cycles representation of this Permutation instance.
+    # The return value of this method can be used to create a
+    # new Permutation instance with the Permutation.from_cycles method.
+    #
+    # <b>Example:</b>
+    #  perm = Permutation.new(7, 23)
+    #  # => #<Permutation:0x58541c @last=5039, @rank=23, @size=7>
+    #  perm.cycles
+    #  # => [[3, 6], [4, 5]]
+    def cycles
+      perm = value
+      result = [[]]
+      seen = {}
+      current = nil
+      loop do
+        current or current = perm.find { |x| !seen[x] }
+        break unless current
+        if seen[current]
+          current = nil
+          result << []
+        else
+          seen[current] = true
+          result[-1] << current
+          current = perm[current]
+        end
+      end
+      result.pop
+      result.select { |c| c.size > 1 }.map do |c|
+        min_index = c.index(c.min)
+        c[min_index..-1] + c[0...min_index]
+      end
+    end
+
+    # Returns the signum of this Permutation instance.
+    # It's -1 if this permutation is odd and 1 if it's
+    # an even permutation.
+    #
+    # A permutation is odd if it can be represented by an odd number of
+    # transpositions (cycles of length 2), or even if it can be represented of
+    # an even number of transpositions.
+    def signum
+      s = 1
+      cycles.each do |c|
+        c.size % 2 == 0 and s *= -1
+      end
+      s
+    end
+
+    alias sgn signum
+
+    # Returns true if this permutation is even, false otherwise.
+    def even?
+      signum == 1
+    end
+
+    # Returns true if this permutation is odd, false otherwise.
+    def odd?
+      signum == -1
+    end
+
+    private
+
+    @@fcache = [ 1 ]
+
+    def factorial(n)
+      @@fcache.size.upto(n) { |i| @@fcache[i] =  i * @@fcache[i - 1] }
+      @@fcache[n]
+    end
+
+    def rank_indices(p)
+      result = 0
+      for i in 0...size
+        result += p[i] * factorial(size - i - 1)
+        for j in (i + 1)...size
+          p[j] -= 1 if p[j] > p[i]
+        end
+      end
+      result
+    end
+
+    def unrank_indices(m)
+      result = Array.new(size, 0)
+      for i in 0...size
+        f = factorial(i)
+        x = m % (f * (i + 1))
+        m -= x
+        x /= f
+        result[size - i - 1] = x
+        x -= 1
+        for j in (size - i)...size
+          result[j] += 1 if result[j] > x
+        end
+      end
+      result
+    end
+  end
+end

data/lib/more_math/ranking_common.rb

@@ -0,0 +1,93 @@
+module MoreMath
+  module RankingCommon
+    # Returns the size of this instance's collection, a Fixnum.
+    attr_reader :size
+
+    # Returns the rank of this instance, a Fixnum in the range
+    # of 0 and #last.
+    attr_reader :rank
+
+    # Returns the rank of the last ranked instance.
+    attr_reader :last
+
+    # Returns the collection the #rank applies to if any was set, otherwise
+    # retrurns nil.
+    attr_reader :collection
+
+    # Switches this instance to the next ranked instance. If this was the #last
+    # instance it wraps around the first (<code>rank == 0</code>) instance.
+    def next!
+      self.rank += 1
+      self
+    end
+
+    alias succ! next!
+
+    # Returns the next ranked instance. If this instance is the #last instance
+    # it returns the first (<code>rank == 0</code>) instance again.
+    def next
+      clone.next!
+    end
+
+    alias succ next
+
+    # Switches this instance to the previously ranked instance. If this was the
+    # first instance it returns the last (<code>rank == #last</code>) instance.
+    def pred!
+      self.rank -= 1
+      self
+    end
+
+    # Returns the previously ranked instance. If this was the first instance it
+    # returns the last (<code>rank == #last</code>) instance.
+    def pred
+      clone.pred!
+    end
+
+    # Switches this instance to a randomly ranked instance.
+    def random!
+      new_rank = rand(last + 1).to_i
+      self.rank = new_rank
+      self
+    end
+
+    # Returns a randomly ranked instance.
+    def random
+      clone.random!
+    end
+
+    # Iterates over all instances starting with the
+    # first (<code>rank == 0</code>) ranked instance and ending with the
+    # last (<code>rank == #last</code>) ranked instance while
+    # yielding to a freshly created instance for every iteration
+    # step.
+    #
+    # The mixed in methods from the Enumerable module rely on this method.
+    def each # :yields: perm
+      0.upto(last) do |r|
+        klon = clone
+        klon.rank = r
+        yield klon
+      end
+      self
+    end
+
+    # Does something similar to #each. It doesn't create new
+    # instances (less overhead) for every iteration step, but yields to a
+    # modified self instead. This is useful if one only wants to call a
+    # method on the yielded value and work with the result of this call. It's
+    # not a good idea to put the yielded values in a data structure because all
+    # of them will reference the same (this!) instance. If you want to do this
+    # use #each.
+    def each!
+      old_rank = rank
+      0.upto(last) do |r|
+        self.rank = r
+        yield self
+      end
+      self
+    ensure
+      self.rank = old_rank
+    end
+  end
+end

data/lib/more_math/subset.rb

@@ -0,0 +1,46 @@
+require 'more_math/ranking_common'
+
+module MoreMath
+  class Subset
+    include Enumerable
+    include RankingCommon
+
+    # Returns a Subset instance for a collection of size +size+ with the rank
+    # +rank+.
+    def initialize(size, rank = 0)
+      @size, self.rank = size, rank
+      @last = (1 << size) - 1
+    end
+
+    # Returns the subset of the collection +collection+ for the rank +rank+.
+    def self.for(collection, rank = 0)
+      subset = new(collection.size, rank)
+      subset.instance_variable_set(:@collection, collection)
+      subset
+    end
+
+    # Returns the power set of the collection +collection+.
+    def self.power_set(collection)
+      self.for(collection).map(&:value)
+    end
+
+    # Assigns <code>m</code> to the rank attribute of this object.
+    def rank=(m)
+      @rank = m % (1 << size)
+    end
+
+    # Returns the subset for rank #rank and #collection. (If no collection was
+    # set it applies to the array [ 0, 1, ..., size - 1 ] instead.)
+    def value
+      result = []
+      c = @collection || (0...size).to_a
+      r = @rank
+      0.upto(size) do |i|
+        r[i] == 1 and result << c[i]
+      end
+      result
+    end
+
+    # TODO project
+  end
+end

data/lib/more_math/version.rb

@@ -1,6 +1,6 @@
 module MoreMath
   # MoreMath version
-  VERSION         = '0.0.2'
+  VERSION         = '0.0.3'
   VERSION_ARRAY   = VERSION.split(/\./).map { |x| x.to_i } # :nodoc:
   VERSION_MAJOR   = VERSION_ARRAY[0] # :nodoc:
   VERSION_MINOR   = VERSION_ARRAY[1] # :nodoc:

data/more_math.gemspec

@@ -2,34 +2,34 @@
 
 Gem::Specification.new do |s|
   s.name = "more_math"
-  s.version = "0.0.2"
+  s.version = "0.0.3"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
   s.authors = ["Florian Frank"]
-  s.date = "2011-09-25"
+  s.date = "2011-10-27"
   s.description = "Library that provides more mathematical functions/algorithms than standard Ruby."
   s.email = "flori@ping.de"
-  s.extra_rdoc_files = ["README.rdoc", "lib/more_math/cantor_pairing_function.rb", "lib/more_math/version.rb", "lib/more_math/functions.rb", "lib/more_math/sequence.rb", "lib/more_math/linear_regression.rb", "lib/more_math/string_numeral.rb", "lib/more_math/histogram.rb", "lib/more_math/constants/functions_constants.rb", "lib/more_math/numberify_string_function.rb", "lib/more_math/distributions.rb", "lib/more_math/exceptions.rb", "lib/more_math/newton_bisection.rb", "lib/more_math/continued_fraction.rb", "lib/more_math.rb"]
-  s.files = [".gitignore", ".travis.yml", "CHANGES", "Gemfile", "LICENSE", "README.rdoc", "Rakefile", "VERSION", "lib/more_math.rb", "lib/more_math/cantor_pairing_function.rb", "lib/more_math/constants/functions_constants.rb", "lib/more_math/continued_fraction.rb", "lib/more_math/distributions.rb", "lib/more_math/exceptions.rb", "lib/more_math/functions.rb", "lib/more_math/histogram.rb", "lib/more_math/linear_regression.rb", "lib/more_math/newton_bisection.rb", "lib/more_math/numberify_string_function.rb", "lib/more_math/sequence.rb", "lib/more_math/string_numeral.rb", "lib/more_math/version.rb", "more_math.gemspec", "tests/test_analysis.rb", "tests/test_cantor_pairing_function.rb", "tests/test_continued_fraction.rb", "tests/test_distribution.rb", "tests/test_functions.rb", "tests/test_histogram.rb", "tests/test_newton_bisection.rb", "tests/test_numberify_string_function.rb"]
+  s.extra_rdoc_files = ["README.rdoc", "lib/more_math/cantor_pairing_function.rb", "lib/more_math/version.rb", "lib/more_math/functions.rb", "lib/more_math/sequence.rb", "lib/more_math/linear_regression.rb", "lib/more_math/string_numeral.rb", "lib/more_math/ranking_common.rb", "lib/more_math/subset.rb", "lib/more_math/histogram.rb", "lib/more_math/constants/functions_constants.rb", "lib/more_math/numberify_string_function.rb", "lib/more_math/distributions.rb", "lib/more_math/exceptions.rb", "lib/more_math/newton_bisection.rb", "lib/more_math/permutation.rb", "lib/more_math/continued_fraction.rb", "lib/more_math.rb"]
+  s.files = [".gitignore", ".travis.yml", "CHANGES", "Gemfile", "LICENSE", "README.rdoc", "Rakefile", "VERSION", "lib/more_math.rb", "lib/more_math/cantor_pairing_function.rb", "lib/more_math/constants/functions_constants.rb", "lib/more_math/continued_fraction.rb", "lib/more_math/distributions.rb", "lib/more_math/exceptions.rb", "lib/more_math/functions.rb", "lib/more_math/histogram.rb", "lib/more_math/linear_regression.rb", "lib/more_math/newton_bisection.rb", "lib/more_math/numberify_string_function.rb", "lib/more_math/permutation.rb", "lib/more_math/ranking_common.rb", "lib/more_math/sequence.rb", "lib/more_math/string_numeral.rb", "lib/more_math/subset.rb", "lib/more_math/version.rb", "more_math.gemspec", "tests/test_cantor_pairing_function.rb", "tests/test_continued_fraction.rb", "tests/test_distribution.rb", "tests/test_functions.rb", "tests/test_histogram.rb", "tests/test_newton_bisection.rb", "tests/test_numberify_string_function.rb", "tests/test_permutation.rb", "tests/test_sequence.rb", "tests/test_subset.rb"]
   s.homepage = "http://flori.github.com/more_math"
   s.rdoc_options = ["--title", "MoreMath -- More Math in Ruby", "--main", "README.rdoc"]
   s.require_paths = ["lib"]
   s.rubygems_version = "1.8.10"
   s.summary = "Library that provides more mathematics."
-  s.test_files = ["tests/test_cantor_pairing_function.rb", "tests/test_continued_fraction.rb", "tests/test_newton_bisection.rb", "tests/test_analysis.rb", "tests/test_functions.rb", "tests/test_distribution.rb", "tests/test_histogram.rb", "tests/test_numberify_string_function.rb"]
+  s.test_files = ["tests/test_subset.rb", "tests/test_permutation.rb", "tests/test_cantor_pairing_function.rb", "tests/test_continued_fraction.rb", "tests/test_newton_bisection.rb", "tests/test_functions.rb", "tests/test_distribution.rb", "tests/test_sequence.rb", "tests/test_histogram.rb", "tests/test_numberify_string_function.rb"]
 
   if s.respond_to? :specification_version then
     s.specification_version = 3
 
     if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
-      s.add_development_dependency(%q<gem_hadar>, ["~> 0.1.0"])
+      s.add_development_dependency(%q<gem_hadar>, ["~> 0.1.1"])
       s.add_runtime_dependency(%q<tins>, ["~> 0.3"])
     else
-      s.add_dependency(%q<gem_hadar>, ["~> 0.1.0"])
+      s.add_dependency(%q<gem_hadar>, ["~> 0.1.1"])
       s.add_dependency(%q<tins>, ["~> 0.3"])
     end
   else
-    s.add_dependency(%q<gem_hadar>, ["~> 0.1.0"])
+    s.add_dependency(%q<gem_hadar>, ["~> 0.1.1"])
     s.add_dependency(%q<tins>, ["~> 0.3"])
   end
 end

data/tests/test_permutation.rb

@@ -0,0 +1,254 @@
+#!/usr/bin/env ruby
+
+require 'test/unit'
+require 'more_math'
+
+class TestPermutation < Test::Unit::TestCase
+  include MoreMath
+
+  def setup
+    @perms = (0..4).map { |i| Permutation.new(i) }
+    @perms_collections = [ "", "a", "ab", "abc", "abcd" ].map do |c|
+      Permutation.for(c)
+    end
+    @perms_each = [
+      [[]],
+      [[0]],
+      [[0, 1], [1, 0]],
+      [[0, 1, 2], [0, 2, 1], [1, 0, 2], [1, 2, 0], [2, 0, 1], [2, 1, 0]],
+      [[0, 1, 2, 3], [0, 1, 3, 2], [0, 2, 1, 3], [0, 2, 3, 1],
+        [0, 3, 1, 2], [0, 3, 2, 1], [1, 0, 2, 3], [1, 0, 3, 2],
+        [1, 2, 0, 3], [1, 2, 3, 0], [1, 3, 0, 2], [1, 3, 2, 0],
+        [2, 0, 1, 3], [2, 0, 3, 1], [2, 1, 0, 3], [2, 1, 3, 0],
+        [2, 3, 0, 1], [2, 3, 1, 0], [3, 0, 1, 2], [3, 0, 2, 1],
+        [3, 1, 0, 2], [3, 1, 2, 0], [3, 2, 0, 1], [3, 2, 1, 0]]
+    ]
+    @next_pred = [
+      [ [], [] ],
+      [ [ 0 ], [ 0 ] ],
+      [ [ 0, 1 ], [ 1, 0 ] ],
+      [ [ 1, 0 ], [ 0, 1 ] ],
+      [ [ 0, 1, 2 ], [ 0, 2, 1 ] ],
+      [ [ 0, 2, 1 ], [ 1, 0, 2 ] ],
+      [ [ 1, 0, 2 ], [ 1, 2, 0 ] ],
+      [ [ 1, 2, 0 ], [ 2, 0, 1 ] ],
+      [ [ 2, 0, 1 ], [ 2, 1, 0 ] ],
+      [ [ 2, 1, 0 ], [ 0, 1, 2 ] ],
+    ]
+    @projected = [
+      [ "" ],
+      [ "a" ],
+      [ "ab", "ba", ],
+      [ "abc", "acb", "bac", "bca", "cab", "cba" ],
+      [ "abcd", "abdc", "acbd", "acdb", "adbc", "adcb", "bacd",
+        "badc", "bcad", "bcda", "bdac", "bdca", "cabd", "cadb",
+        "cbad", "cbda", "cdab", "cdba", "dabc", "dacb", "dbac",
+        "dbca", "dcab", "dcba"]
+    ]
+    @products = [
+      {[0, 0]=>[]},
+      {[0, 0]=>[0]},
+      {[0, 0]=>[0, 1], [1, 1]=>[0, 1], [1, 0]=>[1, 0], [0, 1]=>[1, 0]},
+      {[2, 4]=>[2, 1, 0], [1, 2]=>[2, 0, 1], [0, 0]=>[0, 1, 2],
+        [5, 4]=>[0, 2, 1], [3, 3]=>[2, 0, 1], [2, 1]=>[1, 2, 0],
+        [0, 5]=>[2, 1, 0], [3, 5]=>[0, 2, 1], [1, 1]=>[0, 1, 2],
+        [0, 3]=>[1, 2, 0], [5, 3]=>[1, 0, 2], [4, 1]=>[2, 1, 0],
+        [3, 2]=>[2, 1, 0], [2, 0]=>[1, 0, 2], [0, 4]=>[2, 0, 1],
+        [3, 4]=>[0, 1, 2], [1, 0]=>[0, 2, 1], [0, 2]=>[1, 0, 2],
+        [5, 2]=>[1, 2, 0], [4, 0]=>[2, 0, 1], [3, 1]=>[1, 0, 2],
+        [2, 3]=>[0, 2, 1], [1, 5]=>[1, 2, 0], [4, 5]=>[1, 0, 2],
+        [5, 1]=>[2, 0, 1], [4, 3]=>[0, 1, 2], [3, 0]=>[1, 2, 0],
+        [2, 2]=>[0, 1, 2], [1, 4]=>[1, 0, 2], [4, 4]=>[1, 2, 0],
+        [5, 0]=>[2, 1, 0], [4, 2]=>[0, 2, 1], [2, 5]=>[2, 0, 1],
+        [1, 3]=>[2, 1, 0], [0, 1]=>[0, 2, 1], [5, 5]=>[0, 1, 2]}
+    ]
+    @cycles = [
+      [[]],
+      [[]],
+      [[], [[0, 1]]],
+      [[], [[1, 2]], [[0, 1]], [[0, 1, 2]], [[0, 2, 1]], [[0, 2]]],
+      [[], [[2, 3]], [[1, 2]], [[1, 2, 3]], [[1, 3, 2]], [[1, 3]],
+        [[0, 1]], [[0, 1], [2, 3]], [[0, 1, 2]], [[0, 1, 2, 3]],
+        [[0, 1, 3, 2]], [[0, 1, 3]], [[0, 2, 1]], [[0, 2, 3, 1]],
+        [[0, 2]], [[0, 2, 3]], [[0, 2], [1, 3]], [[0, 2, 1, 3]],
+        [[0, 3, 2, 1]], [[0, 3, 1]], [[0, 3, 2]], [[0, 3]],
+        [[0, 3, 1, 2]], [[0, 3], [1, 2]]]
+    ]
+    @signum = [
+      [1],
+      [1],
+      [1, -1],
+      [1, -1, -1, 1, 1, -1],
+      [1, -1, -1, 1, 1, -1, -1, 1, 1, -1, -1, 1, 1, -1, -1, 1, 1, -1,
+        -1, 1, 1, -1, -1, 1]
+    ]
+  end
+
+  def test_created
+    factorial = 1
+    @perms.each_with_index do |p, i|
+      assert_equal(i, p.size)
+      assert_equal(factorial - 1, p.last)
+      factorial *= (i + 1)
+    end
+  end
+
+  def test_rank_assign
+    perm = Permutation.new(3)
+    perms = [
+      [0, 1, 2],
+      [0, 2, 1],
+      [1, 0, 2],
+      [1, 2, 0],
+      [2, 0, 1],
+      [2, 1, 0],
+      [0, 1, 2],
+    ]
+    (-12...-6).each do |i|
+      perm.rank = i
+      assert_equal(perms[i + 12], perm.value)
+    end
+    (-6...0).each do |i|
+      perm.rank = i
+      assert_equal(perms[i + 6], perm.value)
+    end
+    (0..6).each do |i|
+      perm.rank = i
+      assert_equal(perms[i], perm.value)
+    end
+    (6..12).each do |i|
+      perm.rank = i
+      assert_equal(perms[i - 6], perm.value)
+    end
+    (12..17).each do |i|
+      perm.rank = i
+      assert_equal(perms[i - 12], perm.value)
+    end
+  end
+
+  def test_compare
+    perm1 = Permutation.new(3)
+    perm2 = Permutation.new(3)
+    perm3 = perm1.dup
+    perm4 = Permutation.new(3, 1)
+    assert(!perm1.equal?(perm2))
+    assert(perm1 == perm2)
+    assert(perm1.eql?(perm2))
+    assert_equal(0, perm1 <=> perm2)
+    assert_equal(perm1.hash, perm2.hash)
+    assert(!perm1.equal?(perm3))
+    assert(perm1 == perm3)
+    assert(perm1.eql?(perm3))
+    assert_equal(0, perm1 <=> perm3)
+    assert_equal(perm1.hash, perm3.hash)
+    assert(!perm1.equal?(perm4))
+    assert(perm1 != perm4)
+    assert(!perm1.eql?(perm4))
+    assert_equal(-1, perm1 <=> perm4)
+    assert_equal(1, perm4 <=> perm1)
+    assert(perm1 < perm4)
+    assert(perm4 > perm1)
+    assert(perm1.hash != perm4.hash)
+    perms = perm1.to_a
+    perms[1..-1].each_with_index do |p, i|
+      assert(p > perms[i])
+      assert_equal(1, p <=> perms[i])
+      assert(perms[i] < p)
+      assert_equal(-1, perms[i] <=> p)
+    end
+  end
+
+  def test_random
+    @perms_each.each_with_index do |perms, i|
+      perm = Permutation.new(i)
+      until perms.empty?
+        deleted = perms.delete perm.random.value
+        deleted and assert true
+      end
+    end
+  end
+
+  def test_enumerable
+    @perms.each_with_index do |perm, i|
+      assert_equal(@perms_each[i], perm.map { |x| x.value })
+    end
+    @perms.each_with_index do |perm, i|
+      ary = []
+      old_rank = perm.rank
+      perm.each! { |x| ary << x.value }
+      assert_equal(@perms_each[i], ary)
+      assert_equal(old_rank, perm.rank)
+    end
+  end
+
+  def test_next
+    @next_pred.each do |before, after|
+      beforep = Permutation.from_value(before)
+      afterp = Permutation.from_value(after)
+      assert_equal(afterp, beforep.next)
+      assert_equal(beforep, afterp.pred)
+      assert_equal(afterp, beforep.succ)
+    end
+  end
+
+  def test_project
+    too_big = Array.new(10)
+    @perms.each_with_index do |perms, i|
+      assert_equal(@projected[i],
+                   perms.map { |p| p.project(@projected[i][0]) })
+      assert_raises(ArgumentError) { perms.project }
+      assert_raises(ArgumentError) { perms.project(too_big) }
+    end
+    @perms_collections.each_with_index do |perms, i|
+      assert_equal(@projected[i], perms.map { |p| p.project })
+    end
+  end
+
+  def test_compose
+    too_big = Permutation.new(10)
+    @perms[0..3].each do |perm|
+      elements = perm.to_a
+      for i in 0...elements.size
+        for j in 0...elements.size
+          assert_equal(@products[perm.size][[i, j]],
+                       (elements[i].compose(elements[j])).value)
+          assert_equal(@products[perm.size][[i, j]],
+                       (elements[i] * elements[j]).value)
+        end
+        assert_raises(ArgumentError) { elements[i] * too_big }
+        assert_raises(ArgumentError) { elements[i].compose(too_big) }
+      end
+    end
+  end
+
+  def test_invert
+    @perms.each do |perm|
+      id = perm
+      perm.each do |p|
+        assert_equal(id.value, (p * p.invert).value)
+        assert_equal(id, p * p.invert)
+        assert_equal(id.value, (p * -p).value)
+        assert_equal(id, p * -p)
+      end
+    end
+  end
+
+  def test_cycles
+    @perms.each_with_index do |perm, i|
+      assert_equal(@cycles[i], perm.map { |p| p.cycles })
+      assert_equal(perm.to_a,
+                   @cycles[i].map { |c| Permutation.from_cycles(c, i) })
+    end
+  end
+
+  def test_signum
+    @perms.each_with_index do |perm, i|
+      assert_equal(@signum[i], perm.map { |p| p.signum })
+      assert_equal(@signum[i], perm.map { |p| p.sgn })
+      assert_equal(@signum[i].map { |x| x == 1 },
+                   perm.map { |p| p.even? })
+      assert_equal(@signum[i].map { |x| x == -1 },
+                   perm.map { |p| p.odd? })
+    end
+  end
+end

data/tests/test_subset.rb

@@ -0,0 +1,21 @@
+#!/usr/bin/env ruby
+
+require 'test/unit'
+require 'more_math'
+
+class TestSubset < Test::Unit::TestCase
+  include MoreMath
+
+  def test_empty_set
+    assert_equal [[]], Subset.for([]).map(&:value)
+  end
+
+  def test_one_element_set
+    assert_equal [[], [1]], Subset.for([1]).map(&:value)
+  end
+
+  def test_three_element_set
+    assert_equal [[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]],
+      Subset.for([1, 2, 3]).map(&:value)
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: more_math
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.0.3
   prerelease: 
 platform: ruby
 authors:
@@ -9,22 +9,22 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2011-09-25 00:00:00.000000000Z
+date: 2011-10-27 00:00:00.000000000Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: gem_hadar
-  requirement: &2160789860 !ruby/object:Gem::Requirement
+  requirement: &2156570840 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
-        version: 0.1.0
+        version: 0.1.1
   type: :development
   prerelease: false
-  version_requirements: *2160789860
+  version_requirements: *2156570840
 - !ruby/object:Gem::Dependency
   name: tins
-  requirement: &2160789420 !ruby/object:Gem::Requirement
+  requirement: &2156570220 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ~>
@@ -32,7 +32,7 @@ dependencies:
         version: '0.3'
   type: :runtime
   prerelease: false
-  version_requirements: *2160789420
+  version_requirements: *2156570220
 description: Library that provides more mathematical functions/algorithms than standard
   Ruby.
 email: flori@ping.de
@@ -46,12 +46,15 @@ extra_rdoc_files:
 - lib/more_math/sequence.rb
 - lib/more_math/linear_regression.rb
 - lib/more_math/string_numeral.rb
+- lib/more_math/ranking_common.rb
+- lib/more_math/subset.rb
 - lib/more_math/histogram.rb
 - lib/more_math/constants/functions_constants.rb
 - lib/more_math/numberify_string_function.rb
 - lib/more_math/distributions.rb
 - lib/more_math/exceptions.rb
 - lib/more_math/newton_bisection.rb
+- lib/more_math/permutation.rb
 - lib/more_math/continued_fraction.rb
 - lib/more_math.rb
 files:
@@ -74,11 +77,13 @@ files:
 - lib/more_math/linear_regression.rb
 - lib/more_math/newton_bisection.rb
 - lib/more_math/numberify_string_function.rb
+- lib/more_math/permutation.rb
+- lib/more_math/ranking_common.rb
 - lib/more_math/sequence.rb
 - lib/more_math/string_numeral.rb
+- lib/more_math/subset.rb
 - lib/more_math/version.rb
 - more_math.gemspec
-- tests/test_analysis.rb
 - tests/test_cantor_pairing_function.rb
 - tests/test_continued_fraction.rb
 - tests/test_distribution.rb
@@ -86,6 +91,9 @@ files:
 - tests/test_histogram.rb
 - tests/test_newton_bisection.rb
 - tests/test_numberify_string_function.rb
+- tests/test_permutation.rb
+- tests/test_sequence.rb
+- tests/test_subset.rb
 homepage: http://flori.github.com/more_math
 licenses: []
 post_install_message: 
@@ -115,11 +123,13 @@ signing_key:
 specification_version: 3
 summary: Library that provides more mathematics.
 test_files:
+- tests/test_subset.rb
+- tests/test_permutation.rb
 - tests/test_cantor_pairing_function.rb
 - tests/test_continued_fraction.rb
 - tests/test_newton_bisection.rb
-- tests/test_analysis.rb
 - tests/test_functions.rb
 - tests/test_distribution.rb
+- tests/test_sequence.rb
 - tests/test_histogram.rb
 - tests/test_numberify_string_function.rb