/* -*- 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 <DocumentContentOperationsManager.hxx>
#include <DocumentRedlineManager.hxx>
#include <wrtsh.hxx>
#include <doc.hxx>
#include <IDocumentUndoRedo.hxx>
#include <IDocumentMarkAccess.hxx>
#include <IDocumentState.hxx>
#include <IDocumentLayoutAccess.hxx>
#include <IDocumentRedlineAccess.hxx>
#include <IDocumentStylePoolAccess.hxx>
#include <IDocumentSettingAccess.hxx>
#include <UndoManager.hxx>
#include <docary.hxx>
#include <pamtyp.hxx>
#include <textboxhelper.hxx>
#include <dcontact.hxx>
#include <grfatr.hxx>
#include <numrule.hxx>
#include <charfmt.hxx>
#include <ndgrf.hxx>
#include <ndnotxt.hxx>
#include <ndole.hxx>
#include <breakit.hxx>
#include <frmfmt.hxx>
#include <fmtanchr.hxx>
#include <fmtcntnt.hxx>
#include <fmtinfmt.hxx>
#include <fmtpdsc.hxx>
#include <fmtcnct.hxx>
#include <SwStyleNameMapper.hxx>
#include <redline.hxx>
#include <txtfrm.hxx>
#include <rootfrm.hxx>
#include <frmtool.hxx>
#include <unocrsr.hxx>
#include <mvsave.hxx>
#include <ndtxt.hxx>
#include <poolfmt.hxx>
#include <paratr.hxx>
#include <txatbase.hxx>
#include <UndoRedline.hxx>
#include <undobj.hxx>
#include <UndoBookmark.hxx>
#include <UndoDelete.hxx>
#include <UndoSplitMove.hxx>
#include <UndoOverwrite.hxx>
#include <UndoInsert.hxx>
#include <UndoAttribute.hxx>
#include <rolbck.hxx>
#include <acorrect.hxx>
#include <bookmark.hxx>
#include <ftnidx.hxx>
#include <txtftn.hxx>
#include <hints.hxx>
#include <fmtflcnt.hxx>
#include <docedt.hxx>
#include <frameformats.hxx>
#include <annotationmark.hxx>
#include <formatflysplit.hxx>
#include <istyleaccess.hxx>
#include <o3tl/safeint.hxx>
#include <sal/log.hxx>
#include <unotools/charclass.hxx>
#include <unotools/configmgr.hxx>
#include <unotools/transliterationwrapper.hxx>
#include <i18nutil/transliteration.hxx>
#include <sfx2/Metadatable.hxx>
#include <sot/exchange.hxx>
#include <svl/stritem.hxx>
#include <svl/itemiter.hxx>
#include <svx/svdobj.hxx>
#include <svx/svdouno.hxx>
#include <tools/globname.hxx>
#include <editeng/formatbreakitem.hxx>
#include <com/sun/star/i18n/Boundary.hpp>
#include <com/sun/star/i18n/WordType.hpp>
#include <com/sun/star/i18n/XBreakIterator.hpp>
#include <com/sun/star/embed/XEmbeddedObject.hpp>
#include <tuple>
#include <memory>
#include <optional>
using namespace ::com::sun::star::i18n;
namespace
{
// Copy method from SwDoc
// Prevent copying into Flys that are anchored in the range
bool lcl_ChkFlyFly( SwDoc& rDoc, SwNodeOffset nSttNd, SwNodeOffset nEndNd,
SwNodeOffset nInsNd )
{
for(sw::SpzFrameFormat* pFormat: *rDoc.GetSpzFrameFormats())
{
SwFormatAnchor const*const pAnchor = &pFormat->GetAnchor();
SwNode const*const pAnchorNode = pAnchor->GetAnchorNode();
if (pAnchorNode &&
((RndStdIds::FLY_AS_CHAR == pAnchor->GetAnchorId()) ||
(RndStdIds::FLY_AT_CHAR == pAnchor->GetAnchorId()) ||
(RndStdIds::FLY_AT_FLY == pAnchor->GetAnchorId()) ||
(RndStdIds::FLY_AT_PARA == pAnchor->GetAnchorId())) &&
nSttNd <= pAnchorNode->GetIndex() &&
pAnchorNode->GetIndex() < nEndNd )
{
const SwFormatContent& rContent = pFormat->GetContent();
SwStartNode* pSNd;
if( !rContent.GetContentIdx() ||
nullptr == ( pSNd = rContent.GetContentIdx()->GetNode().GetStartNode() ))
continue;
if( pSNd->GetIndex() < nInsNd &&
nInsNd < pSNd->EndOfSectionIndex() )
// Do not copy !
return true;
if( lcl_ChkFlyFly( rDoc, pSNd->GetIndex(),
pSNd->EndOfSectionIndex(), nInsNd ) )
// Do not copy !
return true;
}
}
return false;
}
SwNodeIndex InitDelCount(SwPaM const& rSourcePaM, SwNodeOffset & rDelCount)
{
SwPosition const& rStart(*rSourcePaM.Start());
// Special handling for SwDoc::AppendDoc
if (rSourcePaM.GetDoc().GetNodes().GetEndOfExtras().GetIndex() + 1
== rStart.GetNodeIndex())
{
rDelCount = SwNodeOffset(1);
return SwNodeIndex(rStart.GetNode(), +1);
}
else
{
rDelCount = SwNodeOffset(0);
return SwNodeIndex(rStart.GetNode());
}
}
/*
The CopyBookmarks function has to copy bookmarks from the source to the destination nodes
array. It is called after a call of the CopyNodes(..) function. But this function does not copy
every node (at least at the moment: 2/08/2006 ), section start and end nodes will not be copied
if the corresponding end/start node is outside the copied pam.
The lcl_NonCopyCount function counts the number of these nodes, given the copied pam and a node
index inside the pam.
rPam is the original source pam, rLastIdx is the last calculated position, rDelCount the number
of "non-copy" nodes between rPam.Start() and rLastIdx.
nNewIdx is the new position of interest.
*/
void lcl_NonCopyCount( const SwPaM& rPam, SwNodeIndex& rLastIdx, const SwNodeOffset nNewIdx, SwNodeOffset& rDelCount )
{
SwNodeOffset nStart = rPam.Start()->GetNodeIndex();
SwNodeOffset nEnd = rPam.End()->GetNodeIndex();
if( rLastIdx.GetIndex() < nNewIdx ) // Moving forward?
{
// We never copy the StartOfContent node
do // count "non-copy" nodes
{
SwNode& rNode = rLastIdx.GetNode();
if( ( rNode.IsSectionNode() && rNode.EndOfSectionIndex() >= nEnd )
|| ( rNode.IsEndNode() && rNode.StartOfSectionNode()->GetIndex() < nStart ) )
{
++rDelCount;
}
++rLastIdx;
}
while( rLastIdx.GetIndex() < nNewIdx );
}
else if( rDelCount ) // optimization: if there are no "non-copy" nodes until now,
// no move backward needed
{
while( rLastIdx.GetIndex() > nNewIdx )
{
SwNode& rNode = rLastIdx.GetNode();
if( ( rNode.IsSectionNode() && rNode.EndOfSectionIndex() >= nEnd )
|| ( rNode.IsEndNode() && rNode.StartOfSectionNode()->GetIndex() < nStart ) )
{
--rDelCount;
}
--rLastIdx;
}
}
}
void lcl_SetCpyPos( const SwPosition& rOrigPos,
const SwPosition& rOrigStt,
const SwPosition& rCpyStt,
SwPosition& rChgPos,
SwNodeOffset nDelCount )
{
SwNodeOffset nNdOff = rOrigPos.GetNodeIndex();
nNdOff -= rOrigStt.GetNodeIndex();
nNdOff -= nDelCount;
sal_Int32 nContentPos = rOrigPos.GetContentIndex();
// Always adjust <nNode> at to be changed <SwPosition> instance <rChgPos>
rChgPos.Assign( nNdOff + rCpyStt.GetNodeIndex() );
if (!rChgPos.GetNode().GetContentNode())
return;
if( !nNdOff )
{
// just adapt the content index
if( nContentPos > rOrigStt.GetContentIndex() )
nContentPos -= rOrigStt.GetContentIndex();
else
nContentPos = 0;
nContentPos += rCpyStt.GetContentIndex();
}
rChgPos.SetContent( nContentPos );
}
}
namespace sw
{
// TODO: use SaveBookmark (from DelBookmarks)
void CopyBookmarks(const SwPaM& rPam, const SwPosition& rCpyPam, SwCopyFlags flags)
{
const SwDoc& rSrcDoc = rPam.GetDoc();
SwDoc& rDestDoc = rCpyPam.GetDoc();
const IDocumentMarkAccess* const pSrcMarkAccess = rSrcDoc.getIDocumentMarkAccess();
::sw::UndoGuard const undoGuard(rDestDoc.GetIDocumentUndoRedo());
const SwPosition &rStt = *rPam.Start(), &rEnd = *rPam.End();
SwPosition const*const pCpyStt = &rCpyPam;
std::vector< const ::sw::mark::MarkBase* > vMarksToCopy;
for ( auto ppMark = pSrcMarkAccess->getAllMarksBegin();
ppMark != pSrcMarkAccess->getAllMarksEnd();
++ppMark )
{
const ::sw::mark::MarkBase* const pMark = *ppMark;
auto [/*const SwPosition&*/ rMarkStart, rMarkEnd] = pMark->GetMarkStartEnd();
// only include marks that are in the range and not touching both start and end
// - not for annotation or checkbox marks.
bool const isIncludeStart(
(rStt.GetContentIndex() == 0 // paragraph start selected?
// also: only if inserting at the start - cross reference
// marks require index to be 0, and there could be one
// on the target node already
&& rCpyPam.GetContentIndex() == 0)
|| rMarkStart != rStt);
bool const isIncludeEnd(
(rEnd.GetNode().IsTextNode() // paragraph end selected?
&& rEnd.GetContentIndex() == rEnd.GetNode().GetTextNode()->Len())
|| rMarkEnd != rEnd);
const bool bIsNotOnBoundary =
pMark->IsExpanded()
? (isIncludeStart || isIncludeEnd) // rMarkStart != rMarkEnd
: (isIncludeStart && isIncludeEnd); // rMarkStart == rMarkEnd
const IDocumentMarkAccess::MarkType aMarkType = IDocumentMarkAccess::GetType(*pMark);
if ( rMarkStart >= rStt && rMarkEnd <= rEnd
&& ( bIsNotOnBoundary
|| aMarkType == IDocumentMarkAccess::MarkType::ANNOTATIONMARK
|| aMarkType == IDocumentMarkAccess::MarkType::TEXT_FIELDMARK
|| aMarkType == IDocumentMarkAccess::MarkType::CHECKBOX_FIELDMARK
|| aMarkType == IDocumentMarkAccess::MarkType::DROPDOWN_FIELDMARK
|| aMarkType == IDocumentMarkAccess::MarkType::DATE_FIELDMARK))
{
vMarksToCopy.push_back(pMark);
}
}
// We have to count the "non-copied" nodes...
SwNodeOffset nDelCount;
SwNodeIndex aCorrIdx(InitDelCount(rPam, nDelCount));
for(const sw::mark::MarkBase* const pMark : vMarksToCopy)
{
SwPaM aTmpPam(*pCpyStt);
lcl_NonCopyCount(rPam, aCorrIdx, pMark->GetMarkPos().GetNodeIndex(), nDelCount);
lcl_SetCpyPos( pMark->GetMarkPos(), rStt, *pCpyStt, *aTmpPam.GetPoint(), nDelCount);
if(pMark->IsExpanded())
{
aTmpPam.SetMark();
lcl_NonCopyCount(rPam, aCorrIdx, pMark->GetOtherMarkPos().GetNodeIndex(), nDelCount);
lcl_SetCpyPos(pMark->GetOtherMarkPos(), rStt, *pCpyStt, *aTmpPam.GetMark(), nDelCount);
}
SwMarkName sRequestedName = pMark->GetName();
if (flags & SwCopyFlags::IsMoveToFly)
{
assert(&rSrcDoc == &rDestDoc);
// Ensure the name can be given to NewMark, since this is ultimately a move
auto pSoonToBeDeletedMark = const_cast<sw::mark::MarkBase*>(pMark);
rDestDoc.getIDocumentMarkAccess()->renameMark(pSoonToBeDeletedMark,
SwMarkName(sRequestedName.toString() + "COPY_IS_MOVE"));
}
::sw::mark::MarkBase* const pNewMark = rDestDoc.getIDocumentMarkAccess()->makeMark(
aTmpPam,
sRequestedName,
IDocumentMarkAccess::GetType(*pMark),
::sw::mark::InsertMode::CopyText);
// Explicitly try to get exactly the same name as in the source
// because NavigatorReminders, DdeBookmarks etc. ignore the proposed name
if (pNewMark == nullptr)
{
assert(IDocumentMarkAccess::GetType(*pMark) == IDocumentMarkAccess::MarkType::CROSSREF_NUMITEM_BOOKMARK
|| IDocumentMarkAccess::GetType(*pMark) == IDocumentMarkAccess::MarkType::CROSSREF_HEADING_BOOKMARK);
continue; // can't insert duplicate cross reference mark
}
rDestDoc.getIDocumentMarkAccess()->renameMark(pNewMark, sRequestedName);
// copying additional attributes for bookmarks or fieldmarks
::sw::mark::Bookmark* const pNewBookmark =
dynamic_cast< ::sw::mark::Bookmark* const >(pNewMark);
const ::sw::mark::Bookmark* const pOldBookmark =
dynamic_cast< const ::sw::mark::Bookmark* >(pMark);
if (pNewBookmark && pOldBookmark)
{
pNewBookmark->SetKeyCode(pOldBookmark->GetKeyCode());
pNewBookmark->SetShortName(pOldBookmark->GetShortName());
pNewBookmark->Hide(pOldBookmark->IsHidden());
pNewBookmark->SetHideCondition(pOldBookmark->GetHideCondition());
}
::sw::mark::Fieldmark* const pNewFieldmark =
dynamic_cast< ::sw::mark::Fieldmark* const >(pNewMark);
const ::sw::mark::Fieldmark* const pOldFieldmark =
dynamic_cast< const ::sw::mark::Fieldmark* >(pMark);
if (pNewFieldmark && pOldFieldmark)
{
pNewFieldmark->SetFieldname(pOldFieldmark->GetFieldname());
pNewFieldmark->SetFieldHelptext(pOldFieldmark->GetFieldHelptext());
::sw::mark::Fieldmark::parameter_map_t* pNewParams = pNewFieldmark->GetParameters();
const ::sw::mark::Fieldmark::parameter_map_t* pOldParams = pOldFieldmark->GetParameters();
for (const auto& rEntry : *pOldParams )
{
pNewParams->insert( rEntry );
}
}
::sfx2::Metadatable const*const pMetadatable(
dynamic_cast< ::sfx2::Metadatable const* >(pMark));
::sfx2::Metadatable *const pNewMetadatable(
dynamic_cast< ::sfx2::Metadatable * >(pNewMark));
if (pMetadatable && pNewMetadatable)
{
pNewMetadatable->RegisterAsCopyOf(*pMetadatable);
}
}
}
} // namespace sw
namespace
{
void lcl_DeleteRedlines( const SwPaM& rPam, SwPaM& rCpyPam )
{
const SwDoc& rSrcDoc = rPam.GetDoc();
const SwRedlineTable& rTable = rSrcDoc.getIDocumentRedlineAccess().GetRedlineTable();
if( rTable.empty() )
return;
SwDoc& rDestDoc = rCpyPam.GetDoc();
SwPosition* pCpyStt = rCpyPam.Start(), *pCpyEnd = rCpyPam.End();
std::unique_ptr<SwPaM> pDelPam;
auto [pStart, pEnd] = rPam.StartEnd(); // SwPosition*
// We have to count the "non-copied" nodes
SwNodeOffset nDelCount;
SwNodeIndex aCorrIdx(InitDelCount(rPam, nDelCount));
SwRedlineTable::size_type n = 0;
rSrcDoc.getIDocumentRedlineAccess().GetRedline( *pStart, &n );
for( ; n < rTable.size(); ++n )
{
const SwRangeRedline* pRedl = rTable[ n ];
if( RedlineType::Delete == pRedl->GetType() && pRedl->IsVisible() )
{
auto [pRStt, pREnd] = pRedl->StartEnd(); // SwPosition*
SwComparePosition eCmpPos = ComparePosition( *pStart, *pEnd, *pRStt, *pREnd );
switch( eCmpPos )
{
case SwComparePosition::CollideEnd:
case SwComparePosition::Before:
// Pos1 is before Pos2
break;
case SwComparePosition::CollideStart:
case SwComparePosition::Behind:
// Pos1 is after Pos2
n = rTable.size();
break;
default:
{
pDelPam.reset(new SwPaM( *pCpyStt, pDelPam.release() ));
if( *pStart < *pRStt )
{
lcl_NonCopyCount( rPam, aCorrIdx, pRStt->GetNodeIndex(), nDelCount );
lcl_SetCpyPos( *pRStt, *pStart, *pCpyStt,
*pDelPam->GetPoint(), nDelCount );
}
pDelPam->SetMark();
if( *pEnd < *pREnd )
*pDelPam->GetPoint() = *pCpyEnd;
else
{
lcl_NonCopyCount( rPam, aCorrIdx, pREnd->GetNodeIndex(), nDelCount );
lcl_SetCpyPos( *pREnd, *pStart, *pCpyStt,
*pDelPam->GetPoint(), nDelCount );
}
if (pDelPam->GetNext() != pDelPam.get()
&& *pDelPam->GetNext()->End() == *pDelPam->Start())
{
*pDelPam->GetNext()->End() = *pDelPam->End();
pDelPam.reset(pDelPam->GetNext());
}
}
}
}
}
if( !pDelPam )
return;
RedlineFlags eOld = rDestDoc.getIDocumentRedlineAccess().GetRedlineFlags();
rDestDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( eOld | RedlineFlags::Ignore );
::sw::UndoGuard const undoGuard(rDestDoc.GetIDocumentUndoRedo());
// At this point, pDelPam points to the last of maybe several disjoint selections, organized
// in reverse order in document (so every GetNext() returns a PaM closer to document start,
// until wrap to pDelPam). Removal of the selections must be from last in document to first,
// to avoid situations when another PaM in chain points into the node that will be destroyed
// (joined to previous) by removal of the currently processed PaM.
do {
rDestDoc.getIDocumentContentOperations().DeleteAndJoin(*pDelPam);
if( !pDelPam->IsMultiSelection() )
break;
pDelPam.reset(pDelPam->GetNext());
} while( true );
rDestDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( eOld );
}
void lcl_DeleteRedlines( const SwNodeRange& rRg, SwNodeRange const & rCpyRg )
{
SwDoc& rSrcDoc = rRg.aStart.GetNode().GetDoc();
if( !rSrcDoc.getIDocumentRedlineAccess().GetRedlineTable().empty() )
{
SwPaM aRgTmp( rRg.aStart, rRg.aEnd );
SwPaM aCpyTmp( rCpyRg.aStart, rCpyRg.aEnd );
lcl_DeleteRedlines( aRgTmp, aCpyTmp );
}
}
void lcl_ChainFormats( SwFlyFrameFormat *pSrc, SwFlyFrameFormat *pDest )
{
SwFormatChain aSrc( pSrc->GetChain() );
if ( !aSrc.GetNext() )
{
aSrc.SetNext( pDest );
pSrc->SetFormatAttr( aSrc );
}
SwFormatChain aDest( pDest->GetChain() );
if ( !aDest.GetPrev() )
{
aDest.SetPrev( pSrc );
pDest->SetFormatAttr( aDest );
}
}
// #i86492#
bool lcl_ShouldKeepSourceList( const SwPaM& rPam )
{
const SwTextNode* pTextNd = rPam.Start()->GetNode().GetTextNode();
const SwTextNode* pEndTextNd = rPam.End()->GetNode().GetTextNode();
if (pTextNd == nullptr || pEndTextNd == nullptr)
return false;
bool bRet = pTextNd->IsInListFromStyle();
//single paragraphs are preferred only if it's a has a list from style
if (pTextNd == pEndTextNd)
return bRet;
if (pTextNd && pTextNd->IsInList() && !pTextNd->IsInListFromStyle() &&
pEndTextNd && pEndTextNd->IsInList() && !pEndTextNd->IsInListFromStyle())
{
bRet = false;
SwNodeIndex aIdx(rPam.Start()->GetNode());
do
{
++aIdx;
pTextNd = aIdx.GetNode().GetTextNode();
if (!pTextNd || !pTextNd->IsInList() || pTextNd->IsInListFromStyle())
{
bRet = true;
break;
}
} while (pTextNd != pEndTextNd);
}
return bRet;
}
bool lcl_MarksWholeNode(const SwPaM & rPam)
{
bool bResult = false;
auto [pStart, pEnd] = rPam.StartEnd(); // SwPosition*
if (nullptr != pStart && nullptr != pEnd)
{
const SwTextNode* pSttNd = pStart->GetNode().GetTextNode();
const SwTextNode* pEndNd = pEnd->GetNode().GetTextNode();
if (nullptr != pSttNd && nullptr != pEndNd &&
pStart->GetContentIndex() == 0 &&
pEnd->GetContentIndex() == pEndNd->Len())
{
bResult = true;
}
}
return bResult;
}
}
//local functions originally from sw/source/core/doc/docedt.cxx
namespace sw
{
void CalcBreaks(std::vector<std::pair<SwNodeOffset, sal_Int32>> & rBreaks,
SwPaM const & rPam, bool const isOnlyFieldmarks)
{
SwNodeOffset const nStartNode(rPam.Start()->GetNodeIndex());
SwNodeOffset const nEndNode(rPam.End()->GetNodeIndex());
SwNodes const& rNodes(rPam.GetPoint()->GetNodes());
IDocumentMarkAccess const& rIDMA(*rPam.GetDoc().getIDocumentMarkAccess());
std::stack<std::tuple<sw::mark::Fieldmark const*, bool, SwNodeOffset, sal_Int32>> startedFields;
for (SwNodeOffset n = nStartNode; n <= nEndNode; ++n)
{
SwNode *const pNode(rNodes[n]);
if (pNode->IsTextNode())
{
SwTextNode & rTextNode(*pNode->GetTextNode());
sal_Int32 const nStart(n == nStartNode
? rPam.Start()->GetContentIndex()
: 0);
sal_Int32 const nEnd(n == nEndNode
? rPam.End()->GetContentIndex()
: rTextNode.Len());
for (sal_Int32 i = nStart; i < nEnd; ++i)
{
const sal_Unicode c(rTextNode.GetText()[i]);
switch (c)
{
// note: CH_TXT_ATR_FORMELEMENT does not need handling
// not sure how CH_TXT_ATR_INPUTFIELDSTART/END are currently handled
case CH_TXTATR_INWORD:
case CH_TXTATR_BREAKWORD:
{
// META hints only have dummy char at the start, not
// at the end, so no need to check in nStartNode
if (n == nEndNode && !isOnlyFieldmarks)
{
SwTextAttr const* pAttr(rTextNode.GetTextAttrForCharAt(i));
if (pAttr && pAttr->End() && (nEnd < *pAttr->End()))
{
assert(pAttr->HasDummyChar());
rBreaks.emplace_back(n, i);
}
if (!pAttr)
{
// See if this is an end dummy character for a content control.
pAttr = rTextNode.GetTextAttrForEndCharAt(i, RES_TXTATR_CONTENTCONTROL);
if (pAttr && (nStart > pAttr->GetStart()))
{
rBreaks.emplace_back(n, i);
}
}
}
break;
}
case CH_TXT_ATR_FIELDSTART:
{
auto const pFieldMark(rIDMA.getFieldmarkAt(SwPosition(rTextNode, i)));
startedFields.emplace(pFieldMark, false, 0, 0);
break;
}
case CH_TXT_ATR_FIELDSEP:
{
if (startedFields.empty())
{
rBreaks.emplace_back(n, i);
}
else
{ // no way to find the field via MarkManager...
assert(std::get<0>(startedFields.top())->IsCoveringPosition(SwPosition(rTextNode, i)));
std::get<1>(startedFields.top()) = true;
std::get<2>(startedFields.top()) = n;
std::get<3>(startedFields.top()) = i;
}
break;
}
case CH_TXT_ATR_FIELDEND:
{
if (startedFields.empty())
{
rBreaks.emplace_back(n, i);
}
else
{ // fieldmarks must not overlap => stack
assert(std::get<0>(startedFields.top()) == rIDMA.getFieldmarkAt(SwPosition(rTextNode, i)));
startedFields.pop();
}
break;
}
}
}
}
else if (pNode->IsStartNode())
{
if (pNode->EndOfSectionIndex() <= nEndNode)
{ // fieldmark cannot overlap node section
n = pNode->EndOfSectionIndex();
}
}
else
{ // EndNode can actually happen with sections :(
assert(pNode->IsEndNode() || pNode->IsNoTextNode());
}
}
while (!startedFields.empty())
{
if (const sw::mark::Fieldmark* pMark = std::get<0>(startedFields.top()))
{
SwPosition const& rStart(pMark->GetMarkStart());
std::pair<SwNodeOffset, sal_Int32> const pos(
rStart.GetNodeIndex(), rStart.GetContentIndex());
auto it = std::lower_bound(rBreaks.begin(), rBreaks.end(), pos);
assert(it == rBreaks.end() || *it != pos);
rBreaks.insert(it, pos);
}
if (std::get<1>(startedFields.top()))
{
std::pair<SwNodeOffset, sal_Int32> const posSep(
std::get<2>(startedFields.top()),
std::get<3>(startedFields.top()));
auto it = std::lower_bound(rBreaks.begin(), rBreaks.end(), posSep);
assert(it == rBreaks.end() || *it != posSep);
rBreaks.insert(it, posSep);
}
startedFields.pop();
}
}
}
namespace
{
bool lcl_DoWithBreaks(::sw::DocumentContentOperationsManager & rDocumentContentOperations,
SwPaM & rPam, SwDeleteFlags const flags,
bool (::sw::DocumentContentOperationsManager::*pFunc)(SwPaM&, SwDeleteFlags))
{
std::vector<std::pair<SwNodeOffset, sal_Int32>> Breaks;
sw::CalcBreaks(Breaks, rPam);
if (Breaks.empty())
{
return (rDocumentContentOperations.*pFunc)(rPam, flags);
}
// Deletion must be split into several parts if the text node
// contains a text attribute with end and with dummy character
// and the selection does not contain the text attribute completely,
// but overlaps its start (left), where the dummy character is.
SwPosition const & rSelectionEnd( *rPam.End() );
bool bRet( true );
// iterate from end to start, to avoid invalidating the offsets!
auto iter( Breaks.rbegin() );
SwNodeOffset nOffset(0);
SwNodes const& rNodes(rPam.GetPoint()->GetNodes());
SwPaM aPam( rSelectionEnd, rSelectionEnd ); // end node!
SwPosition & rEnd( *aPam.End() );
SwPosition & rStart( *aPam.Start() );
while (iter != Breaks.rend())
{
rStart.Assign(*rNodes[iter->first - nOffset]->GetTextNode(), iter->second + 1);
if (rStart < rEnd) // check if part is empty
{
bRet &= (rDocumentContentOperations.*pFunc)(aPam, flags);
nOffset = iter->first - rStart.GetNodeIndex(); // deleted fly nodes...
}
rEnd.Assign(*rNodes[iter->first - nOffset]->GetTextNode(), iter->second);
++iter;
}
rStart = *rPam.Start(); // set to original start
if (rStart < rEnd) // check if part is empty
{
bRet &= (rDocumentContentOperations.*pFunc)(aPam, flags);
}
return bRet;
}
bool lcl_StrLenOverflow( const SwPaM& rPam )
{
// If we try to merge two paragraphs we have to test if afterwards
// the string doesn't exceed the allowed string length
if( rPam.GetPoint()->GetNode() != rPam.GetMark()->GetNode() )
{
auto [pStart, pEnd] = rPam.StartEnd(); // SwPosition*
const SwTextNode* pEndNd = pEnd->GetNode().GetTextNode();
if( (nullptr != pEndNd) && pStart->GetNode().IsTextNode() )
{
const sal_uInt64 nSum = pStart->GetContentIndex() +
pEndNd->GetText().getLength() - pEnd->GetContentIndex();
return nSum > o3tl::make_unsigned(SAL_MAX_INT32);
}
}
return false;
}
struct SaveRedline
{
SwRangeRedline* pRedl;
SwNodeOffset nStt, nEnd;
sal_Int32 nSttCnt;
sal_Int32 nEndCnt;
SaveRedline( SwRangeRedline* pR, const SwNodeIndex& rSttIdx )
: pRedl(pR)
, nEnd(0)
, nEndCnt(0)
{
auto [pStart, pEnd] = pR->StartEnd(); // SwPosition*
SwNodeOffset nSttIdx = rSttIdx.GetIndex();
nStt = pStart->GetNodeIndex() - nSttIdx;
nSttCnt = pStart->GetContentIndex();
if( pR->HasMark() )
{
nEnd = pEnd->GetNodeIndex() - nSttIdx;
nEndCnt = pEnd->GetContentIndex();
}
pRedl->GetPoint()->Assign( SwNodeOffset(0) );
pRedl->GetMark()->Assign( SwNodeOffset(0) );
}
SaveRedline( SwRangeRedline* pR, const SwPosition& rPos )
: pRedl(pR)
, nEnd(0)
, nEndCnt(0)
{
auto [pStart, pEnd] = pR->StartEnd(); // SwPosition*
SwNodeOffset nSttIdx = rPos.GetNodeIndex();
nStt = pStart->GetNodeIndex() - nSttIdx;
nSttCnt = pStart->GetContentIndex();
if( nStt == SwNodeOffset(0) )
nSttCnt = nSttCnt - rPos.GetContentIndex();
if( pR->HasMark() )
{
nEnd = pEnd->GetNodeIndex() - nSttIdx;
nEndCnt = pEnd->GetContentIndex();
if( nEnd == SwNodeOffset(0) )
nEndCnt = nEndCnt - rPos.GetContentIndex();
}
pRedl->GetPoint()->Assign( SwNodeOffset(0) );
pRedl->GetMark()->Assign( SwNodeOffset(0) );
}
void SetPos( SwNodeOffset nInsPos )
{
pRedl->GetPoint()->Assign( nInsPos + nStt, nSttCnt );
if( pRedl->HasMark() )
{
pRedl->GetMark()->Assign( nInsPos + nEnd, nEndCnt );
}
}
void SetPos( const SwPosition& aPos )
{
pRedl->GetPoint()->Assign( aPos.GetNodeIndex() + nStt,
nSttCnt + ( nStt == SwNodeOffset(0) ? aPos.GetContentIndex() : 0 ) );
if( pRedl->HasMark() )
{
pRedl->GetMark()->Assign( aPos.GetNodeIndex() + nEnd,
nEndCnt + ( nEnd == SwNodeOffset(0) ? aPos.GetContentIndex() : 0 ) );
}
}
};
typedef std::vector< SaveRedline > SaveRedlines_t;
void lcl_SaveRedlines(const SwPaM& aPam, SaveRedlines_t& rArr)
{
SwDoc& rDoc = aPam.GetPointNode().GetDoc();
auto [pStart, pEnd] = aPam.StartEnd(); // SwPosition*
// get first relevant redline
SwRedlineTable::size_type nCurrentRedline;
rDoc.getIDocumentRedlineAccess().GetRedline( *pStart, &nCurrentRedline );
if( nCurrentRedline > 0)
nCurrentRedline--;
// redline mode RedlineFlags::Ignore|RedlineFlags::On; save old mode
RedlineFlags eOld = rDoc.getIDocumentRedlineAccess().GetRedlineFlags();
rDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( ( eOld & ~RedlineFlags::Ignore) | RedlineFlags::On );
// iterate over relevant redlines and decide for each whether it should
// be saved, or split + saved
SwRedlineTable& rRedlineTable = rDoc.getIDocumentRedlineAccess().GetRedlineTable();
for( ; nCurrentRedline < rRedlineTable.size(); )
{
SwRangeRedline* pCurrent = rRedlineTable[ nCurrentRedline ];
SwComparePosition eCompare =
ComparePosition( *pCurrent->Start(), *pCurrent->End(),
*pStart, *pEnd);
// we must save this redline if it overlaps aPam
// (we may have to split it, too)
if( eCompare == SwComparePosition::OverlapBehind ||
eCompare == SwComparePosition::OverlapBefore ||
eCompare == SwComparePosition::Outside ||
eCompare == SwComparePosition::Inside ||
eCompare == SwComparePosition::Equal )
{
rRedlineTable.Remove( nCurrentRedline );
// split beginning, if necessary
if( eCompare == SwComparePosition::OverlapBefore ||
eCompare == SwComparePosition::Outside )
{
SwRangeRedline* pNewRedline = new SwRangeRedline( *pCurrent );
*pNewRedline->End() = *pStart;
*pCurrent->Start() = *pStart;
rDoc.getIDocumentRedlineAccess().AppendRedline( pNewRedline, true );
}
// split end, if necessary
if( eCompare == SwComparePosition::OverlapBehind ||
eCompare == SwComparePosition::Outside )
{
SwRangeRedline* pNewRedline = new SwRangeRedline( *pCurrent );
*pNewRedline->Start() = *pEnd;
*pCurrent->End() = *pEnd;
rDoc.getIDocumentRedlineAccess().AppendRedline( pNewRedline, true );
}
// save the current redline
rArr.emplace_back( pCurrent, *pStart );
}
else
nCurrentRedline++;
}
// restore old redline mode
rDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( eOld );
}
void lcl_RestoreRedlines(SwDoc& rDoc, const SwPosition& rPos, SaveRedlines_t& rArr)
{
RedlineFlags eOld = rDoc.getIDocumentRedlineAccess().GetRedlineFlags();
rDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( ( eOld & ~RedlineFlags::Ignore) | RedlineFlags::On );
for(SaveRedline & rSvRedLine : rArr)
{
rSvRedLine.SetPos( rPos );
rDoc.getIDocumentRedlineAccess().AppendRedline( rSvRedLine.pRedl, true );
}
rDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( eOld );
}
void lcl_SaveRedlines(const SwNodeRange& rRg, SaveRedlines_t& rArr)
{
SwDoc& rDoc = rRg.aStart.GetNode().GetDoc();
SwRedlineTable& rRedlTable = rDoc.getIDocumentRedlineAccess().GetRedlineTable();
SwRedlineTable::size_type nRedlPos;
SwPosition aSrchPos( rRg.aStart );
aSrchPos.Adjust(SwNodeOffset(-1));
if( rDoc.getIDocumentRedlineAccess().GetRedline( aSrchPos, &nRedlPos ) && nRedlPos )
--nRedlPos;
else if( nRedlPos >= rRedlTable.size() )
return ;
RedlineFlags eOld = rDoc.getIDocumentRedlineAccess().GetRedlineFlags();
rDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( ( eOld & ~RedlineFlags::Ignore) | RedlineFlags::On );
do {
SwRangeRedline* pTmp = rRedlTable[ nRedlPos ];
auto [pRStt, pREnd] = pTmp->StartEnd(); // SwPosition*
if( pRStt->GetNode() < rRg.aStart.GetNode() )
{
if( pREnd->GetNode() > rRg.aStart.GetNode() && pREnd->GetNode() < rRg.aEnd.GetNode() )
{
// Create a copy and set the end of the original to the end of the MoveArea.
// The copy is moved too.
SwRangeRedline* pNewRedl = new SwRangeRedline( *pTmp );
SwPosition* pTmpPos = pNewRedl->Start();
pTmpPos->Assign(rRg.aStart);
rArr.emplace_back(pNewRedl, rRg.aStart);
pTmpPos = pTmp->End();
pTmpPos->Assign(rRg.aEnd);
}
else if( pREnd->GetNode() == rRg.aStart.GetNode() )
{
SwPosition* pTmpPos = pTmp->End();
pTmpPos->Assign(rRg.aEnd);
}
++nRedlPos;
}
else if( pRStt->GetNode() < rRg.aEnd.GetNode() )
{
rRedlTable.Remove( nRedlPos );
if( pREnd->GetNode() < rRg.aEnd.GetNode() ||
( pREnd->GetNode() == rRg.aEnd.GetNode() && !pREnd->GetContentIndex()) )
{
// move everything
rArr.emplace_back( pTmp, rRg.aStart );
}
else
{
// split
SwRangeRedline* pNewRedl = new SwRangeRedline( *pTmp );
SwPosition* pTmpPos = pNewRedl->End();
pTmpPos->Assign(rRg.aEnd);
rArr.emplace_back( pNewRedl, rRg.aStart );
pTmpPos = pTmp->Start();
pTmpPos->Assign(rRg.aEnd);
rDoc.getIDocumentRedlineAccess().AppendRedline( pTmp, true );
}
}
else
break;
} while( nRedlPos < rRedlTable.size() );
rDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( eOld );
}
void lcl_RestoreRedlines(SwDoc& rDoc, SwNodeOffset const nInsPos, SaveRedlines_t& rArr)
{
RedlineFlags eOld = rDoc.getIDocumentRedlineAccess().GetRedlineFlags();
rDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( ( eOld & ~RedlineFlags::Ignore) | RedlineFlags::On );
for(SaveRedline & rSvRedLine : rArr)
{
rSvRedLine.SetPos( nInsPos );
IDocumentRedlineAccess::AppendResult const result(
rDoc.getIDocumentRedlineAccess().AppendRedline( rSvRedLine.pRedl, true ));
if ( IDocumentRedlineAccess::AppendResult::APPENDED == result &&
rSvRedLine.pRedl->GetType() == RedlineType::Delete )
{
UpdateFramesForAddDeleteRedline(rDoc, *rSvRedLine.pRedl);
}
}
rDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( eOld );
}
bool lcl_SaveFootnote( const SwNode& rSttNd, const SwNode& rEndNd,
const SwNode& rInsPos,
SwFootnoteIdxs& rFootnoteArr, SwFootnoteIdxs& rSaveArr,
std::optional<sal_Int32> oSttCnt = std::nullopt, std::optional<sal_Int32> oEndCnt = std::nullopt )
{
bool bUpdateFootnote = false;
const SwNodes& rNds = rInsPos.GetNodes();
const bool bDelFootnote = rInsPos.GetIndex() < rNds.GetEndOfAutotext().GetIndex() &&
rSttNd.GetIndex() >= rNds.GetEndOfAutotext().GetIndex();
const bool bSaveFootnote = !bDelFootnote &&
rInsPos.GetIndex() >= rNds.GetEndOfExtras().GetIndex();
if( !rFootnoteArr.empty() )
{
size_t nPos = 0;
rFootnoteArr.SeekEntry( rSttNd, &nPos );
SwTextFootnote* pSrch;
const SwNode* pFootnoteNd;
// Delete/save all that come after it
while( nPos < rFootnoteArr.size() && ( pFootnoteNd =
&( pSrch = rFootnoteArr[ nPos ] )->GetTextNode())->GetIndex()
<= rEndNd.GetIndex() )
{
const sal_Int32 nFootnoteSttIdx = pSrch->GetStart();
if( ( oEndCnt && oSttCnt )
? (( &rSttNd == pFootnoteNd &&
*oSttCnt > nFootnoteSttIdx) ||
( &rEndNd == pFootnoteNd &&
nFootnoteSttIdx >= *oEndCnt ))
: ( &rEndNd == pFootnoteNd ))
{
++nPos; // continue searching
}
else
{
// delete it
if( bDelFootnote )
{
SwTextNode& rTextNd = const_cast<SwTextNode&>(pSrch->GetTextNode());
SwContentIndex aIdx( &rTextNd, nFootnoteSttIdx );
rTextNd.EraseText( aIdx, 1 );
}
else
{
pSrch->DelFrames(nullptr);
rFootnoteArr.erase( rFootnoteArr.begin() + nPos );
if( bSaveFootnote )
rSaveArr.insert( pSrch );
}
bUpdateFootnote = true;
}
}
while (nPos > 0)
{
nPos--;
pSrch = rFootnoteArr[ nPos ];
pFootnoteNd = &pSrch->GetTextNode();
if (pFootnoteNd->GetIndex() < rSttNd.GetIndex())
break;
const sal_Int32 nFootnoteSttIdx = pSrch->GetStart();
if( !oEndCnt || !oSttCnt ||
! (( &rSttNd == pFootnoteNd &&
*oSttCnt > nFootnoteSttIdx ) ||
( &rEndNd == pFootnoteNd &&
nFootnoteSttIdx >= *oEndCnt )) )
{
if( bDelFootnote )
{
// delete it
SwTextNode& rTextNd = const_cast<SwTextNode&>(pSrch->GetTextNode());
SwContentIndex aIdx( &rTextNd, nFootnoteSttIdx );
rTextNd.EraseText( aIdx, 1 );
}
else
{
pSrch->DelFrames(nullptr);
rFootnoteArr.erase( rFootnoteArr.begin() + nPos );
if( bSaveFootnote )
rSaveArr.insert( pSrch );
}
bUpdateFootnote = true;
}
}
}
// When moving from redline section into document content section, e.g.
// after loading a document with (delete-)redlines, the footnote array
// has to be adjusted... (#i70572)
if( bSaveFootnote )
{
SwNodeIndex aIdx( rSttNd );
while( aIdx < rEndNd ) // Check the moved section
{
SwNode* pNode = &aIdx.GetNode();
if( pNode->IsTextNode() ) // Looking for text nodes...
{
SwpHints *pHints = pNode->GetTextNode()->GetpSwpHints();
if( pHints && pHints->HasFootnote() ) //...with footnotes
{
bUpdateFootnote = true; // Heureka
const size_t nCount = pHints->Count();
for( size_t i = 0; i < nCount; ++i )
{
SwTextAttr *pAttr = pHints->Get( i );
if ( pAttr->Which() == RES_TXTATR_FTN )
{
rSaveArr.insert( static_cast<SwTextFootnote*>(pAttr) );
}
}
}
}
++aIdx;
}
}
return bUpdateFootnote;
}
bool lcl_MayOverwrite( const SwTextNode *pNode, const sal_Int32 nPos )
{
sal_Unicode const cChr = pNode->GetText()[nPos];
switch (cChr)
{
case CH_TXTATR_BREAKWORD:
case CH_TXTATR_INWORD:
return !pNode->GetTextAttrForCharAt(nPos);// how could there be none?
case CH_TXT_ATR_INPUTFIELDSTART:
case CH_TXT_ATR_INPUTFIELDEND:
case CH_TXT_ATR_FIELDSTART:
case CH_TXT_ATR_FIELDSEP:
case CH_TXT_ATR_FIELDEND:
case CH_TXT_ATR_FORMELEMENT:
return false;
default:
return true;
}
}
void lcl_SkipAttr( const SwTextNode *pNode, SwPosition &rIdx, sal_Int32 &rStart )
{
if( !lcl_MayOverwrite( pNode, rStart ) )
{
// skip all special attributes
do {
rIdx.AdjustContent(+1);
rStart = rIdx.GetContentIndex();
} while (rStart < pNode->GetText().getLength()
&& !lcl_MayOverwrite(pNode, rStart) );
}
}
bool lcl_GetTokenToParaBreak( OUString& rStr, OUString& rRet, bool bRegExpRplc )
{
if( bRegExpRplc )
{
sal_Int32 nPos = 0;
static constexpr OUString sPara(u"\\n"_ustr);
for (;;)
{
nPos = rStr.indexOf( sPara, nPos );
if (nPos<0)
{
break;
}
// Has this been escaped?
if( nPos && '\\' == rStr[nPos-1])
{
++nPos;
if( nPos >= rStr.getLength() )
{
break;
}
}
else
{
rRet = rStr.copy( 0, nPos );
rStr = rStr.copy( nPos + sPara.getLength() );
return true;
}
}
}
rRet = rStr;
rStr.clear();
return false;
}
}
namespace //local functions originally from docfmt.cxx
{
bool lcl_ApplyOtherSet(
SwContentNode & rNode,
SwHistory *const pHistory,
SfxItemSet const& rOtherSet,
SfxItemSet const& rFirstSet,
SfxItemSet const& rPropsSet,
SwRootFrame const*const pLayout,
SwNodeIndex *const o_pIndex = nullptr)
{
assert(rOtherSet.Count());
bool ret(false);
SwTextNode *const pTNd = rNode.GetTextNode();
sw::MergedPara const* pMerged(nullptr);
if (pLayout && pLayout->HasMergedParas() && pTNd)
{
SwTextFrame const*const pTextFrame(static_cast<SwTextFrame const*>(
pTNd->getLayoutFrame(pLayout)));
if (pTextFrame)
{
pMerged = pTextFrame->GetMergedPara();
}
if (pMerged)
{
if (rFirstSet.Count())
{
if (pHistory)
{
SwRegHistory aRegH(pMerged->pFirstNode, *pMerged->pFirstNode, pHistory);
ret = pMerged->pFirstNode->SetAttr(rFirstSet);
}
else
{
ret = pMerged->pFirstNode->SetAttr(rFirstSet);
}
}
if (rPropsSet.Count())
{
if (pHistory)
{
SwRegHistory aRegH(pMerged->pParaPropsNode, *pMerged->pParaPropsNode, pHistory);
ret = pMerged->pParaPropsNode->SetAttr(rPropsSet) || ret;
}
else
{
ret = pMerged->pParaPropsNode->SetAttr(rPropsSet) || ret;
}
}
if (o_pIndex)
{
*o_pIndex = *pMerged->pLastNode; // skip hidden
}
}
}
// input cursor can't be on hidden node, and iteration skips them
assert(!pLayout || !pLayout->HasMergedParas()
|| rNode.GetRedlineMergeFlag() != SwNode::Merge::Hidden);
if (!pMerged)
{
if (pHistory)
{
SwRegHistory aRegH(&rNode, rNode, pHistory);
ret = rNode.SetAttr( rOtherSet );
}
else
{
ret = rNode.SetAttr( rOtherSet );
}
}
return ret;
}
#define DELETECHARSETS if ( bDelete ) { delete pCharSet; delete pOtherSet; }
// set format redline with extra data for lcl_InsAttr()
void lcl_SetRedline(
SwDoc& rDoc,
const SwPaM &rRg)
{
std::unique_ptr<SwRedlineExtraData_FormatColl> xExtra;
// check existing redline on the same range, and use its extra data, if it exists
SwRedlineTable::size_type nRedlPos = rDoc.getIDocumentRedlineAccess().GetRedlinePos(
rRg.Start()->GetNode(), RedlineType::Format );
if( SwRedlineTable::npos != nRedlPos )
{
const SwPosition *pRStt, *pREnd;
do {
SwRangeRedline* pTmp = rDoc.getIDocumentRedlineAccess().GetRedlineTable()[ nRedlPos ];
pRStt = pTmp->Start();
pREnd = pTmp->End();
SwComparePosition eCompare = ComparePosition( *rRg.Start(), *rRg.End(), *pRStt, *pREnd );
if ( eCompare == SwComparePosition::Inside || eCompare == SwComparePosition::Equal )
{
if (pTmp->GetExtraData())
{
const SwRedlineExtraData* pExtraData = pTmp->GetExtraData();
const SwRedlineExtraData_FormatColl* pFormattingChanges =
dynamic_cast<const SwRedlineExtraData_FormatColl*>(pExtraData);
// Check if the extra data is of type 'formatting changes'
if (pFormattingChanges)
{
// Get the item set that holds all the changes properties
std::shared_ptr<SfxItemSet> pChangesSet = pFormattingChanges->GetItemSet();
xExtra.reset(new SwRedlineExtraData_FormatColl(UIName(u""_ustr), USHRT_MAX, pChangesSet));
break;
}
}
}
} while( pRStt <= rRg.Start() && ++nRedlPos < rDoc.getIDocumentRedlineAccess().GetRedlineTable().size());
}
SwRangeRedline * pRedline = new SwRangeRedline( RedlineType::Format, rRg );
auto const result(rDoc.getIDocumentRedlineAccess().AppendRedline( pRedline, true));
// store original text attributes to reject formatting change
if (IDocumentRedlineAccess::AppendResult::IGNORED == result)
return;
// no existing format redline in the range
if (!xExtra)
{
// Apply the first character's attributes to the ReplaceText
SfxItemSet aSet(SfxItemSet::makeFixedSfxItemSet<RES_CHRATR_BEGIN, RES_TXTATR_WITHEND_END - 1,
RES_UNKNOWNATR_BEGIN, RES_UNKNOWNATR_END-1>(rDoc.GetAttrPool()));
SwTextNode * pNode = rRg.Start()->GetNode().GetTextNode();
// bGetFromChrFormat would be true by default and we want no expansion of the character
// style to direct formatting for redline purposes.
pNode->GetParaAttr(aSet, rRg.Start()->GetContentIndex() + 1,
rRg.End()->GetContentIndex(), /*bOnlyTextAttr=*/false,
/*bGetFromChrFormat=*/false);
aSet.ClearItem( RES_TXTATR_REFMARK );
aSet.ClearItem( RES_TXTATR_TOXMARK );
aSet.ClearItem( RES_TXTATR_CJK_RUBY );
aSet.ClearItem( RES_TXTATR_INETFMT );
aSet.ClearItem( RES_TXTATR_META );
aSet.ClearItem( RES_TXTATR_METAFIELD );
aSet.ClearItem(RES_CHRATR_RSID);
// After GetParaAttr aSet can contain invalid/dontcare items (true == IsInvalidItem,
// DONTCARE == SfxItemState), e.g. RES_TXTATR_CHARFMT and (a copy of) this
// SfxItemSet can be passed to MSWordExportBase::OutputItemSet
// which doesn't handle invalid/dontcare items so clear them here
aSet.ClearInvalidItems();
IStyleAccess& rStyleAccess = rDoc.GetIStyleAccess();
std::shared_ptr<SfxItemSet> pAutoStyle = rStyleAccess.getAutomaticStyle(aSet, IStyleAccess::AUTO_STYLE_CHAR);
xExtra.reset(new SwRedlineExtraData_FormatColl(UIName(u""_ustr), USHRT_MAX, pAutoStyle));
}
pRedline->SetExtraData(xExtra.get() );
}
// create format redline(s) for the given range:
// to track the original formatting stored in the
// hints, create redlines for all parts of the
// range partitioned by boundaries of the hints.
void lcl_SetRedlines(
SwDoc& rDoc,
const SwPaM &rRg)
{
SwNodeIndex aIdx( rRg.Start()->GetNode() );
const SwNodeIndex aEndNd( rRg.End()->GetNode() );
while( aIdx <= aEndNd )
{
SwTextNode *pNode = aIdx.GetNode().GetTextNode();
if( pNode )
{
const sal_Int32 nStart = aIdx == rRg.Start()->GetNode()
? rRg.Start()->GetContentIndex()
: 0;
const sal_Int32 nEnd = aIdx < aEndNd
? pNode->GetText().getLength()
: rRg.End()->GetContentIndex();
if( SwpHints *pHints = pNode->GetpSwpHints() )
{
const size_t nCount = pHints->Count();
sal_Int32 nRedEnd = nStart;
for( size_t i = 0; i < nCount; ++i )
{
SwTextAttr *pAttr = pHints->Get( i );
if ( pAttr->GetStart() > nEnd )
{
break; // after the range
}
if ( !pAttr->GetEnd() || *pAttr->GetEnd() < nStart )
{
continue; // before the range
}
// range part before the hint
if ( nRedEnd < pAttr->GetStart() )
{
SwPaM aPam( *pNode, nRedEnd, *pNode, pAttr->GetStart() );
lcl_SetRedline(rDoc, aPam);
}
// range part at the hint
sal_Int32 nRedStart = std::max(pAttr->GetStart(), nStart);
nRedEnd = std::min(*pAttr->GetEnd(), nEnd);
SwPaM aPam2( *pNode, nRedStart, *pNode, nRedEnd );
lcl_SetRedline(rDoc, aPam2);
}
// range part after the last hint
if ( nRedEnd < nEnd )
{
SwPaM aPam( *pNode, nRedEnd, *pNode, nEnd );
lcl_SetRedline(rDoc, aPam);
}
}
else
{
SwPaM aPam( *pNode, nStart, *pNode, nEnd );
lcl_SetRedline(rDoc, aPam);
}
}
++aIdx;
}
}
/// Insert Hints according to content types;
// Is used in SwDoc::Insert(..., SwFormatHint &rHt)
bool lcl_InsAttr(
SwDoc& rDoc,
const SwPaM &rRg,
const SfxItemSet& rChgSet,
const SetAttrMode nFlags,
SwUndoAttr *const pUndo,
SwRootFrame const*const pLayout,
SwTextAttr **ppNewTextAttr)
{
// Divide the Sets (for selections in Nodes)
const SfxItemSet* pCharSet = nullptr;
const SfxItemSet* pOtherSet = nullptr;
bool bDelete = false;
bool bCharAttr = false;
bool bOtherAttr = false;
// Check, if we can work with rChgSet or if we have to create additional SfxItemSets
if ( 1 == rChgSet.Count() )
{
SfxItemIter aIter( rChgSet );
const SfxPoolItem* pItem = aIter.GetCurItem();
if (pItem && !IsInvalidItem(pItem))
{
const sal_uInt16 nWhich = pItem->Which();
if ( isCHRATR(nWhich) ||
(RES_TXTATR_CHARFMT == nWhich) ||
(RES_TXTATR_INETFMT == nWhich) ||
(RES_TXTATR_AUTOFMT == nWhich) ||
(RES_TXTATR_UNKNOWN_CONTAINER == nWhich) )
{
pCharSet = &rChgSet;
bCharAttr = true;
}
if ( isPARATR(nWhich)
|| isPARATR_LIST(nWhich)
|| isFRMATR(nWhich)
|| isGRFATR(nWhich)
|| isUNKNOWNATR(nWhich)
|| isDrawingLayerAttribute(nWhich) )
{
pOtherSet = &rChgSet;
bOtherAttr = true;
}
}
}
// Build new itemset if either
// - rChgSet.Count() > 1 or
// - The attribute in rChgSet does not belong to one of the above categories
if ( !bCharAttr && !bOtherAttr )
{
SfxItemSet* pTmpCharItemSet = new SfxItemSet(
rDoc.GetAttrPool(), WhichRangesContainer(svl::Items<RES_CHRATR_BEGIN, RES_CHRATR_END - 1,
RES_TXTATR_AUTOFMT, RES_TXTATR_CHARFMT,
RES_TXTATR_UNKNOWN_CONTAINER, RES_TXTATR_UNKNOWN_CONTAINER>));
SfxItemSet* pTmpOtherItemSet = new SfxItemSet(
rDoc.GetAttrPool(), WhichRangesContainer(svl::Items<RES_PARATR_BEGIN, RES_GRFATR_END - 1,
RES_UNKNOWNATR_BEGIN, RES_UNKNOWNATR_END - 1,
// FillAttribute support:
XATTR_FILL_FIRST, XATTR_FILL_LAST>));
pTmpCharItemSet->Put( rChgSet );
pTmpOtherItemSet->Put( rChgSet );
pCharSet = pTmpCharItemSet;
pOtherSet = pTmpOtherItemSet;
bDelete = true;
}
SwHistory* pHistory = pUndo ? &pUndo->GetHistory() : nullptr;
bool bRet = false;
const SwPosition *pStart = rRg.Start(), *pEnd = rRg.End();
SwContentNode* pNode = pStart->GetNode().GetContentNode();
if( pNode && pNode->IsTextNode() )
{
// tdf#127606 at editing, remove different formatting of DOCX-like numbering symbol
if (pLayout && pNode->GetTextNode()->getIDocumentSettingAccess()->
get(DocumentSettingId::APPLY_PARAGRAPH_MARK_FORMAT_TO_NUMBERING ))
{
SwContentNode* pEndNode = pEnd->GetNode().GetContentNode();
SwContentNode* pCurrentNode = pEndNode;
auto nStartIndex = pNode->GetIndex();
auto nEndIndex = pEndNode->GetIndex();
SwNodeIndex aIdx( pEnd->GetNode() );
while ( pCurrentNode != nullptr && nStartIndex <= pCurrentNode->GetIndex() )
{
if (pCurrentNode->GetSwAttrSet().HasItem(RES_PARATR_LIST_AUTOFMT) &&
// remove character formatting only on wholly selected paragraphs
(nStartIndex < pCurrentNode->GetIndex() || pStart->GetContentIndex() == 0) &&
(pCurrentNode->GetIndex() < nEndIndex || pEnd->GetContentIndex() == pEndNode->Len()))
{
pCurrentNode->ResetAttr(RES_PARATR_LIST_AUTOFMT);
// reset also paragraph marker
pCurrentNode->GetTextNode()->RstTextAttr(pCurrentNode->Len(), 1);
}
pCurrentNode = SwNodes::GoPrevious( &aIdx );
}
}
// #i27615#
if (rRg.IsInFrontOfLabel())
{
SwTextNode * pTextNd = pNode->GetTextNode();
if (pLayout)
{
pTextNd = sw::GetParaPropsNode(*pLayout, *pTextNd);
}
SwNumRule * pNumRule = pTextNd->GetNumRule();
if ( !pNumRule )
{
OSL_FAIL( "<InsAttr(..)> - PaM in front of label, but text node has no numbering rule set. This is a serious defect." );
DELETECHARSETS
return false;
}
int nLevel = pTextNd->GetActualListLevel();
if (nLevel < 0)
nLevel = 0;
if (nLevel >= MAXLEVEL)
nLevel = MAXLEVEL - 1;
SwNumFormat aNumFormat = pNumRule->Get(o3tl::narrowing<sal_uInt16>(nLevel));
SwCharFormat * pCharFormat =
rDoc.FindCharFormatByName(UIName(aNumFormat.GetCharFormatName()));
if (pCharFormat)
{
if (pHistory)
pHistory->AddCharFormat(pCharFormat->GetAttrSet(), *pCharFormat);
if ( pCharSet )
pCharFormat->SetFormatAttr(*pCharSet);
}
DELETECHARSETS
return true;
}
// Attributes without an end do not have a range
if ( !bCharAttr && !bOtherAttr )
{
SfxItemSet aTextSet(SfxItemSet::makeFixedSfxItemSet<RES_TXTATR_NOEND_BEGIN, RES_TXTATR_NOEND_END-1>(rDoc.GetAttrPool()));
aTextSet.Put( rChgSet );
if( aTextSet.Count() )
{
SwRegHistory history( pNode, *pNode, pHistory );
bRet = history.InsertItems(
aTextSet, pStart->GetContentIndex(), pStart->GetContentIndex(), nFlags, /*ppNewTextAttr*/nullptr ) || bRet;
if (bRet && (rDoc.getIDocumentRedlineAccess().IsRedlineOn() || (!rDoc.getIDocumentRedlineAccess().IsIgnoreRedline()
&& !rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty())))
{
SwPaM aPam( pStart->GetNode(), pStart->GetContentIndex()-1,
pStart->GetNode(), pStart->GetContentIndex() );
if( pUndo )
pUndo->SaveRedlineData( aPam, true );
if( rDoc.getIDocumentRedlineAccess().IsRedlineOn() )
rDoc.getIDocumentRedlineAccess().AppendRedline( new SwRangeRedline( RedlineType::Insert, aPam ), true);
else
rDoc.getIDocumentRedlineAccess().SplitRedline( aPam );
}
}
}
// TextAttributes with an end never expand their range
if ( !bCharAttr && !bOtherAttr )
{
// CharFormat and URL attributes are treated separately!
// TEST_TEMP ToDo: AutoFormat!
SfxItemSet aTextSet(SfxItemSet::makeFixedSfxItemSet<RES_TXTATR_REFMARK, RES_TXTATR_METAFIELD,
RES_TXTATR_CJK_RUBY, RES_TXTATR_CJK_RUBY,
RES_TXTATR_INPUTFIELD, RES_TXTATR_CONTENTCONTROL>(rDoc.GetAttrPool()));
aTextSet.Put( rChgSet );
if( aTextSet.Count() )
{
const sal_Int32 nInsCnt = pStart->GetContentIndex();
const sal_Int32 nEnd = pStart->GetNode() == pEnd->GetNode()
? pEnd->GetContentIndex()
: pNode->Len();
SwRegHistory history( pNode, *pNode, pHistory );
bRet = history.InsertItems( aTextSet, nInsCnt, nEnd, nFlags, ppNewTextAttr )
|| bRet;
if (bRet && (rDoc.getIDocumentRedlineAccess().IsRedlineOn() || (!rDoc.getIDocumentRedlineAccess().IsIgnoreRedline()
&& !rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty())))
{
// Was text content inserted? (RefMark/TOXMarks without an end)
bool bTextIns = nInsCnt != pStart->GetContentIndex();
// Was content inserted or set over the selection?
SwPaM aPam( pStart->GetNode(), bTextIns ? nInsCnt + 1 : nEnd,
pStart->GetNode(), nInsCnt );
if( pUndo )
pUndo->SaveRedlineData( aPam, bTextIns );
if( rDoc.getIDocumentRedlineAccess().IsRedlineOn() )
rDoc.getIDocumentRedlineAccess().AppendRedline(
new SwRangeRedline(
bTextIns ? RedlineType::Insert : RedlineType::Format, aPam ),
true);
else if( bTextIns )
rDoc.getIDocumentRedlineAccess().SplitRedline( aPam );
}
}
}
}
// We always have to set the auto flag for PageDescs that are set at the Node!
if( pOtherSet && pOtherSet->Count() )
{
SwTableNode* pTableNd;
const SwFormatPageDesc* pDesc = pOtherSet->GetItemIfSet( RES_PAGEDESC, false );
if( pDesc )
{
if( pNode )
{
// Set auto flag. Only in the template it's without auto!
SwFormatPageDesc aNew( *pDesc );
// Tables now also know line breaks
if( !(nFlags & SetAttrMode::APICALL) &&
nullptr != ( pTableNd = pNode->FindTableNode() ) )
{
SwTableNode* pCurTableNd = pTableNd;
while ( nullptr != ( pCurTableNd = pCurTableNd->StartOfSectionNode()->FindTableNode() ) )
pTableNd = pCurTableNd;
// set the table format
SwFrameFormat* pFormat = pTableNd->GetTable().GetFrameFormat();
SwRegHistory aRegH( pFormat, *pTableNd, pHistory );
pFormat->SetFormatAttr( aNew );
bRet = true;
}
else
{
SwContentNode * pFirstNode(pNode);
if (pLayout && pLayout->HasMergedParas())
{
pFirstNode = sw::GetFirstAndLastNode(*pLayout, pStart->GetNode()).first;
}
SwRegHistory aRegH( pFirstNode, *pFirstNode, pHistory );
bRet = pFirstNode->SetAttr( aNew ) || bRet;
}
}
// bOtherAttr = true means that pOtherSet == rChgSet. In this case
// we know, that there is only one attribute in pOtherSet. We cannot
// perform the following operations, instead we return:
if ( bOtherAttr )
return bRet;
const_cast<SfxItemSet*>(pOtherSet)->ClearItem( RES_PAGEDESC );
if( !pOtherSet->Count() )
{
DELETECHARSETS
return bRet;
}
}
// Tables now also know line breaks
const SvxFormatBreakItem* pBreak;
if( pNode && !(nFlags & SetAttrMode::APICALL) &&
nullptr != (pTableNd = pNode->FindTableNode() ) &&
(pBreak = pOtherSet->GetItemIfSet( RES_BREAK, false )) )
{
SwTableNode* pCurTableNd = pTableNd;
while ( nullptr != ( pCurTableNd = pCurTableNd->StartOfSectionNode()->FindTableNode() ) )
pTableNd = pCurTableNd;
// set the table format
SwFrameFormat* pFormat = pTableNd->GetTable().GetFrameFormat();
SwRegHistory aRegH( pFormat, *pTableNd, pHistory );
pFormat->SetFormatAttr( *pBreak );
bRet = true;
// bOtherAttr = true means that pOtherSet == rChgSet. In this case
// we know, that there is only one attribute in pOtherSet. We cannot
// perform the following operations, instead we return:
if ( bOtherAttr )
return bRet;
const_cast<SfxItemSet*>(pOtherSet)->ClearItem( RES_BREAK );
if( !pOtherSet->Count() )
{
DELETECHARSETS
return bRet;
}
}
{
// If we have a PoolNumRule, create it if needed
sal_uInt16 nPoolId=0;
const SwNumRuleItem* pRule = pOtherSet->GetItemIfSet( RES_PARATR_NUMRULE, false );
if( pRule &&
!rDoc.FindNumRulePtr( pRule->GetValue() ) &&
USHRT_MAX != (nPoolId = SwStyleNameMapper::GetPoolIdFromUIName ( pRule->GetValue(),
SwGetPoolIdFromName::NumRule )) )
rDoc.getIDocumentStylePoolAccess().GetNumRuleFromPool( nPoolId );
}
}
SfxItemSet firstSet(SfxItemSet::makeFixedSfxItemSet<RES_PAGEDESC, RES_BREAK>(rDoc.GetAttrPool()));
if (pOtherSet && pOtherSet->Count())
{ // actually only RES_BREAK is possible here...
firstSet.Put(*pOtherSet);
}
SfxItemSet propsSet(SfxItemSet::makeFixedSfxItemSet<RES_PARATR_BEGIN, RES_PAGEDESC,
RES_BREAK+1, RES_FRMATR_END,
XATTR_FILL_FIRST, XATTR_FILL_LAST+1> (rDoc.GetAttrPool()));
if (pOtherSet && pOtherSet->Count())
{
propsSet.Put(*pOtherSet);
}
if( !rRg.HasMark() ) // no range
{
if( !pNode )
{
DELETECHARSETS
return bRet;
}
if( pNode->IsTextNode() && pCharSet && pCharSet->Count() )
{
SwTextNode* pTextNd = pNode->GetTextNode();
sal_Int32 nMkPos, nPtPos = pStart->GetContentIndex();
const OUString& rStr = pTextNd->GetText();
// Special case: if the Cursor is located within a URL attribute, we take over it's area
SwTextAttr const*const pURLAttr(
pTextNd->GetTextAttrAt(pStart->GetContentIndex(), RES_TXTATR_INETFMT));
if (pURLAttr && !pURLAttr->GetINetFormat().GetValue().isEmpty())
{
nMkPos = pURLAttr->GetStart();
nPtPos = *pURLAttr->End();
}
else
{
assert(g_pBreakIt && g_pBreakIt->GetBreakIter().is());
Boundary aBndry = g_pBreakIt->GetBreakIter()->getWordBoundary(
pTextNd->GetText(), nPtPos,
g_pBreakIt->GetLocale( pTextNd->GetLang( nPtPos ) ),
WordType::ANY_WORD /*ANYWORD_IGNOREWHITESPACES*/,
true);
if( aBndry.startPos < nPtPos && nPtPos < aBndry.endPos )
{
nMkPos = aBndry.startPos;
nPtPos = aBndry.endPos;
}
else
nPtPos = nMkPos = pStart->GetContentIndex();
}
// Remove the overriding attributes from the SwpHintsArray,
// if the selection spans across the whole paragraph.
// These attributes are inserted as FormatAttributes and
// never override the TextAttributes!
if( !(nFlags & SetAttrMode::DONTREPLACE ) &&
pTextNd->HasHints() && !nMkPos && nPtPos == rStr.getLength())
{
if( pHistory )
{
// Save all attributes for the Undo.
SwRegHistory aRHst( *pTextNd, pHistory );
pTextNd->GetpSwpHints()->Register( &aRHst );
pTextNd->RstTextAttr( 0, nPtPos, 0, pCharSet );
if( pTextNd->GetpSwpHints() )
pTextNd->GetpSwpHints()->DeRegister();
}
else
pTextNd->RstTextAttr( 0, nPtPos, 0, pCharSet );
}
if( rDoc.getIDocumentRedlineAccess().IsRedlineOn() )
{
SwPaM aPam( *pNode, nMkPos, *pNode, nPtPos );
if( pUndo )
pUndo->SaveRedlineData( aPam, false );
lcl_SetRedlines(rDoc, aPam);
}
// the SwRegHistory inserts the attribute into the TextNode!
SwRegHistory history( pNode, *pNode, pHistory );
bRet = history.InsertItems( *pCharSet, nMkPos, nPtPos, nFlags, /*ppNewTextAttr*/nullptr )
|| bRet;
if (bRet && pTextNd->GetSwAttrSet().HasItem(RES_PARATR_LIST_AUTOFMT)
&& nMkPos == nPtPos && nMkPos == pTextNd->Len())
{
// The hint is created exactly at the paragraph end and the paragraph has
// paragraph marker character properties, update that autostyle, too.
const SwFormatAutoFormat& rListAutoFormat
= pTextNd->GetAttr(RES_PARATR_LIST_AUTOFMT);
std::unique_ptr<SfxItemSet> pSet = rListAutoFormat.GetStyleHandle()->Clone();
pSet->Put(*pCharSet);
IStyleAccess& rStyleAccess = rDoc.GetIStyleAccess();
std::shared_ptr<SfxItemSet> pAutoStyle
= rStyleAccess.getAutomaticStyle(*pSet, IStyleAccess::AUTO_STYLE_CHAR);
SwFormatAutoFormat aListAutofmt(RES_PARATR_LIST_AUTOFMT);
aListAutofmt.SetStyleHandle(pAutoStyle);
pTextNd->SetAttr(aListAutofmt);
}
}
if( pOtherSet && pOtherSet->Count() )
{
// Need to check for unique item for DrawingLayer items of type NameOrIndex
// and evtl. correct that item to ensure unique names for that type. This call may
// modify/correct entries inside of the given SfxItemSet
SfxItemSet aTempLocalCopy(*pOtherSet);
rDoc.CheckForUniqueItemForLineFillNameOrIndex(aTempLocalCopy);
bRet = lcl_ApplyOtherSet(*pNode, pHistory, aTempLocalCopy, firstSet, propsSet, pLayout) || bRet;
}
DELETECHARSETS
return bRet;
}
if( rDoc.getIDocumentRedlineAccess().IsRedlineOn() && pCharSet && pCharSet->Count() )
{
if( pUndo )
pUndo->SaveRedlineData( rRg, false );
lcl_SetRedlines(rDoc, rRg);
}
/* now if range */
sal_uLong nNodes = 0;
SwNodeIndex aSt( rDoc.GetNodes() );
SwNodeIndex aEnd( rDoc.GetNodes() );
SwContentIndex aCntEnd( pEnd->GetContentNode(), pEnd->GetContentIndex() );
if( pNode )
{
const sal_Int32 nLen = pNode->Len();
if( pStart->GetNode() != pEnd->GetNode() )
aCntEnd.Assign( pNode, nLen );
if( pStart->GetContentIndex() != 0 || aCntEnd.GetIndex() != nLen )
{
// the SwRegHistory inserts the attribute into the TextNode!
if( pNode->IsTextNode() && pCharSet && pCharSet->Count() )
{
SwRegHistory history( pNode, *pNode, pHistory );
bRet = history.InsertItems(*pCharSet,
pStart->GetContentIndex(), aCntEnd.GetIndex(), nFlags, /*ppNewTextAttr*/nullptr)
|| bRet;
}
if( pOtherSet && pOtherSet->Count() )
{
bRet = lcl_ApplyOtherSet(*pNode, pHistory, *pOtherSet, firstSet, propsSet, pLayout) || bRet;
}
// Only selection in a Node.
if( pStart->GetNode() == pEnd->GetNode() )
{
DELETECHARSETS
return bRet;
}
++nNodes;
aSt.Assign( pStart->GetNode(), +1 );
}
else
aSt = pStart->GetNode();
aCntEnd.Assign(pEnd->GetContentNode(), pEnd->GetContentIndex()); // aEnd was changed!
}
else
aSt.Assign( pStart->GetNode(), +1 );
// aSt points to the first full Node now
/*
* The selection spans more than one Node.
*/
if( pStart->GetNode() < pEnd->GetNode() )
{
pNode = pEnd->GetNode().GetContentNode();
if(pNode)
{
if( aCntEnd.GetIndex() != pNode->Len() )
{
// the SwRegHistory inserts the attribute into the TextNode!
if( pNode->IsTextNode() && pCharSet && pCharSet->Count() )
{
SwRegHistory history( pNode, *pNode, pHistory );
(void)history.InsertItems(*pCharSet,
0, aCntEnd.GetIndex(), nFlags, /*ppNewTextAttr*/nullptr);
}
if( pOtherSet && pOtherSet->Count() )
{
lcl_ApplyOtherSet(*pNode, pHistory, *pOtherSet, firstSet, propsSet, pLayout);
}
++nNodes;
aEnd = pEnd->GetNode();
}
else
aEnd.Assign( pEnd->GetNode(), +1 );
}
else
aEnd = pEnd->GetNode();
}
else
aEnd.Assign( pEnd->GetNode(), +1 );
// aEnd points BEHIND the last full node now
/* Edit the fully selected Nodes. */
// Reset all attributes from the set!
if( pCharSet && pCharSet->Count() && !( SetAttrMode::DONTREPLACE & nFlags ) )
{
::sw::DocumentContentOperationsManager::ParaRstFormat aPara(
pStart, pEnd, pHistory, pCharSet, pLayout);
rDoc.GetNodes().ForEach( aSt, aEnd, ::sw::DocumentContentOperationsManager::lcl_RstTextAttr, &aPara );
}
bool bCreateSwpHints = pCharSet && (
SfxItemState::SET == pCharSet->GetItemState( RES_TXTATR_CHARFMT, false ) ||
SfxItemState::SET == pCharSet->GetItemState( RES_TXTATR_INETFMT, false ) );
for (SwNodeIndex current = aSt; current < aEnd; ++current)
{
SwTextNode *const pTNd = current.GetNode().GetTextNode();
if (!pTNd)
continue;
if (pLayout && pLayout->HasMergedParas()
&& pTNd->GetRedlineMergeFlag() == SwNode::Merge::Hidden)
{ // not really sure what to do here, but applying to hidden
continue; // nodes doesn't make sense...
}
if( pHistory )
{
SwRegHistory aRegH( pTNd, *pTNd, pHistory );
if (pCharSet && pCharSet->Count())
{
if (SwpHints *pSwpHints = bCreateSwpHints ? &pTNd->GetOrCreateSwpHints()
: pTNd->GetpSwpHints())
{
pSwpHints->Register( &aRegH );
}
pTNd->SetAttr(*pCharSet, 0, pTNd->GetText().getLength(), nFlags);
// re-fetch as it may be deleted by SetAttr
if (SwpHints *pSwpHints = pTNd->GetpSwpHints())
pSwpHints->DeRegister();
}
}
else
{
if (pCharSet && pCharSet->Count())
pTNd->SetAttr(*pCharSet, 0, pTNd->GetText().getLength(), nFlags);
}
++nNodes;
}
if (pOtherSet && pOtherSet->Count())
{
for (; aSt < aEnd; ++aSt)
{
pNode = aSt.GetNode().GetContentNode();
if (!pNode)
continue;
lcl_ApplyOtherSet(*pNode, pHistory, *pOtherSet, firstSet, propsSet, pLayout, &aSt);
++nNodes;
}
}
DELETECHARSETS
return (nNodes != 0) || bRet;
}
}
namespace sw
{
namespace mark
{
bool IsFieldmarkOverlap(SwPaM const& rPaM)
{
std::vector<std::pair<SwNodeOffset, sal_Int32>> Breaks;
sw::CalcBreaks(Breaks, rPaM);
return !Breaks.empty();
}
}
DocumentContentOperationsManager::DocumentContentOperationsManager( SwDoc& i_rSwdoc ) : m_rDoc( i_rSwdoc )
{
}
/**
* Checks if rStart..rEnd mark a range that makes sense to copy.
*
* IsMoveToFly means the copy is a move to create a fly
* and so existing flys at the edge must not be copied.
*/
static bool IsEmptyRange(const SwPosition& rStart, const SwPosition& rEnd,
SwCopyFlags const flags)
{
if (rStart == rEnd)
{ // check if a fly anchored there would be copied - then copy...
return !IsDestroyFrameAnchoredAtChar(rStart, rStart, rEnd,
(flags & SwCopyFlags::IsMoveToFly)
? DelContentType::WriterfilterHack|DelContentType::AllMask
: DelContentType::AllMask);
}
else
{
return rEnd < rStart;
}
}
// Copy an area into this document or into another document
bool DocumentContentOperationsManager::CopyRange(SwPaM& rPam, SwPosition& rPos,
SwCopyFlags const flags,
sal_uInt32 nMovedID) const
{
const SwPosition *pStart = rPam.Start(), *pEnd = rPam.End();
SwDoc& rDoc = rPos.GetNode().GetDoc();
bool bColumnSel = rDoc.IsClipBoard() && rDoc.IsColumnSelection();
// Catch if there's no copy to do
if (!rPam.HasMark() || (IsEmptyRange(*pStart, *pEnd, flags) && !bColumnSel))
return false;
// Prevent copying into Flys that are anchored in the source range
if (&rDoc == &m_rDoc && (flags & SwCopyFlags::CheckPosInFly))
{
// Correct the Start-/EndNode
SwNodeOffset nStt = pStart->GetNodeIndex(),
nEnd = pEnd->GetNodeIndex(),
nDiff = nEnd - nStt +1;
SwNode* pNd = m_rDoc.GetNodes()[ nStt ];
if( pNd->IsContentNode() && pStart->GetContentIndex() )
{
++nStt;
--nDiff;
}
if( (pNd = m_rDoc.GetNodes()[ nEnd ])->IsContentNode() &&
static_cast<SwContentNode*>(pNd)->Len() != pEnd->GetContentIndex() )
{
--nEnd;
--nDiff;
}
if( nDiff &&
lcl_ChkFlyFly( rDoc, nStt, nEnd, rPos.GetNodeIndex() ) )
{
return false;
}
}
std::optional<SwPaM> pRedlineRange;
if( rDoc.getIDocumentRedlineAccess().IsRedlineOn() ||
(!rDoc.getIDocumentRedlineAccess().IsIgnoreRedline() && !rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty() ) )
pRedlineRange.emplace( rPos );
RedlineFlags eOld = rDoc.getIDocumentRedlineAccess().GetRedlineFlags();
bool bRet = false;
if( &rDoc != &m_rDoc )
{ // ordinary copy
bRet = CopyImpl(rPam, rPos, flags & ~SwCopyFlags::CheckPosInFly, pRedlineRange ? &*pRedlineRange : nullptr);
}
else if( ! ( *pStart <= rPos && rPos < *pEnd &&
( pStart->GetNode() != pEnd->GetNode() ||
!pStart->GetNode().IsTextNode() )) )
{
// Copy to a position outside of the area, or copy a single TextNode
// Do an ordinary copy
bRet = CopyImpl(rPam, rPos, flags & ~SwCopyFlags::CheckPosInFly, pRedlineRange ? &*pRedlineRange : nullptr);
}
else
{
// Copy the range in itself
assert(!"mst: this is assumed to be dead code");
}
rDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( eOld );
if( pRedlineRange )
{
if( rDoc.getIDocumentRedlineAccess().IsRedlineOn() )
rDoc.getIDocumentRedlineAccess().AppendRedline(
new SwRangeRedline(RedlineType::Insert, *pRedlineRange, nMovedID), true);
else
rDoc.getIDocumentRedlineAccess().SplitRedline( *pRedlineRange );
pRedlineRange.reset();
}
return bRet;
}
static auto GetCorrPosition(SwPaM const& rPam) -> SwPosition
{
// tdf#152710 target position must be on node that survives deletion
// so that PaMCorrAbs can invalidate SwUnoCursors properly
return rPam.GetPoint()->GetNode().IsContentNode()
? *rPam.GetPoint()
: rPam.GetMark()->GetNode().IsContentNode()
? *rPam.GetMark()
// this would be the result in SwNodes::RemoveNode()
: SwPosition(rPam.End()->GetNode(), SwNodeOffset(+1));
}
/// Delete a full Section of the NodeArray.
/// The passed Node is located somewhere in the designated Section.
void DocumentContentOperationsManager::DeleteSection( SwNode *pNode )
{
assert(pNode && "Didn't pass a Node.");
SwStartNode* pSttNd = pNode->IsStartNode() ? static_cast<SwStartNode*>(pNode)
: pNode->StartOfSectionNode();
SwNodeIndex aSttIdx( *pSttNd ), aEndIdx( *pNode->EndOfSectionNode() );
// delete all Flys, Bookmarks, ...
DelFlyInRange( aSttIdx.GetNode(), aEndIdx.GetNode() );
m_rDoc.getIDocumentRedlineAccess().DeleteRedline( *pSttNd, true, RedlineType::Any );
DelBookmarks(aSttIdx.GetNode(), aEndIdx.GetNode());
{
// move all Cursor/StackCursor/UnoCursor out of the to-be-deleted area
SwPaM const range(aSttIdx, aEndIdx);
SwPosition const pos(GetCorrPosition(range));
::PaMCorrAbs(range, pos);
}
m_rDoc.GetNodes().DelNodes( aSttIdx, aEndIdx.GetIndex() - aSttIdx.GetIndex() + 1 );
}
void DocumentContentOperationsManager::DeleteDummyChar(
SwPosition const& rPos, sal_Unicode const cDummy)
{
SwPaM aPam(rPos, rPos);
aPam.GetPoint()->AdjustContent(+1);
assert(aPam.GetText().getLength() == 1 && aPam.GetText()[0] == cDummy);
(void) cDummy;
DeleteRangeImpl(aPam, SwDeleteFlags::Default);
if (!m_rDoc.getIDocumentRedlineAccess().IsIgnoreRedline()
&& !m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty())
{
m_rDoc.getIDocumentRedlineAccess().CompressRedlines();
}
}
void DocumentContentOperationsManager::DeleteRange( SwPaM & rPam )
{
// Seek all redlines that are in that PaM to be deleted..
SwRedlineTable::size_type nRedlStart = m_rDoc.getIDocumentRedlineAccess().GetRedlinePos(
rPam.Start()->GetNode(), RedlineType::Any);
SwRedlineTable::size_type nRedlEnd = m_rDoc.getIDocumentRedlineAccess().GetRedlineEndPos(
nRedlStart, rPam.End()->GetNode(), RedlineType::Any);
lcl_DoWithBreaks(*this, rPam, SwDeleteFlags::Default, &DocumentContentOperationsManager::DeleteRangeImpl);
// update all redlines was in the Pam that is
m_rDoc.getIDocumentRedlineAccess().UpdateRedlineContentNode(nRedlStart, nRedlEnd);
if (!m_rDoc.getIDocumentRedlineAccess().IsIgnoreRedline()
&& !m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty())
{
m_rDoc.getIDocumentRedlineAccess().CompressRedlines();
}
}
bool DocumentContentOperationsManager::DelFullPara( SwPaM& rPam )
{
const SwPosition &rStt = *rPam.Start(), &rEnd = *rPam.End();
const SwNode* pNd = &rStt.GetNode();
SwNodeOffset nSectDiff = pNd->StartOfSectionNode()->EndOfSectionIndex() -
pNd->StartOfSectionIndex();
SwNodeOffset nNodeDiff = rEnd.GetNodeIndex() - rStt.GetNodeIndex();
if ( nSectDiff-SwNodeOffset(2) <= nNodeDiff || m_rDoc.getIDocumentRedlineAccess().IsRedlineOn() ||
/* #i9185# Prevent getting the node after the end node (see below) */
rEnd.GetNodeIndex() + 1 == m_rDoc.GetNodes().Count() )
{
return false;
}
{
SwPaM temp(rPam, nullptr);
if (!temp.HasMark())
{
temp.SetMark();
}
if (SwTextNode *const pNode = temp.Start()->GetNode().GetTextNode())
{ // rPam may not have nContent set but IsFieldmarkOverlap requires it
temp.Start()->AssignStartIndex(*pNode);
}
if (SwTextNode *const pNode = temp.End()->GetNode().GetTextNode())
{
temp.End()->AssignEndIndex(*pNode);
}
if (sw::mark::IsFieldmarkOverlap(temp))
{ // a bit of a problem: we want to completely remove the nodes
// but then how can the CH_TXT_ATR survive?
return false;
}
}
// Move hard page breaks to the following Node.
bool bSavePageBreak = false, bSavePageDesc = false;
/* #i9185# This would lead to a segmentation fault if not caught above. */
SwNodeOffset nNextNd = rEnd.GetNodeIndex() + 1;
SwTableNode *const pTableNd = m_rDoc.GetNodes()[ nNextNd ]->GetTableNode();
if( pTableNd && pNd->IsContentNode() )
{
SwFrameFormat* pTableFormat = pTableNd->GetTable().GetFrameFormat();
{
const SfxPoolItem *pItem;
const SfxItemSet* pSet = static_cast<const SwContentNode*>(pNd)->GetpSwAttrSet();
if( pSet && SfxItemState::SET == pSet->GetItemState( RES_PAGEDESC,
false, &pItem ) )
{
pTableFormat->SetFormatAttr( *pItem );
bSavePageDesc = true;
}
if( pSet && SfxItemState::SET == pSet->GetItemState( RES_BREAK,
false, &pItem ) )
{
pTableFormat->SetFormatAttr( *pItem );
bSavePageBreak = true;
}
}
}
bool const bDoesUndo = m_rDoc.GetIDocumentUndoRedo().DoesUndo();
if( bDoesUndo )
{
if( !rPam.HasMark() )
rPam.SetMark();
else if( rPam.GetPoint() == &rStt )
rPam.Exchange();
rPam.GetPoint()->Adjust(SwNodeOffset(1));
SwContentNode *pTmpNode = rPam.GetPoint()->GetNode().GetContentNode();
bool bGoNext = (nullptr == pTmpNode);
if (rPam.GetMark()->GetContentNode())
rPam.GetMark()->SetContent( 0 );
m_rDoc.GetIDocumentUndoRedo().ClearRedo();
SwPaM aDelPam( *rPam.GetMark(), *rPam.GetPoint() );
{
SwPosition aTmpPos( *aDelPam.GetPoint() );
if( bGoNext )
{
SwNodes::GoNext(&aTmpPos);
}
::PaMCorrAbs( aDelPam, aTmpPos );
}
std::unique_ptr<SwUndoDelete> pUndo(new SwUndoDelete(aDelPam, SwDeleteFlags::Default, true));
*rPam.GetPoint() = *aDelPam.GetPoint();
pUndo->SetPgBrkFlags( bSavePageBreak, bSavePageDesc );
m_rDoc.GetIDocumentUndoRedo().AppendUndo(std::move(pUndo));
rPam.DeleteMark();
}
else
{
SwNodeRange aRg( rStt.GetNode(), rEnd.GetNode() );
rPam.Normalize(false);
// Try to move past the End
if( !rPam.Move( fnMoveForward, GoInNode ) )
{
// Fair enough, at the Beginning then
rPam.Exchange();
if( !rPam.Move( fnMoveBackward, GoInNode ))
{
SAL_WARN("sw.core", "DelFullPara: no more Nodes");
return false;
}
}
// must delete all fieldmarks before CorrAbs(), or they'll remain
// moved to wrong node without their CH_TXT_ATR_FIELD*
// (note: deleteMarks() doesn't help here, in case of partially
// selected fieldmarks; let's delete these as re-inserting their chars
// elsewhere looks difficult)
::std::set<::sw::mark::Fieldmark*> fieldmarks;
for (SwNodeIndex i = aRg.aStart; i <= aRg.aEnd; ++i)
{
if (SwTextNode *const pTextNode = i.GetNode().GetTextNode())
{
for (sal_Int32 j = 0; j < pTextNode->GetText().getLength(); ++j)
{
switch (pTextNode->GetText()[j])
{
case CH_TXT_ATR_FIELDSTART:
case CH_TXT_ATR_FIELDEND:
fieldmarks.insert(m_rDoc.getIDocumentMarkAccess()->getFieldmarkAt(SwPosition(*pTextNode, j)));
break;
case CH_TXT_ATR_FIELDSEP:
fieldmarks.insert(m_rDoc.getIDocumentMarkAccess()->getInnerFieldmarkFor(SwPosition(*pTextNode, j)));
break;
}
}
}
}
for (auto const pFieldMark : fieldmarks)
{
m_rDoc.getIDocumentMarkAccess()->deleteMark(pFieldMark);
}
// move bookmarks, redlines etc.
if (aRg.aStart == aRg.aEnd) // only first CorrAbs variant handles this
{
m_rDoc.CorrAbs( aRg.aStart.GetNode(), *rPam.GetPoint(), 0, true );
}
else
{
SwDoc::CorrAbs( aRg.aStart, aRg.aEnd, *rPam.GetPoint(), true );
}
// What's with Flys?
{
// If there are FlyFrames left, delete these too
size_t n = 0;;
while (n < m_rDoc.GetSpzFrameFormats()->size())
{
sw::SpzFrameFormat* pFly = (*m_rDoc.GetSpzFrameFormats())[n];
const SwFormatAnchor* pAnchor = &pFly->GetAnchor();
SwNode const*const pAnchorNode = pAnchor->GetAnchorNode();
if (pAnchorNode &&
((RndStdIds::FLY_AT_PARA == pAnchor->GetAnchorId()) ||
(RndStdIds::FLY_AT_CHAR == pAnchor->GetAnchorId())) &&
// note: here use <= not < like in
// IsDestroyFrameAnchoredAtChar() because of the increment
// of rPam in the bDoesUndo path above!
aRg.aStart <= *pAnchorNode && *pAnchorNode <= aRg.aEnd.GetNode() )
{
m_rDoc.getIDocumentLayoutAccess().DelLayoutFormat( pFly );
continue;
}
++n;
}
}
rPam.DeleteMark();
m_rDoc.GetNodes().Delete( aRg.aStart, nNodeDiff+1 );
}
if (!m_rDoc.getIDocumentRedlineAccess().IsIgnoreRedline()
&& !m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty())
{
m_rDoc.getIDocumentRedlineAccess().CompressRedlines();
}
m_rDoc.getIDocumentState().SetModified();
return true;
}
bool DocumentContentOperationsManager::DeleteAndJoin(SwPaM & rPam, SwDeleteFlags const flags)
{
if ( lcl_StrLenOverflow( rPam ) )
return false;
bool const ret = lcl_DoWithBreaks( *this, rPam, flags, (m_rDoc.getIDocumentRedlineAccess().IsRedlineOn())
? &DocumentContentOperationsManager::DeleteAndJoinWithRedlineImpl
: &DocumentContentOperationsManager::DeleteAndJoinImpl );
return ret;
}
// It seems that this is mostly used by SwDoc internals; the only
// way to call this from the outside seems to be the special case in
// SwDoc::CopyRange (but I have not managed to actually hit that case).
bool DocumentContentOperationsManager::MoveRange( SwPaM& rPaM, SwPosition& rPos, SwMoveFlags eMvFlags )
{
// nothing moved: return
const SwPosition *pStart = rPaM.Start(), *pEnd = rPaM.End();
if( !rPaM.HasMark() || *pStart >= *pEnd || (*pStart <= rPos && rPos < *pEnd))
return false;
assert(!sw::mark::IsFieldmarkOverlap(rPaM)); // probably an invalid redline was created?
// Save the paragraph anchored Flys, so that they can be moved.
SaveFlyArr aSaveFlyArr;
SaveFlyInRange( rPaM, rPos, aSaveFlyArr, bool( SwMoveFlags::ALLFLYS & eMvFlags ) );
// save redlines (if DOC_MOVEREDLINES is used)
SaveRedlines_t aSaveRedl;
if( SwMoveFlags::REDLINES & eMvFlags && !m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty() )
{
lcl_SaveRedlines( rPaM, aSaveRedl );
// #i17764# unfortunately, code below relies on undos being
// in a particular order, and presence of bookmarks
// will change this order. Hence, we delete bookmarks
// here without undo.
::sw::UndoGuard const undoGuard(m_rDoc.GetIDocumentUndoRedo());
DelBookmarks(
pStart->GetNode(),
pEnd->GetNode(),
nullptr,
pStart->GetContentIndex(),
pEnd->GetContentIndex());
}
bool bUpdateFootnote = false;
SwFootnoteIdxs aTmpFntIdx;
std::unique_ptr<SwUndoMove> pUndoMove;
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().ClearRedo();
pUndoMove.reset(new SwUndoMove( rPaM, rPos ));
pUndoMove->SetMoveRedlines( eMvFlags == SwMoveFlags::REDLINES );
}
else
{
bUpdateFootnote = lcl_SaveFootnote( pStart->GetNode(), pEnd->GetNode(), rPos.GetNode(),
m_rDoc.GetFootnoteIdxs(), aTmpFntIdx,
pStart->GetContentIndex(), pEnd->GetContentIndex() );
}
bool bSplit = false;
SwPaM aSavePam( rPos, rPos );
// Move the SPoint to the beginning of the range
if( rPaM.GetPoint() == pEnd )
rPaM.Exchange();
// If there is a TextNode before and after the Move, create a JoinNext in the EditShell.
SwTextNode* pSrcNd = rPaM.GetPoint()->GetNode().GetTextNode();
bool bCorrSavePam = pSrcNd && pStart->GetNode() != pEnd->GetNode();
// If one or more TextNodes are moved, SwNodes::Move will do a SplitNode.
// However, this does not update the cursor. So we create a TextNode to keep
// updating the indices. After the Move the Node is optionally deleted.
SwTextNode * pTNd = rPos.GetNode().GetTextNode();
if( pTNd && rPaM.GetPoint()->GetNode() != rPaM.GetMark()->GetNode() &&
( rPos.GetContentIndex() || ( pTNd->Len() && bCorrSavePam )) )
{
bSplit = true;
const sal_Int32 nMkContent = rPaM.GetMark()->GetContentIndex();
const std::shared_ptr<sw::mark::ContentIdxStore> pContentStore(sw::mark::ContentIdxStore::Create());
pContentStore->Save( m_rDoc, rPos.GetNodeIndex(), rPos.GetContentIndex(), true );
SwTextNode * pOrigNode = pTNd;
assert(*aSavePam.GetPoint() == *aSavePam.GetMark() &&
*aSavePam.GetPoint() == rPos);
assert(aSavePam.GetPoint()->GetContentNode() == pOrigNode);
assert(aSavePam.GetPoint()->GetNode() == rPos.GetNode());
assert(rPos.GetNodeIndex() == pOrigNode->GetIndex());
std::function<void (SwTextNode *, sw::mark::RestoreMode, bool)> restoreFunc(
[&](SwTextNode *const, sw::mark::RestoreMode const eMode, bool)
{
if (!pContentStore->Empty())
{
pContentStore->Restore(m_rDoc, pOrigNode->GetIndex()-SwNodeOffset(1), 0, true, false, eMode);
}
});
pTNd->SplitContentNode(rPos, &restoreFunc);
//A new node was inserted before the orig pTNd and the content up to
//rPos moved into it. The old node is returned with the remainder
//of the content in it.
//
//aSavePam was created with rPos, it continues to point to the
//old node, but with the *original* content index into the node.
//Seeing as all the orignode content before that index has
//been removed, the new index into the original node should now be set
//to 0 and the content index of rPos should also be adapted to the
//truncated node
assert(*aSavePam.GetPoint() == *aSavePam.GetMark() &&
*aSavePam.GetPoint() == rPos);
assert(aSavePam.GetPoint()->GetContentNode() == pOrigNode);
assert(aSavePam.GetPoint()->GetNode() == rPos.GetNode());
assert(rPos.GetNodeIndex() == pOrigNode->GetIndex());
aSavePam.GetPoint()->SetContent(0);
rPos = *aSavePam.GetMark() = *aSavePam.GetPoint();
// correct the PaM!
if( rPos.GetNode() == rPaM.GetMark()->GetNode() )
{
rPaM.GetMark()->Assign( rPos.GetNodeIndex() - SwNodeOffset(1) );
rPaM.GetMark()->SetContent( nMkContent );
}
}
// Put back the Pam by one "content"; so that it's always outside of
// the manipulated range.
// tdf#99692 don't Move() back if that would end up in another node
// because moving backward is not necessarily the inverse of forward then.
// (but do Move() back if we have split the node)
const bool bNullContent = !bSplit && aSavePam.GetPoint()->GetContentIndex() == 0;
if( bNullContent )
{
aSavePam.GetPoint()->Adjust(SwNodeOffset(-1));
}
else
{
bool const success(aSavePam.Move(fnMoveBackward, GoInContent));
assert(success);
(void) success;
}
// Copy all Bookmarks that are within the Move range into an array,
// that saves the position as an offset.
std::vector< ::sw::mark::SaveBookmark> aSaveBkmks;
DelBookmarks(
pStart->GetNode(),
pEnd->GetNode(),
&aSaveBkmks,
pStart->GetContentIndex(),
pEnd->GetContentIndex());
// If there is no range anymore due to the above deletions (e.g. the
// footnotes got deleted), it's still a valid Move!
if( *rPaM.GetPoint() != *rPaM.GetMark() )
{
// now do the actual move
m_rDoc.GetNodes().MoveRange( rPaM, rPos, m_rDoc.GetNodes() );
// after a MoveRange() the Mark is deleted
if ( rPaM.HasMark() ) // => no Move occurred!
{
return false;
}
}
else
rPaM.DeleteMark();
OSL_ENSURE( *aSavePam.GetMark() == rPos ||
( aSavePam.GetMark()->GetNode().GetContentNode() == nullptr ),
"PaM was not moved. Aren't there ContentNodes at the beginning/end?" );
*aSavePam.GetMark() = rPos;
rPaM.SetMark(); // create a Sel. around the new range
pTNd = aSavePam.GetPointNode().GetTextNode();
assert(!m_rDoc.GetIDocumentUndoRedo().DoesUndo());
bool bRemove = true;
// Do two Nodes have to be joined at the SavePam?
if (bSplit && pTNd)
{
if (pTNd->CanJoinNext())
{
// Always join next, because <pTNd> has to stay as it is.
// A join previous from its next would more or less delete <pTNd>
pTNd->JoinNext();
bRemove = false;
}
}
if (bNullContent)
{
aSavePam.GetPoint()->Adjust(SwNodeOffset(1));
}
else if (bRemove) // No move forward after joining with next paragraph
{
aSavePam.Move( fnMoveForward, GoInContent );
}
// Insert the Bookmarks back into the Document.
*rPaM.GetMark() = *aSavePam.Start();
for(auto& rBkmk : aSaveBkmks)
rBkmk.SetInDoc(
&m_rDoc,
rPaM.GetMark()->GetNode(),
rPaM.GetMark()->GetContentIndex());
*rPaM.GetPoint() = *aSavePam.End();
// Move the Flys to the new position.
// note: rPos is at the end here; can't really tell flys that used to be
// at the start of rPam from flys that used to be at the end of rPam
// unfortunately, so some of them are going to end up with wrong anchor...
RestFlyInRange( aSaveFlyArr, *rPaM.Start(), &rPos.GetNode() );
// restore redlines (if DOC_MOVEREDLINES is used)
if( !aSaveRedl.empty() )
{
lcl_RestoreRedlines( m_rDoc, *aSavePam.Start(), aSaveRedl );
}
if( bUpdateFootnote )
{
if( !aTmpFntIdx.empty() )
{
m_rDoc.GetFootnoteIdxs().insert( aTmpFntIdx );
aTmpFntIdx.clear();
}
m_rDoc.GetFootnoteIdxs().UpdateAllFootnote();
}
m_rDoc.getIDocumentState().SetModified();
return true;
}
bool DocumentContentOperationsManager::MoveNodeRange( SwNodeRange& rRange, SwNode& rDestNd,
SwMoveFlags eMvFlags )
{
// Moves all Nodes to the new position.
// Bookmarks are moved too (currently without Undo support).
// If footnotes are being moved to the special section, remove them now.
// Or else delete the Frames for all footnotes that are being moved
// and have it rebuild after the Move (footnotes can change pages).
// Additionally we have to correct the FootnoteIdx array's sorting.
bool bUpdateFootnote = false;
SwFootnoteIdxs aTmpFntIdx;
std::unique_ptr<SwUndoMove> pUndo;
if ((SwMoveFlags::CREATEUNDOOBJ & eMvFlags ) && m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
pUndo.reset(new SwUndoMove( m_rDoc, rRange, rDestNd ));
}
else
{
bUpdateFootnote = lcl_SaveFootnote( rRange.aStart.GetNode(), rRange.aEnd.GetNode(), rDestNd,
m_rDoc.GetFootnoteIdxs(), aTmpFntIdx );
}
SaveRedlines_t aSaveRedl;
std::vector<SwRangeRedline*> aSavRedlInsPosArr;
if( SwMoveFlags::REDLINES & eMvFlags && !m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty() )
{
lcl_SaveRedlines( rRange, aSaveRedl );
// Find all RedLines that end at the InsPos.
// These have to be moved back to the "old" position after the Move.
SwRedlineTable::size_type nRedlPos = m_rDoc.getIDocumentRedlineAccess().GetRedlinePos( rDestNd, RedlineType::Any );
if( SwRedlineTable::npos != nRedlPos )
{
const SwPosition *pRStt, *pREnd;
do {
SwRangeRedline* pTmp = m_rDoc.getIDocumentRedlineAccess().GetRedlineTable()[ nRedlPos ];
pRStt = pTmp->Start();
pREnd = pTmp->End();
if( pREnd->GetNode() == rDestNd && pRStt->GetNode() < rDestNd )
{
aSavRedlInsPosArr.push_back( pTmp );
}
} while( pRStt->GetNode() < rDestNd && ++nRedlPos < m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().size());
}
}
// Copy all Bookmarks that are within the Move range into an array
// that stores all references to positions as an offset.
// The final mapping happens after the Move.
std::vector< ::sw::mark::SaveBookmark> aSaveBkmks;
DelBookmarks(rRange.aStart.GetNode(), rRange.aEnd.GetNode(), &aSaveBkmks);
// Save the paragraph-bound Flys, so that they can be moved.
SaveFlyArr aSaveFlyArr;
if( !m_rDoc.GetSpzFrameFormats()->empty() )
SaveFlyInRange( rRange, aSaveFlyArr );
// Set it to before the Position, so that it cannot be moved further.
SwNodeIndex aIdx( rDestNd, -1 );
std::optional<SwNodeIndex> oSaveInsPos;
if( pUndo )
oSaveInsPos.emplace(rRange.aStart, -1 );
// move the Nodes
bool bNoDelFrames = bool(SwMoveFlags::NO_DELFRMS & eMvFlags);
if( m_rDoc.GetNodes().MoveNodes( rRange, m_rDoc.GetNodes(), rDestNd, !bNoDelFrames ) )
{
++aIdx; // again back to old position
if( oSaveInsPos )
++(*oSaveInsPos);
}
else
{
aIdx = rRange.aStart;
pUndo.reset();
}
// move the Flys to the new position
if( !aSaveFlyArr.empty() )
{
SwPosition const tmp(aIdx);
RestFlyInRange(aSaveFlyArr, tmp, nullptr);
}
// Add the Bookmarks back to the Document
for(auto& rBkmk : aSaveBkmks)
rBkmk.SetInDoc(&m_rDoc, aIdx.GetNode());
if( !aSavRedlInsPosArr.empty() )
{
for(SwRangeRedline* pTmp : aSavRedlInsPosArr)
{
if( m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().Contains( pTmp ) )
{
SwPosition* pEnd = pTmp->End();
pEnd->Assign(aIdx);
}
}
}
if( !aSaveRedl.empty() )
lcl_RestoreRedlines( m_rDoc, aIdx.GetIndex(), aSaveRedl );
if( pUndo )
{
pUndo->SetDestRange( aIdx.GetNode(), rDestNd, *oSaveInsPos );
m_rDoc.GetIDocumentUndoRedo().AppendUndo(std::move(pUndo));
}
oSaveInsPos.reset();
if( bUpdateFootnote )
{
if( !aTmpFntIdx.empty() )
{
m_rDoc.GetFootnoteIdxs().insert( aTmpFntIdx );
aTmpFntIdx.clear();
}
m_rDoc.GetFootnoteIdxs().UpdateAllFootnote();
}
m_rDoc.getIDocumentState().SetModified();
return true;
}
void DocumentContentOperationsManager::MoveAndJoin( SwPaM& rPaM, SwPosition& rPos )
{
SwNodeIndex aIdx( rPaM.Start()->GetNode() );
bool bJoinText = aIdx.GetNode().IsTextNode();
bool bOneNode = rPaM.GetPoint()->GetNode() == rPaM.GetMark()->GetNode();
--aIdx; // in front of the move area!
bool bRet = MoveRange( rPaM, rPos, SwMoveFlags::DEFAULT );
if( !bRet || bOneNode )
return;
if( bJoinText )
++aIdx;
SwTextNode * pTextNd = aIdx.GetNode().GetTextNode();
SwNodeIndex aNxtIdx( aIdx );
if( pTextNd && pTextNd->CanJoinNext( &aNxtIdx ) )
{
{ // Block so SwContentIndex into node is deleted before Join
m_rDoc.CorrRel( aNxtIdx.GetNode(),
SwPosition( *pTextNd, pTextNd->GetText().getLength() ),
0, true );
}
pTextNd->JoinNext();
}
}
// Overwrite only uses the point of the PaM, the mark is ignored; characters
// are replaced from point until the end of the node; at the end of the node,
// characters are inserted.
bool DocumentContentOperationsManager::Overwrite( const SwPaM &rRg, const OUString &rStr )
{
assert(rStr.getLength());
SwPosition& rPt = *const_cast<SwPosition*>(rRg.GetPoint());
if( m_rDoc.GetAutoCorrExceptWord() ) // Add to AutoCorrect
{
if( 1 == rStr.getLength() )
m_rDoc.GetAutoCorrExceptWord()->CheckChar( rPt, rStr[ 0 ] );
m_rDoc.DeleteAutoCorrExceptWord();
}
SwTextNode *pNode = rPt.GetNode().GetTextNode();
if (!pNode || rStr.getLength() > pNode->GetSpaceLeft()) // worst case: no erase
{
return false;
}
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().ClearRedo(); // AppendUndo not always called
}
const size_t nOldAttrCnt = pNode->GetpSwpHints()
? pNode->GetpSwpHints()->Count() : 0;
SwDataChanged aTmp( rRg );
sal_Int32 const nActualStart(rPt.GetContentIndex());
sal_Int32 nStart = 0;
bool bOldExpFlg = pNode->IsIgnoreDontExpand();
pNode->SetIgnoreDontExpand( true );
for( sal_Int32 nCnt = 0; nCnt < rStr.getLength(); ++nCnt )
{
// start behind the characters (to fix the attributes!)
nStart = rPt.GetContentIndex();
if (nStart < pNode->GetText().getLength())
{
lcl_SkipAttr( pNode, rPt, nStart );
}
sal_Unicode c = rStr[ nCnt ];
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
bool bMerged(false);
if (m_rDoc.GetIDocumentUndoRedo().DoesGroupUndo())
{
SwUndo *const pUndo = m_rDoc.GetUndoManager().GetLastUndo();
SwUndoOverwrite *const pUndoOW(
dynamic_cast<SwUndoOverwrite *>(pUndo) );
if (pUndoOW)
{
// if CanGrouping() returns true it's already merged
bMerged = pUndoOW->CanGrouping(m_rDoc, rPt, c);
}
}
if (!bMerged)
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo(
std::make_unique<SwUndoOverwrite>(m_rDoc, rPt, c) );
}
}
else
{
// start behind the characters (to fix the attributes!)
if (nStart < pNode->GetText().getLength())
rPt.AdjustContent(+1);
pNode->InsertText( OUString(c), rPt, SwInsertFlags::EMPTYEXPAND );
if( nStart+1 < rPt.GetContentIndex() )
{
rPt.SetContent(nStart);
pNode->EraseText( rPt, 1 );
rPt.AdjustContent(+1);
}
}
}
pNode->SetIgnoreDontExpand( bOldExpFlg );
const size_t nNewAttrCnt = pNode->GetpSwpHints()
? pNode->GetpSwpHints()->Count() : 0;
if( nOldAttrCnt != nNewAttrCnt )
{
const SwUpdateAttr aHint(0,0,0);
pNode->TriggerNodeUpdate(sw::UpdateAttrHint(&aHint, &aHint));
}
if (!m_rDoc.GetIDocumentUndoRedo().DoesUndo() &&
!m_rDoc.getIDocumentRedlineAccess().IsIgnoreRedline() && !m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty())
{
SwPaM aPam(rPt.GetNode(), nActualStart, rPt.GetNode(), rPt.GetContentIndex());
m_rDoc.getIDocumentRedlineAccess().DeleteRedline( aPam, true, RedlineType::Any );
}
else if( m_rDoc.getIDocumentRedlineAccess().IsRedlineOn() )
{
// FIXME: this redline is WRONG: there is no DELETE, and the skipped
// characters are also included in aPam
SwPaM aPam(rPt.GetNode(), nActualStart, rPt.GetNode(), rPt.GetContentIndex());
m_rDoc.getIDocumentRedlineAccess().AppendRedline( new SwRangeRedline( RedlineType::Insert, aPam ), true);
}
m_rDoc.getIDocumentState().SetModified();
return true;
}
bool DocumentContentOperationsManager::InsertString( const SwPaM &rRg, const OUString &rStr,
const SwInsertFlags nInsertMode )
{
// tdf#119019 accept tracked paragraph formatting to do not hide new insertions
if( m_rDoc.getIDocumentRedlineAccess().IsRedlineOn() )
{
RedlineFlags eOld = m_rDoc.getIDocumentRedlineAccess().GetRedlineFlags();
m_rDoc.getIDocumentRedlineAccess().AcceptRedlineParagraphFormatting( rRg );
if (eOld != m_rDoc.getIDocumentRedlineAccess().GetRedlineFlags())
m_rDoc.getIDocumentRedlineAccess().SetRedlineFlags( eOld );
}
// fetching DoesUndo is surprisingly expensive
bool bDoesUndo = m_rDoc.GetIDocumentUndoRedo().DoesUndo();
if (bDoesUndo)
m_rDoc.GetIDocumentUndoRedo().ClearRedo(); // AppendUndo not always called!
const SwPosition& rPos = *rRg.GetPoint();
if( m_rDoc.GetAutoCorrExceptWord() ) // add to auto correction
{
if( 1 == rStr.getLength() && m_rDoc.GetAutoCorrExceptWord()->IsDeleted() )
{
m_rDoc.GetAutoCorrExceptWord()->CheckChar( rPos, rStr[ 0 ] );
}
m_rDoc.DeleteAutoCorrExceptWord();
}
SwTextNode *const pNode = rPos.GetNode().GetTextNode();
if(!pNode)
return false;
SwDataChanged aTmp( rRg );
if (!bDoesUndo || !m_rDoc.GetIDocumentUndoRedo().DoesGroupUndo())
{
OUString const ins(pNode->InsertText(rStr, rPos, nInsertMode));
if (bDoesUndo)
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo(
std::make_unique<SwUndoInsert>(rPos.GetNode(),
rPos.GetContentIndex(), ins.getLength(), nInsertMode));
}
}
else
{ // if Undo and grouping is enabled, everything changes!
SwUndoInsert * pUndo = nullptr;
// don't group the start if hints at the start should be expanded
if (!(nInsertMode & SwInsertFlags::FORCEHINTEXPAND))
{
SwUndo *const pLastUndo = m_rDoc.GetUndoManager().GetLastUndo();
SwUndoInsert *const pUndoInsert(
dynamic_cast<SwUndoInsert *>(pLastUndo) );
if (pUndoInsert && pUndoInsert->CanGrouping(rPos))
{
pUndo = pUndoInsert;
}
}
CharClass const& rCC = GetAppCharClass();
sal_Int32 nInsPos = rPos.GetContentIndex();
if (!pUndo)
{
pUndo = new SwUndoInsert( rPos.GetNode(), nInsPos, 0, nInsertMode,
!rCC.isLetterNumeric( rStr, 0 ) );
m_rDoc.GetIDocumentUndoRedo().AppendUndo( std::unique_ptr<SwUndo>(pUndo) );
}
OUString const ins(pNode->InsertText(rStr, rPos, nInsertMode));
for (sal_Int32 i = 0; i < ins.getLength(); ++i)
{
nInsPos++;
// if CanGrouping() returns true, everything has already been done
if (!pUndo->CanGrouping(ins[i]))
{
pUndo = new SwUndoInsert(rPos.GetNode(), nInsPos, 1, nInsertMode,
!rCC.isLetterNumeric(ins, i));
m_rDoc.GetIDocumentUndoRedo().AppendUndo( std::unique_ptr<SwUndo>(pUndo) );
}
}
}
// To-Do - add 'SwExtraRedlineTable' also ?
if( m_rDoc.getIDocumentRedlineAccess().IsRedlineOn() || (!m_rDoc.getIDocumentRedlineAccess().IsIgnoreRedline() && !m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty() ))
{
SwPaM aPam( rPos.GetNode(), aTmp.GetContent(),
rPos.GetNode(), rPos.GetContentIndex());
if( m_rDoc.getIDocumentRedlineAccess().IsRedlineOn() )
{
m_rDoc.getIDocumentRedlineAccess().AppendRedline(
new SwRangeRedline( RedlineType::Insert, aPam ), true);
}
else
{
m_rDoc.getIDocumentRedlineAccess().SplitRedline( aPam );
}
}
m_rDoc.getIDocumentState().SetModified();
return true;
}
void DocumentContentOperationsManager::SetIME(bool bIME)
{
m_bIME = bIME;
}
bool DocumentContentOperationsManager::GetIME() const
{
return m_bIME;
}
void DocumentContentOperationsManager::TransliterateText(
const SwPaM& rPaM,
utl::TransliterationWrapper& rTrans )
{
std::unique_ptr<SwUndoTransliterate> pUndo;
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
pUndo.reset(new SwUndoTransliterate( rPaM, rTrans ));
auto [pStart, pEnd] = rPaM.StartEnd(); // SwPosition*
SwNodeOffset nSttNd = pStart->GetNodeIndex(),
nEndNd = pEnd->GetNodeIndex();
sal_Int32 nSttCnt = pStart->GetContentIndex();
sal_Int32 nEndCnt = pEnd->GetContentIndex();
SwTextNode* pTNd = pStart->GetNode().GetTextNode();
bool bNoSelection = (pStart == pEnd) && pTNd; // no selection?
if ( bNoSelection )
{
/* Check if cursor is inside of a word */
assert(g_pBreakIt && g_pBreakIt->GetBreakIter().is());
Boundary aBndry = g_pBreakIt->GetBreakIter()->getWordBoundary(
pTNd->GetText(), nSttCnt,
g_pBreakIt->GetLocale( pTNd->GetLang( nSttCnt ) ),
WordType::ANY_WORD /*ANYWORD_IGNOREWHITESPACES*/,
true);
if( aBndry.startPos < nSttCnt && nSttCnt < aBndry.endPos )
{
/* Cursor is inside of a word */
if (rTrans.getType() == TransliterationFlags::SENTENCE_CASE) {
/* set current sentence as 'area of effect' */
nSttCnt = g_pBreakIt->GetBreakIter()->beginOfSentence(
pTNd->GetText(), nSttCnt,
g_pBreakIt->GetLocale( pTNd->GetLang( nSttCnt ) ) );
nEndCnt = g_pBreakIt->GetBreakIter()->endOfSentence(
pTNd->GetText(), nEndCnt,
g_pBreakIt->GetLocale( pTNd->GetLang( nEndCnt ) ) );
} else {
/* Set current word as 'area of effect' */
nSttCnt = aBndry.startPos;
nEndCnt = aBndry.endPos;
}
} else {
/* Cursor is not inside of a word. Nothing should happen. */
/* Except in the case of change tracking, when the cursor is at the end of the change */
/* Recognize and reject the previous deleted and inserted words to allow to cycle */
IDocumentRedlineAccess& rIDRA = m_rDoc.getIDocumentRedlineAccess();
if ( IDocumentRedlineAccess::IsShowChanges( rIDRA.GetRedlineFlags() ) &&
pStart->GetContentIndex() > 0 )
{
SwPosition aPos(*pStart->GetContentNode(), pStart->GetContentIndex() - 1);
SwRedlineTable::size_type n = 0;
const SwRangeRedline* pFnd =
rIDRA.GetRedlineTable().FindAtPosition( aPos, n );
if ( pFnd && RedlineType::Insert == pFnd->GetType() && n > 0 )
{
const SwRangeRedline* pFnd2 = rIDRA.GetRedlineTable()[n-1];
if ( RedlineType::Delete == pFnd2->GetType() &&
m_rDoc.getIDocumentLayoutAccess().GetCurrentViewShell() &&
*pFnd2->End() == *pFnd->Start() &&
pFnd->GetAuthor() == pFnd2->GetAuthor() )
{
SwPosition aPos2(*pFnd2->End());
rIDRA.RejectRedline(*pFnd, true);
rIDRA.RejectRedline(*pFnd2, true);
// positionate the text cursor inside the changed word to allow to cycle
if ( SwWrtShell *pWrtShell = dynamic_cast<SwWrtShell*>(
m_rDoc.getIDocumentLayoutAccess().GetCurrentViewShell()) )
{
pWrtShell->GetCursor()->GetPoint()->
Assign(*aPos2.GetContentNode(), aPos2.GetContentIndex() - 1);
}
}
}
}
return;
}
}
else
{
bool bHasTrackedChange = false;
IDocumentRedlineAccess& rIDRA = m_rDoc.getIDocumentRedlineAccess();
if ( IDocumentRedlineAccess::IsShowChanges( rIDRA.GetRedlineFlags() ) &&
pEnd->GetContentIndex() > 0 )
{
// search all own redlines within the selected area
SwRedlineTable::size_type n = SwRedlineTable::npos;
const SwRedlineTable& aRedlineTable = rIDRA.GetRedlineTable();
for( SwRedlineTable::size_type m = 0; m < aRedlineTable.size(); ++m )
{
const SwRangeRedline* pRedline = aRedlineTable[ m ];
if ( *pRedline->Start() > *pEnd )
break;
if ( *pRedline->Start() >= *pStart )
n = m;
}
if ( n != SwRedlineTable::npos && n > 0 )
{
SwWrtShell *pWrtShell = dynamic_cast<SwWrtShell*>(
m_rDoc.getIDocumentLayoutAccess().GetCurrentViewShell());
sal_Int32 nRejectedCharacters = 0;
SwRangeRedline* pFnd = rIDRA.GetRedlineTable()[n];
SwRangeRedline* pFnd2 = rIDRA.GetRedlineTable()[--n];
// loop on all redlines of a case changing, and reject them
while ( ( ( RedlineType::Insert == pFnd->GetType() &&
RedlineType::Delete == pFnd2->GetType() ) ||
( RedlineType::Delete == pFnd->GetType() &&
RedlineType::Insert == pFnd2->GetType() ) ) &&
pWrtShell &&
// use time stamp to recognize the multiple selections in the text,
// not only the changes from the same author within the (sometimes
// incomplete) selection
( pFnd2->GetTimeStamp() == pFnd->GetTimeStamp() ||
( pStart->GetContentNode() < pFnd2->Start()->GetContentNode() ||
( pStart->GetContentNode() == pFnd2->Start()->GetContentNode() &&
nSttCnt <= pFnd2->Start()->GetContentIndex() ) ) ) &&
pFnd->GetAuthor() == pFnd2->GetAuthor() )
{
bHasTrackedChange = true;
if ( RedlineType::Insert == pFnd->GetType() )
nRejectedCharacters += pFnd->GetText().getLength();
rIDRA.RejectRedline(*pFnd, true);
pFnd = pFnd2;
if ( n == 0 )
break;
assert(n > 0 && "coverity 2024.6.1");
pFnd2 = rIDRA.GetRedlineTable()[--n];
}
// remove the last item and restore the original selection within the node
if ( bHasTrackedChange )
{
if ( nSttNd == nEndNd )
{
pWrtShell->GetCursor()->GetPoint()->
Assign(*rPaM.Start()->GetContentNode(), nSttCnt);
if ( nEndCnt >= nRejectedCharacters )
pWrtShell->GetCursor()->GetMark()->
Assign(*rPaM.End()->GetContentNode(), nEndCnt - nRejectedCharacters);
}
rIDRA.RejectRedline(*pFnd, true);
}
}
}
// TODO handle title case to lowercase
if ( bHasTrackedChange )
return;
}
bool bUseRedlining = m_rDoc.getIDocumentRedlineAccess().IsRedlineOn();
// as a workaround for a known performance problem, switch off redlining
// to avoid freezing, if transliteration could result too many redlines
if ( bUseRedlining )
{
const sal_uLong nMaxRedlines = 500;
const bool bIsTitleCase = rTrans.getType() == TransliterationFlags::TITLE_CASE;
sal_uLong nAffectedNodes = 0;
sal_uLong nAffectedChars = nEndCnt;
SwNodeIndex aIdx( pStart->GetNode() );
for( ; aIdx.GetIndex() <= nEndNd; ++aIdx )
{
SwTextNode* pAffectedNode = aIdx.GetNode().GetTextNode();
// don't count not text nodes or empty text nodes
if( !pAffectedNode || pAffectedNode->GetText().isEmpty() )
continue;
nAffectedNodes++;
// count characters of the node (the last - maybe partially
// selected - node was counted at initialization of nAffectedChars)
if( aIdx.GetIndex() < nEndNd )
nAffectedChars += pAffectedNode->GetText().getLength();
// transliteration creates n redlines for n nodes, except in the
// case of title case, where it creates n redlines for n words
if( nAffectedNodes > nMaxRedlines ||
// estimate word count based on the character count, where
// 6 = average English word length is ~5 letters + space
( bIsTitleCase && (nAffectedChars - nSttCnt)/6 > nMaxRedlines ) )
{
bUseRedlining = false;
break;
}
}
}
if( nSttNd != nEndNd ) // is more than one text node involved?
{
// iterate over all affected text nodes, the first and the last one
// may be incomplete because the selection starts and/or ends there
SwNodeIndex aIdx( pStart->GetNode() );
if( nSttCnt )
{
++aIdx;
if( pTNd )
{
pTNd->TransliterateText(
rTrans, nSttCnt, pTNd->GetText().getLength(), pUndo.get(), bUseRedlining);
}
}
for( ; aIdx.GetIndex() < nEndNd; ++aIdx )
{
pTNd = aIdx.GetNode().GetTextNode();
if (pTNd)
{
pTNd->TransliterateText(
rTrans, 0, pTNd->GetText().getLength(), pUndo.get(), bUseRedlining);
}
}
if( nEndCnt && nullptr != ( pTNd = pEnd->GetNode().GetTextNode() ))
{
pTNd->TransliterateText( rTrans, 0, nEndCnt, pUndo.get(), bUseRedlining );
}
}
else if( pTNd && nSttCnt < nEndCnt )
{
pTNd->TransliterateText( rTrans, nSttCnt, nEndCnt, pUndo.get(), bUseRedlining );
}
if( pUndo && pUndo->HasData() )
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo(std::move(pUndo));
}
// restore selection after tracked changes
if ( !bNoSelection && bUseRedlining && nSttNd == nEndNd )
{
if ( SwWrtShell *pWrtShell = dynamic_cast<SwWrtShell*>(
m_rDoc.getIDocumentLayoutAccess().GetCurrentViewShell()) )
{
*pWrtShell->GetCursor()->GetMark() = *pWrtShell->GetCursor()->End();
pWrtShell->GetCursor()->GetPoint()->Assign(*pStart->GetContentNode(), nSttCnt);
}
}
m_rDoc.getIDocumentState().SetModified();
}
SwFlyFrameFormat* DocumentContentOperationsManager::InsertGraphic(
const SwPaM &rRg,
const OUString& rGrfName,
const OUString& rFltName,
const Graphic* pGraphic,
const SfxItemSet* pFlyAttrSet,
const SfxItemSet* pGrfAttrSet,
SwFrameFormat* pFrameFormat )
{
if( !pFrameFormat )
pFrameFormat = m_rDoc.getIDocumentStylePoolAccess().GetFrameFormatFromPool( RES_POOLFRM_GRAPHIC );
SwGrfNode* pSwGrfNode = SwNodes::MakeGrfNode(
m_rDoc.GetNodes().GetEndOfAutotext(),
rGrfName, rFltName, pGraphic,
m_rDoc.GetDfltGrfFormatColl() );
SwFlyFrameFormat* pSwFlyFrameFormat = InsNoTextNode( *rRg.GetPoint(), pSwGrfNode,
pFlyAttrSet, pGrfAttrSet, pFrameFormat );
return pSwFlyFrameFormat;
}
SwFlyFrameFormat* DocumentContentOperationsManager::InsertEmbObject(
const SwPaM &rRg, const svt::EmbeddedObjectRef& xObj,
SfxItemSet* pFlyAttrSet)
{
sal_uInt16 nId = RES_POOLFRM_OLE;
if (xObj.is())
{
SvGlobalName aClassName( xObj->getClassID() );
if (SotExchange::IsMath(aClassName))
{
nId = RES_POOLFRM_FORMEL;
}
}
SwFrameFormat* pFrameFormat = m_rDoc.getIDocumentStylePoolAccess().GetFrameFormatFromPool( nId );
return InsNoTextNode( *rRg.GetPoint(), m_rDoc.GetNodes().MakeOLENode(
m_rDoc.GetNodes().GetEndOfAutotext(),
xObj,
m_rDoc.GetDfltGrfFormatColl() ),
pFlyAttrSet, nullptr,
pFrameFormat );
}
SwFlyFrameFormat* DocumentContentOperationsManager::InsertOLE(const SwPaM &rRg, const OUString& rObjName,
sal_Int64 nAspect,
const SfxItemSet* pFlyAttrSet,
const SfxItemSet* pGrfAttrSet)
{
SwFrameFormat* pFrameFormat = m_rDoc.getIDocumentStylePoolAccess().GetFrameFormatFromPool( RES_POOLFRM_OLE );
return InsNoTextNode( *rRg.GetPoint(),
m_rDoc.GetNodes().MakeOLENode(
m_rDoc.GetNodes().GetEndOfAutotext(),
rObjName,
nAspect,
m_rDoc.GetDfltGrfFormatColl(),
nullptr ),
pFlyAttrSet, pGrfAttrSet,
pFrameFormat );
}
void DocumentContentOperationsManager::ReRead( SwPaM& rPam, const OUString& rGrfName,
const OUString& rFltName, const Graphic* pGraphic )
{
SwGrfNode *pGrfNd;
if( !(( !rPam.HasMark()
|| rPam.GetPoint()->GetNodeIndex() == rPam.GetMark()->GetNodeIndex() )
&& nullptr != ( pGrfNd = rPam.GetPoint()->GetNode().GetGrfNode() )) )
return;
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo(std::make_unique<SwUndoReRead>(rPam, *pGrfNd));
}
// Because we don't know if we can mirror the graphic, the mirror attribute is always reset
if( MirrorGraph::Dont != pGrfNd->GetSwAttrSet().
GetMirrorGrf().GetValue() )
pGrfNd->SetAttr( SwMirrorGrf() );
pGrfNd->ReRead( rGrfName, rFltName, pGraphic );
m_rDoc.getIDocumentState().SetModified();
}
// Insert drawing object, which has to be already inserted in the DrawModel
SwDrawFrameFormat* DocumentContentOperationsManager::InsertDrawObj(
const SwPaM &rRg,
SdrObject& rDrawObj,
const SfxItemSet& rFlyAttrSet )
{
SwDrawFrameFormat* pFormat = m_rDoc.MakeDrawFrameFormat( UIName(), m_rDoc.GetDfltFrameFormat() );
const SwFormatAnchor* pAnchor = rFlyAttrSet.GetItemIfSet( RES_ANCHOR, false );
pFormat->SetFormatAttr( rFlyAttrSet );
// Didn't set the Anchor yet?
// DrawObjecte must never end up in the Header/Footer!
RndStdIds eAnchorId = pAnchor != nullptr ? pAnchor->GetAnchorId() : pFormat->GetAnchor().GetAnchorId();
const bool bIsAtContent = (RndStdIds::FLY_AT_PAGE != eAnchorId);
const SwPosition* pChkPos = nullptr;
if ( pAnchor == nullptr )
{
pChkPos = rRg.GetPoint();
}
else if ( bIsAtContent )
{
pChkPos =
pAnchor->GetContentAnchor() ? pAnchor->GetContentAnchor() : rRg.GetPoint();
}
// allow drawing objects in header/footer, but control objects aren't allowed in header/footer.
if( pChkPos != nullptr
&& ::CheckControlLayer( &rDrawObj )
&& m_rDoc.IsInHeaderFooter( pChkPos->GetNode() ) )
{
// apply at-page anchor format
eAnchorId = RndStdIds::FLY_AT_PAGE;
pFormat->SetFormatAttr( SwFormatAnchor( eAnchorId ) );
}
else if( pAnchor == nullptr
|| ( bIsAtContent
&& pAnchor->GetAnchorNode() == nullptr ) )
{
// apply anchor format
SwFormatAnchor aAnch( pAnchor != nullptr ? *pAnchor : pFormat->GetAnchor() );
eAnchorId = aAnch.GetAnchorId();
if ( eAnchorId == RndStdIds::FLY_AT_FLY )
{
const SwStartNode* pStartNode = rRg.GetPointNode().FindFlyStartNode();
assert(pStartNode);
SwPosition aPos(*pStartNode);
aAnch.SetAnchor( &aPos );
}
else
{
aAnch.SetAnchor( rRg.GetPoint() );
if ( eAnchorId == RndStdIds::FLY_AT_PAGE )
{
eAnchorId = dynamic_cast<const SdrUnoObj*>( &rDrawObj) != nullptr ? RndStdIds::FLY_AS_CHAR : RndStdIds::FLY_AT_PARA;
aAnch.SetType( eAnchorId );
}
}
pFormat->SetFormatAttr( aAnch );
}
// insert text attribute for as-character anchored drawing object
if ( eAnchorId == RndStdIds::FLY_AS_CHAR )
{
bool bAnchorAtPageAsFallback = true;
const SwFormatAnchor& rDrawObjAnchorFormat = pFormat->GetAnchor();
if ( rDrawObjAnchorFormat.GetAnchorNode() != nullptr )
{
SwTextNode* pAnchorTextNode =
rDrawObjAnchorFormat.GetAnchorNode()->GetTextNode();
if ( pAnchorTextNode != nullptr )
{
const sal_Int32 nStt = rDrawObjAnchorFormat.GetContentAnchor()->GetContentIndex();
SwFormatFlyCnt aFormat( pFormat );
pAnchorTextNode->InsertItem( aFormat, nStt, nStt );
bAnchorAtPageAsFallback = false;
}
}
if ( bAnchorAtPageAsFallback )
{
OSL_ENSURE( false, "DocumentContentOperationsManager::InsertDrawObj(..) - missing content anchor for as-character anchored drawing object --> anchor at-page" );
pFormat->SetFormatAttr( SwFormatAnchor( RndStdIds::FLY_AT_PAGE ) );
}
}
SwDrawContact* pContact = new SwDrawContact( pFormat, &rDrawObj );
// Create Frames if necessary
if( m_rDoc.getIDocumentLayoutAccess().GetCurrentViewShell() )
{
// create layout representation
pFormat->MakeFrames();
// #i42319# - follow-up of #i35635#
// move object to visible layer
// #i79391#
if ( pContact->GetAnchorFrame() )
{
pContact->MoveObjToVisibleLayer( &rDrawObj );
}
}
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo( std::make_unique<SwUndoInsLayFormat>(pFormat, SwNodeOffset(0), 0) );
}
m_rDoc.getIDocumentState().SetModified();
return pFormat;
}
bool DocumentContentOperationsManager::SplitNode( const SwPosition &rPos, bool bChkTableStart )
{
SwContentNode *pNode = rPos.GetNode().GetContentNode();
if(nullptr == pNode)
return false;
{
// BUG 26675: Send DataChanged before deleting, so that we notice which objects are in scope.
// After that they can be before/after the position.
SwDataChanged aTmp( m_rDoc, rPos );
}
SwUndoSplitNode* pUndo = nullptr;
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().ClearRedo();
// insert the Undo object (currently only for TextNode)
if( pNode->IsTextNode() )
{
pUndo = new SwUndoSplitNode( m_rDoc, rPos, bChkTableStart );
m_rDoc.GetIDocumentUndoRedo().AppendUndo(std::unique_ptr<SwUndo>(pUndo));
}
}
// Update the rsid of the old and the new node unless
// the old node is split at the beginning or at the end
SwTextNode *pTextNode = rPos.GetNode().GetTextNode();
const sal_Int32 nPos = rPos.GetContentIndex();
if( pTextNode && nPos && nPos != pTextNode->Len() )
{
m_rDoc.UpdateParRsid( pTextNode );
}
//JP 28.01.97: Special case for SplitNode at table start:
// If it is at the beginning of a Doc/Fly/Footer/... or right at after a table
// then insert a paragraph before it.
if( bChkTableStart && !rPos.GetContentIndex() && pNode->IsTextNode() )
{
SwNodeOffset nPrevPos = rPos.GetNodeIndex() - 1;
SwTableNode* pTableNd;
const SwNode* pNd = m_rDoc.GetNodes()[ nPrevPos ];
if( pNd->IsStartNode() &&
SwTableBoxStartNode == static_cast<const SwStartNode*>(pNd)->GetStartNodeType() &&
nullptr != ( pTableNd = m_rDoc.GetNodes()[ --nPrevPos ]->GetTableNode() ) &&
((( pNd = m_rDoc.GetNodes()[ --nPrevPos ])->IsStartNode() &&
SwTableBoxStartNode != static_cast<const SwStartNode*>(pNd)->GetStartNodeType() )
|| ( pNd->IsEndNode() && pNd->StartOfSectionNode()->IsTableNode() )
|| pNd->IsContentNode() ))
{
if( pNd->IsContentNode() )
{
//JP 30.04.99 Bug 65660:
// There are no page breaks outside of the normal body area,
// so this is not a valid condition to insert a paragraph.
if( nPrevPos < m_rDoc.GetNodes().GetEndOfExtras().GetIndex() )
pNd = nullptr;
else
{
// Only if the table has page breaks!
const SwFrameFormat* pFrameFormat = pTableNd->GetTable().GetFrameFormat();
if( SfxItemState::SET != pFrameFormat->GetItemState(RES_PAGEDESC, false) &&
SfxItemState::SET != pFrameFormat->GetItemState( RES_BREAK, false ) )
pNd = nullptr;
}
}
if( pNd )
{
SwTextNode* pTextNd = m_rDoc.GetNodes().MakeTextNode(
*pTableNd,
m_rDoc.getIDocumentStylePoolAccess().GetTextCollFromPool( RES_POOLCOLL_TEXT ));
if( pTextNd )
{
const_cast<SwPosition&>(rPos).Assign( pTableNd->GetIndex() - SwNodeOffset(1) );
// only add page breaks/styles to the body area
if( nPrevPos > m_rDoc.GetNodes().GetEndOfExtras().GetIndex() )
{
SwFrameFormat* pFrameFormat = pTableNd->GetTable().GetFrameFormat();
const SfxPoolItem *pItem;
if( SfxItemState::SET == pFrameFormat->GetItemState( RES_PAGEDESC,
false, &pItem ) )
{
pTextNd->SetAttr( *pItem );
pFrameFormat->ResetFormatAttr( RES_PAGEDESC );
}
if( SfxItemState::SET == pFrameFormat->GetItemState( RES_BREAK,
false, &pItem ) )
{
pTextNd->SetAttr( *pItem );
pFrameFormat->ResetFormatAttr( RES_BREAK );
}
}
if( pUndo )
pUndo->SetTableFlag();
m_rDoc.getIDocumentState().SetModified();
return true;
}
}
}
}
const std::shared_ptr<sw::mark::ContentIdxStore> pContentStore(sw::mark::ContentIdxStore::Create());
pContentStore->Save( m_rDoc, rPos.GetNodeIndex(), rPos.GetContentIndex(), true );
assert(pNode->IsTextNode());
std::function<void (SwTextNode *, sw::mark::RestoreMode, bool bAtStart)> restoreFunc(
[&](SwTextNode *const, sw::mark::RestoreMode const eMode, bool const bAtStart)
{
if (!pContentStore->Empty())
{ // move all bookmarks, TOXMarks, FlyAtCnt
pContentStore->Restore(m_rDoc, rPos.GetNodeIndex()-SwNodeOffset(1), 0, true, bAtStart && (eMode & sw::mark::RestoreMode::Flys), eMode);
}
if (eMode & sw::mark::RestoreMode::NonFlys)
{
// To-Do - add 'SwExtraRedlineTable' also ?
if (m_rDoc.getIDocumentRedlineAccess().IsRedlineOn() ||
(!m_rDoc.getIDocumentRedlineAccess().IsIgnoreRedline() &&
!m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty()))
{
SwPaM aPam( rPos );
aPam.SetMark();
aPam.Move( fnMoveBackward );
if (m_rDoc.getIDocumentRedlineAccess().IsRedlineOn())
{
m_rDoc.getIDocumentRedlineAccess().AppendRedline(
new SwRangeRedline(RedlineType::Insert, aPam), true);
}
else
{
m_rDoc.getIDocumentRedlineAccess().SplitRedline(aPam);
}
}
}
});
pNode->GetTextNode()->SplitContentNode(rPos, &restoreFunc);
m_rDoc.getIDocumentState().SetModified();
return true;
}
bool DocumentContentOperationsManager::AppendTextNode( SwPosition& rPos )
{
// create new node before EndOfContent
SwTextNode * pCurNode = rPos.GetNode().GetTextNode();
if( !pCurNode )
{
// so then one can be created!
SwNodeIndex aIdx( rPos.GetNode(), 1 );
pCurNode = m_rDoc.GetNodes().MakeTextNode( aIdx.GetNode(),
m_rDoc.getIDocumentStylePoolAccess().GetTextCollFromPool( RES_POOLCOLL_STANDARD ));
}
else
pCurNode = pCurNode->AppendNode( rPos )->GetTextNode();
rPos.Adjust(SwNodeOffset(1));
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo( std::make_unique<SwUndoInsert>( rPos.GetNode() ) );
}
// To-Do - add 'SwExtraRedlineTable' also ?
if( m_rDoc.getIDocumentRedlineAccess().IsRedlineOn() || (!m_rDoc.getIDocumentRedlineAccess().IsIgnoreRedline() && !m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty() ))
{
SwPaM aPam( rPos );
aPam.SetMark();
aPam.Move( fnMoveBackward );
if( m_rDoc.getIDocumentRedlineAccess().IsRedlineOn() )
m_rDoc.getIDocumentRedlineAccess().AppendRedline( new SwRangeRedline( RedlineType::Insert, aPam ), true);
else
m_rDoc.getIDocumentRedlineAccess().SplitRedline( aPam );
}
m_rDoc.getIDocumentState().SetModified();
return true;
}
bool DocumentContentOperationsManager::ReplaceRange( SwPaM& rPam, const OUString& rStr,
const bool bRegExReplace )
{
// unfortunately replace works slightly differently from delete,
// so we cannot use lcl_DoWithBreaks here...
std::vector<std::pair<SwNodeOffset, sal_Int32>> Breaks;
SwPaM aPam( *rPam.GetMark(), *rPam.GetPoint() );
aPam.Normalize(false);
if (aPam.GetPoint()->GetNode() != aPam.GetMark()->GetNode())
{
aPam.Move(fnMoveBackward);
}
OSL_ENSURE((aPam.GetPoint()->GetNode() == aPam.GetMark()->GetNode()), "invalid pam?");
sw::CalcBreaks(Breaks, aPam);
while (!Breaks.empty() // skip over prefix of dummy chars
&& (aPam.GetMark()->GetNodeIndex() == Breaks.begin()->first)
&& (aPam.GetMark()->GetContentIndex() == Breaks.begin()->second))
{
// skip!
aPam.GetMark()->AdjustContent(+1); // always in bounds if Breaks valid
Breaks.erase(Breaks.begin());
}
*rPam.Start() = *aPam.GetMark(); // update start of original pam w/ prefix
if (Breaks.empty())
{
// park aPam somewhere so it does not point to node that is deleted
aPam.DeleteMark();
aPam.GetPoint()->Assign(m_rDoc.GetNodes().GetEndOfContent());
return ReplaceRangeImpl(rPam, rStr, bRegExReplace); // original pam!
}
// Deletion must be split into several parts if the text node
// contains a text attribute with end and with dummy character
// and the selection does not contain the text attribute completely,
// but overlaps its start (left), where the dummy character is.
bool bRet( true );
// iterate from end to start, to avoid invalidating the offsets!
auto iter( Breaks.rbegin() );
SwNodeOffset nOffset(0);
SwNodes const& rNodes(rPam.GetPoint()->GetNodes());
OSL_ENSURE(aPam.GetPoint() == aPam.End(), "wrong!");
SwPosition & rEnd( *aPam.End() );
SwPosition & rStart( *aPam.Start() );
// set end of temp pam to original end (undo Move backward above)
rEnd = *rPam.End();
// after first deletion, rEnd will point into the original text node again!
while (iter != Breaks.rend())
{
rStart.Assign(*rNodes[iter->first - nOffset]->GetTextNode(), iter->second + 1);
if (rStart < rEnd) // check if part is empty
{
bRet &= (m_rDoc.getIDocumentRedlineAccess().IsRedlineOn())
? DeleteAndJoinWithRedlineImpl(aPam, SwDeleteFlags::Default)
: DeleteAndJoinImpl(aPam, SwDeleteFlags::Default);
nOffset = iter->first - rStart.GetNodeIndex(); // deleted fly nodes...
}
rEnd.Assign(*rNodes[iter->first - nOffset]->GetTextNode(), iter->second);
++iter;
}
rStart = *rPam.Start(); // set to original start
assert(rStart < rEnd && "replace part empty!");
if (rStart < rEnd) // check if part is empty
{
bRet &= ReplaceRangeImpl(aPam, rStr, bRegExReplace);
}
rPam = aPam; // update original pam (is this required?)
return bRet;
}
bool DocumentContentOperationsManager::InsertPoolItem(
const SwPaM &rRg,
const SfxPoolItem &rHt,
const SetAttrMode nFlags,
SwRootFrame const*const pLayout,
SwTextAttr **ppNewTextAttr)
{
SwHistory* pHistory = nullptr;
SwDataChanged aTmp( rRg );
std::unique_ptr<SwUndoAttr> pUndoAttr;
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().ClearRedo();
pUndoAttr.reset(new SwUndoAttr( rRg, rHt, nFlags ));
pHistory = &pUndoAttr->GetHistory();
}
if (nFlags & SetAttrMode::REMOVE_ALL_ATTR)
{
std::shared_ptr<const SfxItemSet> pDelSet = lcl_createDelSet(m_rDoc);
SwPosition aStart(*rRg.GetMark()->GetNode().GetContentNode(), rRg.GetMark()->GetContentIndex());
SwPosition aEnd(*rRg.GetPoint()->GetNode().GetContentNode(), rRg.GetPoint()->GetContentIndex());
sw::DocumentContentOperationsManager::ParaRstFormat aPara(
&aStart, &aEnd, pHistory, nullptr, nullptr /* //TODO: is layout required? m_rDoc.GetLayout()*/);
// aPara.pFormatColl = pPara->pFormatColl;
aPara.bReset = true;
// #i62675#
aPara.bResetListAttrs = true;
aPara.bResetAllCharAttrs = true;
aPara.pDelSet = pDelSet.get();
m_rDoc.GetNodes().ForEach(
aStart.GetNode().GetIndex(),
aEnd.GetNode().GetIndex(),
::sw::DocumentContentOperationsManager::lcl_RstTextAttr,
&aPara);
}
SfxItemSet aSet( m_rDoc.GetAttrPool(), rHt.Which(), rHt.Which() );
aSet.Put( rHt );
const bool bRet = lcl_InsAttr(m_rDoc, rRg, aSet, nFlags, pUndoAttr.get(), pLayout, ppNewTextAttr);
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo( std::move(pUndoAttr) );
}
if( bRet )
{
m_rDoc.getIDocumentState().SetModified();
}
return bRet;
}
void DocumentContentOperationsManager::InsertItemSet ( const SwPaM &rRg, const SfxItemSet &rSet,
const SetAttrMode nFlags, SwRootFrame const*const pLayout)
{
SwDataChanged aTmp( rRg );
std::unique_ptr<SwUndoAttr> pUndoAttr;
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().ClearRedo();
pUndoAttr.reset(new SwUndoAttr( rRg, rSet, nFlags ));
}
bool bRet = lcl_InsAttr(m_rDoc, rRg, rSet, nFlags, pUndoAttr.get(), pLayout, /*ppNewTextAttr*/nullptr );
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo( std::move(pUndoAttr) );
}
if( bRet )
m_rDoc.getIDocumentState().SetModified();
}
void DocumentContentOperationsManager::RemoveLeadingWhiteSpace(const SwPosition & rPos )
{
const SwTextNode* pTNd = rPos.GetNode().GetTextNode();
if ( !pTNd )
return;
const OUString& rText = pTNd->GetText();
sal_Int32 nIdx = 0;
while (nIdx < rText.getLength())
{
sal_Unicode const cCh = rText[nIdx];
if (('\t' != cCh) && (' ' != cCh))
{
break;
}
++nIdx;
}
if ( nIdx > 0 )
{
SwPaM aPam(rPos);
aPam.GetPoint()->SetContent(0);
aPam.SetMark();
aPam.GetMark()->SetContent(nIdx);
DeleteRange( aPam );
}
}
void DocumentContentOperationsManager::RemoveLeadingWhiteSpace(SwPaM& rPaM )
{
for (SwPaM& rSel :rPaM.GetRingContainer())
{
SwNodeOffset nStt = rSel.Start()->GetNodeIndex();
SwNodeOffset nEnd = rSel.End()->GetNodeIndex();
for (SwNodeOffset nPos = nStt; nPos<=nEnd; nPos++)
RemoveLeadingWhiteSpace(SwPosition(rSel.GetBound().GetNodes(), nPos));
}
}
// Copy method from SwDoc - "copy Flys in Flys"
/// note: rRg/rInsPos *exclude* a partially selected start text node;
/// pCopiedPaM *includes* a partially selected start text node
void DocumentContentOperationsManager::CopyWithFlyInFly(
const SwNodeRange& rRg,
SwNode& rInsPos,
const std::pair<const SwPaM&, const SwPosition&>* pCopiedPaM /*and real insert pos*/,
const bool bMakeNewFrames,
const bool bDelRedlines,
const bool bCopyFlyAtFly,
SwCopyFlags const flags) const
{
assert(!pCopiedPaM || pCopiedPaM->first.End()->GetNode() == rRg.aEnd.GetNode());
assert(!pCopiedPaM || pCopiedPaM->second.GetNode() <= rInsPos);
SwDoc& rDest = rInsPos.GetDoc();
SwNodeIndex aSavePos( rInsPos );
SwPaM aCopiedPaM(rRg.aStart, rRg.aEnd);
if (pCopiedPaM)
aCopiedPaM = pCopiedPaM->first;
if (rRg.aStart != rRg.aEnd)
{
bool bEndIsEqualEndPos = rInsPos == rRg.aEnd.GetNode();
--aSavePos;
SaveRedlEndPosForRestore aRedlRest( rInsPos, 0 );
auto savedEndContentIndex = aCopiedPaM.End()->GetContentIndex();
// insert behind the already copied start node
m_rDoc.GetNodes().CopyNodes( rRg, rInsPos, false, true );
aRedlRest.Restore();
if (bEndIsEqualEndPos)
{
const_cast<SwNodeIndex&>(rRg.aEnd).Assign(aSavePos.GetNode(), +1);
// pCopiedPaM->first now spans a range from the start of the original selection
// to the end of newly added text, and the insertion point is in the middle of
// that range. Adjust the local copy to cover the original copied PaM.
aCopiedPaM.End()->Assign(rRg.aEnd, savedEndContentIndex);
}
}
// Also copy all bookmarks
// guess this must be done before the DelDummyNodes below as that
// deletes nodes so would mess up the index arithmetic
// sw_fieldmarkhide: also needs to be done before making frames
if (m_rDoc.getIDocumentMarkAccess()->getAllMarksCount())
{
SwPosition targetPos(aSavePos, SwNodeOffset(rRg.aStart != rRg.aEnd ? +1 : 0));
if (pCopiedPaM && rRg.aStart != pCopiedPaM->first.Start()->GetNode())
{
// there is 1 (partially selected, maybe) paragraph before
assert(SwNodeIndex(rRg.aStart, -1) == pCopiedPaM->first.Start()->GetNode());
// only use the passed in target SwPosition if the source PaM point
// is on a different node; if it was the same node then the target
// position was likely moved along by the copy operation and now
// points to the end of the range!
targetPos = pCopiedPaM->second;
}
sw::CopyBookmarks(aCopiedPaM, targetPos, flags);
}
if (rRg.aStart != rRg.aEnd)
{
++aSavePos;
}
#if OSL_DEBUG_LEVEL > 0
{
//JP 17.06.99: Bug 66973 - check count only if the selection is in
// the same section or there's no section, because sections that are
// not fully selected are not copied.
const SwSectionNode* pSSectNd = rRg.aStart.GetNode().FindSectionNode();
SwNodeIndex aTmpI( rRg.aEnd, -1 );
const SwSectionNode* pESectNd = aTmpI.GetNode().FindSectionNode();
if( pSSectNd == pESectNd &&
!rRg.aStart.GetNode().IsSectionNode() &&
!aTmpI.GetNode().IsEndNode() )
{
// If the range starts with a SwStartNode, it isn't copied
SwNodeOffset offset( (rRg.aStart.GetNode().GetNodeType() != SwNodeType::Start) ? 1 : 0 );
OSL_ENSURE( rInsPos.GetIndex() - aSavePos.GetIndex() ==
rRg.aEnd.GetIndex() - rRg.aStart.GetIndex() - 1 + offset,
"An insufficient number of nodes were copied!" );
}
}
#endif
{
::sw::UndoGuard const undoGuard(rDest.GetIDocumentUndoRedo());
// this must happen before lcl_DeleteRedlines() because it counts nodes
CopyFlyInFlyImpl(rRg, pCopiedPaM ? &aCopiedPaM : nullptr,
// see comment below regarding use of pCopiedPaM->second
(pCopiedPaM && rRg.aStart != pCopiedPaM->first.Start()->GetNode())
? pCopiedPaM->second.GetNode()
: aSavePos.GetNode(),
bCopyFlyAtFly,
flags,
false);
}
SwNodeRange aCpyRange( aSavePos.GetNode(), rInsPos );
if( bDelRedlines && ( RedlineFlags::DeleteRedlines & rDest.getIDocumentRedlineAccess().GetRedlineFlags() ))
lcl_DeleteRedlines( rRg, aCpyRange );
rDest.GetNodes().DelDummyNodes( aCpyRange );
// tdf#159023 create layout frames after DelDummyNodes():
// InsertCnt_() does early return on the first SwPlaceholderNode
if (rRg.aStart != rRg.aEnd)
{
--aSavePos; // restore temporarily...
bool isRecreateEndNode(false);
if (bMakeNewFrames) // tdf#130685 only after aRedlRest
{ // recreate from previous node (could be merged now)
o3tl::sorted_vector<SwTextFrame*> frames;
SwTextNode * pNode(aSavePos.GetNode().GetTextNode());
SwTextNode *const pEndNode(rInsPos.GetTextNode());
if (pEndNode)
{
SwIterator<SwTextFrame, SwTextNode, sw::IteratorMode::UnwrapMulti> aIter(*pEndNode);
for (SwTextFrame* pFrame = aIter.First(); pFrame; pFrame = aIter.Next())
{
if (pFrame->getRootFrame()->HasMergedParas())
{
frames.insert(pFrame);
// tdf#135061 check if end node is merged to a preceding node
if (pNode == nullptr && pFrame->GetMergedPara()
&& pFrame->GetMergedPara()->pFirstNode->GetIndex() < aSavePos.GetIndex())
{
pNode = pFrame->GetMergedPara()->pFirstNode;
}
}
}
}
if (pNode != nullptr)
{
sw::RecreateStartTextFrames(*pNode);
if (!frames.empty())
{ // tdf#132187 check if the end node needs new frames
assert(pEndNode);
SwIterator<SwTextFrame, SwTextNode, sw::IteratorMode::UnwrapMulti> aIter(*pEndNode);
for (SwTextFrame* pFrame = aIter.First(); pFrame; pFrame = aIter.Next())
{
if (pFrame->getRootFrame()->HasMergedParas())
{
auto const it(frames.find(pFrame));
if (it != frames.end())
{
frames.erase(it);
}
}
}
if (!frames.empty()) // existing frame was deleted
{ // all layouts because MakeFrames recreates all layouts
pEndNode->DelFrames(nullptr);
isRecreateEndNode = true;
}
}
}
}
bool const isAtStartOfSection(aSavePos.GetNode().IsStartNode());
++aSavePos;
if (bMakeNewFrames)
{
// it's possible that CheckParaRedlineMerge() deleted frames
// on rInsPos so have to include it, but it must not be included
// if it was the first node in the document so that MakeFrames()
// will find the existing (wasn't deleted) frame on it
SwNodeIndex const end(rInsPos,
SwNodeOffset((!isRecreateEndNode || isAtStartOfSection)
? 0 : +1));
::MakeFrames(rDest, aSavePos.GetNode(), end.GetNode());
}
}
}
// note: for the redline Show/Hide this must be in sync with
// SwRangeRedline::CopyToSection()/DelCopyOfSection()/MoveFromSection()
void DocumentContentOperationsManager::CopyFlyInFlyImpl(
const SwNodeRange& rRg,
SwPaM const*const pCopiedPaM,
SwNode& rStartIdx,
const bool bCopyFlyAtFly,
SwCopyFlags const flags,
bool const bMakeNewFrames) const
{
assert(!pCopiedPaM || pCopiedPaM->End()->GetNode() == rRg.aEnd.GetNode());
// First collect all Flys, sort them according to their ordering number,
// and then only copy them. This maintains the ordering numbers (which are only
// managed in the DrawModel).
SwDoc& rDest = rStartIdx.GetDoc();
std::set< ZSortFly > aSet;
const size_t nArrLen = m_rDoc.GetSpzFrameFormats()->size();
SwTextBoxHelper::SavedLink aOldTextBoxes;
SwTextBoxHelper::saveLinks(*m_rDoc.GetSpzFrameFormats(), aOldTextBoxes);
for ( size_t n = 0; n < nArrLen; ++n )
{
SwFrameFormat* pFormat = (*m_rDoc.GetSpzFrameFormats())[n];
SwFormatAnchor const*const pAnchor = &pFormat->GetAnchor();
SwNode const*const pAnchorNode = pAnchor->GetAnchorNode();
if ( !pAnchorNode )
continue;
bool bAdd = false;
SwNodeOffset nSkipAfter = pAnchorNode->GetIndex();
SwNodeOffset nStart = rRg.aStart.GetIndex();
switch ( pAnchor->GetAnchorId() )
{
case RndStdIds::FLY_AT_FLY:
if(bCopyFlyAtFly)
++nSkipAfter;
else if(m_rDoc.getIDocumentRedlineAccess().IsRedlineMove())
++nStart;
break;
case RndStdIds::FLY_AT_PARA:
{
bAdd = IsSelectFrameAnchoredAtPara(*pAnchor->GetContentAnchor(),
pCopiedPaM ? *pCopiedPaM->Start() : SwPosition(rRg.aStart),
pCopiedPaM ? *pCopiedPaM->End() : SwPosition(rRg.aEnd),
(flags & SwCopyFlags::IsMoveToFly)
? DelContentType::AllMask|DelContentType::WriterfilterHack
: DelContentType::AllMask);
}
break;
case RndStdIds::FLY_AT_CHAR:
{
bAdd = IsDestroyFrameAnchoredAtChar(*pAnchor->GetContentAnchor(),
pCopiedPaM ? *pCopiedPaM->Start() : SwPosition(rRg.aStart),
pCopiedPaM ? *pCopiedPaM->End() : SwPosition(rRg.aEnd),
(flags & SwCopyFlags::IsMoveToFly)
? DelContentType::AllMask|DelContentType::WriterfilterHack
: DelContentType::AllMask);
}
break;
default:
continue;
}
if (RndStdIds::FLY_AT_FLY == pAnchor->GetAnchorId())
{
if (nStart > nSkipAfter)
continue;
if (*pAnchorNode > rRg.aEnd.GetNode())
continue;
//frames at the last source node are not always copied:
//- if the node is empty and is the last node of the document or a table cell
// or a text frame then they have to be copied
//- if the content index in this node is > 0 then paragraph and frame bound objects are copied
//- to-character bound objects are copied if their index is <= nEndContentIndex
if (*pAnchorNode < rRg.aEnd.GetNode())
bAdd = true;
if (!bAdd && !m_rDoc.getIDocumentRedlineAccess().IsRedlineMove()) // fdo#40599: not for redline move
{
if (!bAdd)
{
// technically old code checked nContent of AT_FLY which is pointless
bAdd = pCopiedPaM && 0 < pCopiedPaM->End()->GetContentIndex();
}
}
}
if( bAdd )
{
aSet.insert( ZSortFly( pFormat, pAnchor, nArrLen + aSet.size() ));
}
}
// Store all copied (and also the newly created) frames in another array.
// They are stored as matching the originals, so that we will be later
// able to build the chains accordingly.
std::vector< SwFrameFormat* > aVecSwFrameFormat;
std::set< ZSortFly >::const_iterator it=aSet.begin();
while (it != aSet.end())
{
// #i59964#
// correct determination of new anchor position
SwFormatAnchor aAnchor( *(*it).GetAnchor() );
assert( aAnchor.GetContentAnchor() != nullptr );
SwPosition newPos = *aAnchor.GetContentAnchor();
// for at-paragraph and at-character anchored objects the new anchor
// position can *not* be determined by the difference of the current
// anchor position to the start of the copied range, because not
// complete selected sections in the copied range aren't copied - see
// method <SwNodes::CopyNodes(..)>.
// Thus, the new anchor position in the destination document is found
// by counting the text nodes.
if ((aAnchor.GetAnchorId() == RndStdIds::FLY_AT_PARA) ||
(aAnchor.GetAnchorId() == RndStdIds::FLY_AT_CHAR) )
{
// First, determine number of anchor text node in the copied range.
// Note: The anchor text node *have* to be inside the copied range.
sal_uLong nAnchorTextNdNumInRange( 0 );
bool bAnchorTextNdFound( false );
// start at the first node for which flys are copied
SwNodeIndex aIdx(pCopiedPaM ? pCopiedPaM->Start()->GetNode() : rRg.aStart.GetNode());
while ( !bAnchorTextNdFound && aIdx <= rRg.aEnd )
{
if ( aIdx.GetNode().IsTextNode() )
{
++nAnchorTextNdNumInRange;
bAnchorTextNdFound = *aAnchor.GetAnchorNode() == aIdx.GetNode();
}
++aIdx;
}
if ( !bAnchorTextNdFound )
{
// This case can *not* happen, but to be robust take the first
// text node in the destination document.
OSL_FAIL( "<SwDoc::_CopyFlyInFly(..)> - anchor text node in copied range not found" );
nAnchorTextNdNumInRange = 1;
}
// Second, search corresponding text node in destination document
// by counting forward from start insert position <rStartIdx> the
// determined number of text nodes.
aIdx = rStartIdx;
SwNodeIndex aAnchorNdIdx( rStartIdx );
const SwNode& aEndOfContentNd =
aIdx.GetNode().GetNodes().GetEndOfContent();
while ( nAnchorTextNdNumInRange > 0 &&
aIdx.GetNode() != aEndOfContentNd )
{
if ( aIdx.GetNode().IsTextNode() )
{
--nAnchorTextNdNumInRange;
aAnchorNdIdx = aIdx;
}
++aIdx;
}
if ( !aAnchorNdIdx.GetNode().IsTextNode() )
{
// This case can *not* happen, but to be robust take the first
// text node in the destination document.
OSL_FAIL( "<SwDoc::_CopyFlyInFly(..)> - found anchor node index isn't a text node" );
aAnchorNdIdx = rStartIdx;
while ( !aAnchorNdIdx.GetNode().IsTextNode() )
{
++aAnchorNdIdx;
}
}
// apply found anchor text node as new anchor position, but keep the content index
// unchanged
newPos.Assign( aAnchorNdIdx, newPos.GetContentIndex() );
}
else
{
SwNodeOffset nOffset = newPos.GetNodeIndex() - rRg.aStart.GetIndex();
newPos.Assign( rStartIdx, nOffset );
}
// Set the character bound Flys back at the original character
if ((RndStdIds::FLY_AT_CHAR == aAnchor.GetAnchorId()) &&
newPos.GetNode().IsTextNode() )
{
// only if pCopiedPaM: care about partially selected start node
sal_Int32 const nContent = pCopiedPaM && pCopiedPaM->Start()->GetNode() == *aAnchor.GetAnchorNode()
? newPos.GetContentIndex() - pCopiedPaM->Start()->GetContentIndex()
: newPos.GetContentIndex();
newPos.SetContent(nContent);
}
aAnchor.SetAnchor( &newPos );
// Check recursion: if copying content inside the same frame, then don't copy the format.
if( &rDest == &m_rDoc )
{
const SwFormatContent& rContent = (*it).GetFormat()->GetContent();
const SwStartNode* pSNd;
if( rContent.GetContentIdx() &&
nullptr != ( pSNd = rContent.GetContentIdx()->GetNode().GetStartNode() ) &&
pSNd->GetIndex() < rStartIdx.GetIndex() &&
rStartIdx.GetIndex() < pSNd->EndOfSectionIndex() )
{
it = aSet.erase(it);
continue;
}
}
// Ignore TextBoxes, they are already handled in
// sw::DocumentLayoutManager::CopyLayoutFormat().
if (SwTextBoxHelper::isTextBox(it->GetFormat(), RES_FLYFRMFMT))
{
it = aSet.erase(it);
continue;
}
// Copy the format and set the new anchor
aVecSwFrameFormat.push_back( rDest.getIDocumentLayoutAccess().CopyLayoutFormat( *(*it).GetFormat(),
aAnchor, false, bMakeNewFrames) );
++it;
}
// Rebuild as much as possible of all chains that are available in the original,
OSL_ENSURE( aSet.size() == aVecSwFrameFormat.size(), "Missing new Flys" );
if ( aSet.size() != aVecSwFrameFormat.size() )
return;
size_t n = 0;
for (const auto& rFlyN : aSet)
{
const SwFrameFormat *pFormatN = rFlyN.GetFormat();
const SwFormatChain &rChain = pFormatN->GetChain();
size_t k = 0;
for (const auto& rFlyK : aSet)
{
const SwFrameFormat *pFormatK = rFlyK.GetFormat();
if ( rChain.GetPrev() == pFormatK )
{
::lcl_ChainFormats( static_cast< SwFlyFrameFormat* >(aVecSwFrameFormat[k]),
static_cast< SwFlyFrameFormat* >(aVecSwFrameFormat[n]) );
}
else if ( rChain.GetNext() == pFormatK )
{
::lcl_ChainFormats( static_cast< SwFlyFrameFormat* >(aVecSwFrameFormat[n]),
static_cast< SwFlyFrameFormat* >(aVecSwFrameFormat[k]) );
}
++k;
}
++n;
}
// Re-create content property of draw formats, knowing how old shapes
// were paired with old fly formats (aOldTextBoxes) and that aSet is
// parallel with aVecSwFrameFormat.
SwTextBoxHelper::restoreLinks(aSet, aVecSwFrameFormat, aOldTextBoxes);
}
/*
create ItemSet to be used in ParaRstFormat
*/
std::shared_ptr<SfxItemSet> DocumentContentOperationsManager::lcl_createDelSet(SwDoc& rDoc)
{
std::shared_ptr<SfxItemSet> pDelSet(new SfxItemSet(
rDoc.GetAttrPool(), WhichRangesContainer(svl::Items<RES_CHRATR_BEGIN, RES_CHRATR_END - 1,
RES_TXTATR_INETFMT, RES_TXTATR_UNKNOWN_CONTAINER,
RES_PARATR_BEGIN, RES_FRMATR_END - 1,
RES_UNKNOWNATR_BEGIN, RES_UNKNOWNATR_END - 1>)));
o3tl::sorted_vector<sal_uInt16> aAttribs;
static constexpr std::pair<sal_uInt16, sal_uInt16> aResetableSetRange[] = {
// tdf#40496: we don't want to change writing direction, so exclude RES_FRAMEDIR:
{ RES_TXTATR_CHARFMT,RES_TXTATR_CHARFMT },
{ RES_FRMATR_BEGIN, RES_FRAMEDIR - 1 },
{ RES_FRAMEDIR + 1, RES_FRMATR_END - 1 },
{ RES_CHRATR_BEGIN, RES_CHRATR_LANGUAGE - 1 },
{ RES_CHRATR_LANGUAGE + 1, RES_CHRATR_CJK_LANGUAGE - 1 },
{ RES_CHRATR_CJK_LANGUAGE + 1, RES_CHRATR_CTL_LANGUAGE - 1 },
{ RES_CHRATR_CTL_LANGUAGE + 1, RES_CHRATR_END - 1 },
{ RES_PARATR_BEGIN, RES_PARATR_END - 1 },
{ RES_PARATR_LIST_AUTOFMT, RES_PARATR_LIST_AUTOFMT },
{ RES_TXTATR_UNKNOWN_CONTAINER, RES_TXTATR_UNKNOWN_CONTAINER },
{ RES_UNKNOWNATR_BEGIN, RES_UNKNOWNATR_END - 1 },
};
for (const auto& [nBegin, nEnd] : aResetableSetRange)
{
for (sal_uInt16 i = nBegin; i <= nEnd; ++i)
aAttribs.insert( i );
}
for( auto it = aAttribs.rbegin(); it != aAttribs.rend(); ++it )
{
if( POOLATTR_END > *it )
pDelSet->Put( *GetDfltAttr( *it ));
}
return pDelSet;
}
/*
* Reset the text's hard formatting
*/
/** @params pArgs contains the document's ChrFormatTable
* Is need for selections at the beginning/end and with no SSelection.
*/
bool DocumentContentOperationsManager::lcl_RstTextAttr( SwNode* pNd, void* pArgs )
{
ParaRstFormat* pPara = static_cast<ParaRstFormat*>(pArgs);
if (pPara->pLayout && pPara->pLayout->HasMergedParas()
&& pNd->GetRedlineMergeFlag() == SwNode::Merge::Hidden)
{
return true; // skip hidden, since new items aren't applied
}
SwTextNode * pTextNode = pNd->GetTextNode();
if( pTextNode && pTextNode->GetpSwpHints() )
{
SwContentIndex aSt( pTextNode, 0 );
sal_Int32 nEnd = pTextNode->Len();
if( &pPara->pSttNd->GetNode() == pTextNode &&
pPara->pSttNd->GetContentIndex() )
aSt = pPara->pSttNd->GetContentIndex();
if( &pPara->pEndNd->GetNode() == pNd )
nEnd = pPara->pEndNd->GetContentIndex();
if( pPara->pHistory )
{
// Save all attributes for the Undo.
SwRegHistory aRHst( *pTextNode, pPara->pHistory );
pTextNode->GetpSwpHints()->Register( &aRHst );
pTextNode->RstTextAttr( aSt.GetIndex(), nEnd - aSt.GetIndex(), pPara->nWhich,
pPara->pDelSet, pPara->bInclRefToxMark, pPara->bExactRange );
if( pTextNode->GetpSwpHints() )
pTextNode->GetpSwpHints()->DeRegister();
}
else
pTextNode->RstTextAttr( aSt.GetIndex(), nEnd - aSt.GetIndex(), pPara->nWhich,
pPara->pDelSet, pPara->bInclRefToxMark, pPara->bExactRange );
}
return true;
}
DocumentContentOperationsManager::~DocumentContentOperationsManager()
{
}
//Private methods
bool DocumentContentOperationsManager::DeleteAndJoinWithRedlineImpl(SwPaM & rPam, SwDeleteFlags const flags)
{
assert(m_rDoc.getIDocumentRedlineAccess().IsRedlineOn());
RedlineFlags eOld = m_rDoc.getIDocumentRedlineAccess().GetRedlineFlags();
if (*rPam.GetPoint() == *rPam.GetMark())
{
return false; // do not add empty redlines
}
std::vector<std::unique_ptr<SwRangeRedline>> redlines;
{
auto pRedline(std::make_unique<SwRangeRedline>(RedlineType::Delete, rPam));
if (pRedline->HasValidRange())
{
redlines.push_back(std::move(pRedline));
}
else // sigh ... why is such a selection even possible...
{ // split it up so we get one SwUndoRedlineDelete per inserted RL
redlines = GetAllValidRanges(std::move(pRedline));
}
}
if (redlines.empty())
{
return false;
}
// tdf#54819 current redlining needs also modification of paragraph style and
// attributes added to the same grouped Undo
if (m_rDoc.GetIDocumentUndoRedo().DoesGroupUndo())
m_rDoc.GetIDocumentUndoRedo().StartUndo(SwUndoId::EMPTY, nullptr);
auto & rDMA(*m_rDoc.getIDocumentMarkAccess());
std::vector<std::unique_ptr<SwUndo>> MarkUndos;
for (auto iter = rDMA.getAnnotationMarksBegin();
iter != rDMA.getAnnotationMarksEnd(); )
{
// tdf#111524 remove annotation marks that have their field
// characters deleted
SwPosition const& rEndPos((**iter).GetMarkEnd());
if (*rPam.Start() < rEndPos && rEndPos <= *rPam.End())
{
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
MarkUndos.emplace_back(std::make_unique<SwUndoDeleteBookmark>(**iter));
}
// iter is into annotation mark vector so must be dereferenced!
rDMA.deleteMark(&**iter);
// this invalidates iter, have to start over...
iter = rDMA.getAnnotationMarksBegin();
}
else
{ // marks are sorted by start
if (*rPam.End() < (**iter).GetMarkStart())
{
break;
}
++iter;
}
}
// tdf#119019 accept tracked paragraph formatting to do not hide new deletions
if (*rPam.GetPoint() != *rPam.GetMark())
m_rDoc.getIDocumentRedlineAccess().AcceptRedlineParagraphFormatting(rPam);
std::vector<std::unique_ptr<SwUndoRedlineDelete>> undos;
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
// this should no longer happen in calls from the UI but maybe via API
// (randomTest and testTdf54819 triggers it)
SAL_WARN_IF((eOld & RedlineFlags::ShowMask) != RedlineFlags::ShowMask,
"sw.core", "redlines will be moved in DeleteAndJoin");
RedlineFlags eFlags = RedlineFlags::On | RedlineFlags::ShowInsert | RedlineFlags::ShowDelete;
if (eOld & RedlineFlags::DontCombineRedlines)
{
// Reinstate disables redline compressing, don't drop that here.
eFlags |= RedlineFlags::DontCombineRedlines;
}
m_rDoc.getIDocumentRedlineAccess().SetRedlineFlags(eFlags);
for (std::unique_ptr<SwRangeRedline> & pRedline : redlines)
{
assert(pRedline->HasValidRange());
undos.emplace_back(std::make_unique<SwUndoRedlineDelete>(
*pRedline, SwUndoId::DELETE, flags));
}
const SwRewriter aRewriter = undos.front()->GetRewriter();
// can only group a single undo action
if (MarkUndos.empty() && undos.size() == 1
&& m_rDoc.GetIDocumentUndoRedo().DoesGroupUndo())
{
SwUndo * const pLastUndo( m_rDoc.GetUndoManager().GetLastUndo() );
SwUndoRedlineDelete *const pUndoRedlineDel(dynamic_cast<SwUndoRedlineDelete*>(pLastUndo));
bool const bMerged = pUndoRedlineDel
&& pUndoRedlineDel->CanGrouping(*undos.front());
if (!bMerged)
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo(std::move(undos.front()));
}
undos.clear(); // prevent unmatched EndUndo
}
else
{
m_rDoc.GetIDocumentUndoRedo().StartUndo(SwUndoId::DELETE, &aRewriter);
for (auto& it : MarkUndos)
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo(std::move(it));
}
for (auto & it : undos)
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo(std::move(it));
}
}
}
for (std::unique_ptr<SwRangeRedline> & pRedline : redlines)
{
// note: 1. the pRedline can still be merged & deleted
// 2. the impl. can even DeleteAndJoin the range => no plain PaM
std::shared_ptr<SwUnoCursor> const pCursor(m_rDoc.CreateUnoCursor(*pRedline->GetMark()));
pCursor->SetMark();
*pCursor->GetPoint() = *pRedline->GetPoint();
m_rDoc.getIDocumentRedlineAccess().AppendRedline(pRedline.release(), true);
// sw_redlinehide: 2 reasons why this is needed:
// 1. it's the first redline in node => RedlineDelText was sent but ignored
// 2. redline spans multiple nodes => must merge text frames
sw::UpdateFramesForAddDeleteRedline(m_rDoc, *pCursor);
}
m_rDoc.getIDocumentState().SetModified();
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
if (!undos.empty())
{
m_rDoc.GetIDocumentUndoRedo().EndUndo(SwUndoId::EMPTY, nullptr);
}
m_rDoc.getIDocumentRedlineAccess().SetRedlineFlags( eOld );
}
if (m_rDoc.GetIDocumentUndoRedo().DoesGroupUndo())
m_rDoc.GetIDocumentUndoRedo().EndUndo(SwUndoId::EMPTY, nullptr);
return true;
}
bool DocumentContentOperationsManager::DeleteAndJoinImpl(SwPaM & rPam, SwDeleteFlags const flags)
{
bool bJoinText, bJoinPrev;
::sw_GetJoinFlags( rPam, bJoinText, bJoinPrev );
bool const bSuccess( DeleteRangeImpl(rPam, flags) );
if (!bSuccess)
return false;
if( bJoinText )
{
::sw_JoinText( rPam, bJoinPrev );
}
if (!m_rDoc.getIDocumentRedlineAccess().IsIgnoreRedline()
&& !m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty()
&& !(flags & SwDeleteFlags::DontCompressRedlines))
{
m_rDoc.getIDocumentRedlineAccess().CompressRedlines();
}
return true;
}
bool DocumentContentOperationsManager::DeleteRangeImpl(SwPaM & rPam, SwDeleteFlags const flags)
{
// Move all cursors out of the deleted range, but first copy the
// passed PaM, because it could be a cursor that would be moved!
SwPaM aDelPam( *rPam.GetMark(), *rPam.GetPoint() );
{
SwPosition const pos(GetCorrPosition(aDelPam));
::PaMCorrAbs(aDelPam, pos);
}
bool const bSuccess( DeleteRangeImplImpl(aDelPam, flags) );
if (bSuccess)
{ // now copy position from temp copy to given PaM
*rPam.GetPoint() = *aDelPam.GetPoint();
}
return bSuccess;
}
bool DocumentContentOperationsManager::DeleteRangeImplImpl(SwPaM & rPam, SwDeleteFlags const flags)
{
auto [pStart, pEnd] = rPam.StartEnd(); // SwPosition*
if (!rPam.HasMark()
|| (*pStart == *pEnd && !IsFlySelectedByCursor(m_rDoc, *pStart, *pEnd)))
{
return false;
}
if( m_rDoc.GetAutoCorrExceptWord() )
{
// if necessary the saved Word for the exception
if( m_rDoc.GetAutoCorrExceptWord()->IsDeleted() || pStart->GetNode() != pEnd->GetNode() ||
pStart->GetContentIndex() + 1 != pEnd->GetContentIndex() ||
!m_rDoc.GetAutoCorrExceptWord()->CheckDelChar( *pStart ))
{ m_rDoc.DeleteAutoCorrExceptWord(); }
}
{
// Delete all empty TextHints at the Mark's position
SwTextNode* pTextNd = rPam.GetMark()->GetNode().GetTextNode();
SwpHints* pHts;
if( pTextNd && nullptr != ( pHts = pTextNd->GetpSwpHints()) && pHts->Count() )
{
const sal_Int32 nMkCntPos = rPam.GetMark()->GetContentIndex();
for( size_t n = pHts->Count(); n; )
{
const SwTextAttr* pAttr = pHts->Get( --n );
if( nMkCntPos > pAttr->GetStart() )
break;
const sal_Int32 *pEndIdx;
if( nMkCntPos == pAttr->GetStart() &&
nullptr != (pEndIdx = pAttr->End()) &&
*pEndIdx == pAttr->GetStart() )
pTextNd->DestroyAttr( pHts->Cut( n ) );
}
}
}
{
// Send DataChanged before deletion, so that we still know
// which objects are in the range.
// Afterwards they could be before/after the Position.
SwDataChanged aTmp( rPam );
}
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().ClearRedo();
bool bMerged(false);
if (m_rDoc.GetIDocumentUndoRedo().DoesGroupUndo())
{
SwUndo *const pLastUndo( m_rDoc.GetUndoManager().GetLastUndo() );
SwUndoDelete *const pUndoDelete(
dynamic_cast<SwUndoDelete *>(pLastUndo) );
if (pUndoDelete)
{
bMerged = pUndoDelete->CanGrouping(m_rDoc, rPam);
// if CanGrouping() returns true it's already merged
}
}
if (!bMerged)
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo(std::make_unique<SwUndoDelete>(rPam, flags));
}
m_rDoc.getIDocumentState().SetModified();
return true;
}
if( !m_rDoc.getIDocumentRedlineAccess().IsIgnoreRedline() && !m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty() )
m_rDoc.getIDocumentRedlineAccess().DeleteRedline( rPam, true, RedlineType::Any );
// Delete and move all "Flys at the paragraph", which are within the Selection
if (!(flags & SwDeleteFlags::ArtificialSelection))
{
DelFlyInRange(rPam.GetMark()->GetNode(), rPam.GetPoint()->GetNode(),
rPam.GetMark()->GetContentIndex(), rPam.GetPoint()->GetContentIndex());
}
DelBookmarks(
pStart->GetNode(),
pEnd->GetNode(),
nullptr,
pStart->GetContentIndex(),
pEnd->GetContentIndex(),
bool(flags & SwDeleteFlags::ArtificialSelection));
SwNodeIndex aSttIdx( pStart->GetNode() );
SwContentNode * pCNd = aSttIdx.GetNode().GetContentNode();
do { // middle checked loop!
if( pCNd )
{
SwTextNode * pStartTextNode( pCNd->GetTextNode() );
if ( pStartTextNode )
{
// now move the Content to the new Node
bool bOneNd = pStart->GetNode() == pEnd->GetNode();
const sal_Int32 nLen = ( bOneNd ? pEnd->GetContentIndex()
: pCNd->Len() )
- pStart->GetContentIndex();
// Don't call again, if already empty
if( nLen )
{
pStartTextNode->EraseText( *pStart, nLen );
if( !pStartTextNode->Len() )
{
// METADATA: remove reference if empty (consider node deleted)
pStartTextNode->RemoveMetadataReference();
}
}
if( bOneNd ) // that's it
break;
++aSttIdx;
}
else
{
// So that there are no indices left registered when deleted,
// we remove a SwPaM from the Content here.
pStart->nContent.Assign( nullptr, 0 );
}
}
pCNd = pEnd->GetNode().GetContentNode();
if( pCNd )
{
SwTextNode * pEndTextNode( pCNd->GetTextNode() );
if( pEndTextNode )
{
// if already empty, don't call again
if( pEnd->GetContentIndex() )
{
SwContentIndex aIdx( pCNd, 0 );
pEndTextNode->EraseText( aIdx, pEnd->GetContentIndex() );
if( !pEndTextNode->Len() )
{
// METADATA: remove reference if empty (consider node deleted)
pEndTextNode->RemoveMetadataReference();
}
}
}
else
{
// So that there are no indices left registered when deleted,
// we remove a SwPaM from the Content here.
pEnd->nContent.Assign( nullptr, 0 );
}
}
// if the end is not a content node, delete it as well
SwNodeOffset nEnd = pEnd->GetNodeIndex();
if( pCNd == nullptr )
nEnd++;
if( aSttIdx != nEnd )
{
// tdf#134436 delete section nodes like SwUndoDelete::SwUndoDelete
SwNode *pTmpNd;
while (pEnd == rPam.GetPoint()
&& nEnd + SwNodeOffset(2) < m_rDoc.GetNodes().Count()
&& (pTmpNd = m_rDoc.GetNodes()[nEnd + 1])->IsEndNode()
&& pTmpNd->StartOfSectionNode()->IsSectionNode()
&& aSttIdx <= pTmpNd->StartOfSectionNode()->GetIndex())
{
SwNodeRange range(*pTmpNd->StartOfSectionNode(), *pTmpNd);
m_rDoc.GetNodes().SectionUp(&range);
--nEnd; // account for deleted start node
}
// delete the Nodes from the NodesArray
m_rDoc.GetNodes().Delete( aSttIdx, nEnd - aSttIdx.GetIndex() );
}
// If the Node that contained the Cursor has been deleted,
// the Content has to be assigned to the current Content.
if (pStart->GetNode().GetContentNode())
pStart->SetContent( pStart->GetContentIndex() );
// If we deleted across Node boundaries we have to correct the PaM,
// because they are in different Nodes now.
// Also, the Selection is revoked.
*pEnd = *pStart;
rPam.DeleteMark();
} while( false );
m_rDoc.getIDocumentState().SetModified();
return true;
}
// It's possible to call Replace with a PaM that spans 2 paragraphs:
// search with regex for "$", then replace _all_
bool DocumentContentOperationsManager::ReplaceRangeImpl( SwPaM& rPam, const OUString& rStr,
const bool bRegExReplace )
{
if (!rPam.HasMark())
return false;
bool bJoinText, bJoinPrev;
::sw_GetJoinFlags( rPam, bJoinText, bJoinPrev );
{
// Create a copy of the Cursor in order to move all Pams from
// the other views out of the deletion range.
// Except for itself!
SwPaM aDelPam( *rPam.GetMark(), *rPam.GetPoint() );
::PaMCorrAbs( aDelPam, *aDelPam.End() );
auto [pStart, pEnd] = aDelPam.StartEnd(); // SwPosition*
bool bOneNode = pStart->GetNode() == pEnd->GetNode();
// Own Undo?
OUString sRepl( rStr );
SwTextNode* pTextNd = pStart->GetNode().GetTextNode();
sal_Int32 nStt = pStart->GetContentIndex();
sal_Int32 nEnd;
SwDataChanged aTmp( aDelPam );
if( m_rDoc.getIDocumentRedlineAccess().IsRedlineOn() )
{
RedlineFlags eOld = m_rDoc.getIDocumentRedlineAccess().GetRedlineFlags();
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
// this should no longer happen in calls from the UI but maybe via API
SAL_WARN_IF((eOld & RedlineFlags::ShowMask) != RedlineFlags::ShowMask,
"sw.core", "redlines will be moved in ReplaceRange");
m_rDoc.GetIDocumentUndoRedo().StartUndo(SwUndoId::EMPTY, nullptr);
// If any Redline will change (split!) the node
const ::sw::mark::MarkBase* pBkmk =
m_rDoc.getIDocumentMarkAccess()->makeMark( aDelPam,
SwMarkName(), IDocumentMarkAccess::MarkType::UNO_BOOKMARK,
::sw::mark::InsertMode::New);
m_rDoc.getIDocumentRedlineAccess().SetRedlineFlags(
RedlineFlags::On | RedlineFlags::ShowInsert | RedlineFlags::ShowDelete );
*aDelPam.GetPoint() = pBkmk->GetMarkPos();
if(pBkmk->IsExpanded())
*aDelPam.GetMark() = pBkmk->GetOtherMarkPos();
m_rDoc.getIDocumentMarkAccess()->deleteMark(pBkmk);
pStart = aDelPam.Start();
pTextNd = pStart->GetNode().GetTextNode();
nStt = pStart->GetContentIndex();
}
if( !sRepl.isEmpty() )
{
// Apply the first character's attributes to the ReplaceText
SfxItemSet aSet(SfxItemSet::makeFixedSfxItemSet<RES_CHRATR_BEGIN, RES_TXTATR_WITHEND_END - 1,
RES_UNKNOWNATR_BEGIN, RES_UNKNOWNATR_END-1>(m_rDoc.GetAttrPool()));
pTextNd->GetParaAttr( aSet, nStt+1, nStt+1 );
aSet.ClearItem( RES_TXTATR_REFMARK );
aSet.ClearItem( RES_TXTATR_TOXMARK );
aSet.ClearItem( RES_TXTATR_CJK_RUBY );
aSet.ClearItem( RES_TXTATR_INETFMT );
aSet.ClearItem( RES_TXTATR_META );
aSet.ClearItem( RES_TXTATR_METAFIELD );
if( aDelPam.GetPoint() != aDelPam.End() )
aDelPam.Exchange();
// Remember the End
SwNodeIndex aPtNd( aDelPam.GetPoint()->GetNode(), -1 );
const sal_Int32 nPtCnt = aDelPam.GetPoint()->GetContentIndex();
bool bFirst = true;
OUString sIns;
while ( lcl_GetTokenToParaBreak( sRepl, sIns, bRegExReplace ) )
{
InsertString( aDelPam, sIns );
if( bFirst )
{
SwNodeIndex aMkNd( aDelPam.GetMark()->GetNode(), -1 );
const sal_Int32 nMkCnt = aDelPam.GetMark()->GetContentIndex();
SplitNode( *aDelPam.GetPoint(), false );
++aMkNd;
aDelPam.GetMark()->Assign( aMkNd, nMkCnt );
bFirst = false;
}
else
SplitNode( *aDelPam.GetPoint(), false );
}
if( !sIns.isEmpty() )
{
InsertString( aDelPam, sIns );
}
SwPaM aTmpRange( *aDelPam.GetPoint() );
aTmpRange.SetMark();
++aPtNd;
aDelPam.GetPoint()->Assign(aPtNd, nPtCnt);
*aTmpRange.GetMark() = *aDelPam.GetPoint();
m_rDoc.RstTextAttrs( aTmpRange );
InsertItemSet( aTmpRange, aSet );
}
// tdf#139982: Appending the redline may immediately delete flys
// anchored in the previous text if it's inside an insert redline.
// Also flys will be deleted if the redline is accepted. Move them
// to the position between the previous text and the new text,
// there the chance of surviving both accept and reject is best.
SaveFlyArr flys;
SaveFlyInRange(aDelPam, *aDelPam.End(), flys, false);
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
m_rDoc.GetIDocumentUndoRedo().AppendUndo(
std::make_unique<SwUndoRedlineDelete>( aDelPam, SwUndoId::REPLACE ));
}
// add redline similar to DeleteAndJoinWithRedlineImpl()
std::shared_ptr<SwUnoCursor> const pCursor(m_rDoc.CreateUnoCursor(*aDelPam.GetMark()));
pCursor->SetMark();
*pCursor->GetPoint() = *aDelPam.GetPoint();
m_rDoc.getIDocumentRedlineAccess().AppendRedline( new SwRangeRedline( RedlineType::Delete, aDelPam ), true);
RestFlyInRange(flys, *aDelPam.End(), &aDelPam.End()->GetNode(), true);
sw::UpdateFramesForAddDeleteRedline(m_rDoc, *pCursor);
*rPam.GetMark() = *aDelPam.GetMark();
if (m_rDoc.GetIDocumentUndoRedo().DoesUndo())
{
*aDelPam.GetPoint() = *rPam.GetPoint();
m_rDoc.GetIDocumentUndoRedo().EndUndo(SwUndoId::EMPTY, nullptr);
// If any Redline will change (split!) the node
const ::sw::mark::MarkBase* pBkmk =
m_rDoc.getIDocumentMarkAccess()->makeMark( aDelPam,
SwMarkName(), IDocumentMarkAccess::MarkType::UNO_BOOKMARK,
::sw::mark::InsertMode::New);
aDelPam.GetPoint()->Assign( SwNodeOffset(0) );
aDelPam.GetMark()->Assign( SwNodeOffset(0) );
rPam.GetPoint()->Assign( SwNodeOffset(0) );
*rPam.GetMark() = *rPam.GetPoint();
m_rDoc.getIDocumentRedlineAccess().SetRedlineFlags( eOld );
*rPam.GetPoint() = pBkmk->GetMarkPos();
*rPam.GetMark() = pBkmk->IsExpanded() ? pBkmk->GetOtherMarkPos() : pBkmk->GetMarkPos();
m_rDoc.getIDocumentMarkAccess()->deleteMark(pBkmk);
}
bJoinText = false;
}
else
{
assert((pStart->GetNode() == pEnd->GetNode() ||
( pStart->GetNodeIndex() + 1 == pEnd->GetNodeIndex() &&
!pEnd->GetContentIndex() )) &&
"invalid range: Point and Mark on different nodes" );
if( !m_rDoc.getIDocumentRedlineAccess().IsIgnoreRedline() && !m_rDoc.getIDocumentRedlineAccess().GetRedlineTable().empty() )
m_rDoc.getIDocumentRedlineAccess().DeleteRedline( aDelPam, true, RedlineType::Any );
SwUndoReplace* pUndoRpl = nullptr;
bool const bDoesUndo = m_rDoc.GetIDocumentUndoRedo().DoesUndo();
if (bDoesUndo)
{
pUndoRpl = new SwUndoReplace(aDelPam, sRepl, bRegExReplace);
m_rDoc.GetIDocumentUndoRedo().AppendUndo(std::unique_ptr<SwUndo>(pUndoRpl));
}
::sw::UndoGuard const undoGuard(m_rDoc.GetIDocumentUndoRedo());
if( aDelPam.GetPoint() != pStart )
aDelPam.Exchange();
SwNodeIndex aPtNd( pStart->GetNode(), -1 );
const sal_Int32 nPtCnt = pStart->GetContentIndex();
// Set the values again, if Frames or footnotes on the Text have been removed.
nStt = nPtCnt;
nEnd = bOneNode ? pEnd->GetContentIndex()
: pTextNd->GetText().getLength();
bool bFirst = true;
OUString sIns;
while ( lcl_GetTokenToParaBreak( sRepl, sIns, bRegExReplace ) )
{
if (!bFirst || nStt == pTextNd->GetText().getLength())
{
InsertString( aDelPam, sIns );
}
else if( nStt < nEnd || !sIns.isEmpty() )
{
pTextNd->ReplaceText( *pStart, nEnd - nStt, sIns );
}
SplitNode( *pStart, false);
bFirst = false;
}
if( bFirst || !sIns.isEmpty() )
{
if (!bFirst || nStt == pTextNd->GetText().getLength())
{
InsertString( aDelPam, sIns );
}
else if( nStt < nEnd || !sIns.isEmpty() )
{
pTextNd->ReplaceText( *pStart, nEnd - nStt, sIns );
}
}
*rPam.GetPoint() = *aDelPam.GetMark();
++aPtNd;
rPam.GetMark()->Assign( aPtNd, nPtCnt );
if (bJoinText)
{
assert(rPam.GetPoint() == rPam.End());
// move so that SetEnd remembers position after sw_JoinText
rPam.Move(fnMoveBackward);
}
else if (aDelPam.GetPoint() == pStart) // backward selection?
{
assert(*rPam.GetMark() <= *rPam.GetPoint());
rPam.Exchange(); // swap so that rPam is backwards
}
if( pUndoRpl )
{
pUndoRpl->SetEnd(rPam);
}
}
}
bool bRet(true);
if (bJoinText)
{
bRet = ::sw_JoinText(rPam, bJoinPrev);
}
m_rDoc.getIDocumentState().SetModified();
return bRet;
}
SwFlyFrameFormat* DocumentContentOperationsManager::InsNoTextNode( const SwPosition& rPos, SwNoTextNode* pNode,
const SfxItemSet* pFlyAttrSet,
const SfxItemSet* pGrfAttrSet,
SwFrameFormat* pFrameFormat)
{
SwFlyFrameFormat *pFormat = nullptr;
if( pNode )
{
pFormat = m_rDoc.MakeFlySection_( rPos, *pNode, RndStdIds::FLY_AT_PARA,
pFlyAttrSet, pFrameFormat );
if( pGrfAttrSet )
pNode->SetAttr( *pGrfAttrSet );
}
return pFormat;
}
#define NUMRULE_STATE \
std::shared_ptr<SwNumRuleItem> aNumRuleItemHolderIfSet; \
std::shared_ptr<SfxStringItem> aListIdItemHolderIfSet; \
#define PUSH_NUMRULE_STATE \
lcl_PushNumruleState( aNumRuleItemHolderIfSet, aListIdItemHolderIfSet, pDestTextNd );
#define POP_NUMRULE_STATE \
lcl_PopNumruleState( aNumRuleItemHolderIfSet, aListIdItemHolderIfSet, pDestTextNd, rPam );
static void lcl_PushNumruleState(
std::shared_ptr<SwNumRuleItem>& aNumRuleItemHolderIfSet,
std::shared_ptr<SfxStringItem>& aListIdItemHolderIfSet,
const SwTextNode *pDestTextNd )
{
// Safe numrule item at destination.
// #i86492# - Safe also <ListId> item of destination.
const SfxItemSet * pAttrSet = pDestTextNd->GetpSwAttrSet();
if (pAttrSet == nullptr)
return;
if (const SwNumRuleItem* pItem = pAttrSet->GetItemIfSet(RES_PARATR_NUMRULE, false))
{
aNumRuleItemHolderIfSet.reset(pItem->Clone());
}
if (const SfxStringItem* pItem = pAttrSet->GetItemIfSet(RES_PARATR_LIST_ID, false))
{
aListIdItemHolderIfSet.reset(pItem->Clone());
}
}
static void lcl_PopNumruleState(
const std::shared_ptr<SwNumRuleItem>& aNumRuleItemHolderIfSet,
const std::shared_ptr<SfxStringItem>& aListIdItemHolderIfSet,
SwTextNode *pDestTextNd, const SwPaM& rPam )
{
/* If only a part of one paragraph is copied
restore the numrule at the destination. */
// #i86492# - restore also <ListId> item
if ( lcl_MarksWholeNode(rPam) )
return;
if (aNumRuleItemHolderIfSet)
{
pDestTextNd->SetAttr(*aNumRuleItemHolderIfSet);
}
else
{
pDestTextNd->ResetAttr(RES_PARATR_NUMRULE);
}
if (aListIdItemHolderIfSet)
{
pDestTextNd->SetAttr(*aListIdItemHolderIfSet);
}
else
{
pDestTextNd->ResetAttr(RES_PARATR_LIST_ID);
}
}
bool DocumentContentOperationsManager::CopyImpl(SwPaM& rPam, SwPosition& rPos,
SwCopyFlags const flags,
SwPaM *const pCopyRange) const
{
std::vector<std::pair<SwNodeOffset, sal_Int32>> Breaks;
sw::CalcBreaks(Breaks, rPam, true);
if (Breaks.empty())
{
return CopyImplImpl(rPam, rPos, flags, pCopyRange);
}
SwPosition const & rSelectionEnd( *rPam.End() );
bool bRet(true);
bool bFirst(true);
// iterate from end to start, ... don't think it's necessary here?
auto iter( Breaks.rbegin() );
SwNodeOffset nOffset(0);
SwNodes const& rNodes(rPam.GetPoint()->GetNodes());
SwPaM aPam( rSelectionEnd, rSelectionEnd ); // end node!
SwPosition & rEnd( *aPam.End() );
SwPosition & rStart( *aPam.Start() );
SwPaM copyRange(rPos, rPos);
while (iter != Breaks.rend())
{
rStart.Assign(*rNodes[iter->first - nOffset]->GetTextNode(), iter->second + 1);
if (rStart < rEnd) // check if part is empty
{
// pass in copyRange member as rPos; should work ...
bRet &= CopyImplImpl(aPam, *copyRange.Start(), flags & ~SwCopyFlags::IsMoveToFly, ©Range);
nOffset = iter->first - rStart.GetNodeIndex(); // fly nodes...
if (pCopyRange)
{
if (bFirst)
{
pCopyRange->SetMark();
*pCopyRange->GetMark() = *copyRange.End();
}
*pCopyRange->GetPoint() = *copyRange.Start();
}
bFirst = false;
}
rEnd.Assign(*rNodes[iter->first - nOffset]->GetTextNode(), iter->second);
++iter;
}
rStart = *rPam.Start(); // set to original start
if (rStart < rEnd) // check if part is empty
{
bRet &= CopyImplImpl(aPam, *copyRange.Start(), flags & ~SwCopyFlags::IsMoveToFly, ©Range);
if (pCopyRange)
{
if (bFirst)
{
pCopyRange->SetMark();
*pCopyRange->GetMark() = *copyRange.End();
}
*pCopyRange->GetPoint() = *copyRange.Start();
}
}
return bRet;
}
bool DocumentContentOperationsManager::CopyImplImpl(SwPaM& rPam, SwPosition& rPos,
SwCopyFlags const flags,
SwPaM *const pCpyRange) const
{
SwDoc& rDoc = rPos.GetNode().GetDoc();
const bool bColumnSel = rDoc.IsClipBoard() && rDoc.IsColumnSelection();
auto [pStart, pEnd] = rPam.StartEnd(); // SwPosition*
// Catch when there's no copy to do.
if (!rPam.HasMark() || (IsEmptyRange(*pStart, *pEnd, flags) && !bColumnSel) ||
//JP 29.6.2001: 88963 - don't copy if inspos is in region of start to end
//JP 15.11.2001: don't test inclusive the end, ever exclusive
( &rDoc == &m_rDoc && *pStart <= rPos && rPos < *pEnd ))
{
return false;
}
const bool bEndEqualIns = &rDoc == &m_rDoc && rPos == *pEnd;
// If Undo is enabled, create the UndoCopy object
SwUndoCpyDoc* pUndo = nullptr;
// lcl_DeleteRedlines may delete the start or end node of the cursor when
// removing the redlines so use cursor that is corrected by PaMCorrAbs
std::shared_ptr<SwUnoCursor> const pCopyPam(rDoc.CreateUnoCursor(rPos));
SwTableNumFormatMerge aTNFM( m_rDoc, rDoc );
std::optional<std::vector<SwFrameFormat*>> pFlys;
std::vector<SwFrameFormat*> const* pFlysAtInsPos;
if (rDoc.GetIDocumentUndoRedo().DoesUndo())
{
pUndo = new SwUndoCpyDoc(*pCopyPam);
pFlysAtInsPos = pUndo->GetFlysAnchoredAt();
}
else
{
pFlys = sw::GetFlysAnchoredAt(rDoc, rPos.GetNodeIndex(), false);
pFlysAtInsPos = pFlys ? &*pFlys : nullptr;
}
RedlineFlags eOld = rDoc.getIDocumentRedlineAccess().GetRedlineFlags();
rDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern(eOld | RedlineFlags::Ignore);
// Move the PaM one node back from the insert position, so that
// the position doesn't get moved
pCopyPam->SetMark();
bool bCanMoveBack = false;
// First check if it will be able to move *to* first copied node.
// Note this doesn't just check IsStartNode() because SwDoc::AppendDoc()
// intentionally sets it to the body start node, perhaps it should just
// call SplitNode instead?
if ((!pStart->GetNode().IsSectionNode() && !pStart->GetNode().IsTableNode())
|| (pCopyPam->GetPoint()->GetContentIndex() != 0 // also if node will split
&& pCopyPam->GetPoint()->GetContentIndex() != pCopyPam->GetPoint()->GetNode().GetContentNode()->Len()))
{
bCanMoveBack = pCopyPam->Move(fnMoveBackward, GoInContent);
}
if( !bCanMoveBack )
{
pCopyPam->GetPoint()->Adjust(SwNodeOffset(-1));
assert(pCopyPam->GetPoint()->GetContentIndex() == 0);
}
SwNodeRange aRg( pStart->GetNode(), pEnd->GetNode() );
SwNodeIndex aInsPos( rPos.GetNode() );
::std::optional<SwContentIndex> oInsContentIndex;
const bool bOneNode = pStart->GetNode() == pEnd->GetNode();
SwTextNode* pSttTextNd = pStart->GetNode().GetTextNode();
SwTextNode* pEndTextNd = pEnd->GetNode().GetTextNode();
SwTextNode* pDestTextNd = aInsPos.GetNode().GetTextNode();
bool bDestTextNdEmpty = pDestTextNd && (pDestTextNd->GetText().isEmpty() || pDestTextNd->GetText() == "\n");
bool bCopyCollFormat = !rDoc.IsInsOnlyTextGlossary() &&
( bDestTextNdEmpty ||
( !bOneNode && !rPos.GetContentIndex() ) );
bool bCopyBookmarks = true;
bool bCopyPageSource = false;
SwNodeOffset nDeleteTextNodes(0);
// #i104585# copy outline num rule to clipboard (for ASCII filter)
if (rDoc.IsClipBoard() && m_rDoc.GetOutlineNumRule())
{
rDoc.SetOutlineNumRule(*m_rDoc.GetOutlineNumRule());
}
// #i86492#
// Correct the search for a previous list:
// First search for non-outline numbering list. Then search for non-outline
// bullet list.
// Keep also the <ListId> value for possible propagation.
OUString aListIdToPropagate;
SvxTextLeftMarginItem const* pTextLeftMarginToPropagate{nullptr};
SvxFirstLineIndentItem const* pFirstLineIndentToPropagate{nullptr};
const SwNumRule* pNumRuleToPropagate =
rDoc.SearchNumRule(rPos, false, true, false, 0, aListIdToPropagate, nullptr,
true, &pTextLeftMarginToPropagate, &pFirstLineIndentToPropagate);
if ( !pNumRuleToPropagate )
{
pNumRuleToPropagate =
rDoc.SearchNumRule(rPos, false, false, false, 0, aListIdToPropagate, nullptr,
true, &pTextLeftMarginToPropagate, &pFirstLineIndentToPropagate);
}
// #i86492#
// Do not propagate previous found list, if
// - destination is an empty paragraph which is not in a list and
// - source contains at least one paragraph which is not in a list
// or
// - source is a table
// - tdf#163340 overwrite list if source has a list
// - overwrite also if all source paragraphs have a list from a style
if ( pNumRuleToPropagate &&
((pDestTextNd && !pDestTextNd->GetText().getLength() &&
(!pDestTextNd->IsInList() || lcl_ShouldKeepSourceList(rPam) )) ||
rPam.GetBound().nNode.GetNode().GetNodeType() == SwNodeType::Table) )
{
pNumRuleToPropagate = nullptr;
}
// This do/while block is only there so that we can break out of it!
do {
if( pSttTextNd )
{
++nDeleteTextNodes; // must be joined in Undo
// Don't copy the beginning completely?
if( !bCopyCollFormat || bColumnSel || pStart->GetContentIndex() )
{
SwContentIndex aDestIdx( rPos.GetContentNode(), rPos.GetContentIndex() );
bool bCopyOk = false;
if( !pDestTextNd )
{
if( pStart->GetContentIndex() || bOneNode )
pDestTextNd = rDoc.GetNodes().MakeTextNode( aInsPos.GetNode(),
rDoc.getIDocumentStylePoolAccess().GetTextCollFromPool(RES_POOLCOLL_STANDARD));
else
{
pDestTextNd = pSttTextNd->MakeCopy(rDoc, aInsPos.GetNode(), true)->GetTextNode();
bCopyOk = true;
}
aDestIdx.Assign( pDestTextNd, 0 );
bCopyCollFormat = true;
}
else if( !bOneNode || bColumnSel )
{
const sal_Int32 nContentEnd = pEnd->GetContentIndex();
{
::sw::UndoGuard const ug(rDoc.GetIDocumentUndoRedo());
rDoc.getIDocumentContentOperations().SplitNode( rPos, false );
}
assert(rPos != *pCopyPam->GetPoint()); // code removed
pDestTextNd = rDoc.GetNodes()[ aInsPos.GetIndex()-SwNodeOffset(1) ]->GetTextNode();
aDestIdx.Assign(
pDestTextNd, pDestTextNd->GetText().getLength());
// Correct the area again
if( bEndEqualIns )
{
bool bChg = pEnd != rPam.GetPoint();
if( bChg )
rPam.Exchange();
rPam.Move( fnMoveBackward, GoInContent );
if( bChg )
rPam.Exchange();
}
else if( rPos == *pEnd )
{
// The end was also moved
pEnd->Adjust(SwNodeOffset(-1));
pEnd->SetContent( nContentEnd );
}
// tdf#63022 always reset pEndTextNd after SplitNode
aRg.aEnd = pEnd->GetNode();
pEndTextNd = pEnd->GetNode().GetTextNode();
}
NUMRULE_STATE
if( bCopyCollFormat && bOneNode )
{
PUSH_NUMRULE_STATE
}
if( !bCopyOk )
{
const sal_Int32 nCpyLen = ( bOneNode
? pEnd->GetContentIndex()
: pSttTextNd->GetText().getLength())
- pStart->GetContentIndex();
pSttTextNd->CopyText( pDestTextNd, aDestIdx, *pStart, nCpyLen );
if( bEndEqualIns )
pEnd->AdjustContent( -nCpyLen );
}
++aRg.aStart;
if( bOneNode )
{
if (bCopyCollFormat)
{
// tdf#138897 no Undo for applying style, SwUndoInserts does it
pSttTextNd->CopyCollFormat(*pDestTextNd, false);
POP_NUMRULE_STATE
}
// Copy at-char flys in rPam.
// Update to new (start) node for flys.
// tdf#126626 prevent duplicate Undos.
::sw::UndoGuard const ug(rDoc.GetIDocumentUndoRedo());
CopyFlyInFlyImpl(aRg, &rPam, *pDestTextNd, false);
break;
}
}
}
else if( pDestTextNd )
{
// Problems with insertion of table selections into "normal" text solved.
// We have to set the correct PaM for Undo, if this PaM starts in a textnode,
// the undo operation will try to merge this node after removing the table.
// If we didn't split a textnode, the PaM should start at the inserted table node
if (pDestTextNd->Len() && rPos.GetContentIndex() == pDestTextNd->Len())
{ // Insertion at the last position of a textnode
++aInsPos; // The table will be inserted behind the text node
}
else if( rPos.GetContentIndex() )
{ // Insertion in the middle of a text node, it has to be split
// (and joined from undo)
++nDeleteTextNodes;
const sal_Int32 nContentEnd = pEnd->GetContentIndex();
{
::sw::UndoGuard const ug(rDoc.GetIDocumentUndoRedo());
rDoc.getIDocumentContentOperations().SplitNode( rPos, false );
}
assert(rPos != *pCopyPam->GetPoint()); // code removed
// Correct the area again
if( bEndEqualIns )
--aRg.aEnd;
// The end would also be moved
else if( rPos == *pEnd )
{
rPos.Adjust(SwNodeOffset(-1));
rPos.SetContent( nContentEnd );
--aRg.aEnd;
}
}
assert((nDeleteTextNodes.get() != 0) == bCanMoveBack);
}
pDestTextNd = aInsPos.GetNode().GetTextNode();
if (pEndTextNd)
{
oInsContentIndex.emplace(aInsPos.GetNode().GetContentNode(), rPos.GetContentIndex());
if( !pDestTextNd )
{
pDestTextNd = rDoc.GetNodes().MakeTextNode( aInsPos.GetNode(),
rDoc.getIDocumentStylePoolAccess().GetTextCollFromPool(RES_POOLCOLL_STANDARD));
oInsContentIndex->Assign(pDestTextNd, 0);
--aInsPos;
// if we have to insert an extra text node
// at the destination, this node will be our new destination
// (text) node, and thus we increment nDeleteTextNodes. This
// will ensure that this node will be deleted during Undo.
++nDeleteTextNodes; // must be deleted
}
const bool bEmptyDestNd = pDestTextNd->GetText().isEmpty();
NUMRULE_STATE
if( bCopyCollFormat && ( bOneNode || bEmptyDestNd ))
{
PUSH_NUMRULE_STATE
}
pEndTextNd->CopyText(pDestTextNd, *oInsContentIndex,
SwContentIndex(pEndTextNd), pEnd->GetContentIndex());
// Also copy all format templates
if( bCopyCollFormat && ( bOneNode || bEmptyDestNd ))
{
// tdf#138897 no Undo for applying style, SwUndoInserts does it
pEndTextNd->CopyCollFormat(*pDestTextNd, false);
if ( bOneNode )
{
POP_NUMRULE_STATE
}
}
}
SfxItemSet aBrkSet( rDoc.GetAttrPool(), aBreakSetRange );
if ((flags & SwCopyFlags::CopyAll) || aRg.aStart != aRg.aEnd)
{
if (pSttTextNd && bCopyCollFormat && pDestTextNd->HasSwAttrSet())
{
aBrkSet.Put( *pDestTextNd->GetpSwAttrSet() );
if( SfxItemState::SET == aBrkSet.GetItemState( RES_BREAK, false ) )
pDestTextNd->ResetAttr( RES_BREAK );
if( SfxItemState::SET == aBrkSet.GetItemState( RES_PAGEDESC, false ) )
pDestTextNd->ResetAttr( RES_PAGEDESC );
}
}
{
SwPosition startPos(pCopyPam->GetPoint()->GetNode(), SwNodeOffset(+1));
if (bCanMoveBack)
{ // pCopyPam is actually 1 before the copy range so move it fwd
SwPaM temp(*pCopyPam->GetPoint());
temp.Move(fnMoveForward, GoInContent);
startPos = *temp.GetPoint();
}
assert(startPos.GetNode().IsContentNode());
std::pair<SwPaM const&, SwPosition const&> tmp(rPam, startPos);
if( aInsPos == pEnd->GetNode() )
{
SwNodeIndex aSaveIdx( aInsPos, -1 );
assert(pStart->GetNode() != pEnd->GetNode());
pEnd->SetContent(0); // TODO why this?
CopyWithFlyInFly(aRg, aInsPos.GetNode(), &tmp, /*bMakeNewFrames*/true, false, /*bCopyFlyAtFly=*/false, flags);
++aSaveIdx;
pEnd->Assign(aSaveIdx);
}
else
CopyWithFlyInFly(aRg, aInsPos.GetNode(), &tmp, /*bMakeNewFrames*/true, false, /*bCopyFlyAtFly=*/false, flags);
bCopyBookmarks = false;
}
// init *again* - because CopyWithFlyInFly moved startPos
SwPosition startPos(pCopyPam->GetPoint()->GetNode(), SwNodeOffset(+1));
// at-char anchors post SplitNode are on index 0 of 2nd node and will
// remain there - move them back to the start (end would also work?)
// ... also for at-para anchors; here start is preferable because
// it's consistent with SplitNode from SwUndoInserts::RedoImpl()
if (pFlysAtInsPos
&& (bCanMoveBack
|| startPos.GetNode().IsTextNode()
|| (pCopyPam->GetPoint()->GetNode().IsStartNode()
&& startPos.GetNode().IsSectionNode()))) // not into table
{
if (bCanMoveBack)
{ // pCopyPam is actually 1 before the copy range so move it fwd
SwPaM temp(*pCopyPam->GetPoint());
temp.Move(fnMoveForward, GoInContent);
startPos = *temp.GetPoint();
}
else if (startPos.GetNode().IsSectionNode())
{ // probably on top-level start node, so no CheckNodesRange here;
GoNextPos(&startPos, false); // SwFEShell::Paste() deletes node
}
assert(startPos.GetNode().IsContentNode());
SwPosition startPosAtPara(startPos);
startPosAtPara.nContent.Assign(nullptr, 0);
for (SwFrameFormat * pFly : *pFlysAtInsPos)
{
SwFormatAnchor const*const pAnchor = &pFly->GetAnchor();
if (pAnchor->GetAnchorId() == RndStdIds::FLY_AT_CHAR)
{
SwFormatAnchor anchor(*pAnchor);
anchor.SetAnchor( &startPos );
pFly->SetFormatAttr(anchor);
}
else if (pAnchor->GetAnchorId() == RndStdIds::FLY_AT_PARA)
{
SwFormatAnchor anchor(*pAnchor);
anchor.SetAnchor( &startPosAtPara );
bool bSplitFly = false;
if (pFly->GetFlySplit().GetValue())
{
SwIterator<SwFrame, SwModify> aIter(*pFly);
bSplitFly = aIter.First() && aIter.Next();
}
if (bSplitFly)
{
// This fly format has multiple frames, and we change the anchor. Remove the
// old frames, which were based on the old anchor position.
pFly->DelFrames();
}
pFly->SetFormatAttr(anchor);
if (bSplitFly)
{
// Re-create the frames now that the new anchor is set.
pFly->MakeFrames();
}
}
}
}
if ((flags & SwCopyFlags::CopyAll) || aRg.aStart != aRg.aEnd)
{
// Put the breaks back into the first node
if( aBrkSet.Count() && nullptr != ( pDestTextNd = rDoc.GetNodes()[
pCopyPam->GetPoint()->GetNodeIndex()+1 ]->GetTextNode()))
{
pDestTextNd->SetAttr( aBrkSet );
bCopyPageSource = true;
}
}
} while( false );
// it is not possible to make this test when copy from the clipBoard to document
// in this case the PageNum not exist anymore
// tdf#39400 and tdf#97526
// when copy from document to ClipBoard, and it is from the first page
// and not the source has the page break
if (rDoc.IsClipBoard() && (rPam.GetPageNum(pStart == rPam.GetPoint()) == 1) && !bCopyPageSource)
{
if (pDestTextNd)
{
pDestTextNd->ResetAttr(RES_BREAK); // remove the page-break
pDestTextNd->ResetAttr(RES_PAGEDESC);
}
}
// Adjust position (in case it was moved / in another node)
rPos.nContent.Assign( rPos.GetNode().GetContentNode(),
rPos.GetContentIndex() );
if( rPos.GetNode() != aInsPos.GetNode() )
{
if (aInsPos < rPos.GetNode())
{ // tdf#134250 decremented in (pEndTextNd && !pDestTextNd) above
pCopyPam->GetMark()->AssignEndIndex(*aInsPos.GetNode().GetContentNode());
}
else // incremented in (!pSttTextNd && pDestTextNd) above
{
// assign also content index in this case, see testSectionAnchorCopyTableAtStart
assert(oInsContentIndex);
assert(oInsContentIndex->GetContentNode() == &aInsPos.GetNode());
pCopyPam->GetMark()->Assign(aInsPos, oInsContentIndex->GetIndex());
}
rPos = *pCopyPam->GetMark();
}
else
*pCopyPam->GetMark() = rPos;
if (bCanMoveBack)
{
pCopyPam->Move(fnMoveForward, GoInContent);
}
else
{
// Reset the offset to 0 as it was before the insertion
pCopyPam->GetPoint()->Adjust(SwNodeOffset(+1));
}
oInsContentIndex.reset();
pCopyPam->Exchange();
// Also copy all bookmarks
if( bCopyBookmarks && m_rDoc.getIDocumentMarkAccess()->getAllMarksCount() )
{
sw::CopyBookmarks(rPam, *pCopyPam->Start());
}
if( RedlineFlags::DeleteRedlines & eOld )
{
assert(*pCopyPam->GetPoint() == rPos);
// the Node rPos points to may be deleted so unregister ...
rPos.nContent.Assign(nullptr, 0);
lcl_DeleteRedlines(rPam, *pCopyPam);
rPos = *pCopyPam->GetPoint(); // ... and restore.
}
// If Undo is enabled, store the inserted area
if (rDoc.GetIDocumentUndoRedo().DoesUndo())
{
// append it after styles have been copied when copying nodes
rDoc.GetIDocumentUndoRedo().AppendUndo( std::unique_ptr<SwUndo>(pUndo) );
pUndo->SetInsertRange(*pCopyPam, true, nDeleteTextNodes);
}
if( pCpyRange )
{
pCpyRange->SetMark();
*pCpyRange->GetPoint() = *pCopyPam->GetPoint();
*pCpyRange->GetMark() = *pCopyPam->GetMark();
}
if ( pNumRuleToPropagate != nullptr )
{
// #i86492# - use <SwDoc::SetNumRule(..)>, because it also handles the <ListId>
// Don't reset indent attributes, that would mean loss of direct
// formatting.
// It could be that pNumRuleToPropagate is already applied via
// the paragraph style, in that case applying it again in mpAttrSet could
// override indents, so avoid that.
rDoc.SetNumRule(*pCopyPam, *pNumRuleToPropagate,
SwDoc::SetNumRuleMode::DontSetIfAlreadyApplied, nullptr, aListIdToPropagate,
pTextLeftMarginToPropagate, pFirstLineIndentToPropagate);
}
rDoc.getIDocumentRedlineAccess().SetRedlineFlags_intern( eOld );
rDoc.getIDocumentState().SetModified();
return true;
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'InsertText' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'Assign' is required to be utilized.
↑ V530 The return value of function 'SetNumRule' is required to be utilized.
↑ V547 Expression '!"mst: this is assumed to be dead code"' is always false.
↑ V547 Expression '!bAdd' is always true.
↑ V560 A part of conditional expression is always true: pTextNd.
↑ V560 A part of conditional expression is always true: pEndTextNd.
↑ V581 The conditional expressions of the 'if' statements situated alongside each other are identical. Check lines: 1552, 1580.
↑ V1007 The value from the potentially uninitialized optional 'oSaveInsPos' is used. Probably it is a mistake.
↑ V1007 The value from the potentially uninitialized optional 'oInsContentIndex' is used. Probably it is a mistake.
↑ V1007 The value from the potentially uninitialized optional 'oInsContentIndex' is used. Probably it is a mistake.
↑ V1051 Consider checking for misprints. It's possible that the 'pDestTextNd' should be checked here.