npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

rectpack-ts

v0.0.1

Published

Rectpack-ts is a TypeScript library that implements heuristic algorithms for solving the 2D knapsack problem, also known as the bin packing problem. This involves packing a set of rectangles into the smallest number of bins.

Downloads

109

Readme

Rectpack-TS

Rectpack-ts is a TypeScript library that implements heuristic algorithms for solving the 2D knapsack problem, also known as the bin packing problem. This involves packing a set of rectangles into the smallest number of bins.

Credits

This TypeScript library is a port of the Python library rectpack by secnot. The structure and algorithms are based on the original rectpack library. Special thanks to the authors and contributors of rectpack for their work.

Installation

To install rectpack-ts, use npm:

npm install rectpack-ts

Basic Usage

Packing rectangles into a number of bins is easy:

import { Packer, MaxRectsBaf } from 'rectpack-ts';

const rectangles = [
  { width: 100, height: 30 },
  { width: 40, height: 60 },
  { width: 30, height: 30 },
  { width: 70, height: 70 },
  { width: 100, height: 50 },
  { width: 30, height: 30 },
];

const bins = [
  { width: 300, height: 450 },
  { width: 80, height: 40 },
  { width: 200, height: 150 },
];

const packer = new Packer({ binAlgo: MaxRectsBaf });

// Add the rectangles to the packing queue
for (const rect of rectangles) {
  packer.addRect(rect.width, rect.height);
}

// Add the bins where the rectangles will be placed
for (const bin of bins) {
  packer.addBin(bin.width, bin.height);
}

// Start packing
packer.pack();

Once the rectangles have been packed, the results can be accessed individually:

// Obtain number of bins used for packing
const nbins = packer.numberOfBins;

// Index first bin
const abin = packer.getBin(0);

// Bin dimensions (bins can be reordered during packing)
const { width, height } = abin;

// Number of rectangles packed into the first bin
const nrect = abin.numberOfRectangles;

// Second bin's rectangles
const rect = packer.getBin(1).rectangles;

// Rectangle properties
const { x, y, width, height, rid } = rect[0];

Looping over all bins and rectangles:

for (const bin of packer.binList()) {
  for (const rect of bin.rectangles) {
    console.log(rect);
  }
}

or all rectangles

p.rectList();

All dimensions (bins and rectangles) must be integers or decimals to avoid collisions caused by floating-point rounding.

API

A more detailed description of API calls:

  • new Packer({ binAlgo?, packAlgo?, sortAlgo?, rotation? })
    Return a new packer object.

    • binAlgo (optional, default: PackageBin.PackerBBF): Bin selection heuristic.
      • PackageBin.PackerBFF: (Bin First Fit) Pack rectangle into the first bin it fits (without closing)
      • PackageBin.PackerBNF: (Bin Next Fit) If a rectangle doesn't fit into the current bin, close it and try next one.
      • PackageBin.PackerBBF: (Bin Best Fit) Pack rectangle into the bin that gives best fitness.
    • packAlgo (optional, default: PackingAlgorithms.MaxRectsBssf): Packing algorithm for rectangles.
      • PackingAlgorithms.MaxRectsBl: Bottom Left
      • PackingAlgorithms.MaxRectsBssf: Best Sort Side Fit minimize short leftover side
      • PackingAlgorithms.MaxRectsBaf: Best Area Fit pick maximal rectangle with smallest area where the rectangle can be placed
      • PackingAlgorithms.MaxRectsBlsf: Best Long Side Fit minimize long leftover side
    • sortAlgo (optional, default: SORT_AREA): Rectangle sort order before packing.
      • SORT_NONE: Rectangles left unsorted.
      • SORT_AREA: Sort by descending area.
      • SORT_PERI: Sort by descending perimeter.
      • SORT_DIFF: Sort by difference of rectangle sides.
      • SORT_SSIDE: Sort by shortest side.
      • SORT_LSIDE: Sort by longest side.
      • SORT_RATIO: Sort by ratio between sides.
    • rotation (optional, default: true): Enable or disable rectangle rotation.
  • packer.addBin(width, height[, count[, id]])
    Add empty bin(s) to a packer.

    • width: Bin width.
    • height: Bin height.
    • count: Number of bins to add, 1 by default.
    • id: Optional bin identifier.
  • packer.addRect(width, height[, id])
    Add rectangle to the packing queue.

    • width: Rectangle width.
    • height: Rectangle height.
    • id: User assigned rectangle id.
  • packer.pack():
    Starts the packing process.

  • packer.rectList():
    Returns the list of packed rectangles, each represented by the object { binIndex, x, y, width, height, rid }.

  • packer.getBin(index):
    Returns the bin at specified index.

  • packer.binList():
    Returns the list of bins, each represented by the object { width, height, numberOfRectangles, rectangles: [{ x, y, width, height, rid }] }.

  • packer.reset():
    Resets all added bins, rectangles and its packing.

Testing

Run the tests with:

npm test