pub type Floors = HashMap<u64, Minimum>;Expand description
Each window’s own floor, by id: the smallest its tile can be for its client to fit, frame included (#115).
Not Minimum, which is one floor for every tile and a rule about
splitting. This is what an application says it cannot go under, one window
at a time. tree::Tiling gives a window under its floor a larger share,
taken from its siblings, and scroller::Scroller never lays a column out
narrower than the widest floor in it. A window with no entry has no floor
of its own, and an empty map is exactly the arithmetic before #115.
Aliased Type§
pub struct Floors { /* private fields */ }