overlaps(a: any, b: any) → boolean

largestFree(bounds: any, obstacles: { any }, opts: any?) → any

The largest rect inside bounds { x, y, w, h } that overlaps none of the obstacle rects (each grown by opts.pad). opts.minW / opts.minH: prefer rects at least this big (the largest is still returned when none is). Returns { x, y, w, h } (w or h can be 0 when the obstacles fill everything).

offer(x1: number, x2: number, y1: number, y2: number) → void

evenRows(spans: { number }, cols: number) → void

Deal items with the given spans (1 or 2 columns wide) into rows of `cols` columns, keeping the order but pulling a 1-wide item forward when a 2-wide one does not fit, so every row holds as nearly the same number of columns as it can. Returns { { items = { index, ... }, used = columns } }.

rowWidths(spans: { number }, avail: number, gap: number) → void

Widths for a row of items with these spans, stretched to fill `avail` exactly with `gap` between them.

packLines(widths: { number }, avail: number, gap: number) → number

How many lines items of these widths take when wrapped left to right into `avail` with `gap` between.

fitGrid(items: { any }, availW: number, availH: number, opts: any?) → any

Choose a card grid that shows every card in availW x availH at once, with no scrolling. items: { { w, h, wide } } (a look's size; a wide one spans two columns once there are 3 or more). opts: { gap, headH (a card's label block), minCols, maxCols, minCardW (per column), minBodyH, maxCellH, maxScale, padX, padY (room around the look inside its card) }. Every column count is tried, the rows share the height evenly, and the grid whose looks are drawn largest wins (half the geometric mean of their scales, half the smallest scale, so no look is starved). Returns { fits, cols, rows, spans, cellH, bodyH, scales, minScale }; fits is false (with the best try) when nothing fits at the minimum sizes.