easy-box-packer 0.0.3 → 0.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 29750bc45104f8bddc2dbf0117bb41a5dbeae216
-  data.tar.gz: 6b696a68d044e4bdb34f31b02410c3597e2fbadc
+  metadata.gz: 9d7ee6c881d4342f0daaf9c3a87b838a6094c9e5
+  data.tar.gz: 2edf4d7bda53d69bd0e8f127124cf31619b940a1
 SHA512:
-  metadata.gz: cf3d9d27612e1bf412452eca360d2d792262ccf7137bd0f47dc1ce57d2f56477ab7901a3f7269a54958d6c71dabd0ff46494133b551e6122cde25c231262d2e1
-  data.tar.gz: c87f00e751a2c6b45096b9517f24c775ca93b0066596503ee842bee2cac8213aa18d2a4d6d2cb75160acbef7f5318e7329b87017f9f31cd22a775957bf1677de
+  metadata.gz: c4720460af7baf0828a12661358cec38e1ec1e4a565295d7604c879043bd268f9a6954bff6fb2d211c05ffef2c7ad8c2dd08a69a14318a6a06285066313f96e5
+  data.tar.gz: 30c42440ccad0c65b874166c523e4d5945250182a3a0cef5b992505772af2493d50a55846c4af72bcfade997a0991b825a7f8aa7de7542c0dfb00046f22b5d23

data/README.md

@@ -14,10 +14,12 @@ gem  'easy-box-packer'
 
 ## Usage
 
+### Check all items can be packed in a container
+
 ``` ruby
 require 'easy-box-packer'
 
-packings = BoxPacker.pack(
+cont = EasyBoxPacker.pack(
   container: { dimensions: [15, 20, 13], weight_limit: 50 },
   items: [
     { dimensions: [2, 3, 5], weight: 47 },
@@ -27,19 +29,28 @@ packings = BoxPacker.pack(
   ]
 )
 
-packings.length # 3
-packings[0][:weight] # 47
-packings[0][:placements].length # 1
-packings[0][:placements][0][:dimensions] # [2, 3, 5]
-packings[0][:placements][0][:position] # [0, 0, 0]
-packings[1][:weight] # 47
-packings[1][:placements].length # 1
-packings[1][:placements][0][:dimensions] # [2, 3, 5]
-packings[1][:placements][0][:position] # [0, 0, 0]
-packings[2][:weight] # 31
-packings[2][:placements].length # 2
-packings[2][:placements][0][:dimensions] # [1, 3, 3]
-packings[2][:placements][0][:position] # [0, 0, 0]
-packings[2][:placements][1][:dimensions] # [4, 1, 1]
-packings[2][:placements][1][:position] # [3, 0, 0]
+cont[:packings].length # 3
+cont[:packings][0][:weight] # 47
+cont[:packings][0][:placements].length # 1
+cont[:packings][0][:placements][0][:dimensions] # [2, 3, 5]
+cont[:packings][0][:placements][0][:position] # [0, 0, 0]
+cont[:packings][1][:weight] # 47
+cont[:packings][1][:placements].length # 1
+cont[:packings][1][:placements][0][:dimensions] # [2, 3, 5]
+cont[:packings][1][:placements][0][:position] # [0, 0, 0]
+cont[:packings][2][:weight] # 31
+cont[:packings][2][:placements].length # 2
+cont[:packings][2][:placements][0][:dimensions] # [1, 3, 3]
+cont[:packings][2][:placements][0][:position] # [0, 0, 0]
+cont[:packings][2][:placements][1][:dimensions] # [4, 1, 1]
+cont[:packings][2][:placements][1][:position] # [3, 0, 0]
+```
+
+### Get a reasonable smallest container by given boxes
+
+```
+container = EasyBoxPacker.find_smallest_container(
+    items: Array.new(1000) {{ dimensions: [1, 1, 1] }}
+  )
+container # [10, 10, 10]
 ```

data/easy-box-packer.rb

@@ -76,6 +76,10 @@ module EasyBoxPacker
       # base_container = sorted_items.first
       based_container = sorted_items.first
 
+      if sorted_items.size == 1
+        return based_container[:dimensions]
+      end
+
       find_possible_container(
         possible_containers: possible_containers,
         invalid_containers: invalid_containers,
@@ -118,9 +122,9 @@ module EasyBoxPacker
       ]
 
       tmp_possible_containers = []
-      # (1) loops base_container 6 rotations
+      # (1) loops base_container 3 rotations
       c_permutations.each do |c_perm|
-        # (2) try to puts items to 3 points, then it will create 6 different possible containers
+        # (2) try to puts items to 3 points, then it will create 3 different possible containers
         b_permutations.each do |b_perm|
           tmp_possible_containers << [  c_perm[0] + b_perm[0],     [c_perm[1], b_perm[1]].max, [c_perm[2], b_perm[2]].max]
           tmp_possible_containers << [ [c_perm[0], b_perm[0]].max,  c_perm[1] + b_perm[1],     [c_perm[2], b_perm[2]].max]
@@ -128,13 +132,14 @@ module EasyBoxPacker
         end
       end
       removed_tried_container = tmp_possible_containers.map { |a| a.sort }.uniq - possible_containers - invalid_containers
+
       return unless removed_tried_container.any?
       # (3) loop all container from smallest spaces to biggest space
       removed_tried_container.sort_by { |a| [a.inject(&:*), a.inject(&:+)] }.each do |cont|
         # (4) next unless l * w * h >= minimum_space
         if cont.inject(&:*) >= min_vol
           possible_containers << cont
-        else
+        # else
           # puts "invalid: #{cont}"
           # invalid_containers << cont
           # find_possible_container(possible_containers: possible_containers, invalid_containers: invalid_containers, container: cont, items: items, item_index: item_index + 1, min_vol: min_vol)

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: easy-box-packer
 version: !ruby/object:Gem::Version
-  version: 0.0.3
+  version: 0.0.4
 platform: ruby
 authors:
 - Aloha Chen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-03-23 00:00:00.000000000 Z
+date: 2017-04-02 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec