Crandore Hub

binpackr

Fast 1d Bin Packing

Implements the First Fit Decreasing algorithm to achieve one dimensional heuristic bin packing. Runtime is of order O(n log(n)) where n is the number of items to pack. See "The Art of Computer Programming Vol. 1" by Donald E. Knuth (1997, ISBN: 0201896834) for more details.

Versions across snapshots

VersionRepositoryFileSize
0.2.0 rolling linux/jammy R-4.5 binpackr_0.2.0.tar.gz 307.6 KiB
0.2.0 rolling linux/noble R-4.5 binpackr_0.2.0.tar.gz 307.7 KiB
0.2.0 rolling source/ R- binpackr_0.2.0.tar.gz 294.7 KiB
0.2.0 latest linux/jammy R-4.5 binpackr_0.2.0.tar.gz 307.6 KiB
0.2.0 latest linux/noble R-4.5 binpackr_0.2.0.tar.gz 307.7 KiB
0.2.0 latest source/ R- binpackr_0.2.0.tar.gz 294.7 KiB
0.2.0 2026-04-26 source/ R- binpackr_0.2.0.tar.gz 294.7 KiB
0.2.0 2026-04-23 source/ R- binpackr_0.2.0.tar.gz 294.7 KiB
0.2.0 2026-04-09 windows/windows R-4.5 binpackr_0.2.0.zip 390.0 KiB
0.1.1 2025-04-20 source/ R- binpackr_0.1.1.tar.gz 298.4 KiB

Dependencies (latest)

LinkingTo

Suggests