Adding upstream version 4:24.2.0.upstream/4%24.2.0

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

1 files changed, 236 insertions, 0 deletions

diff --git a/sw/source/core/undo/unsort.cxx b/sw/source/core/undo/unsort.cxx
new file mode 100644
index 0000000000..bf188918a4
--- /dev/null
+++ b/sw/source/core/undo/unsort.cxx
@@ -0,0 +1,236 @@
+/* -*- 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 <memory>
+#include <UndoSort.hxx>
+#include <doc.hxx>
+#include <swundo.hxx>
+#include <pam.hxx>
+#include <swtable.hxx>
+#include <ndtxt.hxx>
+#include <UndoCore.hxx>
+#include <UndoTable.hxx>
+#include <sortopt.hxx>
+#include <docsort.hxx>
+#include <node2lay.hxx>
+
+SwUndoSort::SwUndoSort(const SwPaM& rRg, const SwSortOptions& rOpt)
+    : SwUndo(SwUndoId::SORT_TXT, &rRg.GetDoc())
+    , SwUndRng(rRg)
+    , m_nTableNode(0)
+{
+    m_pSortOptions.reset( new SwSortOptions(rOpt) );
+}
+
+SwUndoSort::SwUndoSort( SwNodeOffset nStt, SwNodeOffset nEnd, const SwTableNode& rTableNd,
+                        const SwSortOptions& rOpt, bool bSaveTable )
+    : SwUndo(SwUndoId::SORT_TBL, &rTableNd.GetDoc())
+{
+    m_nSttNode = nStt;
+    m_nEndNode = nEnd;
+    m_nTableNode   = rTableNd.GetIndex();
+
+    m_pSortOptions.reset( new SwSortOptions(rOpt) );
+    if( bSaveTable )
+        m_pUndoAttrTable.reset( new SwUndoAttrTable( rTableNd ) );
+}
+
+SwUndoSort::~SwUndoSort()
+{
+    m_pSortOptions.reset();
+    m_pUndoAttrTable.reset();
+}
+
+void SwUndoSort::UndoImpl(::sw::UndoRedoContext & rContext)
+{
+    SwDoc & rDoc = rContext.GetDoc();
+    if(m_pSortOptions->bTable)
+    {
+        // Undo for Table
+        RemoveIdxFromSection( rDoc, m_nSttNode, &m_nEndNode );
+
+        if( m_pUndoAttrTable )
+        {
+            m_pUndoAttrTable->UndoImpl(rContext);
+        }
+
+        SwTableNode* pTableNd = rDoc.GetNodes()[ m_nTableNode ]->GetTableNode();
+
+        // #i37739# A simple 'MakeFrames' after the node sorting
+        // does not work if the table is inside a frame and has no prev/next.
+        SwNode2LayoutSaveUpperFrames aNode2Layout(*pTableNd);
+
+        pTableNd->DelFrames();
+        const SwTable& rTable = pTableNd->GetTable();
+
+        SwMovedBoxes aMovedList;
+        for (std::unique_ptr<SwSortUndoElement> const& pElement : m_SortList)
+        {
+            const SwTableBox* pSource = rTable.GetTableBox(pElement->maSourceString);
+            const SwTableBox* pTarget = rTable.GetTableBox(pElement->maTargetString);
+
+            // move back
+            MoveCell(&rDoc, pTarget, pSource,
+                     USHRT_MAX != aMovedList.GetPos(pSource) );
+
+            // store moved entry in list
+            aMovedList.push_back(pTarget);
+        }
+
+        // Restore table frames:
+        // #i37739# A simple 'MakeFrames' after the node sorting
+        // does not work if the table is inside a frame and has no prev/next.
+        const SwNodeOffset nIdx = pTableNd->GetIndex();
+        aNode2Layout.RestoreUpperFrames( rDoc.GetNodes(), nIdx, nIdx + 1 );
+    }
+    else
+    {
+        // Undo for Text
+        SwPaM & rPam( AddUndoRedoPaM(rContext) );
+        RemoveIdxFromRange(rPam, true);
+
+        // create index for (sorted) positions
+        // The IndexList must be created based on (asc.) sorted SourcePosition.
+        std::vector<SwNodeIndex> aIdxList;
+        aIdxList.reserve(m_SortList.size());
+
+        for (size_t i = 0; i < m_SortList.size(); ++i)
+        {
+            for (std::unique_ptr<SwSortUndoElement> const& pElement : m_SortList)
+            {
+                if (pElement->mnSourceNodeOffset == (m_nSttNode + SwNodeOffset(i)))
+                {
+                    aIdxList.push_back( SwNodeIndex(rDoc.GetNodes(), pElement->mnTargetNodeOffset));
+                    break;
+                }
+            }
+        }
+
+        for (size_t i = 0; i < m_SortList.size(); ++i)
+        {
+            SwNodeIndex aIdx( rDoc.GetNodes(), m_nSttNode + SwNodeOffset(i) );
+            SwNodeRange aRg( aIdxList[i], SwNodeOffset(0), aIdxList[i], SwNodeOffset(1) );
+            rDoc.getIDocumentContentOperations().MoveNodeRange(aRg, aIdx.GetNode(),
+                SwMoveFlags::DEFAULT);
+        }
+        // delete indices
+        aIdxList.clear();
+        SetPaM(rPam, true);
+    }
+}
+
+void SwUndoSort::RedoImpl(::sw::UndoRedoContext & rContext)
+{
+    SwDoc & rDoc = rContext.GetDoc();
+
+    if(m_pSortOptions->bTable)
+    {
+        // Redo for Table
+        RemoveIdxFromSection( rDoc, m_nSttNode, &m_nEndNode );
+
+        SwTableNode* pTableNd = rDoc.GetNodes()[ m_nTableNode ]->GetTableNode();
+
+        // #i37739# A simple 'MakeFrames' after the node sorting
+        // does not work if the table is inside a frame and has no prev/next.
+        SwNode2LayoutSaveUpperFrames aNode2Layout(*pTableNd);
+
+        pTableNd->DelFrames();
+        const SwTable& rTable = pTableNd->GetTable();
+
+        SwMovedBoxes aMovedList;
+        for (std::unique_ptr<SwSortUndoElement> const& pElement: m_SortList)
+        {
+            const SwTableBox* pSource = rTable.GetTableBox(pElement->maSourceString);
+            const SwTableBox* pTarget = rTable.GetTableBox(pElement->maTargetString);
+
+            // move back
+            MoveCell(&rDoc, pSource, pTarget,
+                     USHRT_MAX != aMovedList.GetPos( pTarget ) );
+            // store moved entry in list
+            aMovedList.push_back( pSource );
+        }
+
+        if( m_pUndoAttrTable )
+        {
+            m_pUndoAttrTable->RedoImpl(rContext);
+        }
+
+        // Restore table frames:
+        // #i37739# A simple 'MakeFrames' after the node sorting
+        // does not work if the table is inside a frame and has no prev/next.
+        const SwNodeOffset nIdx = pTableNd->GetIndex();
+        aNode2Layout.RestoreUpperFrames( rDoc.GetNodes(), nIdx, nIdx + 1 );
+    }
+    else
+    {
+        // Redo for Text
+        SwPaM & rPam( AddUndoRedoPaM(rContext) );
+        SetPaM(rPam);
+        RemoveIdxFromRange(rPam, true);
+
+        std::vector<SwNodeIndex> aIdxList;
+        aIdxList.reserve(m_SortList.size());
+
+        for (size_t i = 0; i < m_SortList.size(); ++i)
+        {   // current position is starting point
+            aIdxList.push_back( SwNodeIndex(rDoc.GetNodes(), m_SortList[i]->mnSourceNodeOffset) );
+        }
+
+        for (size_t i = 0; i < m_SortList.size(); ++i)
+        {
+            SwNodeIndex aIdx( rDoc.GetNodes(), m_nSttNode + SwNodeOffset(i));
+            SwNodeRange aRg( aIdxList[i], SwNodeOffset(0), aIdxList[i], SwNodeOffset(1) );
+            rDoc.getIDocumentContentOperations().MoveNodeRange(aRg, aIdx.GetNode(),
+                SwMoveFlags::DEFAULT);
+        }
+        // delete indices
+        aIdxList.clear();
+        SetPaM(rPam, true);
+        SwTextNode const*const pTNd = rPam.GetPointNode().GetTextNode();
+        if( pTNd )
+        {
+            rPam.GetPoint()->SetContent( pTNd->GetText().getLength() );
+        }
+    }
+}
+
+void SwUndoSort::RepeatImpl(::sw::RepeatContext & rContext)
+{
+    // table not repeat capable
+    if(!m_pSortOptions->bTable)
+    {
+        SwPaM *const pPam = & rContext.GetRepeatPaM();
+        SwDoc& rDoc = pPam->GetDoc();
+
+        if( !SwDoc::IsInTable( pPam->Start()->GetNode() ) )
+            rDoc.SortText(*pPam, *m_pSortOptions);
+    }
+}
+
+void SwUndoSort::Insert( const OUString& rOrgPos, const OUString& rNewPos)
+{
+    m_SortList.push_back(std::make_unique<SwSortUndoElement>(rOrgPos, rNewPos));
+}
+
+void SwUndoSort::Insert( SwNodeOffset nOrgPos, SwNodeOffset nNewPos)
+{
+    m_SortList.push_back(std::make_unique<SwSortUndoElement>(nOrgPos, nNewPos));
+}
+
+/* vim:set shiftwidth=4 softtabstop=4 expandtab: */