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
|
// RowSmartPlacement.cc
// Copyright (c) 2006 Fluxbox Team (fluxgen at fluxbox dot org)
//
// 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.
// $Id$
#include "RowSmartPlacement.hh"
#include "Window.hh"
#include "Screen.hh"
#include "ScreenPlacement.hh"
bool RowSmartPlacement::placeWindow(const std::list<FluxboxWindow *> &windowlist,
const FluxboxWindow &win,
int &place_x, int &place_y) {
bool placed = false;
int next_x, next_y;
// view (screen + head) constraints
int head = (signed) win.getOnHead();
int head_left = (signed) win.screen().maxLeft(head);
int head_right = (signed) win.screen().maxRight(head);
int head_top = (signed) win.screen().maxTop(head);
int head_bot = (signed) win.screen().maxBottom(head);
const ScreenPlacement &screen_placement =
dynamic_cast<const ScreenPlacement &>(win.screen().placementStrategy());
bool top_bot =
screen_placement.colDirection() == ScreenPlacement::TOPBOTTOM;
bool left_right =
screen_placement.rowDirection() == ScreenPlacement::LEFTRIGHT;
int change_x = 1, change_y = 1;
if (screen_placement.colDirection() == ScreenPlacement::BOTTOMTOP)
change_y = -1;
if (screen_placement.rowDirection() == ScreenPlacement::RIGHTLEFT)
change_x = -1;
int win_w = win.width() + win.fbWindow().borderWidth()*2 + win.widthOffset();
int win_h = win.height() + win.fbWindow().borderWidth()*2 + win.heightOffset();
int x_off = win.xOffset();
int y_off = win.yOffset();
int test_y;
if (top_bot)
test_y = head_top;
else
test_y = head_bot - win_h;
while (!placed &&
(top_bot ? test_y + win_h <= head_bot
: test_y >= head_top)) {
int test_x;
if (left_right)
test_x = head_left;
else
test_x = head_right - win_w;
// The trick here is that we set it to the furthest away one,
// then the code brings it back down to the safest one that
// we can go to (i.e. the next untested area)
if (top_bot)
next_y = head_bot; // will be shrunk
else
next_y = head_top-1;
while (!placed &&
(left_right ? test_x + win_w <= head_right
: test_x >= head_left)) {
placed = true;
next_x = test_x + change_x;
std::list<FluxboxWindow *>::const_iterator win_it =
windowlist.begin();
std::list<FluxboxWindow *>::const_iterator win_it_end =
windowlist.end();
for (; win_it != win_it_end && placed; ++win_it) {
FluxboxWindow &window = **win_it;
int curr_x = window.x() - window.xOffset(); // minus offset to get back up to fake place
int curr_y = window.y() - window.yOffset();
int curr_w = window.width() + window.fbWindow().borderWidth()*2 + window.widthOffset();
int curr_h = window.height() + window.fbWindow().borderWidth()*2 + window.heightOffset();
if (curr_x < test_x + win_w &&
curr_x + curr_w > test_x &&
curr_y < test_y + win_h &&
curr_y + curr_h > test_y) {
// this window is in the way
placed = false;
// we find the next x that we can go to (a window will be in the way
// all the way to its far side)
if (left_right) {
if (curr_x + curr_w > next_x)
next_x = curr_x + curr_w;
} else {
if (curr_x - win_w < next_x)
next_x = curr_x - win_w;
}
// but we can only go to the nearest y, since that is where the
// next time current windows in the way will change
if (top_bot) {
if (curr_y + curr_h < next_y)
next_y = curr_y + curr_h;
} else {
if (curr_y - win_h > next_y)
next_y = curr_y - win_h;
}
}
}
if (placed) {
place_x = test_x + x_off;
place_y = test_y + y_off;
break;
}
test_x = next_x;
} // end while
test_y = next_y;
} // end while
return placed;
}
|
