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
|
/* -*- 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 "sal/config.h"
#include "editeng/forbiddencharacterstable.hxx"
#include <com/sun/star/embed/XEmbeddedObject.hpp>
#include <com/sun/star/embed/EmbedStates.hpp>
#include "officecfg/Office/Common.hxx"
#include <svx/svdetc.hxx>
#include <svx/svdmodel.hxx>
#include <svx/svdtrans.hxx>
#include "svdglob.hxx"
#include "svx/svdstr.hrc"
#include "svx/svdviter.hxx"
#include <svx/svdview.hxx>
#include <svx/svdoutl.hxx>
#include <vcl/bmpacc.hxx>
#include <editeng/editdata.hxx>
#include <editeng/eeitem.hxx>
#include <svl/itemset.hxx>
#include <svl/whiter.hxx>
#include "editeng/fontitem.hxx"
#include <editeng/colritem.hxx>
#include <editeng/fhgtitem.hxx>
#include <svx/xgrad.hxx>
#include <svx/xfillit0.hxx>
#include <svx/xflclit.hxx>
#include <svx/xflhtit.hxx>
#include <svx/xbtmpit.hxx>
#include <svx/xflgrit.hxx>
#include <svx/svdoole2.hxx>
#include <svl/itempool.hxx>
#include <unotools/localedatawrapper.hxx>
#include <com/sun/star/lang/Locale.hpp>
#include <i18nlangtag/lang.h>
#include <unotools/syslocale.hxx>
#include <svx/xflbckit.hxx>
#include <svx/extrusionbar.hxx>
#include <svx/fontworkbar.hxx>
#include <vcl/svapp.hxx>
#include <vcl/settings.hxx>
#include <svx/sdr/contact/viewcontact.hxx>
#include <svx/svdpage.hxx>
#include <svx/svdotable.hxx>
#include <svx/sdrhittesthelper.hxx>
using namespace ::com::sun::star;
/******************************************************************************
* Global data of the DrawingEngine
******************************************************************************/
SdrGlobalData::SdrGlobalData() :
pSysLocale(NULL),
pLocaleData(NULL),
pOutliner(NULL),
pDefaults(NULL),
pResMgr(NULL),
nExchangeFormat(0)
{
svx::ExtrusionBar::RegisterInterface();
svx::FontworkBar::RegisterInterface();
}
const SvtSysLocale* SdrGlobalData::GetSysLocale()
{
if ( !pSysLocale )
pSysLocale = new SvtSysLocale;
return pSysLocale;
}
const LocaleDataWrapper* SdrGlobalData::GetLocaleData()
{
if ( !pLocaleData )
pLocaleData = GetSysLocale()->GetLocaleDataPtr();
return pLocaleData;
}
OLEObjCache::OLEObjCache()
: std::vector<SdrOle2Obj*>()
{
nSize = officecfg::Office::Common::Cache::DrawingEngine::OLE_Objects::get();
pTimer = new AutoTimer();
Link aLink = LINK(this, OLEObjCache, UnloadCheckHdl);
pTimer->SetTimeoutHdl(aLink);
pTimer->SetTimeout(20000);
pTimer->Start();
aLink.Call(pTimer);
}
OLEObjCache::~OLEObjCache()
{
pTimer->Stop();
delete pTimer;
}
void OLEObjCache::UnloadOnDemand()
{
if ( nSize < size() )
{
// more objects than configured cache size try to remove objects
// of course not the freshly inserted one at nIndex=0
sal_uIntPtr nCount2 = size();
sal_uIntPtr nIndex = nCount2-1;
while( nIndex && nCount2 > nSize )
{
SdrOle2Obj* pUnloadObj = (*this)[nIndex--];
if ( pUnloadObj )
{
try
{
// it is important to get object without reinitialization to avoid reentrance
uno::Reference< embed::XEmbeddedObject > xUnloadObj = pUnloadObj->GetObjRef_NoInit();
bool bUnload = SdrOle2Obj::CanUnloadRunningObj( xUnloadObj, pUnloadObj->GetAspect() );
// check whether the object can be unloaded before looking for the parent objects
if ( xUnloadObj.is() && bUnload )
{
uno::Reference< frame::XModel > xUnloadModel( xUnloadObj->getComponent(), uno::UNO_QUERY );
if ( xUnloadModel.is() )
{
for ( sal_uIntPtr nCheckInd = 0; nCheckInd < size(); nCheckInd++ )
{
SdrOle2Obj* pCacheObj = (*this)[nCheckInd];
if ( pCacheObj && pCacheObj != pUnloadObj )
{
uno::Reference< frame::XModel > xParentModel = pCacheObj->GetParentXModel();
if ( xUnloadModel == xParentModel )
bUnload = false; // the object has running embedded objects
}
}
}
}
if ( bUnload && UnloadObj(pUnloadObj) )
// object was successfully unloaded
nCount2--;
}
catch( uno::Exception& )
{}
}
}
}
}
void OLEObjCache::InsertObj(SdrOle2Obj* pObj)
{
if ( !empty() )
{
SdrOle2Obj* pExistingObj = front();
if ( pObj == pExistingObj )
// the object is already on the top, nothing has to be changed
return;
}
// get the old position of the object to know whether it is already in container
iterator it = std::find( begin(), end(), pObj );
bool bFound = it != end();
if( it != end() )
erase( it );
// insert object into first position
insert(begin(), pObj);
if ( !bFound )
{
// a new object was inserted, recalculate the cache
UnloadOnDemand();
}
}
void OLEObjCache::RemoveObj(SdrOle2Obj* pObj)
{
iterator it = std::find( begin(), end(), pObj );
if( it != end() )
erase( it );
}
bool OLEObjCache::UnloadObj(SdrOle2Obj* pObj)
{
bool bUnloaded = false;
if (pObj)
{
//#i80528# The old mechanism is completely useless, only taking into account if
// in all views the GrafDraft feature is used. This will nearly never have been the
// case since no one ever used this option.
// A much better (and working) criteria would be the VOC contact count.
// The question is what will happen when i make it work now suddenly? I
// will try it for 2.4.
const sdr::contact::ViewContact& rViewContact = pObj->GetViewContact();
const bool bVisible(rViewContact.HasViewObjectContacts(true));
if(!bVisible)
{
bUnloaded = pObj->Unload();
}
}
return bUnloaded;
}
IMPL_LINK(OLEObjCache, UnloadCheckHdl, AutoTimer*, /*pTim*/)
{
UnloadOnDemand();
return 0;
}
void SdrLinkList::Clear()
{
unsigned nAnz=GetLinkCount();
for (unsigned i=0; i<nAnz; i++) {
delete aList[i];
}
aList.clear();
}
unsigned SdrLinkList::FindEntry(const Link& rLink) const
{
unsigned nAnz=GetLinkCount();
for (unsigned i=0; i<nAnz; i++) {
if (GetLink(i)==rLink) return i;
}
return 0xFFFF;
}
void SdrLinkList::InsertLink(const Link& rLink, unsigned nPos)
{
unsigned nFnd=FindEntry(rLink);
if (nFnd==0xFFFF) {
if (rLink.IsSet()) {
if(nPos==0xFFFF)
aList.push_back(new Link(rLink));
else
aList.insert(aList.begin() + nPos, new Link(rLink));
} else {
OSL_FAIL("SdrLinkList::InsertLink(): Tried to insert a link that was not set already.");
}
} else {
OSL_FAIL("SdrLinkList::InsertLink(): Link already in place.");
}
}
void SdrLinkList::RemoveLink(const Link& rLink)
{
unsigned nFnd=FindEntry(rLink);
if (nFnd!=0xFFFF) {
Link* pLink = aList[nFnd];
aList.erase( aList.begin() + nFnd );
delete pLink;
} else {
OSL_FAIL("SdrLinkList::RemoveLink(): Link not found.");
}
}
bool GetDraftFillColor(const SfxItemSet& rSet, Color& rCol)
{
XFillStyle eFill=((XFillStyleItem&)rSet.Get(XATTR_FILLSTYLE)).GetValue();
bool bRetval = false;
switch(eFill)
{
case XFILL_SOLID:
{
rCol = ((XFillColorItem&)rSet.Get(XATTR_FILLCOLOR)).GetColorValue();
bRetval = true;
break;
}
case XFILL_HATCH:
{
Color aCol1(((XFillHatchItem&)rSet.Get(XATTR_FILLHATCH)).GetHatchValue().GetColor());
Color aCol2(COL_WHITE);
// when hatched background is activated, use object fill color as hatch color
bool bFillHatchBackground = ((const XFillBackgroundItem&)(rSet.Get(XATTR_FILLBACKGROUND))).GetValue();
if(bFillHatchBackground)
{
aCol2 = ((const XFillColorItem&)(rSet.Get(XATTR_FILLCOLOR))).GetColorValue();
}
const basegfx::BColor aAverageColor(basegfx::average(aCol1.getBColor(), aCol2.getBColor()));
rCol = Color(aAverageColor);
bRetval = true;
break;
}
case XFILL_GRADIENT: {
const XGradient& rGrad=((XFillGradientItem&)rSet.Get(XATTR_FILLGRADIENT)).GetGradientValue();
Color aCol1(rGrad.GetStartColor());
Color aCol2(rGrad.GetEndColor());
const basegfx::BColor aAverageColor(basegfx::average(aCol1.getBColor(), aCol2.getBColor()));
rCol = Color(aAverageColor);
bRetval = true;
break;
}
case XFILL_BITMAP:
{
Bitmap aBitmap(((XFillBitmapItem&)rSet.Get(XATTR_FILLBITMAP)).GetGraphicObject().GetGraphic().GetBitmapEx().GetBitmap());
const Size aSize(aBitmap.GetSizePixel());
const sal_uInt32 nWidth = aSize.Width();
const sal_uInt32 nHeight = aSize.Height();
BitmapReadAccess* pAccess = aBitmap.AcquireReadAccess();
if(pAccess && nWidth > 0 && nHeight > 0)
{
sal_uInt32 nRt(0L);
sal_uInt32 nGn(0L);
sal_uInt32 nBl(0L);
const sal_uInt32 nMaxSteps(8L);
const sal_uInt32 nXStep((nWidth > nMaxSteps) ? nWidth / nMaxSteps : 1L);
const sal_uInt32 nYStep((nHeight > nMaxSteps) ? nHeight / nMaxSteps : 1L);
sal_uInt32 nAnz(0L);
for(sal_uInt32 nY(0L); nY < nHeight; nY += nYStep)
{
for(sal_uInt32 nX(0L); nX < nWidth; nX += nXStep)
{
const BitmapColor& rCol2 = pAccess->GetColor(nY, nX);
nRt += rCol2.GetRed();
nGn += rCol2.GetGreen();
nBl += rCol2.GetBlue();
nAnz++;
}
}
nRt /= nAnz;
nGn /= nAnz;
nBl /= nAnz;
rCol = Color(sal_uInt8(nRt), sal_uInt8(nGn), sal_uInt8(nBl));
bRetval = true;
}
if(pAccess)
{
aBitmap.ReleaseAccess(pAccess);
}
break;
}
default: break;
}
return bRetval;
}
SdrEngineDefaults::SdrEngineDefaults():
aFontName( OutputDevice::GetDefaultFont( DEFAULTFONT_SERIF, LANGUAGE_SYSTEM, DEFAULTFONT_FLAGS_ONLYONE ).GetName() ),
eFontFamily(FAMILY_ROMAN),
aFontColor(COL_AUTO),
nFontHeight(847), // 847/100mm = ca. 24 Point
eMapUnit(MAP_100TH_MM),
aMapFraction(1,1)
{
}
SdrEngineDefaults& SdrEngineDefaults::GetDefaults()
{
SdrGlobalData& rGlobalData=GetSdrGlobalData();
if (rGlobalData.pDefaults==NULL) {
rGlobalData.pDefaults=new SdrEngineDefaults;
}
return *rGlobalData.pDefaults;
}
SdrOutliner* SdrMakeOutliner( sal_uInt16 nOutlinerMode, SdrModel* pModel )
{
SfxItemPool* pPool = &pModel->GetItemPool();
SdrOutliner* pOutl = new SdrOutliner( pPool, nOutlinerMode );
pOutl->SetEditTextObjectPool( pPool );
pOutl->SetStyleSheetPool( (SfxStyleSheetPool*) pModel->GetStyleSheetPool() );
pOutl->SetDefTab( pModel->GetDefaultTabulator() );
pOutl->SetForbiddenCharsTable( pModel->GetForbiddenCharsTable() );
pOutl->SetAsianCompressionMode( pModel->GetCharCompressType() );
pOutl->SetKernAsianPunctuation( pModel->IsKernAsianPunctuation() );
pOutl->SetAddExtLeading( pModel->IsAddExtLeading() );
return pOutl;
}
SdrLinkList& ImpGetUserMakeObjHdl()
{
SdrGlobalData& rGlobalData=GetSdrGlobalData();
return rGlobalData.aUserMakeObjHdl;
}
SdrLinkList& ImpGetUserMakeObjUserDataHdl()
{
SdrGlobalData& rGlobalData=GetSdrGlobalData();
return rGlobalData.aUserMakeObjUserDataHdl;
}
ResMgr* ImpGetResMgr()
{
SdrGlobalData& rGlobalData = GetSdrGlobalData();
if(!rGlobalData.pResMgr)
{
rGlobalData.pResMgr =
ResMgr::CreateResMgr( "svx", Application::GetSettings().GetUILanguageTag() );
}
return rGlobalData.pResMgr;
}
OUString ImpGetResStr(sal_uInt16 nResID)
{
return ResId(nResID, *ImpGetResMgr()).toString();
}
namespace sdr
{
OUString GetResourceString(sal_uInt16 nResID)
{
return ImpGetResStr(nResID);
}
}
bool SearchOutlinerItems(const SfxItemSet& rSet, bool bInklDefaults, bool* pbOnlyEE)
{
bool bHas=false;
bool bOnly=true;
bool bLookOnly=pbOnlyEE!=NULL;
SfxWhichIter aIter(rSet);
sal_uInt16 nWhich=aIter.FirstWhich();
while (((bLookOnly && bOnly) || !bHas) && nWhich!=0) {
// For bInklDefaults, the entire Which range is decisive,
// in other cases only the set items are.
// Disabled and DontCare are regarded as holes in the Which range.
SfxItemState eState=rSet.GetItemState(nWhich);
if ((eState==SFX_ITEM_DEFAULT && bInklDefaults) || eState==SFX_ITEM_SET) {
if (nWhich<EE_ITEMS_START || nWhich>EE_ITEMS_END) bOnly=false;
else bHas=true;
}
nWhich=aIter.NextWhich();
}
if (!bHas) bOnly=false;
if (pbOnlyEE!=NULL) *pbOnlyEE=bOnly;
return bHas;
}
sal_uInt16* RemoveWhichRange(const sal_uInt16* pOldWhichTable, sal_uInt16 nRangeBeg, sal_uInt16 nRangeEnd)
{
// Six possible cases (per range):
// [Beg..End] Range, to delete
// [b..e] [b..e] [b..e] Cases 1,3,2: doesn't matter, delete, doesn't matter + Ranges
// [b........e] [b........e] Cases 4,5 : shrink range | in
// [b......................e] Case 6 : splitting + pOldWhichTable
sal_uInt16 nAnz=0;
while (pOldWhichTable[nAnz]!=0) nAnz++;
nAnz++; // nAnz should now be an odd number (0 for end of array)
DBG_ASSERT((nAnz&1)==1,"RemoveWhichRange: WhichTable doesn't have an odd number of entries.");
sal_uInt16 nAlloc=nAnz;
// check necessary size of new array
sal_uInt16 nNum=nAnz-1;
while (nNum!=0) {
nNum-=2;
sal_uInt16 nBeg=pOldWhichTable[nNum];
sal_uInt16 nEnd=pOldWhichTable[nNum+1];
if (nEnd<nRangeBeg) /*nCase=1*/ ;
else if (nBeg>nRangeEnd) /* nCase=2 */ ;
else if (nBeg>=nRangeBeg && nEnd<=nRangeEnd) /* nCase=3 */ nAlloc-=2;
else if (nEnd<=nRangeEnd) /* nCase=4 */;
else if (nBeg>=nRangeBeg) /* nCase=5*/ ;
else /* nCase=6 */ nAlloc+=2;
}
sal_uInt16* pNewWhichTable=new sal_uInt16[nAlloc];
memcpy(pNewWhichTable,pOldWhichTable,nAlloc*sizeof(sal_uInt16));
pNewWhichTable[nAlloc-1]=0; // in case 3, there's no 0 at the end.
// now remove the unwanted ranges
nNum=nAlloc-1;
while (nNum!=0) {
nNum-=2;
sal_uInt16 nBeg=pNewWhichTable[nNum];
sal_uInt16 nEnd=pNewWhichTable[nNum+1];
unsigned nCase=0;
if (nEnd<nRangeBeg) nCase=1;
else if (nBeg>nRangeEnd) nCase=2;
else if (nBeg>=nRangeBeg && nEnd<=nRangeEnd) nCase=3;
else if (nEnd<=nRangeEnd) nCase=4;
else if (nBeg>=nRangeBeg) nCase=5;
else nCase=6;
switch (nCase) {
case 3: {
unsigned nTailBytes=(nAnz-(nNum+2))*sizeof(sal_uInt16);
memcpy(&pNewWhichTable[nNum],&pNewWhichTable[nNum+2],nTailBytes);
nAnz-=2; // remember: array is now smaller
} break;
case 4: pNewWhichTable[nNum+1]=nRangeBeg-1; break;
case 5: pNewWhichTable[nNum]=nRangeEnd+1; break;
case 6: {
unsigned nTailBytes=(nAnz-(nNum+2))*sizeof(sal_uInt16);
memcpy(&pNewWhichTable[nNum+4],&pNewWhichTable[nNum+2],nTailBytes);
nAnz+=2; // remember:array is now larger
pNewWhichTable[nNum+2]=nRangeEnd+1;
pNewWhichTable[nNum+3]=pNewWhichTable[nNum+1];
pNewWhichTable[nNum+1]=nRangeBeg-1;
} break;
} // switch
}
return pNewWhichTable;
}
SvdProgressInfo::SvdProgressInfo( Link *_pLink )
{
DBG_ASSERT(_pLink!=NULL,"SvdProgressInfo(): No Link stated!");
pLink = _pLink;
nSumActionCount = 0;
nSumCurAction = 0;
nObjCount = 0;
nCurObj = 0;
nActionCount = 0;
nCurAction = 0;
nInsertCount = 0;
nCurInsert = 0;
}
void SvdProgressInfo::Init( sal_uIntPtr _nSumActionCount, sal_uIntPtr _nObjCount )
{
nSumActionCount = _nSumActionCount;
nObjCount = _nObjCount;
}
bool SvdProgressInfo::ReportActions( sal_uIntPtr nAnzActions )
{
nSumCurAction += nAnzActions;
nCurAction += nAnzActions;
if(nCurAction > nActionCount)
nCurAction = nActionCount;
return pLink->Call(NULL) == 1L;
}
bool SvdProgressInfo::ReportInserts( sal_uIntPtr nAnzInserts )
{
nSumCurAction += nAnzInserts;
nCurInsert += nAnzInserts;
return pLink->Call(NULL) == 1L;
}
bool SvdProgressInfo::ReportRescales( sal_uIntPtr nAnzRescales )
{
nSumCurAction += nAnzRescales;
return pLink->Call(NULL) == 1L;
}
void SvdProgressInfo::SetActionCount( sal_uIntPtr _nActionCount )
{
nActionCount = _nActionCount;
}
void SvdProgressInfo::SetInsertCount( sal_uIntPtr _nInsertCount )
{
nInsertCount = _nInsertCount;
}
bool SvdProgressInfo::SetNextObject()
{
nActionCount = 0;
nCurAction = 0;
nInsertCount = 0;
nCurInsert = 0;
nCurObj++;
return ReportActions(0);
}
// #i101872# isolate GetTextEditBackgroundColor to tooling; it will anyways only be used as long
// as text edit is not running on overlay
namespace
{
bool impGetSdrObjListFillColor(
const SdrObjList& rList,
const Point& rPnt,
const SdrPageView& rTextEditPV,
const SetOfByte& rVisLayers,
Color& rCol)
{
if(!rList.GetModel())
return false;
bool bRet(false);
bool bMaster(rList.GetPage() && rList.GetPage()->IsMasterPage());
for(sal_uIntPtr no(rList.GetObjCount()); !bRet && no > 0; )
{
no--;
SdrObject* pObj = rList.GetObj(no);
SdrObjList* pOL = pObj->GetSubList();
if(pOL)
{
// group object
bRet = impGetSdrObjListFillColor(*pOL, rPnt, rTextEditPV, rVisLayers, rCol);
}
else
{
SdrTextObj* pText = dynamic_cast< SdrTextObj * >(pObj);
// Exclude zero master page object (i.e. background shape) from color query
if(pText
&& pObj->IsClosedObj()
&& (!bMaster || (!pObj->IsNotVisibleAsMaster() && 0 != no))
&& pObj->GetCurrentBoundRect().IsInside(rPnt)
&& !pText->IsHideContour()
&& SdrObjectPrimitiveHit(*pObj, rPnt, 0, rTextEditPV, &rVisLayers, false))
{
bRet = GetDraftFillColor(pObj->GetMergedItemSet(), rCol);
}
}
}
return bRet;
}
bool impGetSdrPageFillColor(
const SdrPage& rPage,
const Point& rPnt,
const SdrPageView& rTextEditPV,
const SetOfByte& rVisLayers,
Color& rCol,
bool bSkipBackgroundShape)
{
if(!rPage.GetModel())
return false;
bool bRet(impGetSdrObjListFillColor(rPage, rPnt, rTextEditPV, rVisLayers, rCol));
if(!bRet && !rPage.IsMasterPage())
{
if(rPage.TRG_HasMasterPage())
{
SetOfByte aSet(rVisLayers);
aSet &= rPage.TRG_GetMasterPageVisibleLayers();
SdrPage& rMasterPage = rPage.TRG_GetMasterPage();
// Don't fall back to background shape on
// master pages. This is later handled by
// GetBackgroundColor, and is necessary to cater for
// the silly ordering: 1. shapes, 2. master page
// shapes, 3. page background, 4. master page
// background.
bRet = impGetSdrPageFillColor(rMasterPage, rPnt, rTextEditPV, aSet, rCol, true);
}
}
// Only now determine background color from background shapes
if(!bRet && !bSkipBackgroundShape)
{
rCol = rPage.GetPageBackgroundColor();
return true;
}
return bRet;
}
Color impCalcBackgroundColor(
const Rectangle& rArea,
const SdrPageView& rTextEditPV,
const SdrPage& rPage)
{
svtools::ColorConfig aColorConfig;
Color aBackground(aColorConfig.GetColorValue(svtools::DOCCOLOR).nColor);
const StyleSettings& rStyleSettings = Application::GetSettings().GetStyleSettings();
if(!rStyleSettings.GetHighContrastMode())
{
// search in page
const sal_uInt16 SPOTCOUNT(5);
Point aSpotPos[SPOTCOUNT];
Color aSpotColor[SPOTCOUNT];
sal_uIntPtr nHeight( rArea.GetSize().Height() );
sal_uIntPtr nWidth( rArea.GetSize().Width() );
sal_uIntPtr nWidth14 = nWidth / 4;
sal_uIntPtr nHeight14 = nHeight / 4;
sal_uIntPtr nWidth34 = ( 3 * nWidth ) / 4;
sal_uIntPtr nHeight34 = ( 3 * nHeight ) / 4;
sal_uInt16 i;
for ( i = 0; i < SPOTCOUNT; i++ )
{
// five spots are used
switch ( i )
{
case 0 :
{
// Center-Spot
aSpotPos[i] = rArea.Center();
}
break;
case 1 :
{
// TopLeft-Spot
aSpotPos[i] = rArea.TopLeft();
aSpotPos[i].X() += nWidth14;
aSpotPos[i].Y() += nHeight14;
}
break;
case 2 :
{
// TopRight-Spot
aSpotPos[i] = rArea.TopLeft();
aSpotPos[i].X() += nWidth34;
aSpotPos[i].Y() += nHeight14;
}
break;
case 3 :
{
// BottomLeft-Spot
aSpotPos[i] = rArea.TopLeft();
aSpotPos[i].X() += nWidth14;
aSpotPos[i].Y() += nHeight34;
}
break;
case 4 :
{
// BottomRight-Spot
aSpotPos[i] = rArea.TopLeft();
aSpotPos[i].X() += nWidth34;
aSpotPos[i].Y() += nHeight34;
}
break;
}
aSpotColor[i] = Color( COL_WHITE );
impGetSdrPageFillColor(rPage, aSpotPos[i], rTextEditPV, rTextEditPV.GetVisibleLayers(), aSpotColor[i], false);
}
sal_uInt16 aMatch[SPOTCOUNT];
for ( i = 0; i < SPOTCOUNT; i++ )
{
// were same spot colors found?
aMatch[i] = 0;
for ( sal_uInt16 j = 0; j < SPOTCOUNT; j++ )
{
if( j != i )
{
if( aSpotColor[i] == aSpotColor[j] )
{
aMatch[i]++;
}
}
}
}
// highest weight to center spot
aBackground = aSpotColor[0];
for ( sal_uInt16 nMatchCount = SPOTCOUNT - 1; nMatchCount > 1; nMatchCount-- )
{
// which spot color was found most?
for ( i = 0; i < SPOTCOUNT; i++ )
{
if( aMatch[i] == nMatchCount )
{
aBackground = aSpotColor[i];
nMatchCount = 1; // break outer for-loop
break;
}
}
}
}
return aBackground;
}
} // end of anonymous namespace
Color GetTextEditBackgroundColor(const SdrObjEditView& rView)
{
svtools::ColorConfig aColorConfig;
Color aBackground(aColorConfig.GetColorValue(svtools::DOCCOLOR).nColor);
const StyleSettings& rStyleSettings = Application::GetSettings().GetStyleSettings();
if(!rStyleSettings.GetHighContrastMode())
{
bool bFound(false);
SdrTextObj* pText = dynamic_cast< SdrTextObj * >(rView.GetTextEditObject());
if(pText && pText->IsClosedObj())
{
::sdr::table::SdrTableObj* pTable = dynamic_cast< ::sdr::table::SdrTableObj * >( pText );
if( pTable )
bFound = GetDraftFillColor(pTable->GetActiveCellItemSet(), aBackground );
if( !bFound )
bFound=GetDraftFillColor(pText->GetMergedItemSet(), aBackground);
}
if(!bFound && pText)
{
SdrPageView* pTextEditPV = rView.GetTextEditPageView();
if(pTextEditPV)
{
Point aPvOfs(pText->GetTextEditOffset());
const SdrPage* pPg = pTextEditPV->GetPage();
if(pPg)
{
Rectangle aSnapRect( pText->GetSnapRect() );
aSnapRect.Move(aPvOfs.X(), aPvOfs.Y());
return impCalcBackgroundColor(aSnapRect, *pTextEditPV, *pPg);
}
}
}
}
return aBackground;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|