column_pack 1.0.0 → 1.0.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: d3392aff0cd883b18b176bc81e864c6eb575dcb7
-  data.tar.gz: 4973088e62dac89bc4f9096cec5e76431254af0e
+  metadata.gz: ea52916a285ff3137674ec892b04097564ef5b51
+  data.tar.gz: f88ca4053df9079852c7c665ea0092dc644b3330
 SHA512:
-  metadata.gz: 39fab94e8b81156dbe61ef7a7fd0f09c14f1445f0b234c07e9c2c3555af5d147342bac049fbabd5943c47349037df1b7a32286ab6e1f49184242141d2c599c94
-  data.tar.gz: be2914d3adc9180b9fe12dc9f3e90fe7d8fc4ebe2ee08344ff88fa8844acae0150457fa81cedbe6f2dcd3b598eca8c4e72adede90ac86cff98170fbf9f1aef68
+  metadata.gz: bc117743b86cb42061d308e96b66ed4b7c7b7f127784e40e8d41a035f183f0c7813dbd7167fdd816979a283cc633c8a5c63006db9e9a06eb61f56f63af031a72
+  data.tar.gz: cab6dbf8e18dfd3576a3944eabf3c6cf871e33fd111729b63c8e5997386e05cb0b42c46b17edc5721d9f8eb0689ab22b4aab03944f674596d6166d127da18d8c

data/MIT-LICENSE

@@ -1,20 +1,20 @@
-Copyright 2014 YOURNAME
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+Copyright 2014 Justin Tanner
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/Rakefile

@@ -1,32 +1,32 @@
-begin
-  require 'bundler/setup'
-rescue LoadError
-  puts 'You must `gem install bundler` and `bundle install` to run rake tasks'
-end
-
-require 'rdoc/task'
-
-RDoc::Task.new(:rdoc) do |rdoc|
-  rdoc.rdoc_dir = 'rdoc'
-  rdoc.title    = 'ColumnPack'
-  rdoc.options << '--line-numbers'
-  rdoc.rdoc_files.include('README.rdoc')
-  rdoc.rdoc_files.include('lib/**/*.rb')
-end
-
-
-
-
-Bundler::GemHelper.install_tasks
-
-require 'rake/testtask'
-
-Rake::TestTask.new(:test) do |t|
-  t.libs << 'lib'
-  t.libs << 'test'
-  t.pattern = 'test/**/*_test.rb'
-  t.verbose = false
-end
-
-
-task default: :test
+begin
+  require 'bundler/setup'
+rescue LoadError
+  puts 'You must `gem install bundler` and `bundle install` to run rake tasks'
+end
+
+require 'rdoc/task'
+
+RDoc::Task.new(:rdoc) do |rdoc|
+  rdoc.rdoc_dir = 'rdoc'
+  rdoc.title    = 'ColumnPack'
+  rdoc.options << '--line-numbers'
+  rdoc.rdoc_files.include('README.rdoc')
+  rdoc.rdoc_files.include('lib/**/*.rb')
+end
+
+
+
+
+Bundler::GemHelper.install_tasks
+
+require 'rake/testtask'
+
+Rake::TestTask.new(:test) do |t|
+  t.libs << 'lib'
+  t.libs << 'test'
+  t.pattern = 'test/**/*_test.rb'
+  t.verbose = false
+end
+
+
+task default: :test

data/lib/column_pack.rb

@@ -1,9 +1,9 @@
-require 'column_pack/railtie' if defined? Rails
-
-module ColumnPack
-  module Rails
-    class Engine < ::Rails::Engine
-      # Get rails to add app, lib, vendor to load path
-    end
-  end
-end
+require 'column_pack/railtie' if defined? Rails
+
+module ColumnPack
+  module Rails
+    class Engine < ::Rails::Engine
+      # Get rails to add app, lib, vendor to load path
+    end
+  end
+end

data/lib/column_pack/bin_packer.rb

