1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107
|
/* -*- 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 <UndoDelete.hxx>
#include <hintids.hxx>
#include <unotools/charclass.hxx>
#include <editeng/formatbreakitem.hxx>
#include <fmtpdsc.hxx>
#include <frmfmt.hxx>
#include <fmtanchr.hxx>
#include <doc.hxx>
#include <UndoManager.hxx>
#include <IDocumentRedlineAccess.hxx>
#include <IDocumentStylePoolAccess.hxx>
#include <swtable.hxx>
#include <swundo.hxx>
#include <pam.hxx>
#include <ndtxt.hxx>
#include <UndoCore.hxx>
#include <rolbck.hxx>
#include <poolfmt.hxx>
#include <mvsave.hxx>
#include <redline.hxx>
#include <docary.hxx>
#include <sfx2/app.hxx>
#include <fldbas.hxx>
#include <fmtfld.hxx>
#include <comcore.hrc>
#include <undo.hrc>
#include <vector>
// DELETE
/* lcl_MakeAutoFrames has to call MakeFrames for objects bounded "AtChar"
( == AUTO ), if the anchor frame has be moved via MoveNodes(..) and
DelFrames(..)
*/
static void lcl_MakeAutoFrames( const SwFrameFormats& rSpzArr, sal_uLong nMovedIndex )
{
if( !rSpzArr.empty() )
{
for( size_t n = 0; n < rSpzArr.size(); ++n )
{
SwFrameFormat * pFormat = rSpzArr[n];
const SwFormatAnchor* pAnchor = &pFormat->GetAnchor();
if (pAnchor->GetAnchorId() == FLY_AT_CHAR)
{
const SwPosition* pAPos = pAnchor->GetContentAnchor();
if( pAPos && nMovedIndex == pAPos->nNode.GetIndex() )
pFormat->MakeFrames();
}
}
}
}
// SwUndoDelete has to perform a deletion and to record anything that is needed
// to restore the situation before the deletion. Unfortunately a part of the
// deletion will be done after calling this Ctor, this has to be kept in mind!
// In this Ctor only the complete paragraphs will be deleted, the joining of
// the first and last paragraph of the selection will be handled outside this
// function.
// Here are the main steps of the function:
// 1. Deletion/recording of content indices of the selection: footnotes, fly
// frames and bookmarks
// Step 1 could shift all nodes by deletion of footnotes => nNdDiff will be set.
// 2. If the paragraph where the selection ends, is the last content of a
// section so that this section becomes empty when the paragraphs will be
// joined we have to do some smart actions ;-) The paragraph will be moved
// outside the section and replaced by a dummy text node, the complete
// section will be deleted in step 3. The difference between replacement
// dummy and original is nReplacementDummy.
// 3. Moving complete selected nodes into the UndoArray. Before this happens the
// selection has to be extended if there are sections which would become
// empty otherwise. BTW: sections will be moved into the UndoArray if they
// are complete part of the selection. Sections starting or ending outside
// of the selection will not be removed from the DocNodeArray even they got
// a "dummy"-copy in the UndoArray.
// 4. We have to anticipate the joining of the two paragraphs if the start
// paragraph is inside a section and the end paragraph not. Then we have to
// move the paragraph into this section and to record this in nSectDiff.
SwUndoDelete::SwUndoDelete(
SwPaM& rPam,
bool bFullPara,
bool bCalledByTableCpy )
: SwUndo(UNDO_DELETE),
SwUndRng( rPam ),
m_pMvStt( nullptr ),
m_pSttStr(nullptr),
m_pEndStr(nullptr),
m_pRedlSaveData(nullptr),
m_nNode(0),
m_nNdDiff(0),
m_nSectDiff(0),
m_nReplaceDummy(0),
m_nSetPos(0),
m_bGroup( false ),
m_bBackSp( false ),
m_bJoinNext( false ),
m_bTableDelLastNd( false ),
// bFullPara is set e.g. if an empty paragraph before a table is deleted
m_bDelFullPara( bFullPara ),
m_bResetPgDesc( false ),
m_bResetPgBrk( false ),
m_bFromTableCopy( bCalledByTableCpy )
{
bCacheComment = false;
SwDoc * pDoc = rPam.GetDoc();
if( !pDoc->getIDocumentRedlineAccess().IsIgnoreRedline() && !pDoc->getIDocumentRedlineAccess().GetRedlineTable().empty() )
{
m_pRedlSaveData = new SwRedlineSaveDatas;
if( !FillSaveData( rPam, *m_pRedlSaveData ))
{
delete m_pRedlSaveData;
m_pRedlSaveData = nullptr;
}
}
if( !pHistory )
pHistory = new SwHistory;
// delete all footnotes for now
const SwPosition *pStt = rPam.Start(),
*pEnd = rPam.GetPoint() == pStt
? rPam.GetMark()
: rPam.GetPoint();
// Step 1. deletion/record of content indices
if( m_bDelFullPara )
{
OSL_ENSURE( rPam.HasMark(), "PaM ohne Mark" );
DelContentIndex( *rPam.GetMark(), *rPam.GetPoint(),
DelContentType(nsDelContentType::DELCNT_ALL | nsDelContentType::DELCNT_CHKNOCNTNT) );
::sw::UndoGuard const undoGuard(pDoc->GetIDocumentUndoRedo());
DelBookmarks(pStt->nNode, pEnd->nNode);
}
else
{
DelContentIndex( *rPam.GetMark(), *rPam.GetPoint() );
::sw::UndoGuard const undoGuard(pDoc->GetIDocumentUndoRedo());
if (nEndNode - nSttNode > 1) // check for fully selected nodes
{
SwNodeIndex const start(pStt->nNode, +1);
DelBookmarks(start, pEnd->nNode);
}
}
m_nSetPos = pHistory ? pHistory->Count() : 0;
// Is already anything deleted?
m_nNdDiff = nSttNode - pStt->nNode.GetIndex();
m_bJoinNext = !bFullPara && pEnd == rPam.GetPoint();
m_bBackSp = !bFullPara && !m_bJoinNext;
SwTextNode *pSttTextNd = nullptr, *pEndTextNd = nullptr;
if( !bFullPara )
{
pSttTextNd = pStt->nNode.GetNode().GetTextNode();
pEndTextNd = nSttNode == nEndNode
? pSttTextNd
: pEnd->nNode.GetNode().GetTextNode();
}
bool bMoveNds = *pStt != *pEnd // any area still existent?
&& ( SaveContent( pStt, pEnd, pSttTextNd, pEndTextNd ) || m_bFromTableCopy );
if( pSttTextNd && pEndTextNd && pSttTextNd != pEndTextNd )
{
// two different TextNodes, thus save also the TextFormatCollection
pHistory->Add( pSttTextNd->GetTextColl(),pStt->nNode.GetIndex(), ND_TEXTNODE );
pHistory->Add( pEndTextNd->GetTextColl(),pEnd->nNode.GetIndex(), ND_TEXTNODE );
if( !m_bJoinNext ) // Selection from bottom to top
{
// When using JoinPrev() all AUTO-PageBreak's will be copied
// correctly. To restore them with UNDO, Auto-PageBreak of the
// EndNode needs to be reset. Same for PageDesc and ColBreak.
if( pEndTextNd->HasSwAttrSet() )
{
SwRegHistory aRegHist( *pEndTextNd, pHistory );
if( SfxItemState::SET == pEndTextNd->GetpSwAttrSet()->GetItemState(
RES_BREAK, false ) )
pEndTextNd->ResetAttr( RES_BREAK );
if( pEndTextNd->HasSwAttrSet() &&
SfxItemState::SET == pEndTextNd->GetpSwAttrSet()->GetItemState(
RES_PAGEDESC, false ) )
pEndTextNd->ResetAttr( RES_PAGEDESC );
}
}
}
// Move now also the PaM. The SPoint is at the beginning of a SSelection.
if( pEnd == rPam.GetPoint() && ( !bFullPara || pSttTextNd || pEndTextNd ) )
rPam.Exchange();
if( !pSttTextNd && !pEndTextNd )
--rPam.GetPoint()->nNode;
rPam.DeleteMark(); // the SPoint is in the selection
if( !pEndTextNd )
nEndContent = 0;
if( !pSttTextNd )
nSttContent = 0;
if( bMoveNds ) // Do Nodes exist that need to be moved?
{
SwNodes& rNds = pDoc->GetUndoManager().GetUndoNodes();
SwNodes& rDocNds = pDoc->GetNodes();
SwNodeRange aRg( rDocNds, nSttNode - m_nNdDiff,
rDocNds, nEndNode - m_nNdDiff );
if( !bFullPara && !pEndTextNd &&
&aRg.aEnd.GetNode() != &pDoc->GetNodes().GetEndOfContent() )
{
SwNode* pNode = aRg.aEnd.GetNode().StartOfSectionNode();
if( pNode->GetIndex() >= nSttNode - m_nNdDiff )
++aRg.aEnd; // Deletion of a complete table
}
SwNode* pTmpNd;
// Step 2: Expand selection if necessary
if( m_bJoinNext || bFullPara )
{
// If all content of a section will be moved into Undo, the section
// itself should be moved completely.
while( aRg.aEnd.GetIndex() + 2 < rDocNds.Count() &&
( (pTmpNd = rDocNds[ aRg.aEnd.GetIndex()+1 ])->IsEndNode() &&
pTmpNd->StartOfSectionNode()->IsSectionNode() &&
pTmpNd->StartOfSectionNode()->GetIndex() >= aRg.aStart.GetIndex() ) )
++aRg.aEnd;
m_nReplaceDummy = aRg.aEnd.GetIndex() + m_nNdDiff - nEndNode;
if( m_nReplaceDummy )
{ // The selection has been expanded, because
++aRg.aEnd;
if( pEndTextNd )
{
// The end text node has to leave the (expanded) selection
// The dummy is needed because MoveNodes deletes empty
// sections
++m_nReplaceDummy;
SwNodeRange aMvRg( *pEndTextNd, 0, *pEndTextNd, 1 );
SwPosition aSplitPos( *pEndTextNd );
::sw::UndoGuard const ug(pDoc->GetIDocumentUndoRedo());
pDoc->getIDocumentContentOperations().SplitNode( aSplitPos, false );
rDocNds.MoveNodes( aMvRg, rDocNds, aRg.aEnd );
--aRg.aEnd;
}
else
m_nReplaceDummy = 0;
}
}
if( m_bBackSp || bFullPara )
{
// See above, the selection has to be expanded if there are "nearly
// empty" sections and a replacement dummy has to be set if needed.
while( 1 < aRg.aStart.GetIndex() &&
( (pTmpNd = rDocNds[ aRg.aStart.GetIndex()-1 ])->IsSectionNode() &&
pTmpNd->EndOfSectionIndex() < aRg.aEnd.GetIndex() ) )
--aRg.aStart;
if( pSttTextNd )
{
m_nReplaceDummy = nSttNode - m_nNdDiff - aRg.aStart.GetIndex();
if( m_nReplaceDummy )
{
SwNodeRange aMvRg( *pSttTextNd, 0, *pSttTextNd, 1 );
SwPosition aSplitPos( *pSttTextNd );
::sw::UndoGuard const ug(pDoc->GetIDocumentUndoRedo());
pDoc->getIDocumentContentOperations().SplitNode( aSplitPos, false );
rDocNds.MoveNodes( aMvRg, rDocNds, aRg.aStart );
--aRg.aStart;
}
}
}
if( m_bFromTableCopy )
{
if( !pEndTextNd )
{
if( pSttTextNd )
++aRg.aStart;
else if( !bFullPara && !aRg.aEnd.GetNode().IsContentNode() )
--aRg.aEnd;
}
}
else if (pSttTextNd && (pEndTextNd || pSttTextNd->GetText().getLength()))
++aRg.aStart;
// Step 3: Moving into UndoArray...
m_nNode = rNds.GetEndOfContent().GetIndex();
rDocNds.MoveNodes( aRg, rNds, SwNodeIndex( rNds.GetEndOfContent() ));
m_pMvStt = new SwNodeIndex( rNds, m_nNode );
// remember difference!
m_nNode = rNds.GetEndOfContent().GetIndex() - m_nNode;
if( pSttTextNd && pEndTextNd )
{
//Step 4: Moving around sections
m_nSectDiff = aRg.aEnd.GetIndex() - aRg.aStart.GetIndex();
// nSect is the number of sections which starts(ends) between start
// and end node of the selection. The "loser" paragraph has to be
// moved into the section(s) of the "winner" paragraph
if( m_nSectDiff )
{
if( m_bJoinNext )
{
SwNodeRange aMvRg( *pEndTextNd, 0, *pEndTextNd, 1 );
rDocNds.MoveNodes( aMvRg, rDocNds, aRg.aStart );
}
else
{
SwNodeRange aMvRg( *pSttTextNd, 0, *pSttTextNd, 1 );
rDocNds.MoveNodes( aMvRg, rDocNds, aRg.aEnd );
}
}
}
if( m_nSectDiff || m_nReplaceDummy )
lcl_MakeAutoFrames( *pDoc->GetSpzFrameFormats(),
m_bJoinNext ? pEndTextNd->GetIndex() : pSttTextNd->GetIndex() );
}
else
m_nNode = 0; // moved no node -> no difference at the end
// Are there any Nodes that got deleted before that (FootNotes
// have ContentNodes)?
if( !pSttTextNd && !pEndTextNd )
{
m_nNdDiff = nSttNode - rPam.GetPoint()->nNode.GetIndex() - (bFullPara ? 0 : 1);
rPam.Move( fnMoveForward, fnGoNode );
}
else
{
m_nNdDiff = nSttNode;
if( m_nSectDiff && m_bBackSp )
m_nNdDiff += m_nSectDiff;
m_nNdDiff -= rPam.GetPoint()->nNode.GetIndex();
}
if( !rPam.GetNode().IsContentNode() )
rPam.GetPoint()->nContent.Assign( nullptr, 0 );
// is a history necessary here at all?
if( pHistory && !pHistory->Count() )
DELETEZ( pHistory );
}
bool SwUndoDelete::SaveContent( const SwPosition* pStt, const SwPosition* pEnd,
SwTextNode* pSttTextNd, SwTextNode* pEndTextNd )
{
sal_uLong nNdIdx = pStt->nNode.GetIndex();
// 1 - copy start in Start-String
if( pSttTextNd )
{
bool bOneNode = nSttNode == nEndNode;
SwRegHistory aRHst( *pSttTextNd, pHistory );
// always save all text atttibutes because of possibly overlapping
// areas of on/off
pHistory->CopyAttr( pSttTextNd->GetpSwpHints(), nNdIdx,
0, pSttTextNd->GetText().getLength(), true );
if( !bOneNode && pSttTextNd->HasSwAttrSet() )
pHistory->CopyFormatAttr( *pSttTextNd->GetpSwAttrSet(), nNdIdx );
// the length might have changed (!!Fields!!)
sal_Int32 nLen = ((bOneNode)
? pEnd->nContent.GetIndex()
: pSttTextNd->GetText().getLength())
- pStt->nContent.GetIndex();
// delete now also the text (all attribute changes are added to
// UNDO history)
m_pSttStr = new OUString( pSttTextNd->GetText().copy(nSttContent, nLen));
pSttTextNd->EraseText( pStt->nContent, nLen );
if( pSttTextNd->GetpSwpHints() )
pSttTextNd->GetpSwpHints()->DeRegister();
// METADATA: store
bool emptied( !m_pSttStr->isEmpty() && !pSttTextNd->Len() );
if (!bOneNode || emptied) // merging may overwrite xmlids...
{
m_pMetadataUndoStart = (emptied)
? pSttTextNd->CreateUndoForDelete()
: pSttTextNd->CreateUndo();
}
if( bOneNode )
return false; // stop moving more nodes
}
// 2 - copy end into End-String
if( pEndTextNd )
{
SwIndex aEndIdx( pEndTextNd );
nNdIdx = pEnd->nNode.GetIndex();
SwRegHistory aRHst( *pEndTextNd, pHistory );
// always save all text atttibutes because of possibly overlapping
// areas of on/off
pHistory->CopyAttr( pEndTextNd->GetpSwpHints(), nNdIdx, 0,
pEndTextNd->GetText().getLength(), true );
if( pEndTextNd->HasSwAttrSet() )
pHistory->CopyFormatAttr( *pEndTextNd->GetpSwAttrSet(), nNdIdx );
// delete now also the text (all attribute changes are added to
// UNDO history)
m_pEndStr = new OUString( pEndTextNd->GetText().copy( 0,
pEnd->nContent.GetIndex() ));
pEndTextNd->EraseText( aEndIdx, pEnd->nContent.GetIndex() );
if( pEndTextNd->GetpSwpHints() )
pEndTextNd->GetpSwpHints()->DeRegister();
// METADATA: store
bool emptied = !m_pEndStr->isEmpty() && !pEndTextNd->Len();
m_pMetadataUndoEnd = (emptied)
? pEndTextNd->CreateUndoForDelete()
: pEndTextNd->CreateUndo();
}
// if there are only two Nodes than we're done
if( ( pSttTextNd || pEndTextNd ) && nSttNode + 1 == nEndNode )
return false; // do not move any Node
return true; // move Nodes lying in between
}
bool SwUndoDelete::CanGrouping( SwDoc* pDoc, const SwPaM& rDelPam )
{
// Is Undo greater than one Node (that is Start and EndString)?
if( !m_pSttStr || m_pSttStr->isEmpty() || m_pEndStr )
return false;
// only the deletion of single char's can be condensed
if( nSttNode != nEndNode || ( !m_bGroup && nSttContent+1 != nEndContent ))
return false;
const SwPosition *pStt = rDelPam.Start(),
*pEnd = rDelPam.GetPoint() == pStt
? rDelPam.GetMark()
: rDelPam.GetPoint();
if( pStt->nNode != pEnd->nNode ||
pStt->nContent.GetIndex()+1 != pEnd->nContent.GetIndex() ||
pEnd->nNode != nSttNode )
return false;
// Distinguish between BackSpace and Delete because the Undo array needs to
// be constructed differently!
if( pEnd->nContent == nSttContent )
{
if( m_bGroup && !m_bBackSp ) return false;
m_bBackSp = true;
}
else if( pStt->nContent == nSttContent )
{
if( m_bGroup && m_bBackSp ) return false;
m_bBackSp = false;
}
else
return false;
// are both Nodes (Node/Undo array) TextNodes at all?
SwTextNode * pDelTextNd = pStt->nNode.GetNode().GetTextNode();
if( !pDelTextNd ) return false;
sal_Int32 nUChrPos = m_bBackSp ? 0 : m_pSttStr->getLength()-1;
sal_Unicode cDelChar = pDelTextNd->GetText()[ pStt->nContent.GetIndex() ];
CharClass& rCC = GetAppCharClass();
if( ( CH_TXTATR_BREAKWORD == cDelChar || CH_TXTATR_INWORD == cDelChar ) ||
rCC.isLetterNumeric( OUString( cDelChar ), 0 ) !=
rCC.isLetterNumeric( *m_pSttStr, nUChrPos ) )
return false;
{
SwRedlineSaveDatas aTmpSav;
const bool bSaved = FillSaveData( rDelPam, aTmpSav, false );
bool bOk = ( !m_pRedlSaveData && !bSaved ) ||
( m_pRedlSaveData && bSaved &&
SwUndo::CanRedlineGroup( *m_pRedlSaveData, aTmpSav, m_bBackSp ));
// aTmpSav.DeleteAndDestroyAll();
if( !bOk )
return false;
pDoc->getIDocumentRedlineAccess().DeleteRedline( rDelPam, false, USHRT_MAX );
}
// Both 'deletes' can be consolidated, so 'move' the related character
if( m_bBackSp )
nSttContent--; // BackSpace: add char to array!
else
{
nEndContent++; // Delete: attach char at the end
nUChrPos++;
}
(*m_pSttStr) = m_pSttStr->replaceAt( nUChrPos, 0, OUString(cDelChar) );
pDelTextNd->EraseText( pStt->nContent, 1 );
m_bGroup = true;
return true;
}
SwUndoDelete::~SwUndoDelete()
{
delete m_pSttStr;
delete m_pEndStr;
if( m_pMvStt ) // Delete also the selection from UndoNodes array
{
// Insert saves content in IconSection
m_pMvStt->GetNode().GetNodes().Delete( *m_pMvStt, m_nNode );
delete m_pMvStt;
}
delete m_pRedlSaveData;
}
static SwRewriter lcl_RewriterFromHistory(SwHistory & rHistory)
{
SwRewriter aRewriter;
bool bDone = false;
for ( sal_uInt16 n = 0; n < rHistory.Count(); n++)
{
OUString aDescr = rHistory[n]->GetDescription();
if (!aDescr.isEmpty())
{
aRewriter.AddRule(UndoArg2, aDescr);
bDone = true;
break;
}
}
if (! bDone)
{
aRewriter.AddRule(UndoArg2, SW_RESSTR(STR_FIELD));
}
return aRewriter;
}
static bool lcl_IsSpecialCharacter(sal_Unicode nChar)
{
switch (nChar)
{
case CH_TXTATR_BREAKWORD:
case CH_TXTATR_INWORD:
case CH_TXTATR_TAB:
case CH_TXTATR_NEWLINE:
return true;
default:
break;
}
return false;
}
static OUString lcl_DenotedPortion(const OUString& rStr, sal_Int32 nStart, sal_Int32 nEnd)
{
OUString aResult;
if (nEnd - nStart > 0)
{
sal_Unicode cLast = rStr[nEnd - 1];
if (lcl_IsSpecialCharacter(cLast))
{
switch(cLast)
{
case CH_TXTATR_TAB:
aResult = SW_RESSTR(STR_UNDO_TABS);
break;
case CH_TXTATR_NEWLINE:
aResult = SW_RESSTR(STR_UNDO_NLS);
break;
case CH_TXTATR_INWORD:
case CH_TXTATR_BREAKWORD:
aResult = SwRewriter::GetPlaceHolder(UndoArg2);
break;
}
SwRewriter aRewriter;
aRewriter.AddRule(UndoArg1,
OUString::number(nEnd - nStart));
aResult = aRewriter.Apply(aResult);
}
else
{
aResult = SW_RESSTR(STR_START_QUOTE);
aResult += rStr.copy(nStart, nEnd - nStart);
aResult += SW_RESSTR(STR_END_QUOTE);
}
}
return aResult;
}
OUString DenoteSpecialCharacters(const OUString & rStr)
{
OUString aResult;
if (!rStr.isEmpty())
{
bool bStart = false;
sal_Int32 nStart = 0;
sal_Unicode cLast = 0;
for( sal_Int32 i = 0; i < rStr.getLength(); i++)
{
if (lcl_IsSpecialCharacter(rStr[i]))
{
if (cLast != rStr[i])
bStart = true;
}
else
{
if (lcl_IsSpecialCharacter(cLast))
bStart = true;
}
if (bStart)
{
aResult += lcl_DenotedPortion(rStr, nStart, i);
nStart = i;
bStart = false;
}
cLast = rStr[i];
}
aResult += lcl_DenotedPortion(rStr, nStart, rStr.getLength());
}
else
aResult = SwRewriter::GetPlaceHolder(UndoArg2);
return aResult;
}
SwRewriter SwUndoDelete::GetRewriter() const
{
SwRewriter aResult;
if (m_nNode != 0)
{
if (!m_sTableName.isEmpty())
{
SwRewriter aRewriter;
aRewriter.AddRule(UndoArg1, SW_RESSTR(STR_START_QUOTE));
aRewriter.AddRule(UndoArg2, m_sTableName);
aRewriter.AddRule(UndoArg3, SW_RESSTR(STR_END_QUOTE));
OUString sTmp = aRewriter.Apply(SW_RES(STR_TABLE_NAME));
aResult.AddRule(UndoArg1, sTmp);
}
else
aResult.AddRule(UndoArg1, SW_RESSTR(STR_PARAGRAPHS));
}
else
{
OUString aStr;
if (m_pSttStr != nullptr && m_pEndStr != nullptr && m_pSttStr->isEmpty() &&
m_pEndStr->isEmpty())
{
aStr = SW_RESSTR(STR_PARAGRAPH_UNDO);
}
else
{
OUString * pStr = nullptr;
if (m_pSttStr != nullptr)
pStr = m_pSttStr;
else if (m_pEndStr != nullptr)
pStr = m_pEndStr;
if (pStr != nullptr)
{
aStr = DenoteSpecialCharacters(*pStr);
}
else
{
aStr = SwRewriter::GetPlaceHolder(UndoArg2);
}
}
aStr = ShortenString(aStr, nUndoStringLength, OUString(SW_RES(STR_LDOTS)));
if (pHistory)
{
SwRewriter aRewriter = lcl_RewriterFromHistory(*pHistory);
aStr = aRewriter.Apply(aStr);
}
aResult.AddRule(UndoArg1, aStr);
}
return aResult;
}
// Every object, anchored "AtContent" will be reanchored at rPos
static void lcl_ReAnchorAtContentFlyFrames( const SwFrameFormats& rSpzArr, SwPosition &rPos, sal_uLong nOldIdx )
{
if( !rSpzArr.empty() )
{
SwFlyFrameFormat* pFormat;
const SwFormatAnchor* pAnchor;
const SwPosition* pAPos;
for( size_t n = 0; n < rSpzArr.size(); ++n )
{
pFormat = static_cast<SwFlyFrameFormat*>(rSpzArr[n]);
pAnchor = &pFormat->GetAnchor();
if (pAnchor->GetAnchorId() == FLY_AT_PARA)
{
pAPos = pAnchor->GetContentAnchor();
if( pAPos && nOldIdx == pAPos->nNode.GetIndex() )
{
SwFormatAnchor aAnch( *pAnchor );
aAnch.SetAnchor( &rPos );
pFormat->SetFormatAttr( aAnch );
}
}
}
}
}
void SwUndoDelete::UndoImpl(::sw::UndoRedoContext & rContext)
{
SwDoc& rDoc = rContext.GetDoc();
sal_uLong nCalcStt = nSttNode - m_nNdDiff;
if( m_nSectDiff && m_bBackSp )
nCalcStt += m_nSectDiff;
SwNodeIndex aIdx(rDoc.GetNodes(), nCalcStt);
SwNode* pInsNd = &aIdx.GetNode();
{ // code block so that SwPosition is detached when deleting a Node
SwPosition aPos( aIdx );
if( !m_bDelFullPara )
{
if( pInsNd->IsTableNode() )
{
pInsNd = rDoc.GetNodes().MakeTextNode( aIdx,
rDoc.GetDfltTextFormatColl() );
--aIdx;
aPos.nNode = aIdx;
aPos.nContent.Assign( pInsNd->GetContentNode(), nSttContent );
}
else
{
if( pInsNd->IsContentNode() )
aPos.nContent.Assign( static_cast<SwContentNode*>(pInsNd), nSttContent );
if( !m_bTableDelLastNd )
pInsNd = nullptr; // do not delete Node!
}
}
else
pInsNd = nullptr; // do not delete Node!
bool bNodeMove = 0 != m_nNode;
if( m_pEndStr )
{
// discard attributes since they all saved!
SwTextNode* pTextNd = aPos.nNode.GetNode().GetTextNode();
if( pTextNd && pTextNd->HasSwAttrSet() )
pTextNd->ResetAllAttr();
if( pTextNd && pTextNd->GetpSwpHints() )
pTextNd->ClearSwpHintsArr( true );
if( m_pSttStr && !m_bFromTableCopy )
{
sal_uLong nOldIdx = aPos.nNode.GetIndex();
rDoc.getIDocumentContentOperations().SplitNode( aPos, false );
// After the split all objects are anchored at the first
// paragraph, but the pHistory of the fly frame formats relies
// on anchoring at the start of the selection
// => selection backwards needs a correction.
if( m_bBackSp )
lcl_ReAnchorAtContentFlyFrames(*rDoc.GetSpzFrameFormats(), aPos, nOldIdx);
pTextNd = aPos.nNode.GetNode().GetTextNode();
}
if( pTextNd )
{
OUString const ins( pTextNd->InsertText(*m_pEndStr, aPos.nContent,
SwInsertFlags::NOHINTEXPAND) );
assert(ins.getLength() == m_pEndStr->getLength()); // must succeed
(void) ins;
// METADATA: restore
pTextNd->RestoreMetadata(m_pMetadataUndoEnd);
}
}
else if( m_pSttStr && bNodeMove )
{
SwTextNode * pNd = aPos.nNode.GetNode().GetTextNode();
if( pNd )
{
if (nSttContent < pNd->GetText().getLength())
{
sal_uLong nOldIdx = aPos.nNode.GetIndex();
rDoc.getIDocumentContentOperations().SplitNode( aPos, false );
if( m_bBackSp )
lcl_ReAnchorAtContentFlyFrames(*rDoc.GetSpzFrameFormats(), aPos, nOldIdx);
}
else
++aPos.nNode;
}
}
SwNode* pMovedNode = nullptr;
if( m_nSectDiff )
{
sal_uLong nMoveIndex = aPos.nNode.GetIndex();
int nDiff = 0;
if( m_bJoinNext )
{
nMoveIndex += m_nSectDiff + 1;
pMovedNode = &aPos.nNode.GetNode();
}
else
{
nMoveIndex -= m_nSectDiff + 1;
++nDiff;
}
SwNodeIndex aMvIdx(rDoc.GetNodes(), nMoveIndex);
SwNodeRange aRg( aPos.nNode, 0 - nDiff, aPos.nNode, 1 - nDiff );
--aPos.nNode;
if( !m_bJoinNext )
pMovedNode = &aPos.nNode.GetNode();
rDoc.GetNodes().MoveNodes(aRg, rDoc.GetNodes(), aMvIdx);
++aPos.nNode;
}
if( bNodeMove )
{
SwNodeRange aRange( *m_pMvStt, 0, *m_pMvStt, m_nNode );
SwNodeIndex aCopyIndex( aPos.nNode, -1 );
rDoc.GetUndoManager().GetUndoNodes().Copy_( aRange, aPos.nNode );
if( m_nReplaceDummy )
{
sal_uLong nMoveIndex;
if( m_bJoinNext )
{
nMoveIndex = nEndNode - m_nNdDiff;
aPos.nNode = nMoveIndex + m_nReplaceDummy;
}
else
{
aPos = SwPosition( aCopyIndex );
nMoveIndex = aPos.nNode.GetIndex() + m_nReplaceDummy + 1;
}
SwNodeIndex aMvIdx(rDoc.GetNodes(), nMoveIndex);
SwNodeRange aRg( aPos.nNode, 0, aPos.nNode, 1 );
pMovedNode = &aPos.nNode.GetNode();
rDoc.GetNodes().MoveNodes(aRg, rDoc.GetNodes(), aMvIdx);
rDoc.GetNodes().Delete( aMvIdx);
}
}
if( pMovedNode )
lcl_MakeAutoFrames(*rDoc.GetSpzFrameFormats(), pMovedNode->GetIndex());
if( m_pSttStr )
{
aPos.nNode = nSttNode - m_nNdDiff + ( m_bJoinNext ? 0 : m_nReplaceDummy );
SwTextNode * pTextNd = aPos.nNode.GetNode().GetTextNode();
// If more than a single Node got deleted, also all "Node"
// attributes were saved
if (pTextNd != nullptr)
{
if( pTextNd->HasSwAttrSet() && bNodeMove && !m_pEndStr )
pTextNd->ResetAllAttr();
if( pTextNd->GetpSwpHints() )
pTextNd->ClearSwpHintsArr( true );
// SectionNode mode and selection from top to bottom:
// -> in StartNode is still the rest of the Join => delete
aPos.nContent.Assign( pTextNd, nSttContent );
OUString const ins( pTextNd->InsertText(*m_pSttStr, aPos.nContent,
SwInsertFlags::NOHINTEXPAND) );
assert(ins.getLength() == m_pSttStr->getLength()); // must succeed
(void) ins;
// METADATA: restore
pTextNd->RestoreMetadata(m_pMetadataUndoStart);
}
}
if( pHistory )
{
pHistory->TmpRollback(&rDoc, m_nSetPos, false);
if( m_nSetPos ) // there were Footnodes/FlyFrames
{
// are there others than these ones?
if( m_nSetPos < pHistory->Count() )
{
// if so save the attributes of the others
SwHistory aHstr;
aHstr.Move( 0, pHistory, m_nSetPos );
pHistory->Rollback(&rDoc);
pHistory->Move( 0, &aHstr );
}
else
{
pHistory->Rollback(&rDoc);
DELETEZ( pHistory );
}
}
}
if( m_bResetPgDesc || m_bResetPgBrk )
{
sal_uInt16 nStt = static_cast<sal_uInt16>( m_bResetPgDesc ? RES_PAGEDESC : RES_BREAK );
sal_uInt16 nEnd = static_cast<sal_uInt16>( m_bResetPgBrk ? RES_BREAK : RES_PAGEDESC );
SwNode* pNode = rDoc.GetNodes()[ nEndNode + 1 ];
if( pNode->IsContentNode() )
static_cast<SwContentNode*>(pNode)->ResetAttr( nStt, nEnd );
else if( pNode->IsTableNode() )
static_cast<SwTableNode*>(pNode)->GetTable().GetFrameFormat()->ResetFormatAttr( nStt, nEnd );
}
}
// delete the temporarily added Node
if( pInsNd )
rDoc.GetNodes().Delete( aIdx );
if( m_pRedlSaveData )
SetSaveData(rDoc, *m_pRedlSaveData);
AddUndoRedoPaM(rContext, true);
}
void SwUndoDelete::RedoImpl(::sw::UndoRedoContext & rContext)
{
SwPaM & rPam = AddUndoRedoPaM(rContext);
SwDoc& rDoc = *rPam.GetDoc();
if( m_pRedlSaveData )
{
const bool bSuccess = FillSaveData(rPam, *m_pRedlSaveData);
OSL_ENSURE(bSuccess,
"SwUndoDelete::Redo: used to have redline data, but now none?");
if (!bSuccess)
{
delete m_pRedlSaveData;
m_pRedlSaveData = nullptr;
}
}
if( !m_bDelFullPara )
{
SwUndRng aTmpRng( rPam );
RemoveIdxFromRange( rPam, false );
aTmpRng.SetPaM( rPam );
if( !m_bJoinNext ) // then restore selection from bottom to top
rPam.Exchange();
}
if( pHistory ) // are the attributes saved?
{
pHistory->SetTmpEnd( pHistory->Count() );
SwHistory aHstr;
aHstr.Move( 0, pHistory );
if( m_bDelFullPara )
{
OSL_ENSURE( rPam.HasMark(), "PaM without Mark" );
DelContentIndex( *rPam.GetMark(), *rPam.GetPoint(),
DelContentType(nsDelContentType::DELCNT_ALL | nsDelContentType::DELCNT_CHKNOCNTNT) );
DelBookmarks(rPam.GetMark()->nNode, rPam.GetPoint()->nNode);
}
else
DelContentIndex( *rPam.GetMark(), *rPam.GetPoint() );
m_nSetPos = pHistory ? pHistory->Count() : 0;
pHistory->Move( m_nSetPos, &aHstr );
}
else
{
if( m_bDelFullPara )
{
OSL_ENSURE( rPam.HasMark(), "PaM without Mark" );
DelContentIndex( *rPam.GetMark(), *rPam.GetPoint(),
DelContentType(nsDelContentType::DELCNT_ALL | nsDelContentType::DELCNT_CHKNOCNTNT) );
DelBookmarks( rPam.GetMark()->nNode, rPam.GetPoint()->nNode );
}
else
DelContentIndex( *rPam.GetMark(), *rPam.GetPoint() );
m_nSetPos = pHistory ? pHistory->Count() : 0;
}
if( !m_pSttStr && !m_pEndStr )
{
SwNodeIndex aSttIdx = ( m_bDelFullPara || m_bJoinNext )
? rPam.GetMark()->nNode
: rPam.GetPoint()->nNode;
SwTableNode* pTableNd = aSttIdx.GetNode().GetTableNode();
if( pTableNd )
{
if( m_bTableDelLastNd )
{
// than add again a Node at the end
const SwNodeIndex aTmpIdx( *pTableNd->EndOfSectionNode(), 1 );
rDoc.GetNodes().MakeTextNode( aTmpIdx,
rDoc.getIDocumentStylePoolAccess().GetTextCollFromPool( RES_POOLCOLL_STANDARD ) );
}
SwContentNode* pNextNd = rDoc.GetNodes()[
pTableNd->EndOfSectionIndex()+1 ]->GetContentNode();
if( pNextNd )
{
SwFrameFormat* pTableFormat = pTableNd->GetTable().GetFrameFormat();
const SfxPoolItem *pItem;
if( SfxItemState::SET == pTableFormat->GetItemState( RES_PAGEDESC,
false, &pItem ) )
pNextNd->SetAttr( *pItem );
if( SfxItemState::SET == pTableFormat->GetItemState( RES_BREAK,
false, &pItem ) )
pNextNd->SetAttr( *pItem );
}
pTableNd->DelFrames();
}
// avoid asserts from ~SwIndexReg for deleted nodes
SwPaM aTmp(*rPam.End());
if (!aTmp.Move(fnMoveForward, fnGoNode))
{
*aTmp.GetPoint() = *rPam.Start();
aTmp.Move(fnMoveBackward, fnGoNode);
}
assert(aTmp.GetPoint()->nNode != rPam.GetPoint()->nNode
&& aTmp.GetPoint()->nNode != rPam.GetMark()->nNode);
::PaMCorrAbs(rPam, *aTmp.GetPoint());
rPam.DeleteMark();
rDoc.GetNodes().Delete( aSttIdx, nEndNode - nSttNode );
}
else if( m_bDelFullPara )
{
// The Pam was incremented by one at Point (== end) to provide space
// for UNDO. This now needs to be reverted!
--rPam.End()->nNode;
if( rPam.GetPoint()->nNode == rPam.GetMark()->nNode )
*rPam.GetMark() = *rPam.GetPoint();
rDoc.getIDocumentContentOperations().DelFullPara( rPam );
}
else
rDoc.getIDocumentContentOperations().DeleteAndJoin( rPam );
}
void SwUndoDelete::RepeatImpl(::sw::RepeatContext & rContext)
{
// this action does not seem idempotent,
// so make sure it is only executed once on repeat
if (rContext.m_bDeleteRepeated)
return;
SwPaM & rPam = rContext.GetRepeatPaM();
SwDoc& rDoc = *rPam.GetDoc();
::sw::GroupUndoGuard const undoGuard(rDoc.GetIDocumentUndoRedo());
if( !rPam.HasMark() )
{
rPam.SetMark();
rPam.Move( fnMoveForward, fnGoContent );
}
if( m_bDelFullPara )
rDoc.getIDocumentContentOperations().DelFullPara( rPam );
else
rDoc.getIDocumentContentOperations().DeleteAndJoin( rPam );
rContext.m_bDeleteRepeated = true;
}
void SwUndoDelete::SetTableName(const OUString & rName)
{
m_sTableName = rName;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|