mirror of https://github.com/lcpz/lain.git
161 lines
4.8 KiB
Lua
161 lines
4.8 KiB
Lua
|
|
--[[
|
|
|
|
Licensed under GNU General Public License v2
|
|
* (c) 2013, Luke Bonham
|
|
* (c) 2010-2012, Peter Hofmann
|
|
|
|
--]]
|
|
|
|
local tag = require("awful.tag")
|
|
local beautiful = require("beautiful")
|
|
local math = { ceil = math.ceil,
|
|
floor = math.floor,
|
|
max = math.max }
|
|
local tonumber = tonumber
|
|
|
|
local termfair =
|
|
{
|
|
name = "termfair",
|
|
|
|
-- You can set the number of columns and rows,
|
|
-- -- otherwise they are read from awful.tag
|
|
nmaster = 0, -- columns
|
|
ncol = 0 -- rows
|
|
}
|
|
|
|
function termfair.arrange(p)
|
|
-- Layout with fixed number of vertical columns (read from nmaster).
|
|
-- New windows align from left to right. When a row is full, a now
|
|
-- one above it is created. Like this:
|
|
|
|
-- (1) (2) (3)
|
|
-- +---+---+---+ +---+---+---+ +---+---+---+
|
|
-- | | | | | | | | | | | |
|
|
-- | 1 | | | -> | 2 | 1 | | -> | 3 | 2 | 1 | ->
|
|
-- | | | | | | | | | | | |
|
|
-- +---+---+---+ +---+---+---+ +---+---+---+
|
|
|
|
-- (4) (5) (6)
|
|
-- +---+---+---+ +---+---+---+ +---+---+---+
|
|
-- | 4 | | | | 5 | 4 | | | 6 | 5 | 4 |
|
|
-- +---+---+---+ -> +---+---+---+ -> +---+---+---+
|
|
-- | 3 | 2 | 1 | | 3 | 2 | 1 | | 3 | 2 | 1 |
|
|
-- +---+---+---+ +---+---+---+ +---+---+---+
|
|
|
|
-- A useless gap (like the dwm patch) can be defined with
|
|
-- beautiful.useless_gap_width.
|
|
local useless_gap = tonumber(beautiful.useless_gap_width)
|
|
if useless_gap == nil
|
|
then
|
|
useless_gap = 0
|
|
end
|
|
|
|
-- Screen.
|
|
local wa = p.workarea
|
|
local cls = p.clients
|
|
|
|
-- How many vertical columns?
|
|
local t = tag.selected(p.screen)
|
|
local num_x
|
|
if termfair.nmaster ~= 0
|
|
then
|
|
num_x = termfair.nmaster
|
|
else
|
|
num_x = tag.getnmaster(t)
|
|
end
|
|
|
|
-- Do at least "desired_y" rows.
|
|
local desired_y
|
|
if termfair.ncol ~= 0
|
|
then
|
|
desired_y = termfair.ncol
|
|
else
|
|
desired_y = tag.getncol(t)
|
|
end
|
|
|
|
if #cls > 0
|
|
then
|
|
local num_y = math.max(math.ceil(#cls / num_x), desired_y)
|
|
local cur_num_x = num_x
|
|
local at_x = 0
|
|
local at_y = 0
|
|
local remaining_clients = #cls
|
|
local width = math.floor(wa.width / num_x)
|
|
local height = math.floor(wa.height / num_y)
|
|
|
|
-- We start the first row. Left-align by limiting the number of
|
|
-- available slots.
|
|
if remaining_clients < num_x
|
|
then
|
|
cur_num_x = remaining_clients
|
|
end
|
|
|
|
-- Iterate in reversed order.
|
|
for i = #cls,1,-1
|
|
do
|
|
-- Get x and y position.
|
|
local c = cls[i]
|
|
local this_x = cur_num_x - at_x - 1
|
|
local this_y = num_y - at_y - 1
|
|
|
|
-- Calc geometry.
|
|
local g = {}
|
|
if this_x == (num_x - 1)
|
|
then
|
|
g.width = wa.width - (num_x - 1) * width
|
|
else
|
|
g.width = width
|
|
end
|
|
if this_y == (num_y - 1)
|
|
then
|
|
g.height = wa.height - (num_y - 1) * height
|
|
else
|
|
g.height = height
|
|
end
|
|
g.x = wa.x + this_x * width
|
|
g.y = wa.y + this_y * height
|
|
if useless_gap > 0
|
|
then
|
|
-- Top and left clients are shrinked by two steps and
|
|
-- get moved away from the border. Other clients just
|
|
-- get shrinked in one direction.
|
|
if this_x == 0
|
|
then
|
|
g.width = g.width - 2 * useless_gap
|
|
g.x = g.x + useless_gap
|
|
else
|
|
g.width = g.width - useless_gap
|
|
end
|
|
|
|
if this_y == 0
|
|
then
|
|
g.height = g.height - 2 * useless_gap
|
|
g.y = g.y + useless_gap
|
|
else
|
|
g.height = g.height - useless_gap
|
|
end
|
|
end
|
|
c:geometry(g)
|
|
remaining_clients = remaining_clients - 1
|
|
|
|
-- Next grid position.
|
|
at_x = at_x + 1
|
|
if at_x == num_x
|
|
then
|
|
-- Row full, create a new one above it.
|
|
at_x = 0
|
|
at_y = at_y + 1
|
|
|
|
-- We start a new row. Left-align.
|
|
if remaining_clients < num_x
|
|
then
|
|
cur_num_x = remaining_clients
|
|
end
|
|
end
|
|
end
|
|
end
|
|
end
|
|
|
|
return termfair
|