@@ -1,104 +1,106 @@
-module ColumnPack
-
-  # Arranges elements into bins using a simple one dimensional bin packing algorithm.
-  class BinPacker
-
-    # Uses a fixed number of bins (total_bins).
-    #
-    # Options:
-    # :algorithm        specify a different bin packing algorithm (default :best_fit_decreasing)
-    #                   available algorithms are :best_fit_decreasing, :best_fit_increasing
-    #
-    # :shuffle_in_col   after packing columns, shuffle the elements in each column (defaults to true)
-    #
-    def initialize(total_bins, options = {})
-      raise ArgumentError.new("Must choose a number of bins greater than zero") if total_bins <= 0
-
-      @total_bins = total_bins
-      @algorithm  = options[:algorithm] || :best_fit_decreasing
-
-      if options.has_key? :shuffle_in_col
-        @shuffle_in_col = options[:shuffle_in_col]
-      else
-        @shuffle_in_col = true
-      end
-
-      @elements       = []
-      @needs_packing  = true
-    end
-
-    # Adds element to be packed.
-    def add(size, content)
-      raise ArgumentError.new("Bin size must be greater than zero") if size <= 0
-
-      @elements << {:size => size.to_i, :content => content}
-      @needs_packing = true
-    end
-
-    # Returns a packed multi-dimensional array of elements.
-    def bins
-      pack_all if @needs_packing
-      @bins
-    end
-
-    # Total empty space left over by uneven packing.
-    def empty_space
-      pack_all if @needs_packing
-      max = @sizes.each.max
-      space = 0
-      @sizes.each { |size| space += max - size }
-      return space
-    end
-
-    private
-    def pack_all
-      @bins   = Array.new(@total_bins) {Array.new}
-      @sizes  = Array.new(@total_bins, 0)
-
-      self.send(@algorithm)
-      tall_to_middle
-      shuffle_within_cols if @shuffle_in_col
-
-      @needs_packing = false
-    end
-
-    def best_fit_decreasing
-      @elements.sort_by! { |e| e[:size] }
-      @elements.reverse!
-      best_fit
-    end
-
-    def best_fit_increasing
-      @elements.sort_by! { |e| e[:size] }
-      best_fit
-    end
-
-    def best_fit
-      @elements.each do |element|
-        size, col = @sizes.each_with_index.min
-        pack(col, element)
-      end
-    end
-
-    def shuffle_within_cols
-      @bins.each { |bin| bin.shuffle! }
-    end
-
-    # moves the tallest bin to the middle
-    def tall_to_middle
-      if (@total_bins > 1) && ((@total_bins % 2) != 0)
-        size, max_col = @sizes.each_with_index.max
-        mid_col = @total_bins / 2
-
-        temp = @bins[mid_col].clone
-        @bins[mid_col] = @bins[max_col]
-        @bins[max_col] = temp
-      end
-    end
-
-    def pack(col, element)
-      @bins[col] << element[:content]
-      @sizes[col] += element[:size].to_i
-    end
-  end
-end
+module ColumnPack
+
+  # Arranges elements into bins using a simple one dimensional bin packing algorithm.
+  class BinPacker
+
+    # Uses a fixed number of bins (total_bins).
+    #
+    # Options:
+    # :algorithm        specify a different bin packing algorithm (default :best_fit_decreasing)
+    #                   available algorithms are :best_fit_decreasing, :best_fit_increasing
+    #
+    # :shuffle_in_col   after packing columns, shuffle the elements in each column (defaults to true)
+    #
+    def initialize(total_bins, options = {})
+      raise ArgumentError.new("Must choose a number of bins greater than zero") if total_bins <= 0
+
+      @total_bins = total_bins
+      @algorithm  = options[:algorithm] || :best_fit_decreasing
+
+      if options.has_key? :shuffle_in_col
+        @shuffle_in_col = options[:shuffle_in_col]
+      else
+        @shuffle_in_col = true
+      end
+
+      @elements       = []
+      @needs_packing  = true
+    end
+
+    # Adds element to be packed.
+    def add(size, content)
+      raise ArgumentError.new("Bin size must be greater than zero") if size <= 0
+
+      @elements << {:size => size.to_i, :content => content}
+      @needs_packing = true
+    end
+
+    # Returns a packed multi-dimensional array of elements.
+    def bins
+      pack_all if @needs_packing
+      @bins
+    end
+
+    # Total empty space left over by uneven packing.
+    def empty_space
+      pack_all if @needs_packing
+      max = @sizes.each.max
+      space = 0
+
+      @sizes.each { |size| space += max - size }
+
+      space
+    end
+
+    private
+    def pack_all
+      @bins   = Array.new(@total_bins) {Array.new}
+      @sizes  = Array.new(@total_bins, 0)
+
+      self.send(@algorithm)
+      tall_to_middle
+      shuffle_within_cols if @shuffle_in_col
+
+      @needs_packing = false
+    end
+
+    def best_fit_decreasing
+      @elements.sort_by! { |e| e[:size] }
+      @elements.reverse!
+      best_fit
+    end
+
+    def best_fit_increasing
+      @elements.sort_by! { |e| e[:size] }
+      best_fit
+    end
+
+    def best_fit
+      @elements.each do |element|
+        _, col = @sizes.each_with_index.min
+        pack(col, element)
+      end
+    end
+
+    def shuffle_within_cols
+      @bins.each { |bin| bin.shuffle! }
+    end
+
+    # moves the tallest bin to the middle
+    def tall_to_middle
+      if (@total_bins > 1) && ((@total_bins % 2) != 0)
+        _, max_col = @sizes.each_with_index.max
+        mid_col = @total_bins / 2
+
+        temp = @bins[mid_col].clone
+        @bins[mid_col] = @bins[max_col]
+        @bins[max_col] = temp
+      end
+    end
+
+    def pack(col, element)
+      @bins[col] << element[:content]
+      @sizes[col] += element[:size].to_i
+    end
+  end
+end

