2000-09-18 23:08:29 +00:00
|
|
|
/*************************************************************************
|
|
|
|
*
|
2005-09-09 04:18:40 +00:00
|
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
2000-09-18 23:08:29 +00:00
|
|
|
*
|
2005-09-09 04:18:40 +00:00
|
|
|
* $RCSfile: undel.cxx,v $
|
2000-09-18 23:08:29 +00:00
|
|
|
*
|
2007-07-26 07:20:20 +00:00
|
|
|
* $Revision: 1.22 $
|
2000-09-18 23:08:29 +00:00
|
|
|
*
|
2007-07-26 07:20:20 +00:00
|
|
|
* last change: $Author: rt $ $Date: 2007-07-26 08:20:20 $
|
2000-09-18 23:08:29 +00:00
|
|
|
*
|
2005-09-09 04:18:40 +00:00
|
|
|
* The Contents of this file are made available subject to
|
|
|
|
* the terms of GNU Lesser General Public License Version 2.1.
|
2000-09-18 23:08:29 +00:00
|
|
|
*
|
|
|
|
*
|
2005-09-09 04:18:40 +00:00
|
|
|
* GNU Lesser General Public License Version 2.1
|
|
|
|
* =============================================
|
|
|
|
* Copyright 2005 by Sun Microsystems, Inc.
|
|
|
|
* 901 San Antonio Road, Palo Alto, CA 94303, USA
|
2000-09-18 23:08:29 +00:00
|
|
|
*
|
2005-09-09 04:18:40 +00:00
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License version 2.1, as published by the Free Software Foundation.
|
2000-09-18 23:08:29 +00:00
|
|
|
*
|
2005-09-09 04:18:40 +00:00
|
|
|
* This library 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 for more details.
|
2000-09-18 23:08:29 +00:00
|
|
|
*
|
2005-09-09 04:18:40 +00:00
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
|
|
|
|
* MA 02111-1307 USA
|
2000-09-18 23:08:29 +00:00
|
|
|
*
|
|
|
|
************************************************************************/
|
|
|
|
|
2006-09-16 20:50:48 +00:00
|
|
|
// MARKER(update_precomp.py): autogen include statement, do not remove
|
|
|
|
#include "precompiled_sw.hxx"
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
|
|
|
|
#ifndef _HINTIDS_HXX
|
|
|
|
#include <hintids.hxx>
|
|
|
|
#endif
|
|
|
|
|
2000-10-25 14:13:25 +00:00
|
|
|
#ifndef _UNOTOOLS_CHARCLASS_HXX
|
|
|
|
#include <unotools/charclass.hxx>
|
2000-09-18 23:08:29 +00:00
|
|
|
#endif
|
|
|
|
#ifndef _SVX_BRKITEM_HXX //autogen
|
|
|
|
#include <svx/brkitem.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _FMTPDSC_HXX //autogen
|
|
|
|
#include <fmtpdsc.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _FRMFMT_HXX //autogen
|
|
|
|
#include <frmfmt.hxx>
|
|
|
|
#endif
|
2006-03-31 08:52:16 +00:00
|
|
|
#ifndef _FMTANCHR_HXX //autogen
|
|
|
|
#include <fmtanchr.hxx>
|
|
|
|
#endif
|
2000-09-18 23:08:29 +00:00
|
|
|
#ifndef _DOC_HXX
|
|
|
|
#include <doc.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _SWTABLE_HXX
|
|
|
|
#include <swtable.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _SWUNDO_HXX
|
|
|
|
#include <swundo.hxx> // fuer die UndoIds
|
|
|
|
#endif
|
|
|
|
#ifndef _PAM_HXX
|
|
|
|
#include <pam.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _NDTXT_HXX
|
|
|
|
#include <ndtxt.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _UNDOBJ_HXX
|
|
|
|
#include <undobj.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _ROLBCK_HXX
|
|
|
|
#include <rolbck.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _POOLFMT_HXX
|
|
|
|
#include <poolfmt.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _MVSAVE_HXX
|
|
|
|
#include <mvsave.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _REDLINE_HXX
|
|
|
|
#include <redline.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _DOCARY_HXX
|
|
|
|
#include <docary.hxx>
|
|
|
|
#endif
|
2006-05-02 14:18:01 +00:00
|
|
|
#ifndef _SFXAPP_HXX
|
2004-05-25 14:19:25 +00:00
|
|
|
#include <sfx2/app.hxx>
|
2004-05-18 13:07:16 +00:00
|
|
|
#endif
|
2004-09-08 13:59:07 +00:00
|
|
|
|
|
|
|
#include <fldbas.hxx>
|
|
|
|
#include <fmtfld.hxx>
|
2004-05-18 13:07:16 +00:00
|
|
|
#include <comcore.hrc> // #111827#
|
|
|
|
#include <undo.hrc>
|
2004-09-08 13:59:07 +00:00
|
|
|
|
2004-05-18 13:07:16 +00:00
|
|
|
// #include <svx/svxacorr.hxx>
|
|
|
|
// #include <comphelper/processfactory.hxx>
|
|
|
|
// #include <svx/unolingu.hxx>
|
|
|
|
// #include <unotools/localedatawrapper.hxx>
|
|
|
|
|
|
|
|
// using namespace comphelper;
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
inline SwDoc& SwUndoIter::GetDoc() const { return *pAktPam->GetDoc(); }
|
|
|
|
|
|
|
|
|
|
|
|
// DELETE
|
2006-03-31 08:52:16 +00:00
|
|
|
/* lcl_MakeAutoFrms has to call MakeFrms for objects bounded "AtChar" ( == AUTO ),
|
|
|
|
if the anchor frame has be moved via _MoveNodes(..) and DelFrms(..)
|
|
|
|
*/
|
|
|
|
|
|
|
|
void lcl_MakeAutoFrms( const SwSpzFrmFmts& rSpzArr, ULONG nMovedIndex )
|
|
|
|
{
|
|
|
|
if( rSpzArr.Count() )
|
|
|
|
{
|
|
|
|
SwFlyFrmFmt* pFmt;
|
|
|
|
const SwFmtAnchor* pAnchor;
|
|
|
|
for( USHORT n = 0; n < rSpzArr.Count(); ++n )
|
|
|
|
{
|
|
|
|
pFmt = (SwFlyFrmFmt*)rSpzArr[n];
|
|
|
|
pAnchor = &pFmt->GetAnchor();
|
|
|
|
if( pAnchor->GetAnchorId() == FLY_AUTO_CNTNT )
|
|
|
|
{
|
|
|
|
const SwPosition* pAPos = pAnchor->GetCntntAnchor();
|
|
|
|
if( pAPos && nMovedIndex == pAPos->nNode.GetIndex() )
|
|
|
|
pFmt->MakeFrms();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
SwUndoDelete has to perform a deletion and to record anything that is needed to restore the
|
|
|
|
situation before the deletion. Unfortunately a part of the deletion will be done after calling
|
|
|
|
this Ctor, this has to be kept in mind! In this Ctor only the complete paragraphs will be deleted,
|
|
|
|
the joining of the first and last paragraph of the selection will be handled outside this function.
|
|
|
|
Here are the main steps of the function:
|
|
|
|
1. Deletion/recording of content indizes of the selection: footnotes, fly frames and bookmarks
|
|
|
|
Step 1 could shift all nodes by deletion of footnotes => nNdDiff will be set.
|
|
|
|
2. If the paragraph where the selection ends, is the last content of a section so that this
|
|
|
|
section becomes empty when the paragraphs will be joined we have to do some smart actions ;-)
|
|
|
|
The paragraph will be moved outside the section and replaced by a dummy text node, the complete
|
|
|
|
section will be deleted in step 3. The difference between replacement dummy and original is
|
|
|
|
nReplacementDummy.
|
|
|
|
3. Moving complete selected nodes into the UndoArray. Before this happens the selection has to be
|
|
|
|
extended if there are sections which would become empty otherwise. BTW: sections will be moved into
|
|
|
|
the UndoArray if they are complete part of the selection. Sections starting or ending outside of the
|
|
|
|
selection will not be removed from the DocNodeArray even they got a "dummy"-copy in the UndoArray.
|
|
|
|
4. We have to anticipate the joining of the two paragraphs if the start paragraph is inside a
|
|
|
|
section and the end paragraph not. Then we have to move the paragraph into this section and to
|
|
|
|
record this in nSectDiff.
|
|
|
|
*/
|
2000-09-18 23:08:29 +00:00
|
|
|
|
2006-07-13 10:31:46 +00:00
|
|
|
SwUndoDelete::SwUndoDelete( SwPaM& rPam, BOOL bFullPara, BOOL bCalledByTblCpy )
|
2000-09-18 23:08:29 +00:00
|
|
|
: SwUndo(UNDO_DELETE), SwUndRng( rPam ),
|
2006-03-31 08:52:16 +00:00
|
|
|
pMvStt( 0 ), pSttStr(0), pEndStr(0), pRedlData(0), pRedlSaveData(0),
|
|
|
|
nNode(0), nNdDiff(0), nSectDiff(0), nReplaceDummy(0), nSetPos(0),
|
|
|
|
bGroup( FALSE ), bBackSp( FALSE ), bJoinNext( FALSE ), bTblDelLastNd( FALSE ),
|
2006-07-13 10:31:46 +00:00
|
|
|
bDelFullPara( bFullPara ), bResetPgDesc( FALSE ), bResetPgBrk( FALSE ),
|
|
|
|
bFromTableCopy( bCalledByTblCpy )
|
2000-09-18 23:08:29 +00:00
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
bDelFullPara = bFullPara; // This is set e.g. if an empty paragraph before a table is deleted
|
2000-09-18 23:08:29 +00:00
|
|
|
|
2004-09-08 13:59:07 +00:00
|
|
|
bCacheComment = false;
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
SwDoc * pDoc = rPam.GetDoc();
|
|
|
|
|
|
|
|
if( !pDoc->IsIgnoreRedline() && pDoc->GetRedlineTbl().Count() )
|
|
|
|
{
|
|
|
|
pRedlSaveData = new SwRedlineSaveDatas;
|
|
|
|
if( !FillSaveData( rPam, *pRedlSaveData ))
|
|
|
|
delete pRedlSaveData, pRedlSaveData = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( !pHistory )
|
|
|
|
pHistory = new SwHistory;
|
|
|
|
|
|
|
|
// loesche erstmal alle Fussnoten
|
|
|
|
const SwPosition *pStt = rPam.Start(),
|
|
|
|
*pEnd = rPam.GetPoint() == pStt
|
|
|
|
? rPam.GetMark()
|
|
|
|
: rPam.GetPoint();
|
|
|
|
|
2006-03-31 08:52:16 +00:00
|
|
|
// Step 1. deletion/record of content indizes
|
2000-09-18 23:08:29 +00:00
|
|
|
if( bDelFullPara )
|
|
|
|
{
|
|
|
|
ASSERT( rPam.HasMark(), "PaM ohne Mark" );
|
|
|
|
DelCntntIndex( *rPam.GetMark(), *rPam.GetPoint(),
|
|
|
|
DelCntntType(DELCNT_ALL | DELCNT_CHKNOCNTNT) );
|
|
|
|
|
|
|
|
BOOL bDoesUndo = pDoc->DoesUndo();
|
|
|
|
pDoc->DoUndo( FALSE );
|
|
|
|
_DelBookmarks( pStt->nNode, pEnd->nNode );
|
|
|
|
pDoc->DoUndo( bDoesUndo );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
DelCntntIndex( *rPam.GetMark(), *rPam.GetPoint() );
|
2004-11-09 12:49:37 +00:00
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
nSetPos = pHistory ? pHistory->Count() : 0;
|
|
|
|
|
|
|
|
// wurde schon was geloescht ??
|
|
|
|
nNdDiff = nSttNode - pStt->nNode.GetIndex();
|
|
|
|
|
|
|
|
bJoinNext = !bFullPara && pEnd == rPam.GetPoint();
|
|
|
|
bBackSp = !bFullPara && !bJoinNext;
|
|
|
|
|
|
|
|
SwTxtNode *pSttTxtNd = 0, *pEndTxtNd = 0;
|
|
|
|
if( !bFullPara )
|
|
|
|
{
|
|
|
|
pSttTxtNd = pStt->nNode.GetNode().GetTxtNode();
|
|
|
|
pEndTxtNd = nSttNode == nEndNode
|
|
|
|
? pSttTxtNd
|
2001-09-27 12:26:40 +00:00
|
|
|
: pEnd->nNode.GetNode().GetTxtNode();
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
BOOL bMoveNds = *pStt == *pEnd // noch ein Bereich vorhanden ??
|
|
|
|
? FALSE
|
2006-07-13 10:31:46 +00:00
|
|
|
: ( SaveCntnt( pStt, pEnd, pSttTxtNd, pEndTxtNd ) || bFromTableCopy );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
if( pSttTxtNd && pEndTxtNd && pSttTxtNd != pEndTxtNd )
|
|
|
|
{
|
|
|
|
// zwei unterschiedliche TextNodes, also speicher noch die
|
|
|
|
// TextFormatCollection fuers
|
|
|
|
pHistory->Add( pSttTxtNd->GetTxtColl(),pStt->nNode.GetIndex(), ND_TEXTNODE );
|
|
|
|
pHistory->Add( pEndTxtNd->GetTxtColl(),pEnd->nNode.GetIndex(), ND_TEXTNODE );
|
|
|
|
|
|
|
|
if( !bJoinNext ) // Selection von Unten nach Oben
|
|
|
|
{
|
|
|
|
// Beim JoinPrev() werden die AUTO-PageBreak's richtig
|
|
|
|
// kopiert. Um diese beim Undo wieder herzustellen, muss das
|
|
|
|
// Auto-PageBreak aus dem EndNode zurueckgesetzt werden.
|
|
|
|
// - fuer die PageDesc, ColBreak dito !
|
2006-12-01 14:48:41 +00:00
|
|
|
if( pEndTxtNd->HasSwAttrSet() )
|
2000-09-18 23:08:29 +00:00
|
|
|
{
|
|
|
|
SwRegHistory aRegHist( *pEndTxtNd, pHistory );
|
|
|
|
if( SFX_ITEM_SET == pEndTxtNd->GetpSwAttrSet()->GetItemState(
|
|
|
|
RES_BREAK, FALSE ) )
|
|
|
|
pEndTxtNd->ResetAttr( RES_BREAK );
|
2006-12-01 14:48:41 +00:00
|
|
|
if( pEndTxtNd->HasSwAttrSet() &&
|
2000-09-18 23:08:29 +00:00
|
|
|
SFX_ITEM_SET == pEndTxtNd->GetpSwAttrSet()->GetItemState(
|
|
|
|
RES_PAGEDESC, FALSE ) )
|
|
|
|
pEndTxtNd->ResetAttr( RES_PAGEDESC );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// verschiebe jetzt noch den PaM !!!
|
|
|
|
// der SPoint steht am Anfang der SSelection
|
|
|
|
if( pEnd == rPam.GetPoint() && pSttTxtNd )
|
|
|
|
rPam.Exchange();
|
|
|
|
|
|
|
|
if( !pSttTxtNd && !pEndTxtNd )
|
|
|
|
rPam.GetPoint()->nNode--;
|
|
|
|
rPam.DeleteMark(); // der SPoint ist aus dem Bereich
|
|
|
|
|
|
|
|
if( !pEndTxtNd )
|
|
|
|
nEndCntnt = 0;
|
|
|
|
if( !pSttTxtNd )
|
|
|
|
nSttCntnt = 0;
|
|
|
|
|
|
|
|
if( bMoveNds ) // sind noch Nodes zu verschieben ?
|
|
|
|
{
|
|
|
|
SwNodes& rNds = (SwNodes&)*pDoc->GetUndoNds();
|
|
|
|
SwNodes& rDocNds = pDoc->GetNodes();
|
2006-03-31 08:52:16 +00:00
|
|
|
SwNodeRange aRg( rDocNds, nSttNode - nNdDiff,
|
|
|
|
rDocNds, nEndNode - nNdDiff );
|
|
|
|
if( !bFullPara && !pEndTxtNd &&
|
|
|
|
&aRg.aEnd.GetNode() != &pDoc->GetNodes().GetEndOfContent() )
|
2006-07-13 10:31:46 +00:00
|
|
|
{
|
2006-08-14 15:49:20 +00:00
|
|
|
SwNode* pNode = aRg.aEnd.GetNode().StartOfSectionNode();
|
2006-07-13 10:31:46 +00:00
|
|
|
if( pNode->GetIndex() >= nSttNode - nNdDiff )
|
|
|
|
aRg.aEnd++; // Deletion of a complete table
|
|
|
|
}
|
2000-09-18 23:08:29 +00:00
|
|
|
SwNode* pTmpNd;
|
2006-03-31 08:52:16 +00:00
|
|
|
// Step 2: Expand selection if necessary
|
|
|
|
if( bJoinNext || bFullPara )
|
2000-09-18 23:08:29 +00:00
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
// If all content of a section will be moved into Undo,
|
|
|
|
// the section itself should be moved complete.
|
|
|
|
while( aRg.aEnd.GetIndex() + 2 < rDocNds.Count() &&
|
|
|
|
( (pTmpNd = rDocNds[ aRg.aEnd.GetIndex()+1 ])->IsEndNode() &&
|
2006-08-14 15:49:20 +00:00
|
|
|
pTmpNd->StartOfSectionNode()->IsSectionNode() &&
|
|
|
|
pTmpNd->StartOfSectionNode()->GetIndex() >= aRg.aStart.GetIndex() ) )
|
2000-09-18 23:08:29 +00:00
|
|
|
aRg.aEnd++;
|
2006-03-31 08:52:16 +00:00
|
|
|
nReplaceDummy = aRg.aEnd.GetIndex() + nNdDiff - nEndNode;
|
|
|
|
if( nReplaceDummy )
|
|
|
|
{ // The selection has been expanded, because
|
|
|
|
aRg.aEnd++;
|
|
|
|
if( pEndTxtNd )
|
2000-09-18 23:08:29 +00:00
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
// The end text node has to leave the (expanded) selection
|
|
|
|
// The dummy is needed because _MoveNodes deletes empty sections
|
|
|
|
++nReplaceDummy;
|
|
|
|
SwNodeRange aMvRg( *pEndTxtNd, 0, *pEndTxtNd, 1 );
|
|
|
|
SwPosition aSplitPos( *pEndTxtNd );
|
|
|
|
BOOL bDoesUndo = pDoc->DoesUndo();
|
|
|
|
pDoc->DoUndo( FALSE );
|
2006-08-14 15:49:20 +00:00
|
|
|
pDoc->SplitNode( aSplitPos, false );
|
2006-03-31 08:52:16 +00:00
|
|
|
rDocNds._MoveNodes( aMvRg, rDocNds, aRg.aEnd, TRUE );
|
|
|
|
pDoc->DoUndo( bDoesUndo );
|
|
|
|
aRg.aEnd--;
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
2006-03-31 08:52:16 +00:00
|
|
|
else
|
|
|
|
nReplaceDummy = 0;
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
2006-03-31 08:52:16 +00:00
|
|
|
}
|
|
|
|
if( bBackSp || bFullPara )
|
|
|
|
{
|
|
|
|
//See above, the selection has to expanded if there are "nearly empty" sections
|
|
|
|
// and a replacement dummy has to be set if needed.
|
2000-09-18 23:08:29 +00:00
|
|
|
while( 1 < aRg.aStart.GetIndex() &&
|
|
|
|
( (pTmpNd = rDocNds[ aRg.aStart.GetIndex()-1 ])->IsSectionNode() &&
|
2006-03-31 08:52:16 +00:00
|
|
|
pTmpNd->EndOfSectionIndex() < aRg.aEnd.GetIndex() ) )
|
2000-09-18 23:08:29 +00:00
|
|
|
aRg.aStart--;
|
2006-03-31 08:52:16 +00:00
|
|
|
if( pSttTxtNd )
|
2000-09-18 23:08:29 +00:00
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
nReplaceDummy = nSttNode - nNdDiff - aRg.aStart.GetIndex();
|
|
|
|
if( nReplaceDummy )
|
2000-09-18 23:08:29 +00:00
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
SwNodeRange aMvRg( *pSttTxtNd, 0, *pSttTxtNd, 1 );
|
|
|
|
SwPosition aSplitPos( *pSttTxtNd );
|
|
|
|
BOOL bDoesUndo = pDoc->DoesUndo();
|
|
|
|
pDoc->DoUndo( FALSE );
|
2006-08-14 15:49:20 +00:00
|
|
|
pDoc->SplitNode( aSplitPos, false );
|
2006-03-31 08:52:16 +00:00
|
|
|
rDocNds._MoveNodes( aMvRg, rDocNds, aRg.aStart, TRUE );
|
|
|
|
pDoc->DoUndo( bDoesUndo );
|
|
|
|
aRg.aStart--;
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2006-07-13 10:31:46 +00:00
|
|
|
|
|
|
|
if( bFromTableCopy )
|
|
|
|
{
|
|
|
|
if( !pEndTxtNd )
|
|
|
|
{
|
|
|
|
if( pSttTxtNd )
|
|
|
|
aRg.aStart++;
|
|
|
|
else if( !bFullPara && !aRg.aEnd.GetNode().IsCntntNode() )
|
|
|
|
aRg.aEnd--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if( pSttTxtNd && ( pEndTxtNd || pSttTxtNd->GetTxt().Len() ) )
|
2006-03-31 08:52:16 +00:00
|
|
|
aRg.aStart++;
|
2000-09-18 23:08:29 +00:00
|
|
|
|
2006-03-31 08:52:16 +00:00
|
|
|
// Step 3: Moving into UndoArray...
|
|
|
|
nNode = rNds.GetEndOfContent().GetIndex();
|
2000-09-18 23:08:29 +00:00
|
|
|
rDocNds._MoveNodes( aRg, rNds, SwNodeIndex( rNds.GetEndOfContent() ));
|
|
|
|
pMvStt = new SwNodeIndex( rNds, nNode );
|
2006-03-31 08:52:16 +00:00
|
|
|
nNode = rNds.GetEndOfContent().GetIndex() - nNode; // Differenz merken !
|
|
|
|
if( pSttTxtNd && pEndTxtNd )
|
2000-09-18 23:08:29 +00:00
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
//Step 4: Moving around sections
|
2000-09-18 23:08:29 +00:00
|
|
|
nSectDiff = aRg.aEnd.GetIndex() - aRg.aStart.GetIndex();
|
2006-03-31 08:52:16 +00:00
|
|
|
// nSect is the number of sections which starts(ends) between start and end node of the
|
|
|
|
// selection. The "loser" paragraph has to be moved into the section(s) of the
|
|
|
|
// "winner" paragraph
|
|
|
|
if( nSectDiff )
|
|
|
|
{
|
|
|
|
if( bJoinNext )
|
|
|
|
{
|
|
|
|
SwNodeRange aMvRg( *pEndTxtNd, 0, *pEndTxtNd, 1 );
|
|
|
|
rDocNds._MoveNodes( aMvRg, rDocNds, aRg.aStart, TRUE );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
SwNodeRange aMvRg( *pSttTxtNd, 0, *pSttTxtNd, 1 );
|
|
|
|
rDocNds._MoveNodes( aMvRg, rDocNds, aRg.aEnd, TRUE );
|
|
|
|
}
|
|
|
|
}
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
2006-03-31 08:52:16 +00:00
|
|
|
if( nSectDiff || nReplaceDummy )
|
|
|
|
lcl_MakeAutoFrms( *pDoc->GetSpzFrmFmts(),
|
|
|
|
bJoinNext ? pEndTxtNd->GetIndex() : pSttTxtNd->GetIndex() );
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
nNode = 0; // kein Node verschoben -> keine Differenz zum Ende
|
|
|
|
|
|
|
|
// wurden davor noch Nodes geloescht ?? (FootNotes haben ContentNodes!)
|
|
|
|
if( !pSttTxtNd && !pEndTxtNd )
|
|
|
|
{
|
|
|
|
nNdDiff = nSttNode - rPam.GetPoint()->nNode.GetIndex() - (bFullPara ? 0 : 1);
|
|
|
|
rPam.Move( fnMoveForward, fnGoNode );
|
|
|
|
}
|
|
|
|
else
|
2006-03-31 08:52:16 +00:00
|
|
|
{
|
|
|
|
nNdDiff = nSttNode;
|
|
|
|
if( nSectDiff && bBackSp )
|
|
|
|
nNdDiff += nSectDiff;
|
|
|
|
nNdDiff -= rPam.GetPoint()->nNode.GetIndex();
|
|
|
|
}
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
if( !rPam.GetNode()->IsCntntNode() )
|
|
|
|
rPam.GetPoint()->nContent.Assign( 0, 0 );
|
|
|
|
|
|
|
|
// wird die History ueberhaupt benoetigt ??
|
|
|
|
if( pHistory && !pHistory->Count() )
|
|
|
|
DELETEZ( pHistory );
|
|
|
|
}
|
|
|
|
|
|
|
|
BOOL SwUndoDelete::SaveCntnt( const SwPosition* pStt, const SwPosition* pEnd,
|
|
|
|
SwTxtNode* pSttTxtNd, SwTxtNode* pEndTxtNd )
|
|
|
|
{
|
|
|
|
ULONG nNdIdx = pStt->nNode.GetIndex();
|
|
|
|
// 1 - kopiere den Anfang in den Start-String
|
|
|
|
if( pSttTxtNd )
|
|
|
|
{
|
|
|
|
BOOL bOneNode = nSttNode == nEndNode;
|
|
|
|
xub_StrLen nLen = bOneNode ? nEndCntnt - nSttCntnt
|
|
|
|
: pSttTxtNd->GetTxt().Len() - nSttCntnt;
|
|
|
|
SwRegHistory aRHst( *pSttTxtNd, pHistory );
|
|
|
|
// immer alle TextAttribute sichern; ist fuers Undo mit voll-
|
|
|
|
// staendiger Attributierung am besten, wegen den evt.
|
|
|
|
// Ueberlappenden Bereichen von An/Aus.
|
|
|
|
pHistory->CopyAttr( pSttTxtNd->GetpSwpHints(), nNdIdx,
|
|
|
|
0, pSttTxtNd->GetTxt().Len(), TRUE );
|
2006-12-01 14:48:41 +00:00
|
|
|
if( !bOneNode && pSttTxtNd->HasSwAttrSet() )
|
2007-07-26 07:20:20 +00:00
|
|
|
pHistory->CopyFmtAttr( *pSttTxtNd->GetpSwAttrSet(), nNdIdx, *(pSttTxtNd->GetDoc()) );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
// die Laenge kann sich veraendert haben (!!Felder!!)
|
|
|
|
nLen = ( bOneNode ? pEnd->nContent.GetIndex() : pSttTxtNd->GetTxt().Len() )
|
|
|
|
- pStt->nContent.GetIndex();
|
|
|
|
|
|
|
|
// loesche jetzt noch den Text (alle Attribut-Aenderungen kommen in
|
|
|
|
// die Undo-History
|
|
|
|
pSttStr = (String*)new String( pSttTxtNd->GetTxt().Copy( nSttCntnt, nLen ));
|
|
|
|
pSttTxtNd->Erase( pStt->nContent, nLen );
|
|
|
|
if( pSttTxtNd->GetpSwpHints() )
|
|
|
|
pSttTxtNd->GetpSwpHints()->DeRegister();
|
|
|
|
|
|
|
|
if( bOneNode )
|
|
|
|
return FALSE; // keine Nodes mehr verschieben
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// 2 - kopiere das Ende in den End-String
|
|
|
|
if( pEndTxtNd )
|
|
|
|
{
|
|
|
|
SwIndex aEndIdx( pEndTxtNd );
|
|
|
|
nNdIdx = pEnd->nNode.GetIndex();
|
|
|
|
SwRegHistory aRHst( *pEndTxtNd, pHistory );
|
|
|
|
|
|
|
|
// immer alle TextAttribute sichern; ist fuers Undo mit voll-
|
|
|
|
// staendiger Attributierung am besten, wegen den evt.
|
|
|
|
// Ueberlappenden Bereichen von An/Aus.
|
|
|
|
pHistory->CopyAttr( pEndTxtNd->GetpSwpHints(), nNdIdx, 0,
|
|
|
|
pEndTxtNd->GetTxt().Len(), TRUE );
|
|
|
|
|
2006-12-01 14:48:41 +00:00
|
|
|
if( pEndTxtNd->HasSwAttrSet() )
|
2007-07-26 07:20:20 +00:00
|
|
|
pHistory->CopyFmtAttr( *pEndTxtNd->GetpSwAttrSet(), nNdIdx, *(pEndTxtNd->GetDoc()) );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
// loesche jetzt noch den Text (alle Attribut-Aenderungen kommen in
|
|
|
|
// die Undo-History
|
|
|
|
pEndStr = (String*)new String( pEndTxtNd->GetTxt().Copy( 0,
|
|
|
|
pEnd->nContent.GetIndex() ));
|
|
|
|
pEndTxtNd->Erase( aEndIdx, pEnd->nContent.GetIndex() );
|
|
|
|
if( pEndTxtNd->GetpSwpHints() )
|
|
|
|
pEndTxtNd->GetpSwpHints()->DeRegister();
|
|
|
|
}
|
|
|
|
|
|
|
|
// sind es nur zwei Nodes, dann ist schon alles erledigt.
|
|
|
|
if( ( pSttTxtNd || pEndTxtNd ) && nSttNode + 1 == nEndNode )
|
|
|
|
return FALSE; // keine Nodes mehr verschieben
|
|
|
|
|
|
|
|
return TRUE; // verschiebe die dazwischen liegenden Nodes
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
BOOL SwUndoDelete::CanGrouping( SwDoc* pDoc, const SwPaM& rDelPam )
|
|
|
|
{
|
|
|
|
// ist das Undo groesser als 1 Node ? (sprich: Start und EndString)
|
|
|
|
if( pSttStr ? !pSttStr->Len() || pEndStr : TRUE )
|
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
// es kann nur das Loeschen von einzelnen char's zusammengefasst werden
|
|
|
|
if( nSttNode != nEndNode || ( !bGroup && nSttCntnt+1 != nEndCntnt ))
|
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
const SwPosition *pStt = rDelPam.Start(),
|
|
|
|
*pEnd = rDelPam.GetPoint() == pStt
|
|
|
|
? rDelPam.GetMark()
|
|
|
|
: rDelPam.GetPoint();
|
|
|
|
|
|
|
|
if( pStt->nNode != pEnd->nNode ||
|
|
|
|
pStt->nContent.GetIndex()+1 != pEnd->nContent.GetIndex() ||
|
|
|
|
pEnd->nNode != nSttNode )
|
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
// untercheide zwischen BackSpace und Delete. Es muss dann das
|
|
|
|
// Undo-Array unterschiedlich aufgebaut werden !!
|
|
|
|
if( pEnd->nContent == nSttCntnt )
|
|
|
|
{
|
|
|
|
if( bGroup && !bBackSp ) return FALSE;
|
|
|
|
bBackSp = TRUE;
|
|
|
|
}
|
|
|
|
else if( pStt->nContent == nSttCntnt )
|
|
|
|
{
|
|
|
|
if( bGroup && bBackSp ) return FALSE;
|
|
|
|
bBackSp = FALSE;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
// sind die beiden Nodes (Nodes-/Undo-Array) ueberhaupt TextNodes?
|
|
|
|
SwTxtNode * pDelTxtNd = pStt->nNode.GetNode().GetTxtNode();
|
|
|
|
if( !pDelTxtNd ) return FALSE;
|
|
|
|
|
|
|
|
xub_StrLen nUChrPos = bBackSp ? 0 : pSttStr->Len()-1;
|
|
|
|
sal_Unicode cDelChar = pDelTxtNd->GetTxt().GetChar( pStt->nContent.GetIndex() );
|
2000-10-25 14:13:25 +00:00
|
|
|
CharClass& rCC = GetAppCharClass();
|
2005-01-21 09:42:10 +00:00
|
|
|
if( ( CH_TXTATR_BREAKWORD == cDelChar || CH_TXTATR_INWORD == cDelChar ) ||
|
2000-10-25 14:13:25 +00:00
|
|
|
rCC.isLetterNumeric( String( cDelChar ), 0 ) !=
|
|
|
|
rCC.isLetterNumeric( *pSttStr, nUChrPos ) )
|
2000-09-18 23:08:29 +00:00
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
{
|
|
|
|
SwRedlineSaveDatas* pTmpSav = new SwRedlineSaveDatas;
|
|
|
|
if( !FillSaveData( rDelPam, *pTmpSav, FALSE ))
|
|
|
|
delete pTmpSav, pTmpSav = 0;
|
|
|
|
|
|
|
|
BOOL bOk = ( !pRedlSaveData && !pTmpSav ) ||
|
|
|
|
( pRedlSaveData && pTmpSav &&
|
|
|
|
SwUndo::CanRedlineGroup( *pRedlSaveData, *pTmpSav, bBackSp ));
|
|
|
|
delete pTmpSav;
|
|
|
|
if( !bOk )
|
|
|
|
return FALSE;
|
|
|
|
|
2006-08-14 15:49:20 +00:00
|
|
|
pDoc->DeleteRedline( rDelPam, false, USHRT_MAX );
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Ok, die beiden 'Deletes' koennen zusammen gefasst werden, also
|
|
|
|
// 'verschiebe' das enstprechende Zeichen
|
|
|
|
if( bBackSp )
|
|
|
|
nSttCntnt--; // BackSpace: Zeichen in Array einfuegen !!
|
|
|
|
else
|
|
|
|
{
|
|
|
|
nEndCntnt++; // Delete: Zeichen am Ende anhaengen
|
|
|
|
nUChrPos++;
|
|
|
|
}
|
|
|
|
pSttStr->Insert( cDelChar, nUChrPos );
|
|
|
|
pDelTxtNd->Erase( pStt->nContent, 1 );
|
|
|
|
|
|
|
|
bGroup = TRUE;
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
SwUndoDelete::~SwUndoDelete()
|
|
|
|
{
|
|
|
|
delete pSttStr;
|
|
|
|
delete pEndStr;
|
|
|
|
if( pMvStt ) // loesche noch den Bereich aus dem UndoNodes Array
|
|
|
|
{
|
|
|
|
// Insert speichert den Inhalt in der IconSection
|
|
|
|
pMvStt->GetNode().GetNodes().Delete( *pMvStt, nNode );
|
|
|
|
delete pMvStt;
|
|
|
|
}
|
|
|
|
delete pRedlData;
|
|
|
|
delete pRedlSaveData;
|
|
|
|
}
|
|
|
|
|
2004-09-08 13:59:07 +00:00
|
|
|
static SwRewriter lcl_RewriterFromHistory(SwHistory & rHistory)
|
|
|
|
{
|
|
|
|
SwRewriter aRewriter;
|
|
|
|
|
|
|
|
bool bDone = false;
|
|
|
|
|
|
|
|
for (int n = 0; n < rHistory.Count(); n++)
|
|
|
|
{
|
|
|
|
USHORT nWhich = rHistory[n]->Which();
|
|
|
|
String aDescr = rHistory[n]->GetDescription();
|
|
|
|
|
|
|
|
if (aDescr.Len() > 0)
|
|
|
|
{
|
|
|
|
aRewriter.AddRule(UNDO_ARG2, aDescr);
|
|
|
|
|
|
|
|
bDone = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (! bDone)
|
|
|
|
{
|
|
|
|
aRewriter.AddRule(UNDO_ARG2, SW_RES(STR_FIELD));
|
|
|
|
}
|
|
|
|
|
|
|
|
return aRewriter;
|
|
|
|
}
|
|
|
|
|
2004-05-18 13:07:16 +00:00
|
|
|
SwRewriter SwUndoDelete::GetRewriter() const
|
|
|
|
{
|
|
|
|
SwRewriter aResult;
|
|
|
|
String * pStr = NULL;
|
2000-09-18 23:08:29 +00:00
|
|
|
|
2004-05-18 13:07:16 +00:00
|
|
|
if (nNode != 0)
|
2004-09-08 13:59:07 +00:00
|
|
|
{
|
|
|
|
if (sTableName.Len() > 0)
|
|
|
|
{
|
|
|
|
|
|
|
|
SwRewriter aRewriter;
|
|
|
|
aRewriter.AddRule(UNDO_ARG1, SW_RES(STR_START_QUOTE));
|
|
|
|
aRewriter.AddRule(UNDO_ARG2, sTableName);
|
|
|
|
aRewriter.AddRule(UNDO_ARG3, SW_RES(STR_END_QUOTE));
|
|
|
|
|
|
|
|
String sTmp = aRewriter.Apply(SW_RES(STR_TABLE_NAME));
|
|
|
|
aResult.AddRule(UNDO_ARG1, sTmp);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
aResult.AddRule(UNDO_ARG1, String(SW_RES(STR_PARAGRAPHS)));
|
|
|
|
}
|
2004-05-18 13:07:16 +00:00
|
|
|
else
|
|
|
|
{
|
2004-09-08 13:59:07 +00:00
|
|
|
String aStr;
|
2004-11-09 12:49:37 +00:00
|
|
|
|
|
|
|
if (pSttStr != NULL && pEndStr != NULL && pSttStr->Len() == 0 &&
|
|
|
|
pEndStr->Len() == 0)
|
2004-05-18 13:07:16 +00:00
|
|
|
{
|
2004-11-09 12:49:37 +00:00
|
|
|
aStr = SW_RES(STR_PARAGRAPH_UNDO);
|
2004-09-08 13:59:07 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2004-11-09 12:49:37 +00:00
|
|
|
if (pSttStr != NULL)
|
|
|
|
pStr = pSttStr;
|
|
|
|
else if (pEndStr != NULL)
|
|
|
|
pStr = pEndStr;
|
|
|
|
|
|
|
|
if (pStr != NULL)
|
|
|
|
{
|
|
|
|
aStr = DenoteSpecialCharacters(*pStr);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
aStr = UNDO_ARG2;
|
|
|
|
}
|
2004-09-08 13:59:07 +00:00
|
|
|
}
|
2004-05-18 13:07:16 +00:00
|
|
|
|
2004-09-08 13:59:07 +00:00
|
|
|
if (pHistory)
|
|
|
|
{
|
|
|
|
SwRewriter aRewriter = lcl_RewriterFromHistory(*pHistory);
|
2004-05-18 13:07:16 +00:00
|
|
|
|
2004-09-08 13:59:07 +00:00
|
|
|
aStr = aRewriter.Apply(aStr);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
aStr = ShortenString(aStr, nUndoStringLength,
|
|
|
|
String(SW_RES(STR_LDOTS)));
|
2004-05-18 13:07:16 +00:00
|
|
|
}
|
2004-09-08 13:59:07 +00:00
|
|
|
|
|
|
|
aResult.AddRule(UNDO_ARG1, aStr);
|
2004-05-18 13:07:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return aResult;
|
|
|
|
}
|
2000-09-18 23:08:29 +00:00
|
|
|
|
2006-03-31 08:52:16 +00:00
|
|
|
// Every object, anchored "AtCntnt" will be reanchored at rPos
|
|
|
|
void lcl_ReAnchorAtCntntFlyFrames( const SwSpzFrmFmts& rSpzArr, SwPosition &rPos, ULONG nOldIdx )
|
|
|
|
{
|
|
|
|
if( rSpzArr.Count() )
|
|
|
|
{
|
|
|
|
SwFlyFrmFmt* pFmt;
|
|
|
|
const SwFmtAnchor* pAnchor;
|
|
|
|
const SwPosition* pAPos;
|
|
|
|
for( USHORT n = 0; n < rSpzArr.Count(); ++n )
|
|
|
|
{
|
|
|
|
pFmt = (SwFlyFrmFmt*)rSpzArr[n];
|
|
|
|
pAnchor = &pFmt->GetAnchor();
|
|
|
|
if( pAnchor->GetAnchorId() == FLY_AT_CNTNT )
|
|
|
|
{
|
|
|
|
pAPos = pAnchor->GetCntntAnchor();
|
|
|
|
if( pAPos && nOldIdx == pAPos->nNode.GetIndex() )
|
|
|
|
{
|
|
|
|
SwFmtAnchor aAnch( *pAnchor );
|
|
|
|
aAnch.SetAnchor( &rPos );
|
|
|
|
pFmt->SetAttr( aAnch );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
void SwUndoDelete::Undo( SwUndoIter& rUndoIter )
|
|
|
|
{
|
|
|
|
SwDoc* pDoc = &rUndoIter.GetDoc();
|
|
|
|
BOOL bUndo = pDoc->DoesUndo();
|
|
|
|
pDoc->DoUndo( FALSE );
|
|
|
|
|
|
|
|
ULONG nCalcStt = nSttNode - nNdDiff;
|
|
|
|
|
2006-03-31 08:52:16 +00:00
|
|
|
if( nSectDiff && bBackSp )
|
|
|
|
nCalcStt += nSectDiff;
|
|
|
|
|
|
|
|
SwNodeIndex aIdx( pDoc->GetNodes(), nCalcStt );
|
2000-09-18 23:08:29 +00:00
|
|
|
SwNode* pInsNd = &aIdx.GetNode();
|
|
|
|
|
|
|
|
{ // Block, damit der SwPosition beim loeschen vom Node
|
|
|
|
// abgemeldet ist
|
|
|
|
SwPosition aPos( aIdx );
|
|
|
|
if( !bDelFullPara )
|
|
|
|
{
|
|
|
|
if( pInsNd->IsTableNode() )
|
|
|
|
{
|
|
|
|
pInsNd = pDoc->GetNodes().MakeTxtNode( aIdx,
|
|
|
|
(SwTxtFmtColl*)pDoc->GetDfltTxtFmtColl() );
|
|
|
|
aIdx--;
|
|
|
|
aPos.nNode = aIdx;
|
|
|
|
aPos.nContent.Assign( pInsNd->GetCntntNode(), nSttCntnt );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if( pInsNd->IsCntntNode() )
|
|
|
|
aPos.nContent.Assign( (SwCntntNode*)pInsNd, nSttCntnt );
|
|
|
|
if( !bTblDelLastNd )
|
|
|
|
pInsNd = 0; // Node nicht loeschen !!
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
pInsNd = 0; // Node nicht loeschen !!
|
|
|
|
|
|
|
|
SwNodes* pUNds = (SwNodes*)pDoc->GetUndoNds();
|
|
|
|
BOOL bNodeMove = 0 != nNode;
|
|
|
|
|
2006-03-31 08:52:16 +00:00
|
|
|
if( pEndStr )
|
2000-09-18 23:08:29 +00:00
|
|
|
{
|
|
|
|
// alle Attribute verwerfen, wurden alle gespeichert!
|
|
|
|
SwTxtNode* pTxtNd = aPos.nNode.GetNode().GetTxtNode();
|
2006-03-31 08:52:16 +00:00
|
|
|
|
2006-12-01 14:48:41 +00:00
|
|
|
if( pTxtNd && pTxtNd->HasSwAttrSet() )
|
2000-09-18 23:08:29 +00:00
|
|
|
pTxtNd->ResetAllAttr();
|
|
|
|
|
2006-08-14 15:49:20 +00:00
|
|
|
if( pTxtNd && pTxtNd->GetpSwpHints() )
|
2006-12-01 14:48:41 +00:00
|
|
|
pTxtNd->ClearSwpHintsArr( true );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
2006-07-13 10:31:46 +00:00
|
|
|
if( pSttStr && !bFromTableCopy )
|
2000-09-18 23:08:29 +00:00
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
ULONG nOldIdx = aPos.nNode.GetIndex();
|
2006-08-14 15:49:20 +00:00
|
|
|
pDoc->SplitNode( aPos, false );
|
2006-03-31 08:52:16 +00:00
|
|
|
// After the split all objects are anchored at the first paragraph,
|
|
|
|
// but the pHistory of the fly frame formats relies on anchoring at
|
|
|
|
// the start of the selection => selection backwards needs a correction.
|
|
|
|
if( bBackSp )
|
|
|
|
lcl_ReAnchorAtCntntFlyFrames( *pDoc->GetSpzFrmFmts(), aPos, nOldIdx );
|
2000-09-18 23:08:29 +00:00
|
|
|
pTxtNd = aPos.nNode.GetNode().GetTxtNode();
|
|
|
|
}
|
|
|
|
|
|
|
|
pTxtNd->Insert( *pEndStr, aPos.nContent, INS_NOHINTEXPAND );
|
|
|
|
}
|
|
|
|
else if( pSttStr && bNodeMove )
|
|
|
|
{
|
|
|
|
SwTxtNode * pNd = aPos.nNode.GetNode().GetTxtNode();
|
|
|
|
if( pNd )
|
|
|
|
{
|
|
|
|
if( nSttCntnt < pNd->GetTxt().Len() )
|
2006-03-31 08:52:16 +00:00
|
|
|
{
|
|
|
|
ULONG nOldIdx = aPos.nNode.GetIndex();
|
2006-08-14 15:49:20 +00:00
|
|
|
pDoc->SplitNode( aPos, false );
|
2006-03-31 08:52:16 +00:00
|
|
|
if( bBackSp )
|
|
|
|
lcl_ReAnchorAtCntntFlyFrames( *pDoc->GetSpzFrmFmts(), aPos, nOldIdx );
|
|
|
|
}
|
2000-09-18 23:08:29 +00:00
|
|
|
else
|
|
|
|
aPos.nNode++;
|
|
|
|
}
|
|
|
|
}
|
2006-03-31 08:52:16 +00:00
|
|
|
SwNode* pMovedNode = NULL;
|
|
|
|
if( nSectDiff )
|
|
|
|
{
|
|
|
|
ULONG nMoveIndex = aPos.nNode.GetIndex();
|
|
|
|
int nDiff = 0;
|
|
|
|
if( bJoinNext )
|
|
|
|
{
|
|
|
|
nMoveIndex += nSectDiff + 1;
|
|
|
|
pMovedNode = &aPos.nNode.GetNode();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
nMoveIndex -= nSectDiff + 1;
|
|
|
|
++nDiff;
|
|
|
|
}
|
|
|
|
SwNodeIndex aMvIdx( pDoc->GetNodes(), nMoveIndex );
|
|
|
|
SwNodeRange aRg( aPos.nNode, 0 - nDiff, aPos.nNode, 1 - nDiff );
|
|
|
|
aPos.nNode--;
|
|
|
|
if( !bJoinNext )
|
|
|
|
pMovedNode = &aPos.nNode.GetNode();
|
|
|
|
pDoc->GetNodes()._MoveNodes( aRg, pDoc->GetNodes(), aMvIdx, TRUE );
|
|
|
|
aPos.nNode++;
|
|
|
|
}
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
if( bNodeMove )
|
|
|
|
{
|
|
|
|
SwNodeRange aRg( *pMvStt, 0, *pMvStt, nNode );
|
2006-03-31 08:52:16 +00:00
|
|
|
SwNodeIndex aCopyIndex( aPos.nNode, -1 );
|
|
|
|
pUNds->_Copy( aRg, aPos.nNode );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
2006-03-31 08:52:16 +00:00
|
|
|
if( nReplaceDummy )
|
2000-09-18 23:08:29 +00:00
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
ULONG nMoveIndex;
|
2000-09-18 23:08:29 +00:00
|
|
|
if( bJoinNext )
|
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
nMoveIndex = nEndNode - nNdDiff;
|
|
|
|
aPos.nNode = nMoveIndex + nReplaceDummy;
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
aPos = aCopyIndex;
|
|
|
|
nMoveIndex = aPos.nNode.GetIndex() + nReplaceDummy + 1;
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
2006-03-31 08:52:16 +00:00
|
|
|
SwNodeIndex aMvIdx( pDoc->GetNodes(), nMoveIndex );
|
|
|
|
SwNodeRange aRg( aPos.nNode, 0, aPos.nNode, 1 );
|
|
|
|
pMovedNode = &aPos.nNode.GetNode();
|
|
|
|
pDoc->GetNodes()._MoveNodes( aRg, pDoc->GetNodes(), aMvIdx, TRUE );
|
|
|
|
pDoc->GetNodes().Delete( aMvIdx, 1 );
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
|
|
|
}
|
2006-03-31 08:52:16 +00:00
|
|
|
|
|
|
|
if( pMovedNode )
|
|
|
|
lcl_MakeAutoFrms( *pDoc->GetSpzFrmFmts(), pMovedNode->GetIndex() );
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
if( pSttStr )
|
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
aPos.nNode = nSttNode - nNdDiff + ( bJoinNext ? 0 : nReplaceDummy );
|
2000-09-18 23:08:29 +00:00
|
|
|
SwTxtNode * pTxtNd = aPos.nNode.GetNode().GetTxtNode();
|
|
|
|
// wenn mehr als ein Node geloescht wurde, dann wurden auch
|
|
|
|
// alle "Node"-Attribute gespeichert
|
|
|
|
|
2006-01-20 12:48:40 +00:00
|
|
|
if (pTxtNd != NULL)
|
|
|
|
{
|
2006-12-01 14:48:41 +00:00
|
|
|
if( pTxtNd->HasSwAttrSet() && bNodeMove && !pEndStr )
|
2006-01-20 12:48:40 +00:00
|
|
|
pTxtNd->ResetAllAttr();
|
2000-09-18 23:08:29 +00:00
|
|
|
|
2006-01-20 12:48:40 +00:00
|
|
|
if( pTxtNd->GetpSwpHints() )
|
2006-12-01 14:48:41 +00:00
|
|
|
pTxtNd->ClearSwpHintsArr( true );
|
2006-01-20 12:48:40 +00:00
|
|
|
|
|
|
|
// SectionNode-Modus und von oben nach unten selektiert:
|
|
|
|
// -> im StartNode steht noch der Rest vom Join => loeschen
|
|
|
|
aPos.nContent.Assign( pTxtNd, nSttCntnt );
|
|
|
|
pTxtNd->Insert( *pSttStr, aPos.nContent, INS_NOHINTEXPAND );
|
|
|
|
}
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if( pHistory )
|
|
|
|
{
|
|
|
|
pHistory->TmpRollback( pDoc, nSetPos, FALSE );
|
|
|
|
if( nSetPos ) // es gab Fussnoten/FlyFrames
|
|
|
|
{
|
|
|
|
// gibts ausser diesen noch andere ?
|
|
|
|
if( nSetPos < pHistory->Count() )
|
|
|
|
{
|
|
|
|
// dann sicher die Attribute anderen Attribute
|
|
|
|
SwHistory aHstr;
|
|
|
|
aHstr.Move( 0, pHistory, nSetPos );
|
|
|
|
pHistory->Rollback( pDoc );
|
|
|
|
pHistory->Move( 0, &aHstr );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
pHistory->Rollback( pDoc );
|
|
|
|
DELETEZ( pHistory );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if( bResetPgDesc || bResetPgBrk )
|
|
|
|
{
|
|
|
|
USHORT nStt = bResetPgDesc ? RES_PAGEDESC : RES_BREAK;
|
|
|
|
USHORT nEnd = bResetPgBrk ? RES_BREAK : RES_PAGEDESC;
|
|
|
|
|
|
|
|
SwNode* pNode = pDoc->GetNodes()[ nEndNode + 1 ];
|
|
|
|
if( pNode->IsCntntNode() )
|
|
|
|
((SwCntntNode*)pNode)->ResetAttr( nStt, nEnd );
|
|
|
|
else if( pNode->IsTableNode() )
|
|
|
|
((SwTableNode*)pNode)->GetTable().GetFrmFmt()->ResetAttr( nStt, nEnd );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// den temp. eingefuegten Node noch loeschen !!
|
|
|
|
if( pInsNd )
|
|
|
|
pDoc->GetNodes().Delete( aIdx, 1 );
|
|
|
|
if( pRedlSaveData )
|
|
|
|
SetSaveData( *pDoc, *pRedlSaveData );
|
|
|
|
|
|
|
|
pDoc->DoUndo( bUndo ); // Undo wieder einschalten
|
|
|
|
SetPaM( rUndoIter, TRUE );
|
|
|
|
}
|
|
|
|
|
|
|
|
void SwUndoDelete::Redo( SwUndoIter& rUndoIter )
|
|
|
|
{
|
|
|
|
rUndoIter.SetUpdateAttr( TRUE );
|
|
|
|
|
|
|
|
SwPaM& rPam = *rUndoIter.pAktPam;
|
|
|
|
SwDoc& rDoc = *rPam.GetDoc();
|
|
|
|
|
|
|
|
SetPaM( rPam );
|
|
|
|
|
|
|
|
if( pRedlSaveData )
|
2006-08-14 15:49:20 +00:00
|
|
|
rDoc.DeleteRedline( rPam, false, USHRT_MAX );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
if( !bDelFullPara )
|
|
|
|
{
|
2001-05-23 15:00:54 +00:00
|
|
|
SwUndRng aTmpRng( rPam );
|
2000-09-18 23:08:29 +00:00
|
|
|
RemoveIdxFromRange( rPam, FALSE );
|
2001-05-23 15:00:54 +00:00
|
|
|
aTmpRng.SetPaM( rPam );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
if( !bJoinNext ) // Dann Selektion von unten nach oben
|
|
|
|
rPam.Exchange(); // wieder herstellen!
|
|
|
|
}
|
|
|
|
|
|
|
|
if( pHistory ) // wurden Attribute gesichert ?
|
|
|
|
{
|
|
|
|
pHistory->SetTmpEnd( pHistory->Count() );
|
|
|
|
SwHistory aHstr;
|
|
|
|
aHstr.Move( 0, pHistory );
|
|
|
|
|
|
|
|
if( bDelFullPara )
|
|
|
|
{
|
|
|
|
ASSERT( rPam.HasMark(), "PaM ohne Mark" );
|
|
|
|
DelCntntIndex( *rPam.GetMark(), *rPam.GetPoint(),
|
|
|
|
DelCntntType(DELCNT_ALL | DELCNT_CHKNOCNTNT) );
|
|
|
|
|
|
|
|
_DelBookmarks( rPam.GetMark()->nNode, rPam.GetPoint()->nNode );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
DelCntntIndex( *rPam.GetMark(), *rPam.GetPoint() );
|
|
|
|
nSetPos = pHistory ? pHistory->Count() : 0;
|
|
|
|
|
|
|
|
pHistory->Move( nSetPos, &aHstr );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if( bDelFullPara )
|
|
|
|
{
|
|
|
|
ASSERT( rPam.HasMark(), "PaM ohne Mark" );
|
|
|
|
DelCntntIndex( *rPam.GetMark(), *rPam.GetPoint(),
|
|
|
|
DelCntntType(DELCNT_ALL | DELCNT_CHKNOCNTNT) );
|
|
|
|
|
|
|
|
_DelBookmarks( rPam.GetMark()->nNode, rPam.GetPoint()->nNode );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
DelCntntIndex( *rPam.GetMark(), *rPam.GetPoint() );
|
|
|
|
nSetPos = pHistory ? pHistory->Count() : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( !pSttStr && !pEndStr )
|
|
|
|
{
|
2006-03-31 08:52:16 +00:00
|
|
|
SwNodeIndex aSttIdx = ( bDelFullPara || bJoinNext )
|
2000-09-18 23:08:29 +00:00
|
|
|
? rPam.GetMark()->nNode
|
|
|
|
: rPam.GetPoint()->nNode;
|
2006-03-31 08:52:16 +00:00
|
|
|
SwTableNode* pTblNd = aSttIdx.GetNode().GetTableNode();
|
2000-09-18 23:08:29 +00:00
|
|
|
if( pTblNd )
|
|
|
|
{
|
|
|
|
if( bTblDelLastNd )
|
|
|
|
{
|
|
|
|
// dann am Ende wieder einen Node einfuegen
|
|
|
|
const SwNodeIndex aTmpIdx( *pTblNd->EndOfSectionNode(), 1 );
|
|
|
|
rDoc.GetNodes().MakeTxtNode( aTmpIdx,
|
|
|
|
rDoc.GetTxtCollFromPool( RES_POOLCOLL_STANDARD ) );
|
|
|
|
}
|
|
|
|
|
|
|
|
SwCntntNode* pNextNd = rDoc.GetNodes()[
|
|
|
|
pTblNd->EndOfSectionIndex()+1 ]->GetCntntNode();
|
|
|
|
if( pNextNd )
|
|
|
|
{
|
|
|
|
SwFrmFmt* pTableFmt = pTblNd->GetTable().GetFrmFmt();
|
2004-09-08 13:59:07 +00:00
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
const SfxPoolItem *pItem;
|
|
|
|
if( SFX_ITEM_SET == pTableFmt->GetItemState( RES_PAGEDESC,
|
|
|
|
FALSE, &pItem ) )
|
|
|
|
pNextNd->SetAttr( *pItem );
|
|
|
|
|
|
|
|
if( SFX_ITEM_SET == pTableFmt->GetItemState( RES_BREAK,
|
|
|
|
FALSE, &pItem ) )
|
|
|
|
pNextNd->SetAttr( *pItem );
|
|
|
|
}
|
|
|
|
pTblNd->DelFrms();
|
|
|
|
}
|
|
|
|
|
2007-05-25 12:01:43 +00:00
|
|
|
rPam.SetMark();
|
2000-09-18 23:08:29 +00:00
|
|
|
rPam.DeleteMark();
|
2006-03-31 08:52:16 +00:00
|
|
|
|
|
|
|
rDoc.GetNodes().Delete( aSttIdx, nEndNode - nSttNode );
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
// setze den Cursor immer in einen ContentNode !!
|
|
|
|
if( !rPam.Move( fnMoveBackward, fnGoCntnt ) &&
|
|
|
|
!rPam.Move( fnMoveForward, fnGoCntnt ) )
|
|
|
|
rPam.GetPoint()->nContent.Assign( rPam.GetCntntNode(), 0 );
|
|
|
|
}
|
|
|
|
else if( bDelFullPara )
|
|
|
|
{
|
|
|
|
// der Pam wurde am Point( == Ende) um eins erhoeht, um einen
|
|
|
|
// Bereich fuers Undo zu haben. Der muss jetzt aber wieder entfernt
|
|
|
|
// werden!!!
|
|
|
|
rPam.End()->nNode--;
|
|
|
|
if( rPam.GetPoint()->nNode == rPam.GetMark()->nNode )
|
|
|
|
*rPam.GetMark() = *rPam.GetPoint();
|
|
|
|
rDoc.DelFullPara( rPam );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
rDoc.DeleteAndJoin( rPam );
|
|
|
|
}
|
|
|
|
|
|
|
|
void SwUndoDelete::Repeat( SwUndoIter& rUndoIter )
|
|
|
|
{
|
|
|
|
if( UNDO_DELETE == rUndoIter.GetLastUndoId() )
|
|
|
|
return;
|
|
|
|
|
|
|
|
SwPaM& rPam = *rUndoIter.pAktPam;
|
|
|
|
SwDoc& rDoc = *rPam.GetDoc();
|
|
|
|
BOOL bGroupUndo = rDoc.DoesGroupUndo();
|
|
|
|
rDoc.DoGroupUndo( FALSE );
|
|
|
|
if( !rPam.HasMark() )
|
|
|
|
{
|
|
|
|
rPam.SetMark();
|
|
|
|
rPam.Move( fnMoveForward, fnGoCntnt );
|
|
|
|
}
|
|
|
|
if( bDelFullPara )
|
|
|
|
rDoc.DelFullPara( rPam );
|
|
|
|
else
|
|
|
|
rDoc.DeleteAndJoin( rPam );
|
|
|
|
rDoc.DoGroupUndo( bGroupUndo );
|
|
|
|
rUndoIter.pLastUndoObj = this;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-09-08 13:59:07 +00:00
|
|
|
void SwUndoDelete::SetTableName(const String & rName)
|
|
|
|
{
|
|
|
|
sTableName = rName;
|
|
|
|
}
|