Skip to content

Java Version of a Bin Packer Algorithm to fit many blocks. Handles one or more bins.

License

Notifications You must be signed in to change notification settings

alexbonilla/java-bin-packer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

java-bin-packer

Java Version of a bin-packer at https://github.com/jakesgordon/bin-packing/. jakesgordon made an awesome job explaining his code at http://codeincomplete.com/posts/2011/5/7/bin_packing/

I translated the forementioned code to Java, since I saw it as a simple way to balance virtual machines in different hosts. But that is a complete different story.

The code preserves the functionality of the original javascript code, except that I added the option to handle more than 1 bin.

Demo

Clone the code [email protected]:alexbonilla/java-bin-packer.git com/iveloper/utils/packer/example/JavaBinPacker.java contains a running example you can play with.

Usage

If you want to use it inside your project, you need to do something like this:

    Packer packer = new Packer(2, 600, 800);// 2 available bins to fill, 600x800 each
    ArrayList<Node> blocks = new ArrayList();

    blocks.add(new Node("Figure1", 300, 400));
    blocks.add(new Node("Figure2", 300, 400));
    blocks.add(new Node("Figure3", 300, 400));
    blocks.add(new Node("Figure4", 300, 400));
    blocks.add(new Node("Figure5", 300, 400));
    blocks.add(new Node("Figure6", 300, 400));
    blocks.add(new Node("Figure7", 300, 400));
    blocks.add(new Node("Figure8", 300, 400));
    blocks.add(new Node("Figure9", 300, 400));

    Collections.sort(blocks, new Comparator<Node>() {
        @Override
        public int compare(Node a, Node b) {

            return (Double.compare(b.w, a.w)); //doing the sort based on the width, you can change it accordingly to your needs.
        }
    });

    packer.fit(blocks);
    Iterator<Node> blocksItr = blocks.iterator();
    while (blocksItr.hasNext()) {
        Node block = blocksItr.next();
        if (block.fit != null) {
            if (block.fit.isroot) {
                System.out.format("%32s", "Pack Starts Here");
                System.out.println("");
                System.out.format("%32s%24s%16s%16s%16s", "Display name", "x", "y", "w", "h");
                System.out.println("");
            }
            System.out.format("%32s%24s%16s%16s%16s", block.name, block.fit.x, block.fit.y, block.w, block.h);
            System.out.println("");
        }
    }

    System.out.println("");

The example above will produce this output:

Pack Starts Here Display name x y w h Figure1 0.0 0.0 300.0 400.0 Figure2 300.0 0.0 300.0 400.0 Figure3 0.0 400.0 300.0 400.0 Figure4 300.0 400.0 300.0 400.0 Pack Starts Here Display name x y w h Figure5 0.0 0.0 300.0 400.0 Figure6 300.0 0.0 300.0 400.0 Figure7 0.0 400.0 300.0 400.0 Figure8 300.0 400.0 300.0 400.0

In the example, Figure9 does not fit in either the two of the bins, since both are already full.

See source code comments for more details.

License

See LICENSE file.

Releases

No releases published

Packages

No packages published

Languages