partitions 0.1.0 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 2decbf60e2bc3cd7377d2d42b003897d7e167c2f
-  data.tar.gz: 4eee0fbaa035a56b04f862c4207442f365256a73
+  metadata.gz: 2aa22121b5627f30e18b9a2740d3cac3b8f33ecb
+  data.tar.gz: f1857f98aaf24b9f6db43cb62ddbb5203b4c1f14
 SHA512:
-  metadata.gz: 1a564fa6fe63af32ae7aed33cec7a3c7ff3f878bfe62d24f1cca23a2b1e9849e21ad31d990cd96259880e2638e3f1b50725de6acbea5c1ce939f1dafe46b082f
-  data.tar.gz: 354d064c68d4a5c9b9ac944dd0613ed54c21ec2f6bfe7c278f1b599fedf5576b9d0b082de3acd104509528b44ca2bffa3016e6213e8e862c700aee3a678213d1
+  metadata.gz: 96c4c851431664fbebeee2622cf118ab78b4400ae91788e821ef8dce4dfbfcfc8635c1a0f1e731dc9cb8186f6956676cfa7f347e4ee5c94c041a24227342a3be
+  data.tar.gz: 2650403dca28ff72cf42662491ad0a021b357f11829fe0a4b46020923e741dc69411c663c4a236a807d0ed3878a73807a82892ce034e375eaa66f24dfeefb4e5

data/README.md

@@ -92,6 +92,26 @@ Or install it yourself as:
     irb(main):004:0> sp.count
     => 4140
 
+    irb(main):005:0> sp = Partitions::SetPartitions.new(6,5)
+    => #<Partitions::SetPartitions:0x007fd9c284def8 @n=6, @k=[0, 0, 1, 2, 3, 4], @m=[0, 0, 1, 2, 3, 4], @p=5, @size=5>
+    irb(main):006:0> sp.each_partition{|partition| p partition};nil
+    [0, 0, 1, 2, 3, 4]
+    [0, 1, 0, 2, 3, 4]
+    [0, 1, 1, 2, 3, 4]
+    [0, 1, 2, 0, 3, 4]
+    [0, 1, 2, 1, 3, 4]
+    [0, 1, 2, 2, 3, 4]
+    [0, 1, 2, 3, 0, 4]
+    [0, 1, 2, 3, 1, 4]
+    [0, 1, 2, 3, 2, 4]
+    [0, 1, 2, 3, 3, 4]
+    [0, 1, 2, 3, 4, 0]
+    [0, 1, 2, 3, 4, 1]
+    [0, 1, 2, 3, 4, 2]
+    [0, 1, 2, 3, 4, 3]
+    [0, 1, 2, 3, 4, 4]
+    => nil
+
 ##References
 ###Integer Partitions
 ---------------------------

data/lib/partitions/set_partitions.rb

@@ -1,47 +1,93 @@
 module Partitions
   class SetPartitions
-    attr_accessor :k, :m, :n, :size
+    attr_reader  :size
 
     def initialize(n, p=nil)
       @n = n
       @k = Array.new(n, 0)
       @m = Array.new(n, 0)
       @p = p
-      @size = 0
+      pinitialize
+      @size = partition_size
     end
 
     def next_partition
-      (@n - 1).downto(1) do |i|
-        if @k[i] <= @m[i - 1]
-          @k[i] = @k[i] + 1
-          @m[i] = max(@m[i], @k[i])
-          j = i + 1
-          while j <= (n - 1) do
-            @k[j] = @k[0]
-            @m[j] = @m[i]
-            j = j + 1
+      if @p.nil?
+        (@n - 1).downto(1) do |i|
+          if @k[i] <= @m[i - 1]
+            @k[i] = @k[i] + 1
+            @m[i] = max(@m[i], @k[i])
+            j = i + 1
+            while j <= (n - 1) do
+              @k[j] = @k[0]
+              @m[j] = @m[i]
+              j = j + 1
+            end
+            @size = partition_size
+            return @k.clone
+          end
+        end
+      else
+        p = partition_size
+        (@n - 1).downto(1) do |i|
+          if (@k[i] < (p - 1)) && (@k[i] <= @m[i - 1])
+            @k[i] = @k[i] + 1
+            @m[i] = max(@m[i], @k[i])
+            j = i + 1
+            while j <= (@n - (p - @m[i])) do
+              @k[j] = 0
+              @m[j] = @m[i]
+              j = j + 1
+            end
+            j = @n - (p - @m[i]) + 1
+            while j <= (n - 1) do
+              @k[j] = @m[j] = p - (@n - j)
+              j = j + 1
+            end
+            @size = partition_size
+            return @k.clone
           end
