blob: 01f960010ac240bc38bd02bf36338a547b42f5e1 (
plain)
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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <vcl/window.hxx>
#include "invmerge.hxx"
ScInvertMerger::ScInvertMerger( ::std::vector< Rectangle >* pRectangles ) :
pRects( pRectangles )
{
// collect rectangles instead of inverting
}
ScInvertMerger::~ScInvertMerger()
{
Flush();
}
void ScInvertMerger::Flush()
{
FlushLine();
FlushTotal();
OSL_ENSURE( aLineRect.IsEmpty() && aTotalRect.IsEmpty(), "Flush: not empty" );
if ( pRects )
{
// also join vertically if there are non-adjacent columns involved
size_t nComparePos = 0;
while ( nComparePos < pRects->size() )
{
Rectangle aCompRect = (*pRects)[nComparePos];
sal_Int32 nBottom = aCompRect.Bottom();
size_t nOtherPos = nComparePos + 1;
while ( nOtherPos < pRects->size() )
{
Rectangle aOtherRect = (*pRects)[nOtherPos];
if ( aOtherRect.Top() > nBottom + 1 )
{
// rectangles are sorted, so we can stop searching
break;
}
if ( aOtherRect.Top() == nBottom + 1 &&
aOtherRect.Left() == aCompRect.Left() &&
aOtherRect.Right() == aCompRect.Right() )
{
// extend first rectangle
nBottom = aOtherRect.Bottom();
aCompRect.Bottom() = nBottom;
(*pRects)[nComparePos].Bottom() = nBottom;
// remove second rectangle
pRects->erase( pRects->begin() + nOtherPos );
// continue at unmodified nOtherPos
}
else
++nOtherPos;
}
++nComparePos;
}
}
}
void ScInvertMerger::FlushTotal()
{
if( aTotalRect.IsEmpty() )
return; // nothing to do
if ( pRects )
pRects->push_back( aTotalRect );
aTotalRect.SetEmpty();
}
void ScInvertMerger::FlushLine()
{
if( aLineRect.IsEmpty() )
return; // nothing to do
if ( aTotalRect.IsEmpty() )
{
aTotalRect = aLineRect; // start new total rect
}
else
{
if ( aLineRect.Left() == aTotalRect.Left() &&
aLineRect.Right() == aTotalRect.Right() &&
aLineRect.Top() == aTotalRect.Bottom() + 1 )
{
// extend total rect
aTotalRect.Bottom() = aLineRect.Bottom();
}
else
{
FlushTotal(); // draw old total rect
aTotalRect = aLineRect; // and start new one
}
}
aLineRect.SetEmpty();
}
void ScInvertMerger::AddRect( const Rectangle& rRect )
{
Rectangle aJustified = rRect;
if ( rRect.Left() > rRect.Right() ) // switch for RTL layout
{
aJustified.Left() = rRect.Right();
aJustified.Right() = rRect.Left();
}
if ( aLineRect.IsEmpty() )
{
aLineRect = aJustified; // start new line rect
}
else
{
bool bDone = false;
if ( aJustified.Top() == aLineRect.Top() &&
aJustified.Bottom() == aLineRect.Bottom() )
{
// try to extend line rect
if ( aJustified.Left() == aLineRect.Right() + 1 )
{
aLineRect.Right() = aJustified.Right();
bDone = true;
}
else if ( aJustified.Right() + 1 == aLineRect.Left() ) // for RTL layout
{
aLineRect.Left() = aJustified.Left();
bDone = true;
}
}
if (!bDone)
{
FlushLine(); // use old line rect for total rect
aLineRect = aJustified; // and start new one
}
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
