1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
|
// XLayer.cc for FbTk - fluxbox toolkit
// Copyright (c) 2003 - 2006 Henrik Kinnunen (fluxgen at fluxbox dot org)
// and Simon Bowden (rathnor at users.sourceforge.net)
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the "Software"),
// to deal in the Software without restriction, including without limitation
// the rights to use, copy, modify, merge, publish, distribute, sublicense,
// and/or sell copies of the Software, and to permit persons to whom the
// Software is furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
// DEALINGS IN THE SOFTWARE.
#include "XLayer.hh"
#include "XLayerItem.hh"
#include "App.hh"
#include "FbWindow.hh"
#include "MultLayers.hh"
#include <iostream>
#include <numeric>
using std::find;
using namespace FbTk;
#ifdef DEBUG
using std::cerr;
using std::endl;
#endif // DEBUG
namespace {
int sum_windows(int nr, XLayerItem* item) {
return nr + item->numWindows();
}
int count_windows(const FbTk::XLayer::ItemList& items) {
return std::accumulate(items.begin(), items.end(), 0, sum_windows);
}
void extract_windows_to_stack(const XLayerItem::Windows& windows, std::vector<Window>& stack) {
XLayerItem::Windows::const_iterator i = windows.begin();
XLayerItem::Windows::const_iterator end = windows.end();
for (; i != end; ++i) {
Window w = (*i)->window();
if (w)
stack.push_back(w);
}
}
void extract_windows_to_stack(const FbTk::XLayer::ItemList& items, XLayerItem* temp_raised, std::vector<Window>& stack) {
if (temp_raised) { // add windows that go on top
extract_windows_to_stack(temp_raised->getWindows(), stack);
}
FbTk::XLayer::ItemList::const_iterator it = items.begin();
FbTk::XLayer::ItemList::const_iterator it_end = items.end();
for (; it != it_end; ++it) { // add all the windows from each other item
if (*it == temp_raised) {
continue;
}
extract_windows_to_stack((*it)->getWindows(), stack);
}
}
void restack(const FbTk::XLayer::ItemList& items, XLayerItem* temp_raised) {
std::vector<Window> stack;
extract_windows_to_stack(items, temp_raised, stack);
if (!stack.empty())
XRestackWindows(FbTk::App::instance()->display(), &stack[0], stack.size());
}
} // end of anonymous namespace
void XLayer::restack(const std::vector<XLayer*>& layers) {
std::vector<Window> stack;
std::vector<XLayer*>::const_iterator l;
for (l = layers.begin(); l != layers.end(); ++l) {
extract_windows_to_stack((*l)->getItemList(), 0, stack);
}
if (!stack.empty())
XRestackWindows(FbTk::App::instance()->display(), &stack[0], stack.size());
}
XLayer::XLayer(MultLayers &manager, int layernum):
m_manager(manager), m_layernum(layernum), m_needs_restack(false) {
}
XLayer::~XLayer() {
}
void XLayer::restack() {
if (m_manager.isUpdatable()) {
::restack(itemList(), 0);
m_needs_restack = false;
}
}
void XLayer::restackAndTempRaise(XLayerItem &item) {
::restack(itemList(), &item);
}
int XLayer::countWindows() {
return ::count_windows(itemList());
}
// Stack all windows associated with 'item' below the 'above' item
void XLayer::stackBelowItem(XLayerItem &item, XLayerItem *above) {
if (!m_manager.isUpdatable())
return;
// if there are no windows provided for above us,
// then we must restack the entire layer
// we can't do XRaiseWindow because a restack then causes OverrideRedirect
// windows to get pushed to the bottom
if (!above || m_needs_restack) { // must need to go right to top
restack();
return;
}
std::vector<Window> stack;
// We do have a window to stack below
// so we put it on top, and fill the rest of the array with the ones to go below it.
// assume that above's window exists
stack.push_back(above->getWindows().back()->window());
// fill the rest of the array
extract_windows_to_stack(item.getWindows(), stack);
XRestackWindows(FbTk::App::instance()->display(), &stack[0], stack.size());
}
// We can't just use Restack here, because it won't do anything if they're
// already in the same relative order excluding other windows
void XLayer::alignItem(XLayerItem &item) {
if (itemList().front() == &item) {
stackBelowItem(item, m_manager.getLowestItemAboveLayer(m_layernum));
return;
}
// Note: some other things effectively assume that the window list is
// sorted from highest to lowest
// get our item
iterator myit = find(itemList().begin(), itemList().end(), &item);
iterator it = myit;
// go to the one above it in our layer (top is front, so we decrement)
--it;
// keep going until we find one that is currently visible to the user
while (it != itemList().begin() && !(*it)->visible())
--it;
if (it == itemList().begin() && !(*it)->visible())
// reached front item, but it wasn't visible, therefore it was already raised
stackBelowItem(item, m_manager.getLowestItemAboveLayer(m_layernum));
else
stackBelowItem(item, *it);
}
XLayer::iterator XLayer::insert(XLayerItem &item, unsigned int pos) {
#ifdef DEBUG
// at this point we don't support insertions into a layer other than at the top
if (pos != 0)
cerr<<__FILE__<<"("<<__LINE__<<"): Insert using non-zero position not valid in XLayer"<<endl;
#endif // DEBUG
itemList().push_front(&item);
// restack below next window up
stackBelowItem(item, m_manager.getLowestItemAboveLayer(m_layernum));
return itemList().begin();
}
void XLayer::remove(XLayerItem &item) {
iterator it = itemList().begin();
iterator it_end = itemList().end();
for (; it != it_end; ++it) {
if (*it == &item) {
itemList().erase(it);
break;
}
}
}
void XLayer::raise(XLayerItem &item) {
// assume it is already in this layer
if (&item == itemList().front()) {
if (m_needs_restack)
restack();
return; // nothing to do
}
iterator it = find(itemList().begin(), itemList().end(), &item);
if (it != itemList().end())
itemList().erase(it);
else {
#ifdef DEBUG
cerr<<__FILE__<<"("<<__LINE__<<"): WARNING: raise on item not in layer["<<m_layernum<<"]"<<endl;
#endif // DEBUG
return;
}
itemList().push_front(&item);
stackBelowItem(item, m_manager.getLowestItemAboveLayer(m_layernum));
}
void XLayer::tempRaise(XLayerItem &item) {
// assume it is already in this layer
if (!m_needs_restack && &item == itemList().front())
return; // nothing to do
iterator it = find(itemList().begin(), itemList().end(), &item);
if (it == itemList().end()) {
#ifdef DEBUG
cerr<<__FILE__<<"("<<__LINE__<<"): WARNING: raise on item not in layer["<<m_layernum<<"]"<<endl;
#endif // DEBUG
return;
}
if (m_needs_restack)
restackAndTempRaise(item);
else
stackBelowItem(item, m_manager.getLowestItemAboveLayer(m_layernum));
m_needs_restack = true;
}
void XLayer::lower(XLayerItem &item) {
// assume already in this layer
// is it already the lowest?
if (&item == itemList().back()) {
if (m_needs_restack)
restack();
return; // nothing to do
}
iterator it = find(itemList().begin(), itemList().end(), &item);
if (it != itemList().end())
// remove this item
itemList().erase(it);
#ifdef DEBUG
else {
cerr<<__FILE__<<"("<<__LINE__<<"): WARNING: lower on item not in layer"<<endl;
return;
}
#endif // DEBUG
// add it to the bottom
itemList().push_back(&item);
// find the item we need to stack below
// start at the end
it = itemList().end();
// go up one so we have an object (which must exist, since at least this item is in the layer)
it--;
// go down another one
// must exist, otherwise our item must == itemList().back()
it--;
// and restack our window below that one.
stackBelowItem(item, *it);
}
void XLayer::raiseLayer(XLayerItem &item) {
m_manager.raiseLayer(item);
}
void XLayer::lowerLayer(XLayerItem &item) {
m_manager.lowerLayer(item);
}
void XLayer::moveToLayer(XLayerItem &item, int layernum) {
m_manager.moveToLayer(item, layernum);
}
XLayerItem *XLayer::getLowestItem() {
if (itemList().empty())
return 0;
else
return itemList().back();
}
|