-          @size = partition_size
-          return @k
         end
       end
 
       @size = nil
-      return
+      return 
     end
 
     def previous_partition
-      (@n - 1).downto(1) do |i|
-        if @k[i] > @k[0]
-          @k[i] = @k[i] - 1
-          @m[i] = @m[i - 1]
-          j = i + 1
-          while j <= n - 1 do
-            @k[j] = @m[j] = @m[i] + j - i;
-            j = j + 1
+      if @p.nil?
+        (@n - 1).downto(1) do |i|
+          if @k[i] > @k[0]
+            @k[i] = @k[i] - 1
+            @m[i] = @m[i - 1]
+            j = i + 1
+            while j <= n - 1 do
+              @k[j] = @m[j] = @m[i] + j - i;
+              j = j + 1
+            end
+            @size = partition_size
+            return @k.clone
+          end
+        end
+      else
+        p = partition_size
+        (@n - 1).downto(1).each do |i|
+          if (@k[i] > 0) && ((p - @m[i - 1]) <= (n - i))
+            @k[i] = @k[i] - 1
+            @m[i] = @m[i - 1]
+            j = i + 1
+            while j <= (i + (p - @m[i]) - 1) do
+              @k[j] = @m[j] = @m[i] + j - i
+              j = j + 1
+            end
+            j = i + (p - @m[i])
+            while j <= (@n - 1) do
+              @k[j] = @m[j] = p - 1
+              j = j + 1
+            end
+            @size = partition_size
+            return @k.clone
           end
-          @size = partition_size
-          return @k
         end
       end
 
@@ -54,23 +100,31 @@ module Partitions
         raise ArgumentError, "Missing block"
       end
       reinitialize
-      yield @k
+      yield @k.clone
       (count - 1).times do
-        yield next_partition
+        partition = next_partition
+        yield partition
       end
       reinitialize
     end
 
     def count
-      sum = 0
-      (1..n).each do |k|
-        sum += sterling_second(@n, k)
+      if @p.nil?
+        sum = 0
+        (1..n).each do |k|
+          sum += sterling_second(@n, k)
+        end
+        return sum
+      else
+        sum = sterling_second(@n, @p)
       end
-      return sum
     end
 
     private
 
+    attr_accessor :k, :m, :n
+    attr_writer :size
+
     def sterling_second(n, k)
       if k == 1 || k == n
         return 1
@@ -86,7 +140,21 @@ module Partitions
     def reinitialize
       @k = Array.new(n, 0)
       @m = Array.new(n, 0)
-      @size = 0
+      pinitialize
+      @size = partition_size
+    end
+
+    def pinitialize
+      unless @p.nil?
+        (0..(@n - @p)).each do |i|
+          @k[i] = @m[i] = 0
+        end
+        i = (@n - @p + 1)
+        while i <= (@n - 1) do
+          @k[i] = @m[i] = i - (@n - @p)
+          i = i + 1
+        end
+      end
     end
 
     def max a, b

data/lib/partitions/version.rb

@@ -1,3 +1,3 @@
 module Partitions
-  VERSION = "0.1.0"
+  VERSION = "0.2.0"
 end

data/partitions.gemspec

@@ -7,7 +7,7 @@ Gem::Specification.new do |spec|
   spec.name          = "partitions"
   spec.version       = Partitions::VERSION
   spec.authors       = ["NagaChaitanya Vellanki"]
-  spec.email         = ["me@chaitanyavellanki.com"]
+  spec.email         = ["nagachaitanya.vellanki.com"]
 
   spec.summary       = %q{a rubygem to generate partitions.}
   spec.description   = %q{Generate integer, set and multiset partitions}

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: partitions
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.2.0
 platform: ruby
 authors:
 - NagaChaitanya Vellanki
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2015-09-23 00:00:00.000000000 Z
+date: 2015-09-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -68,7 +68,7 @@ dependencies:
         version: '0.10'
 description: Generate integer, set and multiset partitions
 email:
-- me@chaitanyavellanki.com
+- nagachaitanya.vellanki.com
 executables: []
 extensions: []
 extra_rdoc_files: []