Software
| Package | Role | Licence | Description | Depends on | Used by | Links |
|---|---|---|---|---|---|---|
| rectpackr-layout v1.0.1 | Web component | MIT | Best-fit rectangle packing as a custom element: it measures its children, of any size, and packs them again as they resize, arrive or leave. | best-fit-strip-pack | none | sourcenpm |
| best-fit-strip-pack v1.1.0 | Algorithm | MIT | Online best-fit strip packing for TypeScript: each rectangle is placed once, as it arrives, and only the skyline of the packing is kept. | addressable-binary-heapsabstract-linked-lists | rectpackr-layout | sourcenpm |
| prefix-tries v1.1.1 | Data structure | MIT | Tries for TypeScript that keep insertion order: sets and maps of strings with prefix search, standard or compressed (radix), under a common interface. | abstract-linked-lists | none | sourcenpm |
| addressable-binary-heaps v1.1.0 | Data structure | MIT | Addressable min-heaps and max-heaps for TypeScript: any object with a numeric key is an element, and the heap always knows where it sits. | none | best-fit-strip-pack | sourcenpm |
| abstract-linked-lists v1.1.0 | Data structure | MIT | Singly and doubly linked lists for TypeScript, reduced to a node that holds nothing but its pointers, for your own objects to extend. | none | best-fit-strip-packprefix-tries | sourcenpm |