 (defun* lusty--compute-optimal-layout-inner (lengths-v)
   (let ((n-items (length lengths-v))
         (max-visible-rows (1- (lusty-max-window-height)))
-        (available-width (window-width))
+        (available-width (lusty-max-window-width))
         ; STEVE figure out optimal start :size
         ; STEVE use pre-allocated hash?
         (lengths-h (make-hash-table :test 'equal)))


(defun lusty--compute-optimal-layout (items)
  (let* ((max-visible-rows (1- (lusty-max-window-height)))
         (max-width (window-width))
         (upper-bound most-positive-fixnum)
         (n-items (length items))
         ; STEVE use pre-allocated array?

          (setq window-search-p nil))))
    lowest-window))

(defun lusty-max-window-height ()
  "Return the expected maximum allowable height of a window on this frame"
  ;; FIXME: are there cases where this is incorrect?
