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
|
/* -*- 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 <hintids.hxx>
#include <doc.hxx>
#include <IDocumentUndoRedo.hxx>
#include <editsh.hxx>
#include <cntfrm.hxx>
#include <pam.hxx>
#include <swundo.hxx>
#include <edimp.hxx>
#include <IMark.hxx>
#include <docary.hxx>
#include <SwRewriter.hxx>
#include <globals.hrc>
#include <comcore.hrc>
#include <list>
void SwEditShell::DeleteSel( SwPaM& rPam, sal_Bool* pUndo )
{
bool bSelectAll = StartsWithTable() && ExtendedSelectedAll(/*bFootnotes =*/ false);
// only for selections
if( !rPam.HasMark() || *rPam.GetPoint() == *rPam.GetMark())
return;
// Is the selection in a table? Then delete only the content of the selected boxes.
// Here, there are two cases:
// 1. Point and Mark are in one box, delete selection as usual
// 2. Point and Mark are in different boxes, search all selected boxes and delete content
// 3. Point and Mark are at the document start and end, Point is in a table: delete selection as usual
if( rPam.GetNode()->FindTableNode() &&
rPam.GetNode()->StartOfSectionNode() !=
rPam.GetNode(sal_False)->StartOfSectionNode() && !bSelectAll )
{
// group the Undo in the table
if( pUndo && !*pUndo )
{
GetDoc()->GetIDocumentUndoRedo().StartUndo( UNDO_START, NULL );
*pUndo = sal_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; // misuse a pointer as a flag
}
else
{
// then go to the end of the selection
aDelPam.GetPoint()->nNode = rEndNd;
aDelPam.Move( fnMoveBackward, fnGoCntnt );
}
// skip protected boxes
if( !pNd->IsCntntNode() ||
!pNd->IsInProtectSect() )
{
// delete everything
GetDoc()->DeleteAndJoin( aDelPam );
SaveTblBoxCntnt( aDelPam.GetPoint() );
}
if( !pEndSelPos ) // at the end of a selection
break;
aDelPam.DeleteMark();
aDelPam.Move( fnMoveForward, fnGoCntnt ); // next box
} while( pEndSelPos );
}
else
{
SwPaM aPam(rPam);
if (bSelectAll)
// Selection starts at the first para of the first cell, but we
// want to delete the table node before the first cell as well.
aPam.Start()->nNode = aPam.Start()->nNode.GetNode().FindTableNode()->GetIndex();
// delete everything
GetDoc()->DeleteAndJoin( aPam );
SaveTblBoxCntnt( aPam.GetPoint() );
}
// Selection is not needed anymore
rPam.DeleteMark();
}
long SwEditShell::Delete()
{
SET_CURR_SHELL( this );
long nRet = 0;
if( !HasReadonlySel() )
{
StartAllAction();
sal_Bool bUndo = GetCrsr()->GetNext() != GetCrsr();
if( bUndo ) // more than one selection?
{
SwRewriter aRewriter;
aRewriter.AddRule(UndoArg1, SW_RESSTR(STR_MULTISEL));
GetDoc()->GetIDocumentUndoRedo().StartUndo(UNDO_DELETE, &aRewriter);
}
FOREACHPAM_START(GetCrsr())
DeleteSel( *PCURCRSR, &bUndo );
FOREACHPAM_END()
// If undo container then close here
if( bUndo )
{
GetDoc()->GetIDocumentUndoRedo().EndUndo(UNDO_END, 0);
}
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;
sal_uInt16 nMove = 0;
FOREACHPAM_START(GetCrsr())
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( sal_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 sal_False;
FOREACHPAM_END()
}
pDestShell->StartAllAction();
SwPosition *pPos = 0;
sal_Bool bRet = sal_False;
bool bFirstMove = true;
SwNodeIndex aSttNdIdx( pDestShell->GetDoc()->GetNodes() );
sal_Int32 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()->GetIDocumentUndoRedo().StartUndo( UNDO_START, NULL );
FOREACHPAM_START(GetCrsr())
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 );
}
// Only for a selection (non-text nodes have selection but Point/GetMark are equal)
if( !PCURCRSR->HasMark() || *PCURCRSR->GetPoint() == *PCURCRSR->GetMark() )
continue;
if( bFirstMove )
{
// Store start position of the new area
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 = sal_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
{
// If the cursor moved during move process, move also its GetMark
pDestShell->GetCrsr()->SetMark();
pDestShell->GetCrsr()->DeleteMark();
}
#if OSL_DEBUG_LEVEL > 0
// check if the indices are registered in the correct nodes
{
SwPaM* pCmp = (SwPaM*)pDestShell->GetCrsr(); // store pointer to cursor
do {
OSL_ENSURE( pCmp->GetPoint()->nContent.GetIdxReg()
== pCmp->GetCntntNode(), "Point in wrong Node" );
OSL_ENSURE( pCmp->GetMark()->nContent.GetIdxReg()
== pCmp->GetCntntNode(sal_False), "Mark in wrong Node" );
bool bTst = *pCmp->GetPoint() == *pCmp->GetMark();
(void) bTst;
} while( pDestShell->GetCrsr() != ( pCmp = (SwPaM*)pCmp->GetNext() ) );
}
#endif
// close Undo container here
pDestShell->GetDoc()->GetIDocumentUndoRedo().EndUndo( UNDO_END, NULL );
pDestShell->EndAllAction();
pDestShell->SaveTblBoxCntnt( pDestShell->GetCrsr()->GetPoint() );
return (long)bRet;
}
/** Replace a selected area in a text node with a given string.
*
* Intended for "search & replace".
*
* @param bRegExpRplc if <true> replace tabs (\\t) and replace with found string (not \&).
* E.g. [Fnd: "zzz", Repl: "xx\t\\t..&..\&"] --> "xx\t<Tab>..zzz..&"
*/
sal_Bool SwEditShell::Replace( const OUString& rNewStr, sal_Bool bRegExpRplc )
{
SET_CURR_SHELL( this );
sal_Bool bRet = sal_False;
if( !HasReadonlySel() )
{
StartAllAction();
GetDoc()->GetIDocumentUndoRedo().StartUndo(UNDO_EMPTY, NULL);
FOREACHPAM_START(GetCrsr())
if( PCURCRSR->HasMark() && *PCURCRSR->GetMark() != *PCURCRSR->GetPoint() )
{
bRet = GetDoc()->ReplaceRange( *PCURCRSR, rNewStr, bRegExpRplc )
|| bRet;
SaveTblBoxCntnt( PCURCRSR->GetPoint() );
}
FOREACHPAM_END()
// close Undo container here
GetDoc()->GetIDocumentUndoRedo().EndUndo(UNDO_EMPTY, NULL);
EndAllAction();
}
return bRet;
}
/// special method for JOE's wizards
sal_Bool SwEditShell::DelFullPara()
{
sal_Bool bRet = sal_False;
if( !IsTableMode() )
{
SwPaM* pCrsr = GetCrsr();
// no multi selection
if( pCrsr->GetNext() == pCrsr && !HasReadonlySel() )
{
SET_CURR_SHELL( this );
StartAllAction();
bRet = GetDoc()->DelFullPara( *pCrsr );
EndAllAction();
}
}
return bRet;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|