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 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423
|
/* -*- 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 <svl/smplhint.hxx>
#include <hintids.hxx>
#include <sfx2/linkmgr.hxx>
#include <svl/itemiter.hxx>
#include <tools/resid.hxx>
#include <fmtcntnt.hxx>
#include <fmtanchr.hxx>
#include <txtftn.hxx>
#include <fmtclds.hxx>
#include <doc.hxx>
#include <IDocumentUndoRedo.hxx>
#include <rootfrm.hxx>
#include <pam.hxx>
#include <ndtxt.hxx>
#include <section.hxx>
#include <UndoSection.hxx>
#include <UndoDelete.hxx>
#include <swundo.hxx>
#include <calc.hxx>
#include <swtable.hxx>
#include <swserv.hxx>
#include <frmfmt.hxx>
#include <frmtool.hxx>
#include <ftnidx.hxx>
#include <docary.hxx>
#include <redline.hxx>
#include <sectfrm.hxx>
#include <pagefrm.hxx>
#include <cntfrm.hxx>
#include <node2lay.hxx>
#include <doctxm.hxx>
#include <fmtftntx.hxx>
#include <comcore.hrc>
#include <viewsh.hxx>
#include <txtfrm.hxx>
#include <boost/scoped_ptr.hpp>
// #i21457# - new implementation of local method <lcl_IsInSameTblBox(..)>.
// Method now determines the previous/next on its own. Thus, it can be controlled,
// for which previous/next is checked, if it's visible.
static bool lcl_IsInSameTblBox( SwNodes& _rNds,
const SwNode& _rNd,
const bool _bPrev )
{
const SwTableNode* pTblNd = _rNd.FindTableNode();
if ( !pTblNd )
{
return true;
}
// determine index to be checked. Its assumed that a previous/next exist.
SwNodeIndex aChkIdx( _rNd );
{
// determine index of previous/next - skip hidden ones, which are
// inside the table.
// If found one is before/after table, this one isn't in the same
// table box as <_rNd>.
bool bFound = false;
do
{
if ( _bPrev
? !_rNds.GoPrevSection( &aChkIdx, false, false )
: !_rNds.GoNextSection( &aChkIdx, false, false ) )
{
OSL_FAIL( "<lcl_IsInSameTblBox(..)> - no previous/next!" );
return false;
}
else
{
if ( aChkIdx < pTblNd->GetIndex() ||
aChkIdx > pTblNd->EndOfSectionNode()->GetIndex() )
{
return false;
}
else
{
// check, if found one isn't inside a hidden section, which
// is also inside the table.
SwSectionNode* pSectNd = aChkIdx.GetNode().FindSectionNode();
if ( !pSectNd ||
pSectNd->GetIndex() < pTblNd->GetIndex() ||
!pSectNd->GetSection().IsHiddenFlag() )
{
bFound = true;
}
}
}
} while ( !bFound );
}
// Find the Box's StartNode
const SwTableSortBoxes& rSortBoxes = pTblNd->GetTable().GetTabSortBoxes();
sal_uLong nIdx = _rNd.GetIndex();
for (size_t n = 0; n < rSortBoxes.size(); ++n)
{
const SwStartNode* pNd = rSortBoxes[ n ]->GetSttNd();
if ( pNd->GetIndex() < nIdx && nIdx < pNd->EndOfSectionIndex() )
{
// The other index needs to be within the same Section
nIdx = aChkIdx.GetIndex();
return pNd->GetIndex() < nIdx && nIdx < pNd->EndOfSectionIndex();
}
}
return true;
}
static void lcl_CheckEmptyLayFrm( SwNodes& rNds, SwSectionData& rSectionData,
const SwNode& rStt, const SwNode& rEnd )
{
SwNodeIndex aIdx( rStt );
if( !rNds.GoPrevSection( &aIdx, true, false ) ||
!CheckNodesRange( rStt, aIdx, true ) ||
// #i21457#
!lcl_IsInSameTblBox( rNds, rStt, true ))
{
aIdx = rEnd;
if( !rNds.GoNextSection( &aIdx, true, false ) ||
!CheckNodesRange( rEnd, aIdx, true ) ||
// #i21457#
!lcl_IsInSameTblBox( rNds, rEnd, false ))
{
rSectionData.SetHidden( false );
}
}
}
SwSection *
SwDoc::InsertSwSection(SwPaM const& rRange, SwSectionData & rNewData,
SwTOXBase const*const pTOXBase,
SfxItemSet const*const pAttr, bool const bUpdate)
{
const SwNode* pPrvNd = 0;
sal_uInt16 nRegionRet = 0;
if( rRange.HasMark() &&
0 == ( nRegionRet = IsInsRegionAvailable( rRange, &pPrvNd ) ))
{
// demoted to info because this is called from SwXTextSection::attach,
// so it could be invalid input
SAL_INFO("sw.core" , "InsertSwSection: rRange overlaps other sections");
return 0;
}
// See if the whole Document should be hidden, which we currently are not able to do.
if (rNewData.IsHidden() && rRange.HasMark())
{
const SwPosition *pStt = rRange.Start(), *pEnd = rRange.End();
if( !pStt->nContent.GetIndex() &&
pEnd->nNode.GetNode().GetCntntNode()->Len() ==
pEnd->nContent.GetIndex() )
{
::lcl_CheckEmptyLayFrm( GetNodes(),
rNewData,
pStt->nNode.GetNode(),
pEnd->nNode.GetNode() );
}
}
SwUndoInsSection* pUndoInsSect = 0;
bool const bUndo(GetIDocumentUndoRedo().DoesUndo());
if (bUndo)
{
pUndoInsSect = new SwUndoInsSection(rRange, rNewData, pAttr, pTOXBase);
GetIDocumentUndoRedo().AppendUndo( pUndoInsSect );
GetIDocumentUndoRedo().DoUndo(false);
}
SwSectionFmt* const pFmt = MakeSectionFmt( 0 );
if ( pAttr )
{
pFmt->SetFmtAttr( *pAttr );
}
SwSectionNode* pNewSectNode = 0;
RedlineMode_t eOld = GetRedlineMode();
SetRedlineMode_intern( (RedlineMode_t)((eOld & ~nsRedlineMode_t::REDLINE_SHOW_MASK) | nsRedlineMode_t::REDLINE_IGNORE));
if( rRange.HasMark() )
{
SwPosition *pSttPos = (SwPosition*)rRange.Start(),
*pEndPos = (SwPosition*)rRange.End();
if( pPrvNd && 3 == nRegionRet )
{
OSL_ENSURE( pPrvNd, "The SectionNode is missing" );
SwNodeIndex aStt( pSttPos->nNode ), aEnd( pEndPos->nNode, +1 );
while( pPrvNd != aStt.GetNode().StartOfSectionNode() )
aStt--;
while( pPrvNd != aEnd.GetNode().StartOfSectionNode() )
++aEnd;
--aEnd; // End is inclusive in the InsertSection
pNewSectNode = GetNodes().InsertTextSection(
aStt, *pFmt, rNewData, pTOXBase, & aEnd);
}
else
{
if( pUndoInsSect )
{
if( !( pPrvNd && 1 == nRegionRet ) &&
pSttPos->nContent.GetIndex() )
{
SwTxtNode* const pTNd =
pSttPos->nNode.GetNode().GetTxtNode();
if (pTNd)
{
pUndoInsSect->SaveSplitNode( pTNd, true );
}
}
if ( !( pPrvNd && 2 == nRegionRet ) )
{
SwTxtNode *const pTNd =
pEndPos->nNode.GetNode().GetTxtNode();
if (pTNd && (pTNd->GetTxt().getLength()
!= pEndPos->nContent.GetIndex()))
{
pUndoInsSect->SaveSplitNode( pTNd, false );
}
}
}
if( pPrvNd && 1 == nRegionRet )
{
pSttPos->nNode.Assign( *pPrvNd );
pSttPos->nContent.Assign( pSttPos->nNode.GetNode().GetCntntNode(), 0 );
}
else if( pSttPos->nContent.GetIndex() )
{
SplitNode( *pSttPos, false );
}
if( pPrvNd && 2 == nRegionRet )
{
pEndPos->nNode.Assign( *pPrvNd );
pEndPos->nContent.Assign( pEndPos->nNode.GetNode().GetCntntNode(), 0 );
}
else
{
const SwCntntNode* pCNd = pEndPos->nNode.GetNode().GetCntntNode();
if( pCNd && pCNd->Len() != pEndPos->nContent.GetIndex() )
{
sal_Int32 nCntnt = pSttPos->nContent.GetIndex();
SplitNode( *pEndPos, false );
SwTxtNode* pTNd;
if( pEndPos->nNode.GetIndex() == pSttPos->nNode.GetIndex() )
{
pSttPos->nNode--;
pEndPos->nNode--;
pTNd = pSttPos->nNode.GetNode().GetTxtNode();
pSttPos->nContent.Assign( pTNd, nCntnt );
}
else
{
// Set to the end of the previous
pEndPos->nNode--;
pTNd = pEndPos->nNode.GetNode().GetTxtNode();
}
nCntnt = (pTNd) ? pTNd->GetTxt().getLength() : 0;
pEndPos->nContent.Assign( pTNd, nCntnt );
}
}
pNewSectNode = GetNodes().InsertTextSection(
pSttPos->nNode, *pFmt, rNewData, pTOXBase, &pEndPos->nNode);
}
}
else
{
const SwPosition* pPos = rRange.GetPoint();
const SwCntntNode* pCNd = pPos->nNode.GetNode().GetCntntNode();
if( !pPos->nContent.GetIndex() )
{
pNewSectNode = GetNodes().InsertTextSection(
pPos->nNode, *pFmt, rNewData, pTOXBase, 0, true);
}
else if( pPos->nContent.GetIndex() == pCNd->Len() )
{
pNewSectNode = GetNodes().InsertTextSection(
pPos->nNode, *pFmt, rNewData, pTOXBase, 0, false);
}
else
{
if( pUndoInsSect && pCNd->IsTxtNode() )
{
pUndoInsSect->SaveSplitNode( (SwTxtNode*)pCNd, true );
}
SplitNode( *pPos, false );
pNewSectNode = GetNodes().InsertTextSection(
pPos->nNode, *pFmt, rNewData, pTOXBase, 0, true);
}
}
//FEATURE::CONDCOLL
pNewSectNode->CheckSectionCondColl();
//FEATURE::CONDCOLL
SetRedlineMode_intern( eOld );
// To-Do - add 'SwExtraRedlineTbl' also ?
if( IsRedlineOn() || (!IsIgnoreRedline() && !mpRedlineTbl->empty() ))
{
SwPaM aPam( *pNewSectNode->EndOfSectionNode(), *pNewSectNode, 1 );
if( IsRedlineOn() )
{
AppendRedline( new SwRangeRedline( nsRedlineType_t::REDLINE_INSERT, aPam ), true);
}
else
{
SplitRedline( aPam );
}
}
// Is a Condition set?
if (rNewData.IsHidden() && !rNewData.GetCondition().isEmpty())
{
// The calculate up to that position
SwCalc aCalc( *this );
if( ! IsInReading() )
{
FldsToCalc( aCalc, pNewSectNode->GetIndex(), USHRT_MAX );
}
SwSection& rNewSect = pNewSectNode->GetSection();
rNewSect.SetCondHidden( aCalc.Calculate( rNewSect.GetCondition() ).GetBool() );
}
bool bUpdateFtn = false;
if( GetFtnIdxs().size() && pAttr )
{
sal_uInt16 nVal = ((SwFmtFtnAtTxtEnd&)pAttr->Get(
RES_FTN_AT_TXTEND )).GetValue();
if( ( FTNEND_ATTXTEND_OWNNUMSEQ == nVal ||
FTNEND_ATTXTEND_OWNNUMANDFMT == nVal ) ||
( FTNEND_ATTXTEND_OWNNUMSEQ == ( nVal = ((SwFmtEndAtTxtEnd&)
pAttr->Get( RES_END_AT_TXTEND )).GetValue() ) ||
FTNEND_ATTXTEND_OWNNUMANDFMT == nVal ))
{
bUpdateFtn = true;
}
}
if( pUndoInsSect )
{
pUndoInsSect->SetSectNdPos( pNewSectNode->GetIndex() );
pUndoInsSect->SetUpdtFtnFlag( bUpdateFtn );
GetIDocumentUndoRedo().DoUndo(bUndo);
}
if (rNewData.IsLinkType())
{
pNewSectNode->GetSection().CreateLink( bUpdate ? CREATE_UPDATE : CREATE_CONNECT );
}
if( bUpdateFtn )
{
GetFtnIdxs().UpdateFtn( SwNodeIndex( *pNewSectNode ));
}
SetModified();
return &pNewSectNode->GetSection();
}
sal_uInt16 SwDoc::IsInsRegionAvailable( const SwPaM& rRange,
const SwNode** ppSttNd ) const
{
sal_uInt16 nRet = 1;
if( rRange.HasMark() )
{
// See if we have a valid Section
const SwPosition* pStt = rRange.Start();
const SwPosition* pEnd = rRange.End();
const SwCntntNode* pCNd = pEnd->nNode.GetNode().GetCntntNode();
const SwNode* pNd = &pStt->nNode.GetNode();
const SwSectionNode* pSectNd = pNd->FindSectionNode();
const SwSectionNode* pEndSectNd = pCNd ? pCNd->FindSectionNode() : 0;
if( pSectNd && pEndSectNd && pSectNd != pEndSectNd )
{
// Try to create an enclosing Section, but only if Start is
// located at the Section's beginning and End at it's end
nRet = 0;
if( !pStt->nContent.GetIndex()
&& pSectNd->GetIndex() == pStt->nNode.GetIndex() - 1
&& pEnd->nContent.GetIndex() == pCNd->Len() )
{
SwNodeIndex aIdx( pStt->nNode, -1 );
sal_uLong nCmp = pEnd->nNode.GetIndex();
const SwStartNode* pPrvNd;
const SwEndNode* pNxtNd;
while( 0 != ( pPrvNd = (pNd = &aIdx.GetNode())->GetSectionNode() ) &&
!( aIdx.GetIndex() < nCmp &&
nCmp < pPrvNd->EndOfSectionIndex() ) )
{
aIdx--;
}
if( !pPrvNd )
pPrvNd = pNd->IsStartNode() ? (SwStartNode*)pNd
: pNd->StartOfSectionNode();
aIdx = pEnd->nNode.GetIndex() + 1;
nCmp = pStt->nNode.GetIndex();
while( 0 != ( pNxtNd = (pNd = &aIdx.GetNode())->GetEndNode() ) &&
pNxtNd->StartOfSectionNode()->IsSectionNode() &&
!( pNxtNd->StartOfSectionIndex() < nCmp &&
nCmp < aIdx.GetIndex() ) )
{
++aIdx;
}
if( !pNxtNd )
pNxtNd = pNd->EndOfSectionNode();
if( pPrvNd && pNxtNd && pPrvNd == pNxtNd->StartOfSectionNode() )
{
nRet = 3;
if( ppSttNd )
*ppSttNd = pPrvNd;
}
}
}
else if( !pSectNd && pEndSectNd )
{
// Try to create an enclosing Section, but only if the End
// is at the Section's end.
nRet = 0;
if( pEnd->nContent.GetIndex() == pCNd->Len() )
{
SwNodeIndex aIdx( pEnd->nNode, 1 );
if( aIdx.GetNode().IsEndNode() &&
0 != aIdx.GetNode().FindSectionNode() )
{
do {
++aIdx;
} while( aIdx.GetNode().IsEndNode() &&
0 != aIdx.GetNode().FindSectionNode() );
{
nRet = 2;
if( ppSttNd )
{
aIdx--;
*ppSttNd = &aIdx.GetNode();
}
}
}
}
}
else if( pSectNd && !pEndSectNd )
{
// Try to create an enclosing Section, but only if Start
// is at the Section's start.
nRet = 0;
if( !pStt->nContent.GetIndex() )
{
SwNodeIndex aIdx( pStt->nNode, -1 );
if( aIdx.GetNode().IsSectionNode() )
{
do {
aIdx--;
} while( aIdx.GetNode().IsSectionNode() );
if( !aIdx.GetNode().IsSectionNode() )
{
nRet = 1;
if( ppSttNd )
{
++aIdx;
*ppSttNd = &aIdx.GetNode();
}
}
}
}
}
}
return nRet;
}
SwSection* SwDoc::GetCurrSection( const SwPosition& rPos ) const
{
const SwSectionNode* pSectNd = rPos.nNode.GetNode().FindSectionNode();
if( pSectNd )
return (SwSection*)&pSectNd->GetSection();
return 0;
}
SwSectionFmt* SwDoc::MakeSectionFmt( SwSectionFmt *pDerivedFrom )
{
if( !pDerivedFrom )
pDerivedFrom = (SwSectionFmt*)mpDfltFrmFmt;
SwSectionFmt* pNew = new SwSectionFmt( pDerivedFrom, this );
mpSectionFmtTbl->push_back( pNew );
return pNew;
}
void SwDoc::DelSectionFmt( SwSectionFmt *pFmt, bool bDelNodes )
{
SwSectionFmts::iterator itFmtPos = std::find( mpSectionFmtTbl->begin(), mpSectionFmtTbl->end(), pFmt );
GetIDocumentUndoRedo().StartUndo(UNDO_DELSECTION, NULL);
if( mpSectionFmtTbl->end() != itFmtPos )
{
const SwNodeIndex* pIdx = pFmt->GetCntnt( false ).GetCntntIdx();
const SfxPoolItem* pFtnEndAtTxtEnd;
if( SFX_ITEM_SET != pFmt->GetItemState(
RES_FTN_AT_TXTEND, true, &pFtnEndAtTxtEnd ) ||
SFX_ITEM_SET != pFmt->GetItemState(
RES_END_AT_TXTEND, true, &pFtnEndAtTxtEnd ))
pFtnEndAtTxtEnd = 0;
const SwSectionNode* pSectNd;
if( GetIDocumentUndoRedo().DoesUndo() )
{
if( bDelNodes && pIdx && &GetNodes() == &pIdx->GetNodes() &&
0 != (pSectNd = pIdx->GetNode().GetSectionNode() ))
{
SwNodeIndex aUpdIdx( *pIdx );
SwPaM aPaM( *pSectNd->EndOfSectionNode(), *pSectNd );
GetIDocumentUndoRedo().AppendUndo( new SwUndoDelete( aPaM ));
if( pFtnEndAtTxtEnd )
GetFtnIdxs().UpdateFtn( aUpdIdx );
SetModified();
//#126178# start/end undo have to be pairs!
GetIDocumentUndoRedo().EndUndo(UNDO_DELSECTION, NULL);
return ;
}
GetIDocumentUndoRedo().AppendUndo( MakeUndoDelSection( *pFmt ) );
}
else if( bDelNodes && pIdx && &GetNodes() == &pIdx->GetNodes() &&
0 != (pSectNd = pIdx->GetNode().GetSectionNode() ))
{
SwNodeIndex aUpdIdx( *pIdx );
DeleteSection( (SwNode*)pSectNd );
if( pFtnEndAtTxtEnd )
GetFtnIdxs().UpdateFtn( aUpdIdx );
SetModified();
//#126178# start/end undo have to be pairs!
GetIDocumentUndoRedo().EndUndo(UNDO_DELSECTION, NULL);
return ;
}
{
SwPtrMsgPoolItem aMsgHint( RES_REMOVE_UNO_OBJECT, pFmt );
pFmt->ModifyNotification( &aMsgHint, &aMsgHint );
}
// A ClearRedo could result in a recursive call of this function and delete some section
// formats, thus the position inside the SectionFmtTbl could have changed
itFmtPos = std::find( mpSectionFmtTbl->begin(), mpSectionFmtTbl->end(), pFmt );
// WARNING: First remove from the array and then delete,
// as the Section DTOR tries to delete it's format itself.
mpSectionFmtTbl->erase( itFmtPos );
//FEATURE::CONDCOLL
sal_uLong nCnt = 0, nSttNd = 0;
if( pIdx && &GetNodes() == &pIdx->GetNodes() &&
0 != (pSectNd = pIdx->GetNode().GetSectionNode() ))
{
nSttNd = pSectNd->GetIndex();
nCnt = pSectNd->EndOfSectionIndex() - nSttNd - 1;
}
//FEATURE::CONDCOLL
delete pFmt;
if( nSttNd && pFtnEndAtTxtEnd )
{
SwNodeIndex aUpdIdx( GetNodes(), nSttNd );
GetFtnIdxs().UpdateFtn( aUpdIdx );
}
//FEATURE::CONDCOLL
SwCntntNode* pCNd;
for( ; nCnt--; ++nSttNd )
if( 0 != (pCNd = GetNodes()[ nSttNd ]->GetCntntNode() ) &&
RES_CONDTXTFMTCOLL == pCNd->GetFmtColl()->Which() )
pCNd->ChkCondColl();
//FEATURE::CONDCOLL
}
GetIDocumentUndoRedo().EndUndo(UNDO_DELSECTION, NULL);
SetModified();
}
void SwDoc::UpdateSection(sal_uInt16 const nPos, SwSectionData & rNewData,
SfxItemSet const*const pAttr, bool const bPreventLinkUpdate)
{
SwSectionFmt* pFmt = (*mpSectionFmtTbl)[ nPos ];
SwSection* pSection = pFmt->GetSection();
/// remember hidden condition flag of SwSection before changes
bool bOldCondHidden = pSection->IsCondHidden();
if (pSection->DataEquals(rNewData))
{
// Check Attributes
bool bOnlyAttrChg = false;
if( pAttr && pAttr->Count() )
{
SfxItemIter aIter( *pAttr );
sal_uInt16 nWhich = aIter.GetCurItem()->Which();
while( true )
{
if( pFmt->GetFmtAttr( nWhich ) != *aIter.GetCurItem() )
{
bOnlyAttrChg = true;
break;
}
if( aIter.IsAtEnd() )
break;
nWhich = aIter.NextItem()->Which();
}
}
if( bOnlyAttrChg )
{
if (GetIDocumentUndoRedo().DoesUndo())
{
GetIDocumentUndoRedo().AppendUndo(
MakeUndoUpdateSection( *pFmt, true ) );
}
// #i32968# Inserting columns in the section causes MakeFrmFmt
// to put two objects of type SwUndoFrmFmt on the undo stack.
// We don't want them.
::sw::UndoGuard const undoGuard(GetIDocumentUndoRedo());
pFmt->SetFmtAttr( *pAttr );
SetModified();
}
return;
}
// Test if the whole Content Section (Document/TableBox/Fly) should be hidden,
// which we're currently not able to do.
const SwNodeIndex* pIdx = 0;
{
if (rNewData.IsHidden())
{
pIdx = pFmt->GetCntnt().GetCntntIdx();
if (pIdx)
{
const SwSectionNode* pSectNd =
pIdx->GetNode().GetSectionNode();
if (pSectNd)
{
::lcl_CheckEmptyLayFrm( GetNodes(), rNewData,
*pSectNd, *pSectNd->EndOfSectionNode() );
}
}
}
}
if (GetIDocumentUndoRedo().DoesUndo())
{
GetIDocumentUndoRedo().AppendUndo(MakeUndoUpdateSection(*pFmt, false));
}
// #i32968# Inserting columns in the section causes MakeFrmFmt to put two
// objects of type SwUndoFrmFmt on the undo stack. We don't want them.
::sw::UndoGuard const undoGuard(GetIDocumentUndoRedo());
// The LinkFileName could only consist of separators
OUString sCompareString = OUString(sfx2::cTokenSeparator) + OUString(sfx2::cTokenSeparator);
const bool bUpdate =
(!pSection->IsLinkType() && rNewData.IsLinkType())
|| (!rNewData.GetLinkFileName().isEmpty()
&& (rNewData.GetLinkFileName() != sCompareString)
&& (rNewData.GetLinkFileName() != pSection->GetLinkFileName()));
OUString sSectName( rNewData.GetSectionName() );
if (sSectName != pSection->GetSectionName())
GetUniqueSectionName( &sSectName );
else
sSectName = OUString();
/// In SwSection::operator=(..) class member bCondHiddenFlag is always set to sal_True.
/// IMHO this have to be changed, but I can't estimate the consequences:
/// Either it is set to sal_True using corresponding method <SwSection.SetCondHidden(..)>,
/// or it is set to the value of SwSection which is assigned to it.
/// Discussion with AMA results that the adjustment to the assignment operator
/// could be very risky.
pSection->SetSectionData(rNewData);
if( pAttr )
pSection->GetFmt()->SetFmtAttr( *pAttr );
if( !sSectName.isEmpty() )
{
pSection->SetSectionName( sSectName );
}
// Is a Condition set
if( pSection->IsHidden() && !pSection->GetCondition().isEmpty() )
{
// Then calculate up to that position
SwCalc aCalc( *this );
if( !pIdx )
pIdx = pFmt->GetCntnt().GetCntntIdx();
FldsToCalc( aCalc, pIdx->GetIndex(), USHRT_MAX );
/// Because on using SwSection::operator=() to set up <pSection>
/// with <rNewData> and the above given note, the hidden condition flag
/// has to be set to sal_False, if hidden condition flag of <pFmt->GetSection()>
/// (SwSection before the changes) is sal_False (already saved in <bOldCondHidden>)
/// and new calculated condition is sal_True.
/// This is necessary, because otherwise the <SetCondHidden> would have
/// no effect.
bool bCalculatedCondHidden =
aCalc.Calculate( pSection->GetCondition() ).GetBool();
if ( bCalculatedCondHidden && !bOldCondHidden )
{
pSection->SetCondHidden( false );
}
pSection->SetCondHidden( bCalculatedCondHidden );
}
if( bUpdate )
pSection->CreateLink( bPreventLinkUpdate ? CREATE_CONNECT : CREATE_UPDATE );
else if( !pSection->IsLinkType() && pSection->IsConnected() )
{
pSection->Disconnect();
GetLinkManager().Remove( &pSection->GetBaseLink() );
}
SetModified();
}
void sw_DeleteFtn( SwSectionNode *pNd, sal_uLong nStt, sal_uLong nEnd )
{
SwFtnIdxs& rFtnArr = pNd->GetDoc()->GetFtnIdxs();
if( rFtnArr.size() )
{
sal_uInt16 nPos;
rFtnArr.SeekEntry( SwNodeIndex( *pNd ), &nPos );
SwTxtFtn* pSrch;
// Delete all succeeding Footnotes
while( nPos < rFtnArr.size() &&
_SwTxtFtn_GetIndex( (pSrch = rFtnArr[ nPos ]) ) <= nEnd )
{
// If the Nodes are not deleted, they need to deregister at the Pages
// (delete Frms) or else they will remain there (Undo does not delete them!)
pSrch->DelFrms(0);
++nPos;
}
while( nPos-- &&
_SwTxtFtn_GetIndex( (pSrch = rFtnArr[ nPos ]) ) >= nStt )
{
// If the Nodes are not deleted, they need to deregister at the Pages
// (delete Frms) or else they will remain there (Undo does not delete them!)
pSrch->DelFrms(0);
}
}
}
static inline bool lcl_IsTOXSection(SwSectionData const& rSectionData)
{
return (TOX_CONTENT_SECTION == rSectionData.GetType())
|| (TOX_HEADER_SECTION == rSectionData.GetType());
}
SwSectionNode* SwNodes::InsertTextSection(SwNodeIndex const& rNdIdx,
SwSectionFmt& rSectionFmt,
SwSectionData const& rSectionData,
SwTOXBase const*const pTOXBase,
SwNodeIndex const*const pEnde,
bool const bInsAtStart, bool const bCreateFrms)
{
SwNodeIndex aInsPos( rNdIdx );
if( !pEnde ) // No Area, thus create a new Section before/after it
{
// #i26762#
OSL_ENSURE(!pEnde || rNdIdx <= *pEnde,
"Section start and end in wrong order!");
if( bInsAtStart )
{
if (!lcl_IsTOXSection(rSectionData))
{
do {
aInsPos--;
} while( aInsPos.GetNode().IsSectionNode() );
++aInsPos;
}
}
else
{
++aInsPos;
if (!lcl_IsTOXSection(rSectionData))
{
SwNode* pNd;
while( aInsPos.GetIndex() < Count() - 1 &&
( pNd = &aInsPos.GetNode())->IsEndNode() &&
pNd->StartOfSectionNode()->IsSectionNode())
{
++aInsPos;
}
}
}
}
SwSectionNode *const pSectNd =
new SwSectionNode(aInsPos, rSectionFmt, pTOXBase);
if( pEnde )
{
// Special case for the Reader/Writer
if( &pEnde->GetNode() != &GetEndOfContent() )
aInsPos = pEnde->GetIndex()+1;
// #i58710: We created a RTF document with a section break inside a table cell
// We are not able to handle a section start inside a table and the section end outside.
const SwNode* pLastNode = pSectNd->StartOfSectionNode()->EndOfSectionNode();
if( aInsPos > pLastNode->GetIndex() )
aInsPos = pLastNode->GetIndex();
// Another way round: if the section starts outside a table but the end is inside...
// aInsPos is at the moment the Position where my EndNode will be inserted
const SwStartNode* pStartNode = aInsPos.GetNode().StartOfSectionNode();
// This StartNode should be in front of me, but if not, I wanna survive
sal_uLong nMyIndex = pSectNd->GetIndex();
if( pStartNode->GetIndex() > nMyIndex ) // Suspicious!
{
const SwNode* pTemp;
do
{
pTemp = pStartNode; // pTemp is a suspicious one
pStartNode = pStartNode->StartOfSectionNode();
}
while( pStartNode->GetIndex() > nMyIndex );
pTemp = pTemp->EndOfSectionNode();
// If it starts behind me but ends behind my end...
if( pTemp->GetIndex() >= aInsPos.GetIndex() )
aInsPos = pTemp->GetIndex()+1; // ...I have to correct my end position
}
}
else
{
SwTxtNode* pCpyTNd = rNdIdx.GetNode().GetTxtNode();
if( pCpyTNd )
{
SwTxtNode* pTNd = new SwTxtNode( aInsPos, pCpyTNd->GetTxtColl() );
if( pCpyTNd->HasSwAttrSet() )
{
// Move PageDesc/Break to the first Node of the section
const SfxItemSet& rSet = *pCpyTNd->GetpSwAttrSet();
if( SFX_ITEM_SET == rSet.GetItemState( RES_BREAK ) ||
SFX_ITEM_SET == rSet.GetItemState( RES_PAGEDESC ))
{
SfxItemSet aSet( rSet );
if( bInsAtStart )
pCpyTNd->ResetAttr( RES_PAGEDESC, RES_BREAK );
else
{
aSet.ClearItem( RES_PAGEDESC );
aSet.ClearItem( RES_BREAK );
}
pTNd->SetAttr( aSet );
}
else
pTNd->SetAttr( rSet );
}
// Do not forget to create the Frame!
pCpyTNd->MakeFrms( *pTNd );
}
else
new SwTxtNode( aInsPos, (SwTxtFmtColl*)GetDoc()->GetDfltTxtFmtColl() );
}
new SwEndNode( aInsPos, *pSectNd );
pSectNd->GetSection().SetSectionData(rSectionData);
SwSectionFmt* pSectFmt = pSectNd->GetSection().GetFmt();
// We could optimize this, by not removing already contained Frames and recreating them,
// but by simply rewiring them
bool bInsFrm = bCreateFrms && !pSectNd->GetSection().IsHidden() &&
GetDoc()->GetCurrentViewShell();
SwNode2Layout *pNode2Layout = NULL;
if( bInsFrm )
{
SwNodeIndex aTmp( *pSectNd );
if( !pSectNd->GetNodes().FindPrvNxtFrmNode( aTmp, pSectNd->EndOfSectionNode() ) )
// Collect all Uppers
pNode2Layout = new SwNode2Layout( *pSectNd );
}
// Set the right StartNode for all in this Area
sal_uLong nEnde = pSectNd->EndOfSectionIndex();
sal_uLong nStart = pSectNd->GetIndex()+1;
sal_uLong nSkipIdx = ULONG_MAX;
for( sal_uLong n = nStart; n < nEnde; ++n )
{
SwNode* pNd = (*this)[n];
// Attach all Sections in the NodeSection underneath the new one
if( ULONG_MAX == nSkipIdx )
pNd->pStartOfSection = pSectNd;
else if( n >= nSkipIdx )
nSkipIdx = ULONG_MAX;
if( pNd->IsStartNode() )
{
// Make up the Format's nesting
if( pNd->IsSectionNode() )
{
((SwSectionNode*)pNd)->GetSection().GetFmt()->
SetDerivedFrom( pSectFmt );
((SwSectionNode*)pNd)->DelFrms();
n = pNd->EndOfSectionIndex();
}
else
{
if( pNd->IsTableNode() )
((SwTableNode*)pNd)->DelFrms();
if( ULONG_MAX == nSkipIdx )
nSkipIdx = pNd->EndOfSectionIndex();
}
}
else if( pNd->IsCntntNode() )
((SwCntntNode*)pNd)->DelFrms();
}
sw_DeleteFtn( pSectNd, nStart, nEnde );
if( bInsFrm )
{
if( pNode2Layout )
{
sal_uLong nIdx = pSectNd->GetIndex();
pNode2Layout->RestoreUpperFrms( pSectNd->GetNodes(), nIdx, nIdx + 1 );
delete pNode2Layout;
}
else
pSectNd->MakeFrms( &aInsPos );
}
return pSectNd;
}
SwSectionNode* SwNode::FindSectionNode()
{
if( IsSectionNode() )
return GetSectionNode();
SwStartNode* pTmp = pStartOfSection;
while( !pTmp->IsSectionNode() && pTmp->GetIndex() )
pTmp = pTmp->pStartOfSection;
return pTmp->GetSectionNode();
}
// SwSectionNode
// ugly hack to make m_pSection const
static SwSectionFmt &
lcl_initParent(SwSectionNode & rThis, SwSectionFmt & rFmt)
{
SwSectionNode *const pParent =
rThis.StartOfSectionNode()->FindSectionNode();
if( pParent )
{
// Register the Format at the right Parent
rFmt.SetDerivedFrom( pParent->GetSection().GetFmt() );
}
return rFmt;
}
SwSectionNode::SwSectionNode(SwNodeIndex const& rIdx,
SwSectionFmt & rFmt, SwTOXBase const*const pTOXBase)
: SwStartNode( rIdx, ND_SECTIONNODE )
, m_pSection( (pTOXBase)
? new SwTOXBaseSection(*pTOXBase, lcl_initParent(*this, rFmt))
: new SwSection( CONTENT_SECTION, rFmt.GetName(),
lcl_initParent(*this, rFmt) ) )
{
// Set the connection from Format to Node
// Suppress Modify; no one's interessted anyway
rFmt.LockModify();
rFmt.SetFmtAttr( SwFmtCntnt( this ) );
rFmt.UnlockModify();
}
#ifdef DBG_UTIL
//remove superfluous SectionFrms
SwFrm* SwClearDummies( SwFrm* pFrm )
{
SwFrm* pTmp = pFrm;
while( pTmp )
{
OSL_ENSURE( !pTmp->GetUpper(), "SwClearDummies: No Upper allowed!" );
if( pTmp->IsSctFrm() )
{
SwSectionFrm* pSectFrm = (SwSectionFrm*)pFrm;
pTmp = pTmp->GetNext();
if( !pSectFrm->GetLower() )
{
if( pSectFrm->GetPrev() )
pSectFrm->GetPrev()->mpNext = pTmp;
else
pFrm = pTmp;
if( pTmp )
pTmp->mpPrev = pSectFrm->GetPrev();
delete pSectFrm;
}
}
else
pTmp = pTmp->GetNext();
}
return pFrm;
}
#endif
SwSectionNode::~SwSectionNode()
{
// mba: test if iteration works as clients will be removed in callback
// use hint which allows to specify, if the content shall be saved or not
m_pSection->GetFmt()->CallSwClientNotify( SwSectionFrmMoveAndDeleteHint( true ) );
SwSectionFmt* pFmt = m_pSection->GetFmt();
if( pFmt )
{
// Remove the Attributei, because the Section deletes it's Format
// and it will neutralize the Section, if the Cntnt Attribute is set
pFmt->LockModify();
pFmt->ResetFmtAttr( RES_CNTNT );
pFmt->UnlockModify();
}
}
SwFrm *SwSectionNode::MakeFrm( SwFrm *pSib )
{
m_pSection->m_Data.SetHiddenFlag(false);
return new SwSectionFrm( *m_pSection, pSib );
}
// Creates all Document Views for the precedeing Node.
// The created ContentFrames are attached to the corresponding Layout
void SwSectionNode::MakeFrms(const SwNodeIndex & rIdx )
{
// Take my succsessive or preceding ContentFrame
SwNodes& rNds = GetNodes();
if( rNds.IsDocNodes() && rNds.GetDoc()->GetCurrentViewShell() )
{
if( GetSection().IsHidden() || IsCntntHidden() )
{
SwNodeIndex aIdx( *EndOfSectionNode() );
SwCntntNode* pCNd = rNds.GoNextSection( &aIdx, true, false );
if( !pCNd )
{
aIdx = *this;
pCNd = rNds.GoPrevSection(&aIdx, true, false);
if (!pCNd)
return;
}
pCNd = aIdx.GetNode().GetCntntNode();
pCNd->MakeFrms( (SwCntntNode&)rIdx.GetNode() );
}
else
{
SwNode2Layout aNode2Layout( *this, rIdx.GetIndex() );
SwFrm *pFrm, *pNew;
while( 0 != (pFrm = aNode2Layout.NextFrm()) )
{
OSL_ENSURE( pFrm->IsSctFrm(), "Depend of Section not a Section." );
pNew = rIdx.GetNode().GetCntntNode()->MakeFrm( pFrm );
SwSectionNode* pS = rIdx.GetNode().FindSectionNode();
// Assure that node is not inside a table, which is inside the
// found section.
if ( pS )
{
SwTableNode* pTableNode = rIdx.GetNode().FindTableNode();
if ( pTableNode &&
pTableNode->GetIndex() > pS->GetIndex() )
{
pS = 0;
}
}
// if the node is in a section, the sectionframe now
// has to be created..
// boolean to control <Init()> of a new section frame.
bool bInitNewSect = false;
if( pS )
{
SwSectionFrm *pSct = new SwSectionFrm( pS->GetSection(), pFrm );
// prepare <Init()> of new section frame.
bInitNewSect = true;
SwLayoutFrm* pUp = pSct;
while( pUp->Lower() ) // for columned sections
{
OSL_ENSURE( pUp->Lower()->IsLayoutFrm(),"Who's in there?" );
pUp = (SwLayoutFrm*)pUp->Lower();
}
pNew->Paste( pUp, NULL );
// #i27138#
// notify accessibility paragraphs objects about changed
// CONTENT_FLOWS_FROM/_TO relation.
// Relation CONTENT_FLOWS_FROM for next paragraph will change
// and relation CONTENT_FLOWS_TO for previous paragraph will change.
if ( pNew->IsTxtFrm() )
{
SwViewShell* pViewShell( pNew->getRootFrm()->GetCurrShell() );
if ( pViewShell && pViewShell->GetLayout() &&
pViewShell->GetLayout()->IsAnyShellAccessible() )
{
pViewShell->InvalidateAccessibleParaFlowRelation(
dynamic_cast<SwTxtFrm*>(pNew->FindNextCnt( true )),
dynamic_cast<SwTxtFrm*>(pNew->FindPrevCnt( true )) );
}
}
pNew = pSct;
}
// If a Node got Frames attached before or after
if ( rIdx < GetIndex() )
// the new one precedes me
pNew->Paste( pFrm->GetUpper(), pFrm );
else
// the new one succeeds me
pNew->Paste( pFrm->GetUpper(), pFrm->GetNext() );
// #i27138#
// notify accessibility paragraphs objects about changed
// CONTENT_FLOWS_FROM/_TO relation.
// Relation CONTENT_FLOWS_FROM for next paragraph will change
// and relation CONTENT_FLOWS_TO for previous paragraph will change.
if ( pNew->IsTxtFrm() )
{
SwViewShell* pViewShell( pNew->getRootFrm()->GetCurrShell() );
if ( pViewShell && pViewShell->GetLayout() &&
pViewShell->GetLayout()->IsAnyShellAccessible() )
{
pViewShell->InvalidateAccessibleParaFlowRelation(
dynamic_cast<SwTxtFrm*>(pNew->FindNextCnt( true )),
dynamic_cast<SwTxtFrm*>(pNew->FindPrevCnt( true )) );
}
}
if ( bInitNewSect )
static_cast<SwSectionFrm*>(pNew)->Init();
}
}
}
}
// Create a new SectionFrm for every occurrence in the Layout and insert before
// the corresponding CntntFrm
void SwSectionNode::MakeFrms( SwNodeIndex* pIdxBehind, SwNodeIndex* pEndIdx )
{
OSL_ENSURE( pIdxBehind, "no Index" );
SwNodes& rNds = GetNodes();
SwDoc* pDoc = rNds.GetDoc();
*pIdxBehind = *this;
m_pSection->m_Data.SetHiddenFlag(true);
if( rNds.IsDocNodes() )
{
SwNodeIndex *pEnd = pEndIdx ? pEndIdx :
new SwNodeIndex( *EndOfSectionNode(), 1 );
::MakeFrms( pDoc, *pIdxBehind, *pEnd );
if( !pEndIdx )
delete pEnd;
}
}
void SwSectionNode::DelFrms()
{
sal_uLong nStt = GetIndex()+1, nEnd = EndOfSectionIndex();
if( nStt >= nEnd )
{
return ;
}
SwNodes& rNds = GetNodes();
m_pSection->GetFmt()->DelFrms();
// Update our Flag
m_pSection->m_Data.SetHiddenFlag(true);
// If the Area is within a Fly or TableBox, we can only hide it if
// there is more Content which has Frames.
// Or else the Fly/TblBox Frame does not have a Lower!
{
SwNodeIndex aIdx( *this );
if( !rNds.GoPrevSection( &aIdx, true, false ) ||
!CheckNodesRange( *this, aIdx, true ) ||
// #i21457#
!lcl_IsInSameTblBox( rNds, *this, true ))
{
aIdx = *EndOfSectionNode();
if( !rNds.GoNextSection( &aIdx, true, false ) ||
!CheckNodesRange( *EndOfSectionNode(), aIdx, true ) ||
// #i21457#
!lcl_IsInSameTblBox( rNds, *EndOfSectionNode(), false ))
{
m_pSection->m_Data.SetHiddenFlag(false);
}
}
}
}
SwSectionNode* SwSectionNode::MakeCopy( SwDoc* pDoc, const SwNodeIndex& rIdx ) const
{
// In which array am I: Nodes, UndoNodes?
const SwNodes& rNds = GetNodes();
// Copy the SectionFrmFmt
SwSectionFmt* pSectFmt = pDoc->MakeSectionFmt( 0 );
pSectFmt->CopyAttrs( *GetSection().GetFmt() );
boost::scoped_ptr<SwTOXBase> pTOXBase;
if (TOX_CONTENT_SECTION == GetSection().GetType())
{
OSL_ENSURE( GetSection().ISA( SwTOXBaseSection ), "no TOXBaseSection!" );
SwTOXBaseSection const& rTBS(
dynamic_cast<SwTOXBaseSection const&>(GetSection()));
pTOXBase.reset( new SwTOXBase(rTBS, pDoc) );
}
SwSectionNode *const pSectNd =
new SwSectionNode(rIdx, *pSectFmt, pTOXBase.get());
SwEndNode* pEndNd = new SwEndNode( rIdx, *pSectNd );
SwNodeIndex aInsPos( *pEndNd );
// Take over values
SwSection *const pNewSect = pSectNd->m_pSection.get();
if (TOX_CONTENT_SECTION != GetSection().GetType())
{
// Keep the Name for Move
if( rNds.GetDoc() == pDoc && pDoc->IsCopyIsMove() )
{
pNewSect->SetSectionName( GetSection().GetSectionName() );
}
else
{
const OUString sSectionName(GetSection().GetSectionName());
pNewSect->SetSectionName(pDoc->GetUniqueSectionName( &sSectionName ));
}
}
pNewSect->SetType( GetSection().GetType() );
pNewSect->SetCondition( GetSection().GetCondition() );
pNewSect->SetLinkFileName( GetSection().GetLinkFileName() );
if( !pNewSect->IsHiddenFlag() && GetSection().IsHidden() )
pNewSect->SetHidden( true );
if( !pNewSect->IsProtectFlag() && GetSection().IsProtect() )
pNewSect->SetProtect( true );
// edit in readonly sections
if( !pNewSect->IsEditInReadonlyFlag() && GetSection().IsEditInReadonly() )
pNewSect->SetEditInReadonly( true );
SwNodeRange aRg( *this, +1, *EndOfSectionNode() ); // Where am I?
rNds._Copy( aRg, aInsPos, false );
// Delete all Frames from the copied Area. They are created when creating
// the SectionFrames.
pSectNd->DelFrms();
// Copy the Links/Server
if( pNewSect->IsLinkType() ) // Add the Link
pNewSect->CreateLink( pDoc->GetCurrentViewShell() ? CREATE_CONNECT : CREATE_NONE );
// If we copy from the Undo as Server, enter it again
if (m_pSection->IsServer()
&& pDoc->GetIDocumentUndoRedo().IsUndoNodes(rNds))
{
pNewSect->SetRefObject( m_pSection->GetObject() );
pDoc->GetLinkManager().InsertServer( pNewSect->GetObject() );
}
// METADATA: copy xml:id; must be done after insertion of node
pSectFmt->RegisterAsCopyOf(*GetSection().GetFmt());
return pSectNd;
}
bool SwSectionNode::IsCntntHidden() const
{
OSL_ENSURE( !m_pSection->IsHidden(),
"That's simple: Hidden Section => Hidden Content" );
SwNodeIndex aTmp( *this, 1 );
sal_uLong nEnd = EndOfSectionIndex();
while( aTmp < nEnd )
{
if( aTmp.GetNode().IsSectionNode() )
{
const SwSection& rSect = ((SwSectionNode&)aTmp.GetNode()).GetSection();
if( rSect.IsHiddenFlag() )
// Skip this Section
aTmp = *aTmp.GetNode().EndOfSectionNode();
}
else
{
if( aTmp.GetNode().IsCntntNode() || aTmp.GetNode().IsTableNode() )
return false; // We found non-hidden content
OSL_ENSURE( aTmp.GetNode().IsEndNode(), "EndNode expected" );
}
++aTmp;
}
return true; // Hide everything
}
void SwSectionNode::NodesArrChgd()
{
SwSectionFmt *const pFmt = m_pSection->GetFmt();
if( pFmt )
{
SwNodes& rNds = GetNodes();
SwDoc* pDoc = pFmt->GetDoc();
if( !rNds.IsDocNodes() )
{
SwPtrMsgPoolItem aMsgHint( RES_REMOVE_UNO_OBJECT, pFmt );
pFmt->ModifyNotification( &aMsgHint, &aMsgHint );
}
pFmt->LockModify();
pFmt->SetFmtAttr( SwFmtCntnt( this ));
pFmt->UnlockModify();
SwSectionNode* pSectNd = StartOfSectionNode()->FindSectionNode();
// set the correct parent from the new section
pFmt->SetDerivedFrom( pSectNd ? pSectNd->GetSection().GetFmt()
: pDoc->GetDfltFrmFmt() );
// Set the right StartNode for all in this Area
sal_uLong nStart = GetIndex()+1, nEnde = EndOfSectionIndex();
for( sal_uLong n = nStart; n < nEnde; ++n )
// Make up the Format's nesting
if( 0 != ( pSectNd = rNds[ n ]->GetSectionNode() ) )
{
pSectNd->GetSection().GetFmt()->SetDerivedFrom( pFmt );
n = pSectNd->EndOfSectionIndex();
}
// Moving Nodes to the UndoNodes array?
if( rNds.IsDocNodes() )
{
OSL_ENSURE( pDoc == GetDoc(),
"Moving to different Documents?" );
if( m_pSection->IsLinkType() ) // Remove the Link
m_pSection->CreateLink( pDoc->GetCurrentViewShell() ? CREATE_CONNECT : CREATE_NONE );
if (m_pSection->IsServer())
pDoc->GetLinkManager().InsertServer( m_pSection->GetObject() );
}
else
{
if (CONTENT_SECTION != m_pSection->GetType())
pDoc->GetLinkManager().Remove( &m_pSection->GetBaseLink() );
if (m_pSection->IsServer())
pDoc->GetLinkManager().RemoveServer( m_pSection->GetObject() );
}
}
}
OUString SwDoc::GetUniqueSectionName( const OUString* pChkStr ) const
{
const OUString aName( ResId( STR_REGION_DEFNAME, *pSwResMgr ) );
sal_uInt16 nNum = 0;
sal_uInt16 nTmp, nFlagSize = ( mpSectionFmtTbl->size() / 8 ) +2;
sal_uInt8* pSetFlags = new sal_uInt8[ nFlagSize ];
memset( pSetFlags, 0, nFlagSize );
const SwSectionNode* pSectNd;
sal_uInt16 n;
for( n = 0; n < mpSectionFmtTbl->size(); ++n )
if( 0 != ( pSectNd = (*mpSectionFmtTbl)[ n ]->GetSectionNode( false ) ))
{
const OUString rNm = pSectNd->GetSection().GetSectionName();
if (rNm.startsWith( aName ))
{
// Calculate the Number and reset the Flag
nNum = static_cast<sal_uInt16>(rNm.copy( aName.getLength() ).toInt32());
if( nNum-- && nNum < mpSectionFmtTbl->size() )
pSetFlags[ nNum / 8 ] |= (0x01 << ( nNum & 0x07 ));
}
if( pChkStr && *pChkStr==rNm )
pChkStr = 0;
}
if( !pChkStr )
{
// Flagged all Numbers accordingly, so get the right Number
nNum = mpSectionFmtTbl->size();
for( n = 0; n < nFlagSize; ++n )
if( 0xff != ( nTmp = pSetFlags[ n ] ))
{
// Calculate the Number
nNum = n * 8;
while( nTmp & 1 )
++nNum, nTmp >>= 1;
break;
}
}
delete [] pSetFlags;
if( pChkStr )
return *pChkStr;
return aName + OUString::number( ++nNum );
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|