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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include <string.h> // fuer strchr()
#include <com/sun/star/i18n/UnicodeType.hdl>
#include <com/sun/star/i18n/WordType.hdl>
#include <unotools/charclass.hxx>
#include <hintids.hxx>
#include <doc.hxx>
#include <IDocumentUndoRedo.hxx>
#include <docary.hxx>
#include <mvsave.hxx> // Strukturen zum Sichern beim Move/Delete
#include <ndtxt.hxx>
#include <txatbase.hxx>
#include <rubylist.hxx>
#include <pam.hxx>
#include <swundo.hxx> // fuer die UndoIds
#include <breakit.hxx>
#include <crsskip.hxx>
SV_IMPL_PTRARR( SwRubyList, SwRubyListEntryPtr )
using namespace ::com::sun::star::i18n;
/*
* Members in the list:
* - String - the orig text
* - SwFmtRuby - the ruby attribut
*
*
*/
sal_uInt16 SwDoc::FillRubyList( const SwPaM& rPam, SwRubyList& rList,
sal_uInt16 nMode )
{
const SwPaM *_pStartCrsr = (SwPaM*)rPam.GetNext(),
*__pStartCrsr = _pStartCrsr;
sal_Bool bCheckEmpty = &rPam != _pStartCrsr;
do {
const SwPosition* pStt = _pStartCrsr->Start(),
* pEnd = pStt == _pStartCrsr->GetPoint()
? _pStartCrsr->GetMark()
: _pStartCrsr->GetPoint();
if( !bCheckEmpty || ( pStt != pEnd && *pStt != *pEnd ))
{
SwPaM aPam( *pStt );
do {
SwRubyListEntry* pNew = new SwRubyListEntry;
if( pEnd != pStt )
{
aPam.SetMark();
*aPam.GetMark() = *pEnd;
}
if( _SelectNextRubyChars( aPam, *pNew, nMode ))
{
rList.Insert( pNew, rList.Count() );
aPam.DeleteMark();
}
else
{
delete pNew;
if( *aPam.GetPoint() < *pEnd )
{
// goto next paragraph
aPam.DeleteMark();
aPam.Move( fnMoveForward, fnGoNode );
}
else
break;
}
} while( 30 > rList.Count() && *aPam.GetPoint() < *pEnd );
}
} while( 30 > rList.Count() &&
(_pStartCrsr=(SwPaM *)_pStartCrsr->GetNext()) != __pStartCrsr );
return rList.Count();
}
sal_uInt16 SwDoc::SetRubyList( const SwPaM& rPam, const SwRubyList& rList,
sal_uInt16 nMode )
{
GetIDocumentUndoRedo().StartUndo( UNDO_SETRUBYATTR, NULL );
std::set<sal_uInt16> aDelArr;
aDelArr.insert( RES_TXTATR_CJK_RUBY );
sal_uInt16 nListEntry = 0;
const SwPaM *_pStartCrsr = (SwPaM*)rPam.GetNext(),
*__pStartCrsr = _pStartCrsr;
sal_Bool bCheckEmpty = &rPam != _pStartCrsr;
do {
const SwPosition* pStt = _pStartCrsr->Start(),
* pEnd = pStt == _pStartCrsr->GetPoint()
? _pStartCrsr->GetMark()
: _pStartCrsr->GetPoint();
if( !bCheckEmpty || ( pStt != pEnd && *pStt != *pEnd ))
{
SwPaM aPam( *pStt );
do {
SwRubyListEntry aCheckEntry;
if( pEnd != pStt )
{
aPam.SetMark();
*aPam.GetMark() = *pEnd;
}
if( _SelectNextRubyChars( aPam, aCheckEntry, nMode ))
{
const SwRubyListEntry* pEntry = rList[ nListEntry++ ];
if( aCheckEntry.GetRubyAttr() != pEntry->GetRubyAttr() )
{
// set/reset the attribut
if( pEntry->GetRubyAttr().GetText().Len() )
{
InsertPoolItem( aPam, pEntry->GetRubyAttr(), 0 );
}
else
{
ResetAttrs( aPam, sal_True, aDelArr );
}
}
if( aCheckEntry.GetText() != pEntry->GetText() &&
pEntry->GetText().Len() )
{
// text is changed, so replace the original
ReplaceRange( aPam, pEntry->GetText(), false );
}
aPam.DeleteMark();
}
else
{
if( *aPam.GetPoint() < *pEnd )
{
// goto next paragraph
aPam.DeleteMark();
aPam.Move( fnMoveForward, fnGoNode );
}
else
{
const SwRubyListEntry* pEntry = rList[ nListEntry++ ];
// set/reset the attribut
if( pEntry->GetRubyAttr().GetText().Len() &&
pEntry->GetText().Len() )
{
InsertString( aPam, pEntry->GetText() );
aPam.SetMark();
aPam.GetMark()->nContent -= pEntry->GetText().Len();
InsertPoolItem( aPam, pEntry->GetRubyAttr(),
nsSetAttrMode::SETATTR_DONTEXPAND );
}
else
break;
aPam.DeleteMark();
}
}
} while( nListEntry < rList.Count() && *aPam.GetPoint() < *pEnd );
}
} while( 30 > rList.Count() &&
(_pStartCrsr=(SwPaM *)_pStartCrsr->GetNext()) != __pStartCrsr );
GetIDocumentUndoRedo().EndUndo( UNDO_SETRUBYATTR, NULL );
return nListEntry;
}
sal_Bool SwDoc::_SelectNextRubyChars( SwPaM& rPam, SwRubyListEntry& rEntry, sal_uInt16 )
{
// Point must be the startposition, Mark is optional the end position
SwPosition* pPos = rPam.GetPoint();
const SwTxtNode* pTNd = pPos->nNode.GetNode().GetTxtNode();
const String* pTxt = &pTNd->GetTxt();
xub_StrLen nStart = pPos->nContent.GetIndex(), nEnd = pTxt->Len();
sal_Bool bHasMark = rPam.HasMark();
if( bHasMark )
{
// in the same node?
if( rPam.GetMark()->nNode == pPos->nNode )
{
// then use that end
xub_StrLen nTEnd = rPam.GetMark()->nContent.GetIndex();
if( nTEnd < nEnd )
nEnd = nTEnd;
}
rPam.DeleteMark();
}
// ----- search the start
// --- look where a ruby attribut starts
sal_uInt16 nHtIdx = USHRT_MAX;
const SwpHints* pHts = pTNd->GetpSwpHints();
const SwTxtAttr* pAttr = 0;
if( pHts )
{
const SwTxtAttr* pHt;
for( nHtIdx = 0; nHtIdx < pHts->Count(); ++nHtIdx )
if( RES_TXTATR_CJK_RUBY == ( pHt = (*pHts)[ nHtIdx ])->Which() &&
*pHt->GetAnyEnd() > nStart )
{
if( *pHt->GetStart() < nEnd )
{
pAttr = pHt;
if( !bHasMark && nStart > *pAttr->GetStart() )
{
nStart = *pAttr->GetStart();
pPos->nContent = nStart;
}
}
break;
}
}
if( !bHasMark && nStart && ( !pAttr || nStart != *pAttr->GetStart()) )
{
// skip to the word begin!
long nWordStt = pBreakIt->GetBreakIter()->getWordBoundary(
*pTxt, nStart,
pBreakIt->GetLocale( pTNd->GetLang( nStart )),
WordType::ANYWORD_IGNOREWHITESPACES,
sal_True ).startPos;
if( nWordStt < nStart && -1 != nWordStt )
{
nStart = (xub_StrLen)nWordStt;
pPos->nContent = nStart;
}
}
sal_Bool bAlphaNum = sal_False;
long nWordEnd = nEnd;
CharClass& rCC = GetAppCharClass();
while( nStart < nEnd )
{
if( pAttr && nStart == *pAttr->GetStart() )
{
pPos->nContent = nStart;
if( !rPam.HasMark() )
{
rPam.SetMark();
pPos->nContent = *pAttr->GetAnyEnd();
if( pPos->nContent.GetIndex() > nEnd )
pPos->nContent = nEnd;
rEntry.SetRubyAttr( pAttr->GetRuby() );
}
break;
}
sal_Int32 nChType = rCC.getType( *pTxt, nStart );
sal_Bool bIgnoreChar = sal_False, bIsAlphaNum = sal_False, bChkNxtWrd = sal_False;
switch( nChType )
{
case UnicodeType::UPPERCASE_LETTER:
case UnicodeType::LOWERCASE_LETTER:
case UnicodeType::TITLECASE_LETTER:
case UnicodeType::DECIMAL_DIGIT_NUMBER:
bChkNxtWrd = bIsAlphaNum = sal_True;
break;
case UnicodeType::SPACE_SEPARATOR:
case UnicodeType::CONTROL:
/*??*/ case UnicodeType::PRIVATE_USE:
case UnicodeType::START_PUNCTUATION:
case UnicodeType::END_PUNCTUATION:
bIgnoreChar = sal_True;
break;
case UnicodeType::OTHER_LETTER:
bChkNxtWrd = sal_True;
default:
bIsAlphaNum = sal_False;
break;
}
if( rPam.HasMark() )
{
if( bIgnoreChar || bIsAlphaNum != bAlphaNum || nStart >= nWordEnd )
break;
}
else if( !bIgnoreChar )
{
rPam.SetMark();
bAlphaNum = bIsAlphaNum;
if( bChkNxtWrd && pBreakIt->GetBreakIter().is() )
{
// search the end of this word
nWordEnd = pBreakIt->GetBreakIter()->getWordBoundary(
*pTxt, nStart,
pBreakIt->GetLocale( pTNd->GetLang( nStart )),
WordType::ANYWORD_IGNOREWHITESPACES,
sal_True ).endPos;
if( 0 > nWordEnd || nWordEnd > nEnd || nWordEnd == nStart )
nWordEnd = nEnd;
}
}
pTNd->GoNext( &pPos->nContent, CRSR_SKIP_CHARS );
nStart = pPos->nContent.GetIndex();
}
nStart = rPam.GetMark()->nContent.GetIndex();
rEntry.SetText( pTxt->Copy( nStart,
rPam.GetPoint()->nContent.GetIndex() - nStart ));
return rPam.HasMark();
}
SwRubyListEntry::~SwRubyListEntry()
{
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
