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
344
345
346
347
348
349
350
351
352
353
354
|
/*************************************************************************
*
* 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.
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_sw.hxx"
#include <hintids.hxx>
#include <doc.hxx>
#include <editsh.hxx>
#include <cntfrm.hxx>
#include <pam.hxx>
#include <swundo.hxx> // fuer die UndoIds
#include <edimp.hxx>
#include <IMark.hxx>
#include <docary.hxx>
#include <SwRewriter.hxx>
#include <undobj.hxx>
#include <globals.hrc>
#include <comcore.hrc>
#include <list>
/************************************************************
* Loeschen
************************************************************/
void SwEditShell::DeleteSel( SwPaM& rPam, BOOL* pUndo )
{
// nur bei Selektion
if( !rPam.HasMark() || *rPam.GetPoint() == *rPam.GetMark())
return;
// besteht eine Selection in einer Tabelle ?
// dann nur den Inhalt der selektierten Boxen loeschen
// jetzt gibt es 2 Faelle die beachtet werden muessen:
// 1. Point und Mark stehen in einer Box, Selection normal loeschen
// 2. Point und Mark stehen in unterschiedlichen Boxen, alle
// selektierten Boxen suchen in den Inhalt loeschen
if( rPam.GetNode()->FindTableNode() &&
rPam.GetNode()->StartOfSectionNode() !=
rPam.GetNode(FALSE)->StartOfSectionNode() )
{
// in Tabellen das Undo gruppieren
if( pUndo && !*pUndo )
{
GetDoc()->StartUndo( UNDO_START, NULL );
*pUndo = TRUE;
}
SwPaM aDelPam( *rPam.Start() );
const SwPosition* pEndSelPos = rPam.End();
do {
aDelPam.SetMark();
SwNode* pNd = aDelPam.GetNode();
const SwNode& rEndNd = *pNd->EndOfSectionNode();
if( pEndSelPos->nNode.GetIndex() <= rEndNd.GetIndex() )
{
*aDelPam.GetPoint() = *pEndSelPos;
pEndSelPos = 0; // Pointer als Flag missbrauchen
}
else
{
// dann ans Ende der Section
aDelPam.GetPoint()->nNode = rEndNd;
aDelPam.Move( fnMoveBackward, fnGoCntnt );
}
// geschuetze Boxen ueberspringen !
if( !pNd->IsCntntNode() ||
!((SwCntntNode*)pNd)->GetFrm()->IsProtected() )
{
// alles loeschen
GetDoc()->DeleteAndJoin( aDelPam );
SaveTblBoxCntnt( aDelPam.GetPoint() );
}
if( !pEndSelPos ) // am Ende der Selection
break;
aDelPam.DeleteMark();
aDelPam.Move( fnMoveForward, fnGoCntnt ); // naechste Box
} while( pEndSelPos );
}
else
{
// alles loeschen
GetDoc()->DeleteAndJoin( rPam );
SaveTblBoxCntnt( rPam.GetPoint() );
}
// Selection wird nicht mehr benoetigt.
rPam.DeleteMark();
}
long SwEditShell::Delete()
{
SET_CURR_SHELL( this );
long nRet = 0;
if( !HasReadonlySel() )
{
StartAllAction();
BOOL bUndo = GetCrsr()->GetNext() != GetCrsr();
if( bUndo ) // mehr als eine Selection ?
{
SwRewriter aRewriter;
aRewriter.AddRule(UNDO_ARG1, String(SW_RES(STR_MULTISEL)));
GetDoc()->StartUndo( UNDO_DELETE, &aRewriter );
}
FOREACHPAM_START(this)
DeleteSel( *PCURCRSR, &bUndo );
FOREACHPAM_END()
// falls eine Undo-Klammerung, dann hier beenden
if( bUndo )
GetDoc()->EndUndo( UNDO_DELETE, NULL );
EndAllAction();
nRet = 1;
}
return nRet;
}
long SwEditShell::Copy( SwEditShell* pDestShell )
{
if( !pDestShell )
pDestShell = this;
SET_CURR_SHELL( pDestShell );
// List of insert positions for smart insert of block selections
std::list< boost::shared_ptr<SwPosition> > aInsertList;
// Fill list of insert positions
{
SwPosition * pPos = 0;
boost::shared_ptr<SwPosition> pInsertPos;
USHORT nMove = 0;
FOREACHPAM_START(this)
if( !pPos )
{
if( pDestShell == this )
{
// First cursor represents the target position!!
PCURCRSR->DeleteMark();
pPos = (SwPosition*)PCURCRSR->GetPoint();
continue;
}
else
pPos = pDestShell->GetCrsr()->GetPoint();
}
if( IsBlockMode() )
{ // In block mode different insert positions will be calculated
// by simulated cursor movements from the given first insert position
if( nMove )
{
SwCursor aCrsr( *pPos, 0, false);
if( aCrsr.UpDown( FALSE, nMove, 0, 0 ) )
{
pInsertPos.reset( new SwPosition( *aCrsr.GetPoint() ) );
aInsertList.push_back( pInsertPos );
}
}
else
pInsertPos.reset( new SwPosition( *pPos ) );
++nMove;
}
SwPosition *pTmp = IsBlockMode() ? pInsertPos.get() : pPos;
// Check if a selection would be copied into itself
if( pDestShell->GetDoc() == GetDoc() &&
*PCURCRSR->Start() <= *pTmp && *pTmp < *PCURCRSR->End() )
return FALSE;
FOREACHPAM_END()
}
pDestShell->StartAllAction();
SwPosition *pPos = 0;
BOOL bRet = FALSE;
BOOL bFirstMove = TRUE;
SwNodeIndex aSttNdIdx( pDestShell->GetDoc()->GetNodes() );
xub_StrLen nSttCntIdx = 0;
// For block selection this list is filled with the insert positions
std::list< boost::shared_ptr<SwPosition> >::iterator pNextInsert = aInsertList.begin();
pDestShell->GetDoc()->StartUndo( UNDO_START, NULL );
FOREACHPAM_START(this)
if( !pPos )
{
if( pDestShell == this )
{
// First cursor represents the target position!!
PCURCRSR->DeleteMark();
pPos = (SwPosition*)PCURCRSR->GetPoint();
continue;
}
else
pPos = pDestShell->GetCrsr()->GetPoint();
}
if( !bFirstMove )
{
if( pNextInsert != aInsertList.end() )
{
pPos = pNextInsert->get();
++pNextInsert;
}
else if( IsBlockMode() )
GetDoc()->SplitNode( *pPos, false );
}
// nur bei Selektion (nicht Textnodes haben Selection,
// aber Point/GetMark sind gleich
if( !PCURCRSR->HasMark() || *PCURCRSR->GetPoint() == *PCURCRSR->GetMark() )
continue;
if( bFirstMove )
{
// Anfangs-Position vom neuen Bereich merken
aSttNdIdx = pPos->nNode.GetIndex()-1;
nSttCntIdx = pPos->nContent.GetIndex();
bFirstMove = FALSE;
}
const bool bSuccess( GetDoc()->CopyRange( *PCURCRSR, *pPos, false ) );
if (!bSuccess)
continue;
SwPaM aInsertPaM(*pPos, SwPosition(aSttNdIdx));
pDestShell->GetDoc()->MakeUniqueNumRules(aInsertPaM);
bRet = TRUE;
FOREACHPAM_END()
// Maybe nothing has been moved?
if( !bFirstMove )
{
SwPaM* pCrsr = pDestShell->GetCrsr();
pCrsr->SetMark();
pCrsr->GetPoint()->nNode = aSttNdIdx.GetIndex()+1;
pCrsr->GetPoint()->nContent.Assign( pCrsr->GetCntntNode(),nSttCntIdx);
pCrsr->Exchange();
}
else
{
// falls beim Move der Cursor "gewandert" ist, so setze hier auch
// seinen GetMark um, damit dieser nie in den Wald zeigt.
pDestShell->GetCrsr()->SetMark();
pDestShell->GetCrsr()->DeleteMark();
}
#if OSL_DEBUG_LEVEL > 1
// pruefe ob die Indizies auch in den richtigen Nodes angemeldet sind
{
SwPaM* pCmp = (SwPaM*)pDestShell->GetCrsr(); // sicher den Pointer auf Cursor
do {
ASSERT( pCmp->GetPoint()->nContent.GetIdxReg()
== pCmp->GetCntntNode(), "Point im falschen Node" );
ASSERT( pCmp->GetMark()->nContent.GetIdxReg()
== pCmp->GetCntntNode(FALSE), "Mark im falschen Node" );
BOOL bTst = *pCmp->GetPoint() == *pCmp->GetMark();
(void) bTst;
} while( pDestShell->GetCrsr() != ( pCmp = (SwPaM*)pCmp->GetNext() ) );
}
#endif
// Undo-Klammerung hier beenden
pDestShell->GetDoc()->EndUndo( UNDO_END, NULL );
pDestShell->EndAllAction();
pDestShell->SaveTblBoxCntnt( pDestShell->GetCrsr()->GetPoint() );
return (long)bRet;
}
// Ersetz einen selektierten Bereich in einem TextNode mit dem
// String. Ist fuers Suchen&Ersetzen gedacht.
// bRegExpRplc - ersetze Tabs (\\t) und setze den gefundenen String
// ein ( nicht \& )
// z.B.: Fnd: "zzz", Repl: "xx\t\\t..&..\&"
// --> "xx\t<Tab>..zzz..&"
BOOL SwEditShell::Replace( const String& rNewStr, BOOL bRegExpRplc )
{
SET_CURR_SHELL( this );
BOOL bRet = FALSE;
if( !HasReadonlySel() )
{
StartAllAction();
GetDoc()->StartUndo(UNDO_EMPTY, NULL);
FOREACHPAM_START(this)
if( PCURCRSR->HasMark() && *PCURCRSR->GetMark() != *PCURCRSR->GetPoint() )
{
bRet = GetDoc()->ReplaceRange( *PCURCRSR, rNewStr, bRegExpRplc )
|| bRet;
SaveTblBoxCntnt( PCURCRSR->GetPoint() );
}
FOREACHPAM_END()
// Undo-Klammerung hier beenden
GetDoc()->EndUndo(UNDO_EMPTY, NULL);
EndAllAction();
}
return bRet;
}
// Special-Methode fuer JOE's- Wizzards
BOOL SwEditShell::DelFullPara()
{
BOOL bRet = FALSE;
if( !IsTableMode() )
{
SwPaM* pCrsr = GetCrsr();
// keine Mehrfach-Selection
if( pCrsr->GetNext() == pCrsr && !HasReadonlySel() )
{
SET_CURR_SHELL( this );
StartAllAction();
bRet = GetDoc()->DelFullPara( *pCrsr );
EndAllAction();
}
}
return bRet;
}
|
