Brandon Semilla

`clamp(min, max, value)` matches stuff like `lerp(v0, v1, t)` quite nicely imo. Not bad for partial application either:thinking:

Probably just assert that all `n` between `[-2*m..2*m]` give expected results. Could panic if m

Devise a more elegant formula for handling negative numbers

4

Currently using `(n % m + m) % m` which looks hideously overcomplicated. sure it passes tests, but there's gotta be a better way of doing it?

Vectors are currently modeled as arrays in the current implementation, adding an extra layer of versatility. The current algorithm should be expanded to cover any dimension.

There are actually plenty of good box packing algorithms out there, but I made my own version without much regard for optimization since I had planned on using it for...

The algorithm already minimizes whitespace, but I'm currently searching for a heuristic that prefers layouts that place whitespace closer to the bottom-right corner than leaving them strewn arbitrarily throughout the...