2000-09-18 23:08:29 +00:00
|
|
|
/*************************************************************************
|
|
|
|
*
|
|
|
|
* $RCSfile: unovwr.cxx,v $
|
|
|
|
*
|
2004-05-18 13:08:58 +00:00
|
|
|
* $Revision: 1.12 $
|
2000-09-18 23:08:29 +00:00
|
|
|
*
|
2004-05-18 13:08:58 +00:00
|
|
|
* last change: $Author: kz $ $Date: 2004-05-18 14:08:58 $
|
2000-09-18 23:08:29 +00:00
|
|
|
*
|
|
|
|
* The Contents of this file are made available subject to the terms of
|
|
|
|
* either of the following licenses
|
|
|
|
*
|
|
|
|
* - GNU Lesser General Public License Version 2.1
|
|
|
|
* - Sun Industry Standards Source License Version 1.1
|
|
|
|
*
|
|
|
|
* Sun Microsystems Inc., October, 2000
|
|
|
|
*
|
|
|
|
* GNU Lesser General Public License Version 2.1
|
|
|
|
* =============================================
|
|
|
|
* Copyright 2000 by Sun Microsystems, Inc.
|
|
|
|
* 901 San Antonio Road, Palo Alto, CA 94303, USA
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* 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
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* Sun Industry Standards Source License Version 1.1
|
|
|
|
* =================================================
|
|
|
|
* The contents of this file are subject to the Sun Industry Standards
|
|
|
|
* Source License Version 1.1 (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.openoffice.org/license.html.
|
|
|
|
*
|
|
|
|
* Software provided under this License is provided on an "AS IS" basis,
|
|
|
|
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
|
|
|
|
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
|
|
|
|
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
|
|
|
|
* See the License for the specific provisions governing your rights and
|
|
|
|
* obligations concerning the Software.
|
|
|
|
*
|
|
|
|
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
|
|
|
|
*
|
|
|
|
* Copyright: 2000 by Sun Microsystems, Inc.
|
|
|
|
*
|
|
|
|
* All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Contributor(s): _______________________________________
|
|
|
|
*
|
|
|
|
*
|
|
|
|
************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
#pragma hdrstop
|
|
|
|
|
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
|
2000-12-21 08:32:45 +00:00
|
|
|
#ifndef _UNOTOOLS_TRANSLITERATIONWRAPPER_HXX
|
|
|
|
#include <unotools/transliterationwrapper.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _COMPHELPER_PROCESSFACTORY_HXX_
|
|
|
|
#include <comphelper/processfactory.hxx>
|
|
|
|
#endif
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
#ifndef _DOC_HXX
|
|
|
|
#include <doc.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 _ACORRECT_HXX
|
|
|
|
#include <acorrect.hxx>
|
|
|
|
#endif
|
|
|
|
#ifndef _DOCARY_HXX
|
|
|
|
#include <docary.hxx>
|
|
|
|
#endif
|
|
|
|
|
2004-05-18 13:08:58 +00:00
|
|
|
#include <tools/resid.hxx>
|
|
|
|
#include <comcore.hrc> // #111827#
|
|
|
|
#include <undo.hrc>
|
2000-09-18 23:08:29 +00:00
|
|
|
|
2000-12-21 08:32:45 +00:00
|
|
|
using namespace ::com::sun::star::i18n;
|
|
|
|
using namespace ::com::sun::star::uno;
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
//------------------------------------------------------------------
|
|
|
|
|
|
|
|
// zwei Zugriffs-Funktionen
|
|
|
|
inline SwPosition* IterPt( SwUndoIter& rUIter )
|
|
|
|
{ return rUIter.pAktPam->GetPoint(); }
|
|
|
|
inline SwPosition* IterMk( SwUndoIter& rUIter )
|
|
|
|
{ return rUIter.pAktPam->GetMark(); }
|
|
|
|
|
|
|
|
inline SwDoc& SwUndoIter::GetDoc() const { return *pAktPam->GetDoc(); }
|
|
|
|
|
|
|
|
//------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
|
|
// OVERWRITE
|
|
|
|
|
|
|
|
|
|
|
|
SwUndoOverwrite::SwUndoOverwrite( SwDoc* pDoc, SwPosition& rPos,
|
|
|
|
sal_Unicode cIns )
|
|
|
|
: SwUndo(UNDO_OVERWRITE), bGroup( FALSE ), pRedlSaveData( 0 )
|
|
|
|
{
|
|
|
|
#ifdef COMPACT
|
|
|
|
pDoc->DelUndoGroups();
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if( !pDoc->IsIgnoreRedline() && pDoc->GetRedlineTbl().Count() )
|
|
|
|
{
|
|
|
|
SwPaM aPam( rPos.nNode, rPos.nContent.GetIndex(),
|
|
|
|
rPos.nNode, rPos.nContent.GetIndex()+1 );
|
|
|
|
pRedlSaveData = new SwRedlineSaveDatas;
|
2000-10-26 10:24:24 +00:00
|
|
|
if( !FillSaveData( aPam, *pRedlSaveData, FALSE ))
|
2000-09-18 23:08:29 +00:00
|
|
|
delete pRedlSaveData, pRedlSaveData = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
nSttNode = rPos.nNode.GetIndex();
|
|
|
|
nSttCntnt = rPos.nContent.GetIndex();
|
|
|
|
|
|
|
|
SwTxtNode* pTxtNd = rPos.nNode.GetNode().GetTxtNode();
|
|
|
|
ASSERT( pTxtNd, "Overwrite nicht im TextNode?" );
|
|
|
|
|
|
|
|
bInsChar = TRUE;
|
2000-10-26 10:24:24 +00:00
|
|
|
xub_StrLen nTxtNdLen = pTxtNd->GetTxt().Len();
|
|
|
|
if( nSttCntnt < nTxtNdLen ) // kein reines Einfuegen ?
|
2000-09-18 23:08:29 +00:00
|
|
|
{
|
|
|
|
aDelStr.Insert( pTxtNd->GetTxt().GetChar( nSttCntnt ) );
|
|
|
|
if( !pHistory )
|
|
|
|
pHistory = new SwHistory;
|
|
|
|
SwRegHistory aRHst( *pTxtNd, pHistory );
|
|
|
|
pHistory->CopyAttr( pTxtNd->GetpSwpHints(), nSttNode, 0,
|
2000-10-26 10:24:24 +00:00
|
|
|
nTxtNdLen, FALSE );
|
2000-09-18 23:08:29 +00:00
|
|
|
rPos.nContent++;
|
|
|
|
bInsChar = FALSE;
|
|
|
|
}
|
2000-11-06 09:50:05 +00:00
|
|
|
|
|
|
|
BOOL bOldExpFlg = pTxtNd->IsIgnoreDontExpand();
|
|
|
|
pTxtNd->SetIgnoreDontExpand( TRUE );
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
pTxtNd->Insert( cIns, rPos.nContent );
|
|
|
|
aInsStr.Insert( cIns );
|
|
|
|
|
|
|
|
if( !bInsChar )
|
|
|
|
{
|
|
|
|
const SwIndex aTmpIndex( rPos.nContent, -2 );
|
|
|
|
pTxtNd->Erase( aTmpIndex, 1 );
|
|
|
|
}
|
2000-11-06 09:50:05 +00:00
|
|
|
pTxtNd->SetIgnoreDontExpand( bOldExpFlg );
|
2000-09-18 23:08:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
SwUndoOverwrite::~SwUndoOverwrite()
|
|
|
|
{
|
|
|
|
delete pRedlSaveData;
|
|
|
|
}
|
|
|
|
|
|
|
|
BOOL SwUndoOverwrite::CanGrouping( SwDoc* pDoc, SwPosition& rPos,
|
|
|
|
sal_Unicode cIns )
|
|
|
|
{
|
|
|
|
/// ?? was ist mit nur eingefuegten Charaktern ???
|
|
|
|
|
|
|
|
// es kann nur das Loeschen von einzelnen char's zusammengefasst werden
|
|
|
|
if( rPos.nNode != nSttNode || !aInsStr.Len() ||
|
|
|
|
( !bGroup && aInsStr.Len() != 1 ))
|
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
// ist der Node ueberhaupt ein TextNode?
|
|
|
|
SwTxtNode * pDelTxtNd = rPos.nNode.GetNode().GetTxtNode();
|
|
|
|
if( !pDelTxtNd ||
|
|
|
|
( pDelTxtNd->GetTxt().Len() != rPos.nContent.GetIndex() &&
|
|
|
|
rPos.nContent.GetIndex() != ( nSttCntnt + aInsStr.Len() )))
|
|
|
|
return FALSE;
|
|
|
|
|
2000-10-25 14:13:25 +00:00
|
|
|
CharClass& rCC = GetAppCharClass();
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
// befrage das einzufuegende Charakter
|
|
|
|
if( ( CH_TXTATR_BREAKWORD == cIns && CH_TXTATR_INWORD == cIns ) ||
|
2000-10-25 14:13:25 +00:00
|
|
|
rCC.isLetterNumeric( String( cIns ), 0 ) !=
|
|
|
|
rCC.isLetterNumeric( aInsStr, aInsStr.Len()-1 ) )
|
2000-09-18 23:08:29 +00:00
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
{
|
|
|
|
SwRedlineSaveDatas* pTmpSav = new SwRedlineSaveDatas;
|
|
|
|
SwPaM aPam( rPos.nNode, rPos.nContent.GetIndex(),
|
|
|
|
rPos.nNode, rPos.nContent.GetIndex()+1 );
|
|
|
|
|
|
|
|
if( !FillSaveData( aPam, *pTmpSav, FALSE ))
|
|
|
|
delete pTmpSav, pTmpSav = 0;
|
|
|
|
|
|
|
|
BOOL bOk = ( !pRedlSaveData && !pTmpSav ) ||
|
|
|
|
( pRedlSaveData && pTmpSav &&
|
|
|
|
SwUndo::CanRedlineGroup( *pRedlSaveData, *pTmpSav,
|
|
|
|
nSttCntnt > rPos.nContent.GetIndex() ));
|
|
|
|
delete pTmpSav;
|
|
|
|
if( !bOk )
|
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
pDoc->DeleteRedline( aPam, FALSE );
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ok, die beiden 'Overwrites' koennen zusammen gefasst werden, also
|
|
|
|
// 'verschiebe' das enstprechende Zeichen
|
|
|
|
if( !bInsChar )
|
|
|
|
{
|
|
|
|
if( rPos.nContent.GetIndex() < pDelTxtNd->GetTxt().Len() )
|
|
|
|
{
|
|
|
|
aDelStr.Insert( pDelTxtNd->GetTxt().GetChar(rPos.nContent.GetIndex()) );
|
|
|
|
rPos.nContent++;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
bInsChar = TRUE;
|
|
|
|
}
|
2000-11-06 09:50:05 +00:00
|
|
|
|
|
|
|
BOOL bOldExpFlg = pDelTxtNd->IsIgnoreDontExpand();
|
|
|
|
pDelTxtNd->SetIgnoreDontExpand( TRUE );
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
pDelTxtNd->Insert( cIns, rPos.nContent );
|
|
|
|
aInsStr.Insert( cIns );
|
|
|
|
|
|
|
|
if( !bInsChar )
|
|
|
|
{
|
|
|
|
const SwIndex aTmpIndex( rPos.nContent, -2 );
|
|
|
|
pDelTxtNd->Erase( aTmpIndex, 1 );
|
|
|
|
}
|
2000-11-06 09:50:05 +00:00
|
|
|
pDelTxtNd->SetIgnoreDontExpand( bOldExpFlg );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
bGroup = TRUE;
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void SwUndoOverwrite::Undo( SwUndoIter& rUndoIter )
|
|
|
|
{
|
|
|
|
SwPaM* pAktPam = rUndoIter.pAktPam;
|
|
|
|
SwDoc* pDoc = pAktPam->GetDoc();
|
|
|
|
pAktPam->DeleteMark();
|
|
|
|
pAktPam->GetPoint()->nNode = nSttNode;
|
|
|
|
SwTxtNode* pTxtNd = pAktPam->GetNode()->GetTxtNode();
|
|
|
|
ASSERT( pTxtNd, "Overwrite nicht im TextNode?" );
|
|
|
|
SwIndex& rIdx = pAktPam->GetPoint()->nContent;
|
|
|
|
rIdx.Assign( pTxtNd, nSttCntnt );
|
|
|
|
|
|
|
|
SwAutoCorrExceptWord* pACEWord = pDoc->GetAutoCorrExceptWord();
|
|
|
|
if( pACEWord )
|
|
|
|
{
|
|
|
|
if( 1 == aInsStr.Len() && 1 == aDelStr.Len() )
|
|
|
|
pACEWord->CheckChar( *pAktPam->GetPoint(), aDelStr.GetChar( 0 ) );
|
|
|
|
pDoc->SetAutoCorrExceptWord( 0 );
|
|
|
|
}
|
|
|
|
|
|
|
|
// wurde nicht nur ueberschieben sondern auch geinsertet, so loesche
|
|
|
|
// den Ueberhang
|
|
|
|
if( aInsStr.Len() > aDelStr.Len() )
|
|
|
|
{
|
|
|
|
rIdx += aDelStr.Len();
|
|
|
|
pTxtNd->Erase( rIdx, aInsStr.Len() - aDelStr.Len() );
|
|
|
|
rIdx = nSttCntnt;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( aDelStr.Len() )
|
|
|
|
{
|
|
|
|
String aTmpStr( '1' );
|
|
|
|
sal_Unicode* pTmpStr = aTmpStr.GetBufferAccess();
|
|
|
|
|
2000-11-06 09:50:05 +00:00
|
|
|
BOOL bOldExpFlg = pTxtNd->IsIgnoreDontExpand();
|
|
|
|
pTxtNd->SetIgnoreDontExpand( TRUE );
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
rIdx++;
|
|
|
|
for( xub_StrLen n = 0; n < aDelStr.Len(); n++ )
|
|
|
|
{
|
|
|
|
// einzeln, damit die Attribute stehen bleiben !!!
|
|
|
|
*pTmpStr = aDelStr.GetChar( n );
|
|
|
|
pTxtNd->Insert( aTmpStr, rIdx /*???, SETATTR_NOTXTATRCHR*/ );
|
|
|
|
rIdx -= 2;
|
|
|
|
pTxtNd->Erase( rIdx, 1 );
|
|
|
|
rIdx += 2;
|
|
|
|
}
|
2000-11-06 09:50:05 +00:00
|
|
|
pTxtNd->SetIgnoreDontExpand( bOldExpFlg );
|
2000-09-18 23:08:29 +00:00
|
|
|
rIdx--;
|
|
|
|
}
|
|
|
|
if( pHistory )
|
2000-11-06 09:50:05 +00:00
|
|
|
{
|
|
|
|
if( pTxtNd->GetpSwpHints() )
|
2001-06-08 12:27:50 +00:00
|
|
|
pTxtNd->ClearSwpHintsArr( FALSE, FALSE );
|
2000-09-18 23:08:29 +00:00
|
|
|
pHistory->TmpRollback( pDoc, 0, FALSE );
|
2000-11-06 09:50:05 +00:00
|
|
|
}
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
if( pAktPam->GetMark()->nContent.GetIndex() != nSttCntnt )
|
|
|
|
{
|
|
|
|
pAktPam->SetMark();
|
|
|
|
pAktPam->GetMark()->nContent = nSttCntnt;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( pRedlSaveData )
|
|
|
|
SetSaveData( *pDoc, *pRedlSaveData );
|
|
|
|
}
|
|
|
|
|
|
|
|
void SwUndoOverwrite::Repeat( SwUndoIter& rUndoIter )
|
|
|
|
{
|
|
|
|
rUndoIter.pLastUndoObj = this;
|
|
|
|
SwPaM* pAktPam = rUndoIter.pAktPam;
|
|
|
|
if( !aInsStr.Len() || pAktPam->HasMark() )
|
|
|
|
return;
|
|
|
|
|
|
|
|
SwDoc& rDoc = *pAktPam->GetDoc();
|
|
|
|
|
|
|
|
BOOL bGroupUndo = rDoc.DoesGroupUndo();
|
|
|
|
rDoc.DoGroupUndo( FALSE );
|
|
|
|
rDoc.Overwrite( *pAktPam, aInsStr.GetChar( 0 ));
|
|
|
|
rDoc.DoGroupUndo( bGroupUndo );
|
|
|
|
for( xub_StrLen n = 1; n < aInsStr.Len(); ++n )
|
|
|
|
rDoc.Overwrite( *pAktPam, aInsStr.GetChar( n ) );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void SwUndoOverwrite::Redo( SwUndoIter& rUndoIter )
|
|
|
|
{
|
|
|
|
SwPaM* pAktPam = rUndoIter.pAktPam;
|
|
|
|
SwDoc* pDoc = pAktPam->GetDoc();
|
|
|
|
pAktPam->DeleteMark();
|
|
|
|
pAktPam->GetPoint()->nNode = nSttNode;
|
|
|
|
SwTxtNode* pTxtNd = pAktPam->GetNode()->GetTxtNode();
|
|
|
|
ASSERT( pTxtNd, "Overwrite nicht im TextNode?" );
|
|
|
|
SwIndex& rIdx = pAktPam->GetPoint()->nContent;
|
|
|
|
|
|
|
|
if( pRedlSaveData )
|
|
|
|
{
|
|
|
|
rIdx.Assign( pTxtNd, nSttCntnt );
|
|
|
|
pAktPam->SetMark();
|
|
|
|
pAktPam->GetMark()->nContent += aInsStr.Len();
|
|
|
|
pDoc->DeleteRedline( *pAktPam, FALSE );
|
|
|
|
pAktPam->DeleteMark();
|
|
|
|
}
|
|
|
|
rIdx.Assign( pTxtNd, aDelStr.Len() ? nSttCntnt+1 : nSttCntnt );
|
|
|
|
|
2000-11-06 09:50:05 +00:00
|
|
|
BOOL bOldExpFlg = pTxtNd->IsIgnoreDontExpand();
|
|
|
|
pTxtNd->SetIgnoreDontExpand( TRUE );
|
|
|
|
|
2000-09-18 23:08:29 +00:00
|
|
|
for( xub_StrLen n = 0; n < aInsStr.Len(); n++ )
|
|
|
|
{
|
|
|
|
// einzeln, damit die Attribute stehen bleiben !!!
|
|
|
|
pTxtNd->Insert( aInsStr.GetChar( n ), rIdx );
|
|
|
|
if( n < aDelStr.Len() )
|
|
|
|
{
|
|
|
|
rIdx -= 2;
|
|
|
|
pTxtNd->Erase( rIdx, 1 );
|
|
|
|
rIdx += n+1 < aDelStr.Len() ? 2 : 1;
|
|
|
|
}
|
|
|
|
}
|
2000-11-06 09:50:05 +00:00
|
|
|
pTxtNd->SetIgnoreDontExpand( bOldExpFlg );
|
2000-09-18 23:08:29 +00:00
|
|
|
|
|
|
|
// alte Anfangs-Position vom UndoNodes-Array zurueckholen
|
|
|
|
if( pHistory )
|
|
|
|
pHistory->SetTmpEnd( pHistory->Count() );
|
|
|
|
if( pAktPam->GetMark()->nContent.GetIndex() != nSttCntnt )
|
|
|
|
{
|
|
|
|
pAktPam->SetMark();
|
|
|
|
pAktPam->GetMark()->nContent = nSttCntnt;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-05-18 13:08:58 +00:00
|
|
|
SwRewriter SwUndoOverwrite::GetRewriter() const
|
|
|
|
{
|
|
|
|
SwRewriter aResult;
|
|
|
|
|
|
|
|
String aString;
|
|
|
|
|
|
|
|
aString += String(SW_RES(STR_START_QUOTE));
|
|
|
|
aString += ShortenString(aInsStr, nUndoStringLength,
|
|
|
|
String(SW_RES(STR_LDOTS)));
|
|
|
|
aString += String(SW_RES(STR_END_QUOTE));
|
|
|
|
|
|
|
|
aResult.AddRule(UNDO_ARG1, aString);
|
|
|
|
|
|
|
|
return aResult;
|
|
|
|
}
|
|
|
|
|
2000-12-21 08:32:45 +00:00
|
|
|
//------------------------------------------------------------
|
|
|
|
|
|
|
|
struct _UndoTransliterate_Data
|
|
|
|
{
|
2001-02-23 13:17:56 +00:00
|
|
|
String sText;
|
2000-12-21 08:32:45 +00:00
|
|
|
_UndoTransliterate_Data* pNext;
|
2001-02-23 13:17:56 +00:00
|
|
|
SwHistory* pHistory;
|
|
|
|
Sequence <long>* pOffsets;
|
2000-12-21 08:32:45 +00:00
|
|
|
ULONG nNdIdx;
|
2001-12-12 11:32:30 +00:00
|
|
|
xub_StrLen nStart, nLen;
|
2000-12-21 08:32:45 +00:00
|
|
|
|
2001-12-12 11:32:30 +00:00
|
|
|
_UndoTransliterate_Data( ULONG nNd, xub_StrLen nStt, xub_StrLen nStrLen,
|
|
|
|
const String& rTxt )
|
2001-02-23 13:17:56 +00:00
|
|
|
: pNext( 0 ), pOffsets( 0 ), pHistory( 0 ), sText( rTxt ),
|
2001-12-12 11:32:30 +00:00
|
|
|
nStart( nStt ), nNdIdx( nNd ), nLen( nStrLen )
|
2001-02-23 13:17:56 +00:00
|
|
|
{}
|
|
|
|
~_UndoTransliterate_Data() { delete pOffsets; delete pHistory; }
|
2000-12-21 08:32:45 +00:00
|
|
|
|
|
|
|
void SetChangeAtNode( SwDoc& rDoc );
|
|
|
|
};
|
|
|
|
|
|
|
|
SwUndoTransliterate::SwUndoTransliterate( const SwPaM& rPam,
|
|
|
|
const utl::TransliterationWrapper& rTrans )
|
|
|
|
: SwUndo( UNDO_TRANSLITERATE ), SwUndRng( rPam ),
|
|
|
|
nType( rTrans.getType() ), pData( 0 ), pLastData( 0 )
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
SwUndoTransliterate::~SwUndoTransliterate()
|
|
|
|
{
|
|
|
|
_UndoTransliterate_Data* pD = pData;
|
|
|
|
while( pD )
|
|
|
|
{
|
|
|
|
pData = pD;
|
|
|
|
pD = pD->pNext;
|
|
|
|
delete pData;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void SwUndoTransliterate::Undo( SwUndoIter& rUndoIter )
|
|
|
|
{
|
|
|
|
SwDoc& rDoc = rUndoIter.GetDoc();
|
|
|
|
BOOL bUndo = rDoc.DoesUndo();
|
|
|
|
rDoc.DoUndo( FALSE );
|
|
|
|
|
|
|
|
for( _UndoTransliterate_Data* pD = pData; pD; pD = pD->pNext )
|
|
|
|
pD->SetChangeAtNode( rDoc );
|
|
|
|
|
|
|
|
rDoc.DoUndo( bUndo );
|
|
|
|
SetPaM( rUndoIter, TRUE );
|
|
|
|
}
|
|
|
|
|
|
|
|
void SwUndoTransliterate::Redo( SwUndoIter& rUndoIter )
|
|
|
|
{
|
|
|
|
/* ??? */ rUndoIter.SetUpdateAttr( TRUE );
|
|
|
|
|
|
|
|
SetPaM( *rUndoIter.pAktPam );
|
|
|
|
Repeat( rUndoIter );
|
|
|
|
}
|
|
|
|
|
|
|
|
void SwUndoTransliterate::Repeat( SwUndoIter& rUndoIter )
|
|
|
|
{
|
|
|
|
SwPaM& rPam = *rUndoIter.pAktPam;
|
|
|
|
SwDoc& rDoc = rUndoIter.GetDoc();
|
|
|
|
|
|
|
|
utl::TransliterationWrapper aTrans(
|
|
|
|
::comphelper::getProcessServiceFactory(), nType );
|
|
|
|
rDoc.TransliterateText( rPam, aTrans );
|
|
|
|
|
|
|
|
rUndoIter.pLastUndoObj = this;
|
|
|
|
}
|
|
|
|
|
|
|
|
void SwUndoTransliterate::AddChanges( const SwTxtNode& rTNd,
|
2001-12-12 11:32:30 +00:00
|
|
|
xub_StrLen nStart, xub_StrLen nLen,
|
2000-12-21 08:32:45 +00:00
|
|
|
::com::sun::star::uno::Sequence <long>& rOffsets )
|
|
|
|
{
|
2001-02-23 13:17:56 +00:00
|
|
|
long nOffsLen = rOffsets.getLength();
|
|
|
|
_UndoTransliterate_Data* pNew = new _UndoTransliterate_Data(
|
2001-12-12 11:32:30 +00:00
|
|
|
rTNd.GetIndex(), nStart, (xub_StrLen)nOffsLen,
|
|
|
|
rTNd.GetTxt().Copy( nStart, nLen ));
|
2000-12-21 08:32:45 +00:00
|
|
|
if( pData )
|
|
|
|
pLastData->pNext = pNew;
|
|
|
|
else
|
|
|
|
pData = pNew;
|
|
|
|
pLastData = pNew;
|
|
|
|
|
2001-02-23 13:17:56 +00:00
|
|
|
const long* pOffsets = rOffsets.getConstArray();
|
2000-12-21 08:32:45 +00:00
|
|
|
// where did we need less memory ?
|
2001-02-23 13:17:56 +00:00
|
|
|
// check for 1-1 mappings:
|
|
|
|
BOOL bOneToOne = TRUE;
|
|
|
|
const long* p = pOffsets;
|
|
|
|
for( long n = 0; n < nOffsLen; ++n, ++p )
|
2001-02-27 15:53:28 +00:00
|
|
|
if( *p != ( nStart + n ))
|
2000-12-21 08:32:45 +00:00
|
|
|
{
|
2001-02-23 13:17:56 +00:00
|
|
|
// create the Offset array
|
2001-12-12 11:32:30 +00:00
|
|
|
pNew->pOffsets = new Sequence <long> ( nLen );
|
2001-02-23 13:17:56 +00:00
|
|
|
long* pIdx = pNew->pOffsets->getArray();
|
|
|
|
p = pOffsets;
|
2001-02-27 15:53:28 +00:00
|
|
|
long nMyOff, nNewVal = nStart;
|
|
|
|
for( n = 0, nMyOff = nStart; n < nOffsLen; ++p, ++n, ++nMyOff )
|
2001-02-23 13:17:56 +00:00
|
|
|
{
|
|
|
|
if( *p < nMyOff )
|
|
|
|
{
|
|
|
|
// something is deleted
|
|
|
|
nMyOff = *p;
|
2001-12-12 11:32:30 +00:00
|
|
|
*(pIdx-1) = nNewVal++;
|
2001-02-23 13:17:56 +00:00
|
|
|
}
|
|
|
|
else if( *p > nMyOff )
|
|
|
|
{
|
|
|
|
for( ; *p > nMyOff; ++nMyOff )
|
2001-12-12 11:32:30 +00:00
|
|
|
*pIdx++ = nNewVal;
|
2001-02-23 13:17:56 +00:00
|
|
|
--nMyOff;
|
|
|
|
--n;
|
|
|
|
--p;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
*pIdx++ = nNewVal++;
|
|
|
|
}
|
|
|
|
|
|
|
|
// and then we need to save the attributes/bookmarks
|
|
|
|
// but this data must moved every time to the last in the chain!
|
|
|
|
_UndoTransliterate_Data* pD = pData;
|
|
|
|
while( pD != pNew )
|
|
|
|
{
|
|
|
|
if( pD->nNdIdx == pNew->nNdIdx && pD->pHistory )
|
|
|
|
{
|
|
|
|
// same node and have a history?
|
|
|
|
pNew->pHistory = pD->pHistory;
|
|
|
|
pD->pHistory = 0;
|
|
|
|
break; // more can't exist
|
|
|
|
}
|
|
|
|
pD = pD->pNext;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( !pNew->pHistory )
|
|
|
|
{
|
|
|
|
pNew->pHistory = new SwHistory;
|
|
|
|
SwRegHistory aRHst( rTNd, pNew->pHistory );
|
|
|
|
pNew->pHistory->CopyAttr( rTNd.GetpSwpHints(),
|
|
|
|
pNew->nNdIdx, 0, rTNd.GetTxt().Len(), FALSE );
|
|
|
|
}
|
|
|
|
break;
|
2000-12-21 08:32:45 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void _UndoTransliterate_Data::SetChangeAtNode( SwDoc& rDoc )
|
|
|
|
{
|
|
|
|
SwTxtNode* pTNd = rDoc.GetNodes()[ nNdIdx ]->GetTxtNode();
|
|
|
|
if( pTNd )
|
|
|
|
{
|
2001-12-12 11:32:30 +00:00
|
|
|
Sequence <long> aOffsets( pOffsets ? pOffsets->getLength() : nLen );
|
2001-02-23 13:17:56 +00:00
|
|
|
if( pOffsets )
|
|
|
|
aOffsets = *pOffsets;
|
2000-12-21 08:32:45 +00:00
|
|
|
else
|
|
|
|
{
|
2001-02-23 13:17:56 +00:00
|
|
|
long* p = aOffsets.getArray();
|
2001-12-12 11:32:30 +00:00
|
|
|
for( xub_StrLen n = 0; n < nLen; ++n, ++p )
|
2001-02-27 15:53:28 +00:00
|
|
|
*p = n + nStart;
|
2001-02-23 13:17:56 +00:00
|
|
|
}
|
2001-12-12 11:32:30 +00:00
|
|
|
pTNd->ReplaceTextOnly( nStart, nLen, sText, aOffsets );
|
2001-02-23 13:17:56 +00:00
|
|
|
|
|
|
|
if( pHistory )
|
|
|
|
{
|
|
|
|
if( pTNd->GetpSwpHints() )
|
2001-06-08 12:27:50 +00:00
|
|
|
pTNd->ClearSwpHintsArr( FALSE, FALSE );
|
2001-02-23 13:17:56 +00:00
|
|
|
pHistory->TmpRollback( &rDoc, 0, FALSE );
|
|
|
|
pHistory->SetTmpEnd( pHistory->Count() );
|
2000-12-21 08:32:45 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|