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
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
|
/* -*- 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 <sal/config.h>
#include <sal/log.hxx>
#include <osl/diagnose.h>
#include <cstddef>
#include <vcl/textdata.hxx>
#include "textdat2.hxx"
TextSelection::TextSelection()
{
}
TextSelection::TextSelection( const TextPaM& rPaM ) :
maStartPaM( rPaM ), maEndPaM( rPaM )
{
}
TextSelection::TextSelection( const TextPaM& rStart, const TextPaM& rEnd ) :
maStartPaM( rStart ), maEndPaM( rEnd )
{
}
void TextSelection::Justify()
{
if ( maEndPaM < maStartPaM )
{
TextPaM aTemp( maStartPaM );
maStartPaM = maEndPaM;
maEndPaM = aTemp;
}
}
TETextPortionList::TETextPortionList()
{
}
TETextPortionList::~TETextPortionList()
{
Reset();
}
TETextPortion* TETextPortionList::operator[]( std::size_t nPos )
{
return maPortions[ nPos ].get();
}
std::vector<std::unique_ptr<TETextPortion>>::iterator TETextPortionList::begin()
{
return maPortions.begin();
}
std::vector<std::unique_ptr<TETextPortion>>::const_iterator TETextPortionList::begin() const
{
return maPortions.begin();
}
std::vector<std::unique_ptr<TETextPortion>>::iterator TETextPortionList::end()
{
return maPortions.end();
}
std::vector<std::unique_ptr<TETextPortion>>::const_iterator TETextPortionList::end() const
{
return maPortions.end();
}
bool TETextPortionList::empty() const
{
return maPortions.empty();
}
std::size_t TETextPortionList::size() const
{
return maPortions.size();
}
std::vector<std::unique_ptr<TETextPortion>>::iterator TETextPortionList::erase( const std::vector<std::unique_ptr<TETextPortion>>::iterator& aIter )
{
return maPortions.erase( aIter );
}
std::vector<std::unique_ptr<TETextPortion>>::iterator TETextPortionList::insert( const std::vector<std::unique_ptr<TETextPortion>>::iterator& aIter,
std::unique_ptr<TETextPortion> pTP )
{
return maPortions.insert( aIter, std::move(pTP) );
}
void TETextPortionList::push_back( std::unique_ptr<TETextPortion> pTP )
{
maPortions.push_back( std::move(pTP) );
}
void TETextPortionList::Reset()
{
maPortions.clear();
}
void TETextPortionList::DeleteFromPortion( std::size_t nDelFrom )
{
SAL_WARN_IF( ( nDelFrom >= maPortions.size() ) && ( (nDelFrom != 0) || (!maPortions.empty()) ), "vcl", "DeleteFromPortion: Out of range" );
maPortions.erase( maPortions.begin() + nDelFrom, maPortions.end() );
}
std::size_t TETextPortionList::FindPortion( sal_Int32 nCharPos, sal_Int32& nPortionStart, bool bPreferStartingPortion )
{
// find left portion at nCharPos at portion border
sal_Int32 nTmpPos = 0;
for ( std::size_t nPortion = 0; nPortion < maPortions.size(); nPortion++ )
{
TETextPortion* pPortion = maPortions[ nPortion ].get();
nTmpPos += pPortion->GetLen();
if ( nTmpPos >= nCharPos )
{
// take this one if we don't prefer the starting portion, or if it's the last one
if ( ( nTmpPos != nCharPos ) || !bPreferStartingPortion || ( nPortion == maPortions.size() - 1 ) )
{
nPortionStart = nTmpPos - pPortion->GetLen();
return nPortion;
}
}
}
OSL_FAIL( "FindPortion: Not found!" );
return ( maPortions.size() - 1 );
}
TEParaPortion::TEParaPortion( TextNode* pN )
: mpNode {pN}
, mnInvalidPosStart {0}
, mnInvalidDiff {0}
, mbInvalid {true}
, mbSimple {false}
{
}
TEParaPortion::~TEParaPortion()
{
}
void TEParaPortion::MarkInvalid( sal_Int32 nStart, sal_Int32 nDiff )
{
if ( !mbInvalid )
{
mnInvalidPosStart = ( nDiff >= 0 ) ? nStart : ( nStart + nDiff );
mnInvalidDiff = nDiff;
}
else
{
// simple consecutive typing
if ( ( nDiff > 0 ) && ( mnInvalidDiff > 0 ) &&
( ( mnInvalidPosStart+mnInvalidDiff ) == nStart ) )
{
mnInvalidDiff = mnInvalidDiff + nDiff;
}
// simple consecutive deleting
else if ( ( nDiff < 0 ) && ( mnInvalidDiff < 0 ) && ( mnInvalidPosStart == nStart ) )
{
mnInvalidPosStart = mnInvalidPosStart + nDiff;
mnInvalidDiff = mnInvalidDiff + nDiff;
}
else
{
SAL_WARN_IF( ( nDiff < 0 ) && ( (nStart+nDiff) < 0 ), "vcl", "MarkInvalid: Diff out of Range" );
mnInvalidPosStart = std::min( mnInvalidPosStart, nDiff < 0 ? nStart+nDiff : nDiff );
mnInvalidDiff = 0;
mbSimple = false;
}
}
maWritingDirectionInfos.clear();
mbInvalid = true;
}
void TEParaPortion::MarkSelectionInvalid( sal_Int32 nStart )
{
if ( !mbInvalid )
{
mnInvalidPosStart = nStart;
}
else
{
mnInvalidPosStart = std::min( mnInvalidPosStart, nStart );
}
maWritingDirectionInfos.clear();
mnInvalidDiff = 0;
mbInvalid = true;
mbSimple = false;
}
std::vector<TextLine>::size_type TEParaPortion::GetLineNumber( sal_Int32 nChar, bool bInclEnd )
{
for ( std::vector<TextLine>::size_type nLine = 0; nLine < maLines.size(); nLine++ )
{
TextLine& rLine = maLines[ nLine ];
if ( ( bInclEnd && ( rLine.GetEnd() >= nChar ) ) ||
( rLine.GetEnd() > nChar ) )
{
return nLine;
}
}
// Then it should be at the end of the last line
OSL_ENSURE(nChar == maLines.back().GetEnd(), "wrong Index");
OSL_ENSURE(!bInclEnd, "Line not found: FindLine");
return ( maLines.size() - 1 );
}
void TEParaPortion::CorrectValuesBehindLastFormattedLine( sal_uInt16 nLastFormattedLine )
{
sal_uInt16 nLines = maLines.size();
SAL_WARN_IF( !nLines, "vcl", "CorrectPortionNumbersFromLine: Empty portion?" );
if ( nLastFormattedLine < ( nLines - 1 ) )
{
const TextLine& rLastFormatted = maLines[ nLastFormattedLine ];
const TextLine& rUnformatted = maLines[ nLastFormattedLine+1 ];
std::ptrdiff_t nPortionDiff = rUnformatted.GetStartPortion() - rLastFormatted.GetEndPortion();
sal_Int32 nTextDiff = rUnformatted.GetStart() - rLastFormatted.GetEnd();
nTextDiff++; // LastFormatted.GetEnd() was inclusive => subtracted one too much!
// The first unformatted one has to start exactly one portion past the last
// formatted one.
// If a portion got split in the changed row, nLastEnd could be > nNextStart!
std::ptrdiff_t nPDiff = -( nPortionDiff-1 );
const sal_Int32 nTDiff = -( nTextDiff-1 );
if ( nPDiff || nTDiff )
{
for ( sal_uInt16 nL = nLastFormattedLine+1; nL < nLines; nL++ )
{
TextLine& rLine = maLines[ nL ];
rLine.SetStartPortion(rLine.GetStartPortion() + nPDiff);
rLine.SetEndPortion(rLine.GetEndPortion() + nPDiff);
rLine.SetStart(rLine.GetStart() + nTDiff);
rLine.SetEnd(rLine.GetEnd() + nTDiff);
rLine.SetValid();
}
}
}
}
TEParaPortions::~TEParaPortions()
{
}
IdleFormatter::IdleFormatter()
: mpView(nullptr)
, mnRestarts(0)
{
SetPriority(TaskPriority::HIGH_IDLE);
}
IdleFormatter::~IdleFormatter()
{
mpView = nullptr;
}
void IdleFormatter::DoIdleFormat( TextView* pV, sal_uInt16 nMaxRestarts )
{
mpView = pV;
if ( IsActive() )
mnRestarts++;
if ( mnRestarts > nMaxRestarts )
{
mnRestarts = 0;
Invoke();
}
else
{
Start();
}
}
void IdleFormatter::ForceTimeout()
{
if ( IsActive() )
{
Stop();
mnRestarts = 0;
Invoke();
}
}
TextHint::TextHint( SfxHintId Id ) : SfxHint( Id ), mnValue(0)
{
}
TextHint::TextHint( SfxHintId Id, sal_uLong nValue ) : SfxHint( Id ), mnValue(nValue)
{
}
TEIMEInfos::TEIMEInfos( const TextPaM& rPos, const OUString& rOldTextAfterStartPos )
: aOldTextAfterStartPos(rOldTextAfterStartPos)
, aPos(rPos)
, nLen(0)
, bWasCursorOverwrite(false)
{
}
TEIMEInfos::~TEIMEInfos()
{
}
void TEIMEInfos::CopyAttribs(const ExtTextInputAttr* pA, sal_Int32 nL)
{
nLen = nL;
pAttribs.reset( new ExtTextInputAttr[ nL ] );
memcpy( pAttribs.get(), pA, nL*sizeof(ExtTextInputAttr) );
}
void TEIMEInfos::DestroyAttribs()
{
pAttribs.reset();
nLen = 0;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|