2000-09-18 23:08:29 +00:00
|
|
|
|
/*************************************************************************
|
|
|
|
|
*
|
2008-04-10 12:07:54 +00:00
|
|
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
2000-09-18 23:08:29 +00:00
|
|
|
|
*
|
2008-04-10 12:07:54 +00:00
|
|
|
|
* Copyright 2008 by Sun Microsystems, Inc.
|
2000-09-18 23:08:29 +00:00
|
|
|
|
*
|
2008-04-10 12:07:54 +00:00
|
|
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
2000-09-18 23:08:29 +00:00
|
|
|
|
*
|
2008-04-10 12:07:54 +00:00
|
|
|
|
* $RCSfile: doccorr.cxx,v $
|
|
|
|
|
* $Revision: 1.13 $
|
2000-09-18 23:08:29 +00:00
|
|
|
|
*
|
2008-04-10 12:07:54 +00:00
|
|
|
|
* This file is part of OpenOffice.org.
|
2000-09-18 23:08:29 +00:00
|
|
|
|
*
|
2008-04-10 12:07:54 +00:00
|
|
|
|
* 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.
|
2000-09-18 23:08:29 +00:00
|
|
|
|
*
|
2008-04-10 12:07:54 +00:00
|
|
|
|
* 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).
|
2000-09-18 23:08:29 +00:00
|
|
|
|
*
|
2008-04-10 12:07:54 +00:00
|
|
|
|
* 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.
|
2000-09-18 23:08:29 +00:00
|
|
|
|
*
|
|
|
|
|
************************************************************************/
|
|
|
|
|
|
2006-09-16 19:50:51 +00:00
|
|
|
|
// MARKER(update_precomp.py): autogen include statement, do not remove
|
|
|
|
|
#include "precompiled_sw.hxx"
|
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
|
|
#include <doc.hxx>
|
|
|
|
|
#include <node.hxx>
|
|
|
|
|
#include <rootfrm.hxx>
|
|
|
|
|
#include <editsh.hxx>
|
|
|
|
|
#include <viscrs.hxx>
|
|
|
|
|
#include <bookmrk.hxx>
|
|
|
|
|
#include <redline.hxx>
|
|
|
|
|
#include <mvsave.hxx>
|
|
|
|
|
#include <docary.hxx>
|
|
|
|
|
#include <unocrsr.hxx>
|
2002-11-21 13:44:36 +00:00
|
|
|
|
#include <swundo.hxx>
|
2003-04-17 15:04:51 +00:00
|
|
|
|
#include <hints.hxx>
|
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
|
/* */
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* MACROS um ueber alle CrsrShells zu iterieren
|
|
|
|
|
*/
|
|
|
|
|
#define PCURSH ((SwCrsrShell*)_pStartShell)
|
|
|
|
|
#define FOREACHSHELL_START( pEShell ) \
|
|
|
|
|
{\
|
2007-09-27 07:33:37 +00:00
|
|
|
|
ViewShell *_pStartShell = pEShell; \
|
2000-09-18 23:08:29 +00:00
|
|
|
|
do { \
|
|
|
|
|
if( _pStartShell->IsA( TYPE( SwCrsrShell )) ) \
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
#define FOREACHSHELL_END( pEShell ) \
|
|
|
|
|
} \
|
|
|
|
|
} while((_pStartShell=(ViewShell*)_pStartShell->GetNext())!= pEShell ); \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define PCURCRSR (_pCurrCrsr)
|
|
|
|
|
#define FOREACHPAM_START(pSttCrsr) \
|
|
|
|
|
{\
|
|
|
|
|
SwPaM *_pStartCrsr = pSttCrsr, *_pCurrCrsr = pSttCrsr; \
|
|
|
|
|
do {
|
|
|
|
|
|
|
|
|
|
#define FOREACHPAM_END() \
|
|
|
|
|
} while( (_pCurrCrsr=(SwPaM *)_pCurrCrsr->GetNext()) != _pStartCrsr ); \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* */
|
|
|
|
|
|
|
|
|
|
#define _PaMCorrAbs1( pPam ) \
|
|
|
|
|
for( int nb = 0; nb < 2; ++nb ) \
|
|
|
|
|
if( &((pPam)->GetBound( BOOL(nb) ).nNode.GetNode()) == pOldNode ) \
|
|
|
|
|
{ \
|
|
|
|
|
(pPam)->GetBound( BOOL(nb) ) = aNewPos; \
|
|
|
|
|
(pPam)->GetBound( BOOL(nb) ).nContent += nOffset; \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void PaMCorrAbs( const SwNodeIndex &rOldNode,
|
|
|
|
|
const SwPosition &rNewPos,
|
|
|
|
|
const xub_StrLen nOffset)
|
|
|
|
|
{
|
|
|
|
|
const SwNode* pOldNode = &rOldNode.GetNode();
|
|
|
|
|
const SwPosition aNewPos( rNewPos );
|
|
|
|
|
const SwDoc* pDoc = pOldNode->GetDoc();
|
|
|
|
|
SwCrsrShell* pShell = pDoc->GetEditShell();
|
|
|
|
|
|
|
|
|
|
if( pShell )
|
|
|
|
|
{
|
|
|
|
|
FOREACHSHELL_START( pShell )
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwPaM *_pStkCrsr = PCURSH->GetStkCrsr();
|
2000-09-18 23:08:29 +00:00
|
|
|
|
// Alle ueberfluessigen Crsr sind vom Stack, oder ??
|
|
|
|
|
// ASSERT( !_pStkCrsr, "Es stehen noch Crsr auf dem CrsrStack" );
|
|
|
|
|
if( _pStkCrsr )
|
|
|
|
|
do {
|
|
|
|
|
_PaMCorrAbs1( _pStkCrsr )
|
|
|
|
|
} while ( (_pStkCrsr != 0 ) &&
|
|
|
|
|
((_pStkCrsr=(SwPaM *)_pStkCrsr->GetNext()) != PCURSH->GetStkCrsr()) );
|
|
|
|
|
|
|
|
|
|
FOREACHPAM_START( PCURSH->_GetCrsr() )
|
|
|
|
|
_PaMCorrAbs1( PCURCRSR )
|
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
|
|
|
|
|
if( PCURSH->IsTableMode() )
|
|
|
|
|
_PaMCorrAbs1( PCURSH->GetTblCrs() )
|
|
|
|
|
|
|
|
|
|
FOREACHSHELL_END( pShell )
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
{
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwUnoCrsrTbl& rTbl = (SwUnoCrsrTbl&)pDoc->GetUnoCrsrTbl();
|
2000-09-18 23:08:29 +00:00
|
|
|
|
for( USHORT n = 0; n < rTbl.Count(); ++n )
|
|
|
|
|
{
|
|
|
|
|
FOREACHPAM_START( rTbl[ n ] )
|
|
|
|
|
_PaMCorrAbs1( PCURCRSR )
|
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
|
|
|
|
|
SwUnoTableCrsr* pUnoTblCrsr = (SwUnoTableCrsr*)*rTbl[ n ];
|
|
|
|
|
if( pUnoTblCrsr )
|
|
|
|
|
{
|
|
|
|
|
FOREACHPAM_START( &pUnoTblCrsr->GetSelRing() )
|
|
|
|
|
_PaMCorrAbs1( PCURCRSR )
|
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void SwDoc::CorrAbs( const SwNodeIndex& rOldNode,
|
|
|
|
|
const SwPosition& rNewPos,
|
|
|
|
|
const xub_StrLen nOffset,
|
|
|
|
|
BOOL bMoveCrsr )
|
|
|
|
|
{
|
|
|
|
|
const SwNode* pOldNode = &rOldNode.GetNode();
|
|
|
|
|
SwPosition aNewPos( rNewPos );
|
|
|
|
|
|
|
|
|
|
{ // erstmal die Bookmark korrigieren
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwBookmarks& rBkmks = *pBookmarkTbl;
|
|
|
|
|
SwBookmark* pBkmk;
|
2000-09-18 23:08:29 +00:00
|
|
|
|
for( USHORT n = 0; n < rBkmks.Count(); ++n )
|
|
|
|
|
{
|
|
|
|
|
// liegt auf der Position ??
|
|
|
|
|
int bChgd = 0;
|
2008-02-26 09:35:53 +00:00
|
|
|
|
if( &( pBkmk = (SwBookmark*)rBkmks[ n ])->GetBookmarkPos().nNode.GetNode() == pOldNode )
|
2000-09-18 23:08:29 +00:00
|
|
|
|
{
|
2008-02-26 09:35:53 +00:00
|
|
|
|
// --> OD 2007-09-26 #i81002# - refactoring
|
|
|
|
|
// *pBkmk->pPos1 = aNewPos;
|
|
|
|
|
// pBkmk->pPos1->nContent += nOffset;
|
|
|
|
|
SwPosition aNewPos1( aNewPos );
|
|
|
|
|
aNewPos1.nContent += nOffset;
|
|
|
|
|
pBkmk->SetBookmarkPos( &aNewPos1 );
|
|
|
|
|
// <--
|
2000-09-18 23:08:29 +00:00
|
|
|
|
bChgd = 1;
|
|
|
|
|
}
|
2008-02-26 09:35:53 +00:00
|
|
|
|
if ( pBkmk->GetOtherBookmarkPos() &&
|
|
|
|
|
&pBkmk->GetOtherBookmarkPos()->nNode.GetNode() == pOldNode )
|
2000-09-18 23:08:29 +00:00
|
|
|
|
{
|
2008-02-26 09:35:53 +00:00
|
|
|
|
// --> OD 2007-09-26 #i81002# - refactoring
|
|
|
|
|
// *pBkmk->pPos2 = aNewPos;
|
|
|
|
|
// pBkmk->pPos2->nContent += nOffset;
|
|
|
|
|
SwPosition aNewPos2( aNewPos );
|
|
|
|
|
aNewPos2.nContent += nOffset;
|
|
|
|
|
pBkmk->SetOtherBookmarkPos( &aNewPos );
|
|
|
|
|
// <--
|
2000-09-18 23:08:29 +00:00
|
|
|
|
bChgd = 2;
|
|
|
|
|
}
|
|
|
|
|
// ungueltige Selektion? Dann die Klammerung aufheben
|
2008-02-26 09:35:53 +00:00
|
|
|
|
if( bChgd && pBkmk->GetOtherBookmarkPos() &&
|
|
|
|
|
pBkmk->GetOtherBookmarkPos()->nNode.GetNode().FindTableBoxStartNode() !=
|
|
|
|
|
pBkmk->GetBookmarkPos().nNode.GetNode().FindTableBoxStartNode() )
|
2000-09-18 23:08:29 +00:00
|
|
|
|
{
|
|
|
|
|
if( 1 == bChgd )
|
2008-02-26 09:35:53 +00:00
|
|
|
|
{
|
|
|
|
|
// --> OD 2007-09-26 #i81002# - refactoring
|
|
|
|
|
// *pBkmk->pPos1 = *pBkmk->pPos2;
|
|
|
|
|
pBkmk->SetBookmarkPos( pBkmk->GetOtherBookmarkPos() );
|
|
|
|
|
// <--
|
|
|
|
|
}
|
|
|
|
|
// --> OD 2007-09-26 #i81002# - refactoring
|
|
|
|
|
// delete pBkmk->pPos2, pBkmk->pPos2 = 0;
|
|
|
|
|
pBkmk->SetOtherBookmarkPos( 0 );
|
|
|
|
|
// <--
|
2000-09-18 23:08:29 +00:00
|
|
|
|
if( pBkmk->IsServer() )
|
|
|
|
|
pBkmk->SetRefObject( 0 );
|
|
|
|
|
// die Sortierung muss aufrecht erhalten bleiben!
|
|
|
|
|
rBkmks.Remove( n-- );
|
|
|
|
|
rBkmks.Insert( pBkmk );
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
{ // dann die Redlines korrigieren
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwRedlineTbl& rTbl = *pRedlineTbl;
|
2000-09-18 23:08:29 +00:00
|
|
|
|
for( USHORT n = 0; n < rTbl.Count(); ++n )
|
|
|
|
|
{
|
|
|
|
|
// liegt auf der Position ??
|
|
|
|
|
_PaMCorrAbs1( rTbl[ n ] )
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if( bMoveCrsr )
|
|
|
|
|
::PaMCorrAbs( rOldNode, rNewPos, nOffset );
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* */
|
|
|
|
|
|
2003-04-17 15:04:51 +00:00
|
|
|
|
bool _PaMCorrAbs2( SwPaM* pPam,
|
|
|
|
|
const SwPosition& rNewPos,
|
|
|
|
|
ULONG nSttNode, ULONG nEndNode )
|
|
|
|
|
{
|
|
|
|
|
bool bRet = false;
|
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
|
for( int nb = 0; nb < 2; ++nb ) \
|
2003-04-17 15:04:51 +00:00
|
|
|
|
if( (pPam)->GetBound( BOOL(nb) ).nNode >= nSttNode &&
|
|
|
|
|
(pPam)->GetBound( BOOL(nb) ).nNode <= nEndNode )
|
|
|
|
|
{
|
|
|
|
|
(pPam)->GetBound( BOOL(nb) ) = rNewPos;
|
|
|
|
|
bRet = true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return bRet;
|
|
|
|
|
}
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
2003-04-17 15:04:51 +00:00
|
|
|
|
// find the relevant section in which the SwUnoCrsr may wander. returns NULL if
|
|
|
|
|
// no restrictions apply
|
|
|
|
|
const SwStartNode* lcl_FindUnoCrsrSection( const SwNode& rNode )
|
|
|
|
|
{
|
|
|
|
|
const SwStartNode* pStartNode = rNode.StartOfSectionNode();
|
|
|
|
|
while( ( pStartNode != NULL ) &&
|
|
|
|
|
( pStartNode->StartOfSectionNode() != pStartNode ) &&
|
|
|
|
|
( pStartNode->GetStartNodeType() == SwNormalStartNode ) )
|
|
|
|
|
pStartNode = pStartNode->StartOfSectionNode();
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
2003-04-17 15:04:51 +00:00
|
|
|
|
return pStartNode;
|
|
|
|
|
}
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
|
|
void PaMCorrAbs( const SwNodeIndex &rStartNode,
|
|
|
|
|
const SwNodeIndex &rEndNode,
|
|
|
|
|
const SwPosition &rNewPos )
|
|
|
|
|
{
|
|
|
|
|
const ULONG nSttNode = rStartNode.GetIndex();
|
|
|
|
|
const ULONG nEndNode = rEndNode.GetIndex();
|
|
|
|
|
const SwPosition aNewPos( rNewPos );
|
|
|
|
|
SwDoc* pDoc = rStartNode.GetNode().GetDoc();
|
|
|
|
|
|
|
|
|
|
SwCrsrShell* pShell = pDoc->GetEditShell();
|
|
|
|
|
if( pShell )
|
|
|
|
|
{
|
|
|
|
|
FOREACHSHELL_START( pShell )
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwPaM *_pStkCrsr = PCURSH->GetStkCrsr();
|
2000-09-18 23:08:29 +00:00
|
|
|
|
// Alle ueberfluessigen Crsr sind vom Stack, oder ??
|
|
|
|
|
// ASSERT( !_pStkCrsr, "Es stehen noch Crsr auf dem CrsrStack" );
|
|
|
|
|
if( _pStkCrsr )
|
|
|
|
|
do {
|
2003-04-17 15:04:51 +00:00
|
|
|
|
_PaMCorrAbs2( _pStkCrsr, aNewPos, nSttNode, nEndNode );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
} while ( (_pStkCrsr != 0 ) &&
|
|
|
|
|
((_pStkCrsr=(SwPaM *)_pStkCrsr->GetNext()) != PCURSH->GetStkCrsr()) );
|
|
|
|
|
|
|
|
|
|
FOREACHPAM_START( PCURSH->_GetCrsr() )
|
2003-04-17 15:04:51 +00:00
|
|
|
|
_PaMCorrAbs2( PCURCRSR, aNewPos, nSttNode, nEndNode );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
|
|
|
|
|
if( PCURSH->IsTableMode() )
|
2003-04-17 15:04:51 +00:00
|
|
|
|
_PaMCorrAbs2( PCURSH->GetTblCrs(), aNewPos, nSttNode, nEndNode );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
|
|
FOREACHSHELL_END( pShell )
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
{
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwUnoCrsrTbl& rTbl = (SwUnoCrsrTbl&)pDoc->GetUnoCrsrTbl();
|
2000-09-18 23:08:29 +00:00
|
|
|
|
for( USHORT n = 0; n < rTbl.Count(); ++n )
|
|
|
|
|
{
|
2003-04-17 15:04:51 +00:00
|
|
|
|
bool bChange = false;
|
|
|
|
|
|
|
|
|
|
SwUnoCrsr* pUnoCursor = rTbl[ n ];
|
|
|
|
|
|
|
|
|
|
// determine whether the UNO cursor will leave it's designated
|
|
|
|
|
// section
|
|
|
|
|
bool bLeaveSection =
|
|
|
|
|
pUnoCursor->IsRemainInSection() &&
|
|
|
|
|
( lcl_FindUnoCrsrSection( aNewPos.nNode.GetNode() ) !=
|
|
|
|
|
lcl_FindUnoCrsrSection(
|
|
|
|
|
pUnoCursor->GetPoint()->nNode.GetNode() ) );
|
|
|
|
|
|
|
|
|
|
FOREACHPAM_START( pUnoCursor )
|
|
|
|
|
bChange |= _PaMCorrAbs2(PCURCRSR, aNewPos, nSttNode, nEndNode);
|
2000-09-18 23:08:29 +00:00
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
|
2003-04-17 15:04:51 +00:00
|
|
|
|
SwUnoTableCrsr* pUnoTblCrsr = (SwUnoTableCrsr*)*pUnoCursor;
|
2000-09-18 23:08:29 +00:00
|
|
|
|
if( pUnoTblCrsr )
|
|
|
|
|
{
|
|
|
|
|
FOREACHPAM_START( &pUnoTblCrsr->GetSelRing() )
|
2003-04-17 15:04:51 +00:00
|
|
|
|
bChange |=
|
|
|
|
|
_PaMCorrAbs2( PCURCRSR, aNewPos, nSttNode, nEndNode );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
}
|
2003-04-17 15:04:51 +00:00
|
|
|
|
|
|
|
|
|
// if a UNO cursor leaves its designated section, we must inform
|
|
|
|
|
// (and invalidate) said cursor
|
|
|
|
|
if( bChange && bLeaveSection )
|
|
|
|
|
{
|
|
|
|
|
// the UNO cursor has left its section. We need to notify it!
|
|
|
|
|
SwMsgPoolItem aHint( RES_UNOCURSOR_LEAVES_SECTION );
|
|
|
|
|
pUnoCursor->Modify( &aHint, NULL );
|
|
|
|
|
}
|
2000-09-18 23:08:29 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void SwDoc::CorrAbs( const SwNodeIndex& rStartNode,
|
|
|
|
|
const SwNodeIndex& rEndNode,
|
|
|
|
|
const SwPosition& rNewPos,
|
|
|
|
|
BOOL bMoveCrsr )
|
|
|
|
|
{
|
|
|
|
|
SwPosition aNewPos( rNewPos );
|
|
|
|
|
|
|
|
|
|
// if( !DoesUndo() )
|
|
|
|
|
// erstmal die Bookmarks/Redlines korrigieren
|
|
|
|
|
_DelBookmarks( rStartNode, rEndNode );
|
|
|
|
|
|
|
|
|
|
if( bMoveCrsr )
|
|
|
|
|
::PaMCorrAbs( rStartNode, rEndNode, rNewPos );
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* */
|
|
|
|
|
|
|
|
|
|
#define _PaMCorrAbs3( pPam ) \
|
|
|
|
|
for( int nb = 0; nb < 2; ++nb ) \
|
|
|
|
|
if( aStart <= (pPam)->GetBound( BOOL(nb) ) && \
|
|
|
|
|
(pPam)->GetBound( BOOL(nb) ) <= aEnd ) \
|
|
|
|
|
(pPam)->GetBound( BOOL(nb) ) = aNewPos;
|
|
|
|
|
|
|
|
|
|
void PaMCorrAbs( const SwPaM& rRange,
|
|
|
|
|
const SwPosition& rNewPos )
|
|
|
|
|
{
|
|
|
|
|
SwPosition aStart( *rRange.Start() );
|
|
|
|
|
SwPosition aEnd( *rRange.End() );
|
|
|
|
|
SwPosition aNewPos( rNewPos );
|
|
|
|
|
SwDoc* pDoc = aStart.nNode.GetNode().GetDoc();
|
|
|
|
|
SwCrsrShell* pShell = pDoc->GetEditShell();
|
|
|
|
|
|
|
|
|
|
if( pShell )
|
|
|
|
|
{
|
|
|
|
|
FOREACHSHELL_START( pShell )
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwPaM *_pStkCrsr = PCURSH->GetStkCrsr();
|
2000-09-18 23:08:29 +00:00
|
|
|
|
// Alle ueberfluessigen Crsr sind vom Stack, oder ??
|
|
|
|
|
// ASSERT( !_pStkCrsr, "Es stehen noch Crsr auf dem CrsrStack" );
|
|
|
|
|
if( _pStkCrsr )
|
|
|
|
|
do {
|
|
|
|
|
_PaMCorrAbs3( _pStkCrsr )
|
|
|
|
|
} while ( (_pStkCrsr != 0 ) &&
|
|
|
|
|
((_pStkCrsr=(SwPaM *)_pStkCrsr->GetNext()) != PCURSH->GetStkCrsr()) );
|
|
|
|
|
|
|
|
|
|
FOREACHPAM_START( PCURSH->_GetCrsr() )
|
|
|
|
|
_PaMCorrAbs3( PCURCRSR )
|
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
|
|
|
|
|
if( PCURSH->IsTableMode() )
|
|
|
|
|
_PaMCorrAbs3( PCURSH->GetTblCrs() )
|
|
|
|
|
|
|
|
|
|
FOREACHSHELL_END( pShell )
|
|
|
|
|
}
|
|
|
|
|
{
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwUnoCrsrTbl& rTbl = (SwUnoCrsrTbl&)pDoc->GetUnoCrsrTbl();
|
2000-09-18 23:08:29 +00:00
|
|
|
|
for( USHORT n = 0; n < rTbl.Count(); ++n )
|
|
|
|
|
{
|
|
|
|
|
FOREACHPAM_START( rTbl[ n ] )
|
|
|
|
|
_PaMCorrAbs3( PCURCRSR )
|
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
|
|
|
|
|
SwUnoTableCrsr* pUnoTblCrsr = (SwUnoTableCrsr*)*rTbl[ n ];
|
|
|
|
|
if( pUnoTblCrsr )
|
|
|
|
|
{
|
|
|
|
|
FOREACHPAM_START( &pUnoTblCrsr->GetSelRing() )
|
|
|
|
|
_PaMCorrAbs3( PCURCRSR )
|
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void SwDoc::CorrAbs( const SwPaM& rRange,
|
|
|
|
|
const SwPosition& rNewPos,
|
|
|
|
|
BOOL bMoveCrsr )
|
|
|
|
|
{
|
|
|
|
|
SwPosition aStart( *rRange.Start() );
|
|
|
|
|
SwPosition aEnd( *rRange.End() );
|
|
|
|
|
SwPosition aNewPos( rNewPos );
|
|
|
|
|
|
|
|
|
|
// if( !DoesUndo() )
|
|
|
|
|
// erstmal die Bookmarks/Redlines korrigieren
|
|
|
|
|
_DelBookmarks( aStart.nNode, aEnd.nNode, 0,
|
|
|
|
|
&aStart.nContent, &aEnd.nContent );
|
|
|
|
|
if( bMoveCrsr )
|
|
|
|
|
::PaMCorrAbs( rRange, rNewPos );
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* */
|
|
|
|
|
|
|
|
|
|
#define _PaMCorrRel1( pPam ) \
|
|
|
|
|
for( int nb = 0; nb < 2; ++nb ) \
|
|
|
|
|
if( &((pPam)->GetBound( BOOL(nb) ).nNode.GetNode()) == pOldNode ) \
|
|
|
|
|
{ \
|
|
|
|
|
(pPam)->GetBound( BOOL(nb) ).nNode = aNewPos.nNode; \
|
|
|
|
|
(pPam)->GetBound( BOOL(nb) ).nContent.Assign( (SwIndexReg*) \
|
|
|
|
|
aNewPos.nContent.GetIdxReg(), \
|
|
|
|
|
nCntIdx + (pPam)->GetBound( BOOL(nb) ).nContent. \
|
|
|
|
|
GetIndex() ); \
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void PaMCorrRel( const SwNodeIndex &rOldNode,
|
|
|
|
|
const SwPosition &rNewPos,
|
|
|
|
|
const xub_StrLen nOffset )
|
|
|
|
|
{
|
|
|
|
|
const SwNode* pOldNode = &rOldNode.GetNode();
|
|
|
|
|
SwPosition aNewPos( rNewPos );
|
|
|
|
|
const SwDoc* pDoc = pOldNode->GetDoc();
|
|
|
|
|
|
|
|
|
|
xub_StrLen nCntIdx = rNewPos.nContent.GetIndex() + nOffset;
|
|
|
|
|
|
|
|
|
|
SwCrsrShell* pShell = pDoc->GetEditShell();
|
|
|
|
|
if( pShell )
|
|
|
|
|
{
|
|
|
|
|
FOREACHSHELL_START( pShell )
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwPaM *_pStkCrsr = PCURSH->GetStkCrsr();
|
2000-09-18 23:08:29 +00:00
|
|
|
|
// Alle ueberfluessigen Crsr sind vom Stack, oder ??
|
|
|
|
|
// ASSERT( !_pStkCrsr, "Es stehen noch Crsr auf dem CrsrStack" );
|
|
|
|
|
if( _pStkCrsr )
|
|
|
|
|
do {
|
|
|
|
|
_PaMCorrRel1( _pStkCrsr )
|
|
|
|
|
} while ( (_pStkCrsr != 0 ) &&
|
|
|
|
|
((_pStkCrsr=(SwPaM *)_pStkCrsr->GetNext()) != PCURSH->GetStkCrsr()) );
|
|
|
|
|
|
|
|
|
|
FOREACHPAM_START( PCURSH->_GetCrsr() )
|
|
|
|
|
_PaMCorrRel1( PCURCRSR )
|
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
|
|
|
|
|
if( PCURSH->IsTableMode() )
|
|
|
|
|
_PaMCorrRel1( PCURSH->GetTblCrs() )
|
|
|
|
|
|
|
|
|
|
FOREACHSHELL_END( pShell )
|
|
|
|
|
}
|
|
|
|
|
{
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwUnoCrsrTbl& rTbl = (SwUnoCrsrTbl&)pDoc->GetUnoCrsrTbl();
|
2000-09-18 23:08:29 +00:00
|
|
|
|
for( USHORT n = 0; n < rTbl.Count(); ++n )
|
|
|
|
|
{
|
|
|
|
|
FOREACHPAM_START( rTbl[ n ] )
|
|
|
|
|
_PaMCorrRel1( PCURCRSR )
|
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
|
|
|
|
|
SwUnoTableCrsr* pUnoTblCrsr = (SwUnoTableCrsr*)*rTbl[ n ];
|
|
|
|
|
if( pUnoTblCrsr )
|
|
|
|
|
{
|
|
|
|
|
FOREACHPAM_START( &pUnoTblCrsr->GetSelRing() )
|
|
|
|
|
_PaMCorrRel1( PCURCRSR )
|
|
|
|
|
FOREACHPAM_END()
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void SwDoc::CorrRel( const SwNodeIndex& rOldNode,
|
|
|
|
|
const SwPosition& rNewPos,
|
|
|
|
|
const xub_StrLen nOffset,
|
|
|
|
|
BOOL bMoveCrsr )
|
|
|
|
|
{
|
|
|
|
|
const SwNode* pOldNode = &rOldNode.GetNode();
|
|
|
|
|
SwPosition aNewPos( rNewPos );
|
|
|
|
|
xub_StrLen nCntIdx = aNewPos.nContent.GetIndex() + nOffset;
|
|
|
|
|
|
|
|
|
|
{ // erstmal die Bookmark korrigieren
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwBookmarks& rBkmks = *pBookmarkTbl;
|
|
|
|
|
SwBookmark* pBkmk;
|
2000-09-18 23:08:29 +00:00
|
|
|
|
for( USHORT n = 0; n < rBkmks.Count(); ++n )
|
|
|
|
|
{
|
|
|
|
|
// liegt auf der Position ??
|
|
|
|
|
int bChgd = FALSE;
|
2008-02-26 09:35:53 +00:00
|
|
|
|
if( &( pBkmk = (SwBookmark*)rBkmks[ n ])->GetBookmarkPos().nNode.GetNode()
|
2000-09-18 23:08:29 +00:00
|
|
|
|
== pOldNode )
|
|
|
|
|
{
|
2008-02-26 09:35:53 +00:00
|
|
|
|
// --> OD 2007-09-26 #i81002# - refactoring
|
|
|
|
|
// pBkmk->pPos1->nNode = aNewPos.nNode;
|
|
|
|
|
// pBkmk->pPos1->nContent.Assign( (SwIndexReg*)
|
|
|
|
|
// aNewPos.nContent.GetIdxReg(),
|
|
|
|
|
// nCntIdx + pBkmk->pPos1->nContent.GetIndex() );
|
|
|
|
|
SwPosition aNewPos1( pBkmk->GetBookmarkPos() );
|
|
|
|
|
aNewPos1.nNode = aNewPos.nNode;
|
|
|
|
|
aNewPos1.nContent.Assign( (SwIndexReg*)aNewPos.nContent.GetIdxReg(),
|
|
|
|
|
nCntIdx + pBkmk->GetBookmarkPos().nContent.GetIndex() );
|
|
|
|
|
pBkmk->SetBookmarkPos( &aNewPos1 );
|
|
|
|
|
// <--
|
2000-09-18 23:08:29 +00:00
|
|
|
|
bChgd = 1;
|
|
|
|
|
}
|
2008-02-26 09:35:53 +00:00
|
|
|
|
if ( pBkmk->GetOtherBookmarkPos() &&
|
|
|
|
|
&pBkmk->GetOtherBookmarkPos()->nNode.GetNode() == pOldNode )
|
2000-09-18 23:08:29 +00:00
|
|
|
|
{
|
2008-02-26 09:35:53 +00:00
|
|
|
|
// --> OD 2007-09-26 #i81002# - refactoring
|
|
|
|
|
// pBkmk->pPos2->nNode = aNewPos.nNode;
|
|
|
|
|
// pBkmk->pPos2->nContent.Assign( (SwIndexReg*)
|
|
|
|
|
// aNewPos.nContent.GetIdxReg(),
|
|
|
|
|
// nCntIdx + pBkmk->pPos2->nContent.GetIndex() );
|
|
|
|
|
SwPosition aNewPos2( *(pBkmk->GetOtherBookmarkPos()) );
|
|
|
|
|
aNewPos2.nNode = aNewPos.nNode;
|
|
|
|
|
aNewPos2.nContent.Assign( (SwIndexReg*)aNewPos.nContent.GetIdxReg(),
|
|
|
|
|
nCntIdx + pBkmk->GetOtherBookmarkPos()->nContent.GetIndex() );
|
|
|
|
|
pBkmk->SetOtherBookmarkPos( &aNewPos2 );
|
|
|
|
|
// <--
|
2000-09-18 23:08:29 +00:00
|
|
|
|
bChgd = 2;
|
|
|
|
|
}
|
|
|
|
|
// ungueltige Selektion? Dann die Klammerung aufheben
|
2008-02-26 09:35:53 +00:00
|
|
|
|
if( bChgd && pBkmk->GetOtherBookmarkPos() &&
|
|
|
|
|
pBkmk->GetOtherBookmarkPos()->nNode.GetNode().FindTableBoxStartNode() !=
|
|
|
|
|
pBkmk->GetBookmarkPos().nNode.GetNode().FindTableBoxStartNode() )
|
2000-09-18 23:08:29 +00:00
|
|
|
|
{
|
|
|
|
|
if( 1 == bChgd )
|
2008-02-26 09:35:53 +00:00
|
|
|
|
{
|
|
|
|
|
// --> OD 2007-09-26 #i81002# - refactoring
|
|
|
|
|
// *pBkmk->pPos1 = *pBkmk->pPos2;
|
|
|
|
|
pBkmk->SetBookmarkPos( pBkmk->GetOtherBookmarkPos() );
|
|
|
|
|
// <--
|
|
|
|
|
}
|
|
|
|
|
// --> OD 2007-09-26 #i81002# - refactoring
|
|
|
|
|
// delete pBkmk->pPos2, pBkmk->pPos2 = 0;
|
|
|
|
|
pBkmk->SetOtherBookmarkPos( 0 );
|
|
|
|
|
// <--
|
2000-09-18 23:08:29 +00:00
|
|
|
|
if( pBkmk->IsServer() )
|
|
|
|
|
pBkmk->SetRefObject( 0 );
|
|
|
|
|
|
|
|
|
|
// die Sortierung muss aufrecht erhalten bleiben!
|
|
|
|
|
rBkmks.Remove( n-- );
|
|
|
|
|
rBkmks.Insert( pBkmk );
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
{ // dann die Redlines korrigieren
|
2007-09-27 07:33:37 +00:00
|
|
|
|
SwRedlineTbl& rTbl = *pRedlineTbl;
|
2000-09-18 23:08:29 +00:00
|
|
|
|
for( USHORT n = 0; n < rTbl.Count(); ++n )
|
|
|
|
|
{
|
|
|
|
|
// liegt auf der Position ??
|
|
|
|
|
_PaMCorrRel1( rTbl[ n ] )
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if( bMoveCrsr )
|
2001-04-25 10:29:30 +00:00
|
|
|
|
::PaMCorrRel( rOldNode, rNewPos, nOffset );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* */
|
|
|
|
|
|
|
|
|
|
SwEditShell* SwDoc::GetEditShell( ViewShell** ppSh ) const
|
|
|
|
|
{
|
|
|
|
|
// Layout und OLE-Shells sollten vorhanden sein!
|
|
|
|
|
if( pLayout && pLayout->GetCurrShell() )
|
|
|
|
|
{
|
2007-09-27 07:33:37 +00:00
|
|
|
|
ViewShell *pSh = pLayout->GetCurrShell(), *pVSh = pSh;
|
2000-09-18 23:08:29 +00:00
|
|
|
|
if( ppSh )
|
|
|
|
|
*ppSh = pSh;
|
|
|
|
|
|
|
|
|
|
// wir suchen uns eine EditShell, falls diese existiert
|
|
|
|
|
do {
|
|
|
|
|
if( pSh->IsA( TYPE( SwEditShell ) ) )
|
|
|
|
|
return (SwEditShell*)pSh;
|
|
|
|
|
|
|
|
|
|
} while( pVSh != ( pSh = (ViewShell*)pSh->GetNext() ));
|
|
|
|
|
}
|
|
|
|
|
else if( ppSh )
|
|
|
|
|
*ppSh = 0;
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|