All patches and comments are welcome. Please squash your changes to logical
commits before using git-format-patch and git-send-email to
patches@git.madduck.net.
If you'd read over the Git project's submission guidelines and adhered to them,
I'd be especially grateful.
4 Licensed under GNU General Public License v2
6 * (c) 2013, Luke Bonham
7 * (c) 2010, Nicolas Estibals
8 * (c) 2010-2012, Peter Hofmann
12 local tag = require("awful.tag")
13 local beautiful = require("beautiful")
14 local math = { ceil = math.ceil,
17 local tonumber = tonumber
19 local centerfair = { name = "centerfair" }
21 function centerfair.arrange(p)
22 -- Layout with fixed number of vertical columns (read from nmaster).
23 -- Cols are centerded until there is nmaster columns, then windows
24 -- are stacked in the slave columns, with at most ncol clients per
25 -- column if possible.
27 -- with nmaster=3 and ncol=1 you'll have
29 -- +---+---+---+ +-+---+---+-+ +---+---+---+
30 -- | | | | | | | | | | | | |
31 -- | | 1 | | -> | | 1 | 2 | | -> | 1 | 2 | 3 | ->
32 -- | | | | | | | | | | | | |
33 -- +---+---+---+ +-+---+---+-+ +---+---+---+
36 -- +---+---+---+ +---+---+---+
37 -- | | | 3 | | | 2 | 4 |
38 -- + 1 + 2 +---+ -> + 1 +---+---+
39 -- | | | 4 | | | 3 | 5 |
40 -- +---+---+---+ +---+---+---+
42 -- A useless gap (like the dwm patch) can be defined with
43 -- beautiful.useless_gap_width .
44 local useless_gap = tonumber(beautiful.useless_gap_width) or 0
45 if useless_gap < 0 then useless_gap = 0 end
47 -- A global border can be defined with
48 -- beautiful.global_border_width
49 local global_border = tonumber(beautiful.global_border_width) or 0
50 if global_border < 0 then global_border = 0 end
52 -- Themes border width requires an offset
53 local bw = tonumber(beautiful.border_width) or 0
59 -- Borders are factored in.
60 wa.height = wa.height - ((global_border * 2) + (bw * 2))
61 wa.width = wa.width - ((global_border * 2) + (bw * 2))
63 -- How many vertical columns? Read from nmaster on the tag.
64 local t = tag.selected(p.screen)
65 local num_x = centerfair.nmaster or tag.getnmaster(t)
66 local ncol = centerfair.ncol or tag.getncol(t)
67 if num_x <= 2 then num_x = 2 end
68 if num_x > #cls then num_x = #cls end
70 local width = math.floor((wa.width-(num_x+1)*useless_gap) / num_x)
72 local offset_y = wa.y + useless_gap
75 -- Less clients than the number of columns, let's center it!
76 local offset_x = wa.x + useless_gap + (wa.width - #cls*width - (#cls+1)*useless_gap) / 2
79 g.height = wa.height - 2*useless_gap - 2
80 g.y = offset_y + global_border
82 g.x = offset_x + (i - 1) * (width + useless_gap + 2) + global_border
86 -- More clients than the number of columns, let's arrange it!
88 if useless_gap > 0 then
92 -- Master client deserves a special treatement
94 g.width = wa.width - (num_x - 1) * width - num_x * useless_gap
95 g.height = wa.height - 2*useless_gap - 2
96 g.x = offset_x + useless_gap + global_border
97 g.y = offset_y + global_border
103 -- Treat the other clients
105 -- Compute distribution of clients among columns
108 local remaining_clients = #cls-1
109 local ncol_min = math.ceil(remaining_clients/(num_x-1))
112 for i = (num_x-1), 1, -1 do
113 if (remaining_clients-i+1) < ncol
115 num_y[i] = remaining_clients-i + 1
119 remaining_clients = remaining_clients - num_y[i]
122 local rem = remaining_clients % (num_x-1)
125 for i = 1, num_x-1 do
129 for i = 1, num_x-1 do
130 num_y[i] = ncol_min - 1
133 num_y[num_x-1-i] = num_y[num_x-1-i] + 1
139 -- Compute geometry of the other clients
141 g.x = g.x + g.width+useless_gap + 2
144 if useless_gap > 0 then
145 g.width = g.width - useless_gap/2 - 2
148 for i = 1, (num_x-1) do
150 g.height = math.floor((wa.height - (num_y[i] * useless_gap)) / num_y[i])
151 g.y = offset_y + global_border
152 for j = 0, (num_y[i]-2) do
153 cls[nclient]:geometry(g)
154 nclient = nclient + 1
155 g.y = g.y + g.height+useless_gap + 2
156 to_remove = to_remove + 2
158 g.height = wa.height - num_y[i]*useless_gap - (num_y[i]-1)*g.height - useless_gap - to_remove
159 cls[nclient]:geometry(g)
160 nclient = nclient + 1
161 g.x = g.x+g.width+useless_gap + 2