data/lib/column_pack/column_packer.rb

@@ -1,54 +1,54 @@
-module ColumnPack
-  # Arranges HTML elements into a fixed number of columns.
-  class ColumnPacker
-    include ActionView::Context
-    include ActionView::Helpers::TagHelper
-    include ActionView::Helpers::TextHelper
-
-    # Uses a fixed number of columns (total_columns).
-    #
-    # Options:
-    # :algorithm        specify a different bin packing algorithm (default :best_fit_decreasing)
-    #                   available algorithms are :best_fit_decreasing, :best_fit_increasing
-    #
-    # :shuffle_in_col   after packing columns, shuffle the elements in each column (defaults to true)
-    #
-    def initialize(total_columns, options = {})
-      @bin_packer = BinPacker.new(total_columns, options)
-    end
-
-    def add(height, content)
-      @bin_packer.add(height.to_i, content)
-    end
-
-    # Renders all elements into columns.
-    def render
-      wrap(@bin_packer.bins).html_safe
-    end
-
-    private
-    def wrap(bins)
-      content_tag :div, :class => "column-pack-wrap" do
-        capture do
-          bins.each do |bin|
-            concat column(bin)
-          end
-        end
-      end
-    end
-
-    def column(bin)
-      content_tag :div, :class => "column-pack-col" do
-        capture do
-          bin.each do |element|
-            concat element(element)
-          end
-        end
-      end
-    end
-
-    def element(element)
-      content_tag :div, element.html_safe, :class => "column-pack-element"
-    end
-  end
-end
+module ColumnPack
+  # Arranges HTML elements into a fixed number of columns.
+  class ColumnPacker
+    include ActionView::Context
+    include ActionView::Helpers::TagHelper
+    include ActionView::Helpers::TextHelper
+
+    # Uses a fixed number of columns (total_columns).
+    #
+    # Options:
+    # :algorithm        specify a different bin packing algorithm (default :best_fit_decreasing)
+    #                   available algorithms are :best_fit_decreasing, :best_fit_increasing
+    #
+    # :shuffle_in_col   after packing columns, shuffle the elements in each column (defaults to true)
+    #
+    def initialize(total_columns, options = {})
+      @bin_packer = BinPacker.new(total_columns, options)
+    end
+
+    def add(height, content)
+      @bin_packer.add(height.to_i, content)
+    end
+
+    # Renders all elements into columns.
+    def render
+      wrap(@bin_packer.bins).html_safe
+    end
+
+    private
+    def wrap(bins)
+      content_tag :div, :class => "column-pack-wrap" do
+        capture do
+          bins.each do |bin|
+            concat column(bin)
+          end
+        end
+      end
+    end
+
+    def column(bin)
+      content_tag :div, :class => "column-pack-col" do
+        capture do
+          bin.each do |element|
+            concat element(element)
+          end
+        end
+      end
+    end
+
+    def element(element)
+      content_tag :div, element.html_safe, :class => "column-pack-element"
+    end
+  end
+end