svtools/source/contnr/imivctl2.cxx

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*
   3  * This file is part of the LibreOffice project.
   4  *
   5  * This Source Code Form is subject to the terms of the Mozilla Public
   6  * License, v. 2.0. If a copy of the MPL was not distributed with this
   7  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
   8  *
   9  * This file incorporates work covered by the following license notice:
  10  *
  11  *   Licensed to the Apache Software Foundation (ASF) under one or more
  12  *   contributor license agreements. See the NOTICE file distributed
  13  *   with this work for additional information regarding copyright
  14  *   ownership. The ASF licenses this file to you under the Apache
  15  *   License, Version 2.0 (the "License"); you may not use this file
  16  *   except in compliance with the License. You may obtain a copy of
  17  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
  18  */
  19
  20 #include "imivctl.hxx"
  21
  22 IcnCursor_Impl::IcnCursor_Impl( SvxIconChoiceCtrl_Impl* pOwner )
  23 {
  24     pView       = pOwner;
  25     pCurEntry   = 0;
  26     nDeltaWidth = 0;
  27     nDeltaHeight= 0;
  28     nCols       = 0;
  29     nRows       = 0;
  30 }
  31
  32 IcnCursor_Impl::~IcnCursor_Impl()
  33 {
  34 }
  35
  36 sal_uInt16 IcnCursor_Impl::GetSortListPos( SvxIconChoiceCtrlEntryPtrVec& rList, long nValue,
  37     bool bVertical )
  38 {
  39     sal_uInt16 nCount = rList.size();
  40     if( !nCount )
  41         return 0;
  42
  43     sal_uInt16 nCurPos = 0;
  44     long nPrevValue = LONG_MIN;
  45     while( nCount )
  46     {
  47         const Rectangle& rRect = pView->GetEntryBoundRect( rList[nCurPos] );
  48         long nCurValue;
  49         if( bVertical )
  50             nCurValue = rRect.Top();
  51         else
  52             nCurValue = rRect.Left();
  53         if( nValue >= nPrevValue && nValue <= nCurValue )
  54             return (sal_uInt16)nCurPos;
  55         nPrevValue = nCurValue;
  56         nCount--;
  57         nCurPos++;
  58     }
  59     return rList.size();
  60 }
  61
  62 void IcnCursor_Impl::ImplCreate()
  63 {
  64     pView->CheckBoundingRects();
  65     DBG_ASSERT(xColumns==0&&xRows==0,"ImplCreate: Not cleared");
  66
  67     SetDeltas();
  68
  69     xColumns.reset(new IconChoiceMap);
  70     xRows.reset(new IconChoiceMap);
  71
  72     size_t nCount = pView->aEntries.size();
  73     for( size_t nCur = 0; nCur < nCount; nCur++ )
  74     {
  75         SvxIconChoiceCtrlEntry* pEntry = pView->aEntries[ nCur ];
  76         // const Rectangle& rRect = pView->GetEntryBoundRect( pEntry );
  77         Rectangle rRect( pView->CalcBmpRect( pEntry,0 ) );
  78         short nY = (short)( ((rRect.Top()+rRect.Bottom())/2) / nDeltaHeight );
  79         short nX = (short)( ((rRect.Left()+rRect.Right())/2) / nDeltaWidth );
  80
  81         // capture rounding errors
  82         if( nY >= nRows )
  83             nY = sal::static_int_cast< short >(nRows - 1);
  84         if( nX >= nCols )
  85             nX = sal::static_int_cast< short >(nCols - 1);
  86
  87         SvxIconChoiceCtrlEntryPtrVec& rColEntry = (*xColumns)[nX];
  88         sal_uInt16 nIns = GetSortListPos( rColEntry, rRect.Top(), true );
  89         rColEntry.insert( rColEntry.begin() + nIns, pEntry );
  90
  91         SvxIconChoiceCtrlEntryPtrVec& rRowEntry = (*xRows)[nY];
  92         nIns = GetSortListPos( rRowEntry, rRect.Left(), false );
  93         rRowEntry.insert( rRowEntry.begin() + nIns, pEntry );
  94
  95         pEntry->nX = nX;
  96         pEntry->nY = nY;
  97     }
  98 }
  99
 100
 101
 102
 103 void IcnCursor_Impl::Clear()
 104 {
 105     if( xColumns )
 106     {
 107         xColumns.reset();
 108         xRows.reset();
 109         pCurEntry = 0;
 110         nDeltaWidth = 0;
 111         nDeltaHeight = 0;
 112     }
 113 }
 114
 115 SvxIconChoiceCtrlEntry* IcnCursor_Impl::SearchCol(sal_uInt16 nCol, sal_uInt16 nTop, sal_uInt16 nBottom,
 116     sal_uInt16, bool bDown, bool bSimple )
 117 {
 118     DBG_ASSERT(pCurEntry, "SearchCol: No reference entry");
 119     IconChoiceMap::iterator mapIt = xColumns->find( nCol );
 120     if ( mapIt == xColumns->end() )
 121         return 0;
 122     SvxIconChoiceCtrlEntryPtrVec const & rList = mapIt->second;
 123     const sal_uInt16 nCount = rList.size();
 124     if( !nCount )
 125         return 0;
 126
 127     const Rectangle& rRefRect = pView->GetEntryBoundRect(pCurEntry);
 128
 129     if( bSimple )
 130     {
 131         SvxIconChoiceCtrlEntryPtrVec::const_iterator it = std::find( rList.begin(), rList.end(), pCurEntry );
 132
 133         assert(it != rList.end()); //Entry not in Col-List
 134         if (it == rList.end())
 135             return 0;
 136
 137         if( bDown )
 138         {
 139             while( ++it != rList.end() )
 140             {
 141                 SvxIconChoiceCtrlEntry* pEntry = *it;
 142                 const Rectangle& rRect = pView->GetEntryBoundRect( pEntry );
 143                 if( rRect.Top() > rRefRect.Top() )
 144                     return pEntry;
 145             }
 146             return 0;
 147         }
 148         else
 149         {
 150             SvxIconChoiceCtrlEntryPtrVec::const_reverse_iterator it2(it);
 151             while (it2 != rList.rend())
 152             {
 153                 SvxIconChoiceCtrlEntry* pEntry = *it2;
 154                 const Rectangle& rRect = pView->GetEntryBoundRect( pEntry );
 155                 if( rRect.Top() < rRefRect.Top() )
 156                     return pEntry;
 157                 ++it2;
 158             }
 159             return 0;
 160         }
 161     }
 162
 163     if( nTop > nBottom )
 164     {
 165         sal_uInt16 nTemp = nTop;
 166         nTop = nBottom;
 167         nBottom = nTemp;
 168     }
 169     long nMinDistance = LONG_MAX;
 170     SvxIconChoiceCtrlEntry* pResult = 0;
 171     for( sal_uInt16 nCur = 0; nCur < nCount; nCur++ )
 172     {
 173         SvxIconChoiceCtrlEntry* pEntry = rList[ nCur ];
 174         if( pEntry != pCurEntry )
 175         {
 176             sal_uInt16 nY = pEntry->nY;
 177             if( nY >= nTop && nY <= nBottom )
 178             {
 179                 const Rectangle& rRect = pView->GetEntryBoundRect( pEntry );
 180                 long nDistance = rRect.Top() - rRefRect.Top();
 181                 if( nDistance < 0 )
 182                     nDistance *= -1;
 183                 if( nDistance && nDistance < nMinDistance )
 184                 {
 185                     nMinDistance = nDistance;
 186                     pResult = pEntry;
 187                 }
 188             }
 189         }
 190     }
 191     return pResult;
 192 }
 193
 194 SvxIconChoiceCtrlEntry* IcnCursor_Impl::SearchRow(sal_uInt16 nRow, sal_uInt16 nLeft, sal_uInt16 nRight,
 195     sal_uInt16, bool bRight, bool bSimple )
 196 {
 197     DBG_ASSERT(pCurEntry,"SearchRow: No reference entry");
 198     IconChoiceMap::iterator mapIt = xRows->find( nRow );
 199     if ( mapIt == xRows->end() )
 200         return 0;
 201     SvxIconChoiceCtrlEntryPtrVec const & rList = mapIt->second;
 202     const sal_uInt16 nCount = rList.size();
 203     if( !nCount )
 204         return 0;
 205
 206     const Rectangle& rRefRect = pView->GetEntryBoundRect(pCurEntry);
 207
 208     if( bSimple )
 209     {
 210         SvxIconChoiceCtrlEntryPtrVec::const_iterator it = std::find( rList.begin(), rList.end(), pCurEntry );
 211
 212         assert(it != rList.end()); //Entry not in Row-List
 213         if (it == rList.end())
 214             return 0;
 215
 216         if( bRight )
 217         {
 218             while( ++it != rList.end() )
 219             {
 220                 SvxIconChoiceCtrlEntry* pEntry = *it;
 221                 const Rectangle& rRect = pView->GetEntryBoundRect( pEntry );
 222                 if( rRect.Left() > rRefRect.Left() )
 223                     return pEntry;
 224             }
 225             return 0;
 226         }
 227         else
 228         {
 229             SvxIconChoiceCtrlEntryPtrVec::const_reverse_iterator it2(it);
 230             while (it2 != rList.rend())
 231             {
 232                 SvxIconChoiceCtrlEntry* pEntry = *it2;
 233                 const Rectangle& rRect = pView->GetEntryBoundRect( pEntry );
 234                 if( rRect.Left() < rRefRect.Left() )
 235                     return pEntry;
 236                 ++it2;
 237             }
 238             return 0;
 239         }
 240
 241     }
 242     if( nRight < nLeft )
 243     {
 244         sal_uInt16 nTemp = nRight;
 245         nRight = nLeft;
 246         nLeft = nTemp;
 247     }
 248     long nMinDistance = LONG_MAX;
 249     SvxIconChoiceCtrlEntry* pResult = 0;
 250     for( sal_uInt16 nCur = 0; nCur < nCount; nCur++ )
 251     {
 252         SvxIconChoiceCtrlEntry* pEntry = rList[ nCur ];
 253         if( pEntry != pCurEntry )
 254         {
 255             sal_uInt16 nX = pEntry->nX;
 256             if( nX >= nLeft && nX <= nRight )
 257             {
 258                 const Rectangle& rRect = pView->GetEntryBoundRect( pEntry );
 259                 long nDistance = rRect.Left() - rRefRect.Left();
 260                 if( nDistance < 0 )
 261                     nDistance *= -1;
 262                 if( nDistance && nDistance < nMinDistance )
 263                 {
 264                     nMinDistance = nDistance;
 265                     pResult = pEntry;
 266                 }
 267             }
 268         }
 269     }
 270     return pResult;
 271 }
 272
 273
 274
 275 /*
 276     Searches, starting from the passed value, the next entry to the left/to the
 277     right. Example for bRight = sal_True:
 278
 279                   c
 280                 b c
 281               a b c
 282             S 1 1 1      ====> search direction
 283               a b c
 284                 b c
 285                   c
 286
 287     S : starting position
 288     1 : first searched rectangle
 289     a,b,c : 2nd, 3rd, 4th searched rectangle
 290 */
 291
 292 SvxIconChoiceCtrlEntry* IcnCursor_Impl::GoLeftRight( SvxIconChoiceCtrlEntry* pCtrlEntry, bool bRight )
 293 {
 294     SvxIconChoiceCtrlEntry* pResult;
 295     pCurEntry = pCtrlEntry;
 296     Create();
 297     sal_uInt16 nY = pCtrlEntry->nY;
 298     sal_uInt16 nX = pCtrlEntry->nX;
 299     DBG_ASSERT(nY< nRows,"GoLeftRight:Bad column");
 300     DBG_ASSERT(nX< nCols,"GoLeftRight:Bad row");
 301     // neighbor in same row?
 302     if( bRight )
 303         pResult = SearchRow(
 304             nY, nX, sal::static_int_cast< sal_uInt16 >(nCols-1), nX, true, true );
 305     else
 306         pResult = SearchRow( nY, nX ,0, nX, false, true );
 307     if( pResult )
 308         return pResult;
 309
 310     long nCurCol = nX;
 311
 312     long nColOffs, nLastCol;
 313     if( bRight )
 314     {
 315         nColOffs = 1;
 316         nLastCol = nCols;
 317     }
 318     else
 319     {
 320         nColOffs = -1;
 321         nLastCol = -1;   // 0-1
 322     }
 323
 324     sal_uInt16 nRowMin = nY;
 325     sal_uInt16 nRowMax = nY;
 326     do
 327     {
 328         SvxIconChoiceCtrlEntry* pEntry = SearchCol((sal_uInt16)nCurCol,nRowMin,nRowMax,nY,true, false);
 329         if( pEntry )
 330             return pEntry;
 331         if( nRowMin )
 332             nRowMin--;
 333         if( nRowMax < (nRows-1))
 334             nRowMax++;
 335         nCurCol += nColOffs;
 336     } while( nCurCol != nLastCol );
 337     return 0;
 338 }
 339
 340 SvxIconChoiceCtrlEntry* IcnCursor_Impl::GoPageUpDown( SvxIconChoiceCtrlEntry* pStart, bool bDown)
 341 {
 342     if( pView->IsAutoArrange() && !(pView->nWinBits & WB_ALIGN_TOP) )
 343     {
 344         const long nPos = (long)pView->GetEntryListPos( pStart );
 345         long nEntriesInView = (pView->aOutputSize.Height() / pView->nGridDY);
 346         nEntriesInView *=
 347             ((pView->aOutputSize.Width()+(pView->nGridDX/2)) / pView->nGridDX );
 348         long nNewPos = nPos;
 349         if( bDown )
 350         {
 351             nNewPos += nEntriesInView;
 352             if( nNewPos >= (long)pView->aEntries.size() )
 353                 nNewPos = pView->aEntries.size() - 1;
 354         }
 355         else
 356         {
 357             nNewPos -= nEntriesInView;
 358             if( nNewPos < 0 )
 359                 nNewPos = 0;
 360         }
 361         if( nPos != nNewPos )
 362             return pView->aEntries[ (size_t)nNewPos ];
 363         return 0;
 364     }
 365     long nOpt = pView->GetEntryBoundRect( pStart ).Top();
 366     if( bDown )
 367     {
 368         nOpt += pView->aOutputSize.Height();
 369         nOpt -= pView->nGridDY;
 370     }
 371     else
 372     {
 373         nOpt -= pView->aOutputSize.Height();
 374         nOpt += pView->nGridDY;
 375     }
 376     if( nOpt < 0 )
 377         nOpt = 0;
 378
 379     long nPrevErr = LONG_MAX;
 380
 381     SvxIconChoiceCtrlEntry* pPrev = pStart;
 382     SvxIconChoiceCtrlEntry* pNext = GoUpDown( pStart, bDown );
 383     while( pNext )
 384     {
 385         long nCur = pView->GetEntryBoundRect( pNext ).Top();
 386         long nErr = nOpt - nCur;
 387         if( nErr < 0 )
 388             nErr *= -1;
 389         if( nErr > nPrevErr )
 390             return pPrev;
 391         nPrevErr = nErr;
 392         pPrev = pNext;
 393         pNext = GoUpDown( pNext, bDown );
 394     }
 395     if( pPrev != pStart )
 396         return pPrev;
 397     return 0;
 398 }
 399
 400 SvxIconChoiceCtrlEntry* IcnCursor_Impl::GoUpDown( SvxIconChoiceCtrlEntry* pCtrlEntry, bool bDown)
 401 {
 402     if( pView->IsAutoArrange() && !(pView->nWinBits & WB_ALIGN_TOP) )
 403     {
 404         sal_uLong nPos = pView->GetEntryListPos( pCtrlEntry );
 405         if( bDown && nPos < (pView->aEntries.size() - 1) )
 406             return pView->aEntries[ nPos + 1 ];
 407         else if( !bDown && nPos > 0 )
 408             return pView->aEntries[ nPos - 1 ];
 409         return 0;
 410     }
 411
 412     SvxIconChoiceCtrlEntry* pResult;
 413     pCurEntry = pCtrlEntry;
 414     Create();
 415     sal_uInt16 nY = pCtrlEntry->nY;
 416     sal_uInt16 nX = pCtrlEntry->nX;
 417     DBG_ASSERT(nY<nRows,"GoUpDown:Bad column");
 418     DBG_ASSERT(nX<nCols,"GoUpDown:Bad row");
 419
 420     // neighbor in same column?
 421     if( bDown )
 422         pResult = SearchCol(
 423             nX, nY, sal::static_int_cast< sal_uInt16 >(nRows-1), nY, true, true );
 424     else
 425         pResult = SearchCol( nX, nY ,0, nY, false, true );
 426     if( pResult )
 427         return pResult;
 428
 429     long nCurRow = nY;
 430
 431     long nRowOffs, nLastRow;
 432     if( bDown )
 433     {
 434         nRowOffs = 1;
 435         nLastRow = nRows;
 436     }
 437     else
 438     {
 439         nRowOffs = -1;
 440         nLastRow = -1;   // 0-1
 441     }
 442
 443     sal_uInt16 nColMin = nX;
 444     sal_uInt16 nColMax = nX;
 445     do
 446     {
 447         SvxIconChoiceCtrlEntry* pEntry = SearchRow((sal_uInt16)nCurRow,nColMin,nColMax,nX,true, false);
 448         if( pEntry )
 449             return pEntry;
 450         if( nColMin )
 451             nColMin--;
 452         if( nColMax < (nCols-1))
 453             nColMax++;
 454         nCurRow += nRowOffs;
 455     } while( nCurRow != nLastRow );
 456     return 0;
 457 }
 458
 459 void IcnCursor_Impl::SetDeltas()
 460 {
 461     const Size& rSize = pView->aVirtOutputSize;
 462     nCols = rSize.Width() / pView->nGridDX;
 463     if( !nCols )
 464         nCols = 1;
 465     nRows = rSize.Height() / pView->nGridDY;
 466     if( (nRows * pView->nGridDY) < rSize.Height() )
 467         nRows++;
 468     if( !nRows )
 469         nRows = 1;
 470
 471     nDeltaWidth = (short)(rSize.Width() / nCols);
 472     nDeltaHeight = (short)(rSize.Height() / nRows);
 473     if( !nDeltaHeight )
 474     {
 475         nDeltaHeight = 1;
 476         DBG_WARNING("SetDeltas:Bad height");
 477     }
 478     if( !nDeltaWidth )
 479     {
 480         nDeltaWidth = 1;
 481         DBG_WARNING("SetDeltas:Bad width");
 482     }
 483 }
 484
 485 void IcnCursor_Impl::CreateGridAjustData( IconChoiceMap& rLists, SvxIconChoiceCtrlEntry* pRefEntry)
 486 {
 487     if( !pRefEntry )
 488     {
 489         sal_uInt16 nGridRows = (sal_uInt16)(pView->aVirtOutputSize.Height() / pView->nGridDY);
 490         nGridRows++; // because we round down later!
 491
 492         if( !nGridRows )
 493             return;
 494         const size_t nCount = pView->aEntries.size();
 495         for( size_t nCur = 0; nCur < nCount; nCur++ )
 496         {
 497             SvxIconChoiceCtrlEntry* pEntry = pView->aEntries[ nCur ];
 498             const Rectangle& rRect = pView->GetEntryBoundRect( pEntry );
 499             short nY = (short)( ((rRect.Top()+rRect.Bottom())/2) / pView->nGridDY );
 500             sal_uInt16 nIns = GetSortListPos( rLists[nY], rRect.Left(), false );
 501             rLists[ nY ].insert( rLists[ nY ].begin() + nIns, pEntry );
 502         }
 503     }
 504     else
 505     {
 506         // build a horizontal "tube" in the RefEntry line
 507         // STOP AND THINK: maybe use bounding rectangle because of overlaps?
 508         Rectangle rRefRect( pView->CalcBmpRect( pRefEntry ) );
 509         //const Rectangle& rRefRect = pView->GetEntryBoundRect( pRefEntry );
 510         short nRefRow = (short)( ((rRefRect.Top()+rRefRect.Bottom())/2) / pView->nGridDY );
 511         SvxIconChoiceCtrlEntryPtrVec& rRow = rLists[0];
 512         size_t nCount = pView->aEntries.size();
 513         for( size_t nCur = 0; nCur < nCount; nCur++ )
 514         {
 515             SvxIconChoiceCtrlEntry* pEntry = pView->aEntries[ nCur ];
 516             Rectangle rRect( pView->CalcBmpRect(pEntry) );
 517             //const Rectangle& rRect = pView->GetEntryBoundRect( pEntry );
 518             short nY = (short)( ((rRect.Top()+rRect.Bottom())/2) / pView->nGridDY );
 519             if( nY == nRefRow )
 520             {
 521                 sal_uInt16 nIns = GetSortListPos( rRow, rRect.Left(), false );
 522                 rRow.insert( rRow.begin() + nIns, pEntry );
 523             }
 524         }
 525     }
 526 }
 527
 528 //static
 529 void IcnCursor_Impl::DestroyGridAdjustData( IconChoiceMap& rLists )
 530 {
 531     rLists.clear();
 532 }
 533
 534 IcnGridMap_Impl::IcnGridMap_Impl(SvxIconChoiceCtrl_Impl* pView)
 535 {
 536     _pView = pView;
 537     _pGridMap = 0;
 538     _nGridCols = 0;
 539     _nGridRows = 0;
 540 }
 541
 542 IcnGridMap_Impl::~IcnGridMap_Impl()
 543 {
 544     delete[] _pGridMap, _pGridMap=0;
 545 }
 546
 547 void IcnGridMap_Impl::Expand()
 548 {
 549     if( !_pGridMap )
 550         Create_Impl();
 551     else
 552     {
 553         sal_uInt16 nNewGridRows = _nGridRows;
 554         sal_uInt16 nNewGridCols = _nGridCols;
 555         if( _pView->nWinBits & WB_ALIGN_TOP )
 556             nNewGridRows += 50;
 557         else
 558             nNewGridCols += 50;
 559
 560         size_t nNewCellCount = static_cast<size_t>(nNewGridRows) * nNewGridCols;
 561         bool* pNewGridMap = new bool[nNewCellCount];
 562         memset(pNewGridMap, 0, nNewCellCount * sizeof(bool));
 563         size_t nOldCellCount = static_cast<size_t>(_nGridRows) * _nGridCols;
 564         memcpy(pNewGridMap, _pGridMap, nOldCellCount * sizeof(bool));
 565         delete[] _pGridMap;
 566         _pGridMap = pNewGridMap;
 567         _nGridRows = nNewGridRows;
 568         _nGridCols = nNewGridCols;
 569     }
 570 }
 571
 572 void IcnGridMap_Impl::Create_Impl()
 573 {
 574     DBG_ASSERT(!_pGridMap,"Unnecessary call to IcnGridMap_Impl::Create_Impl()");
 575     if( _pGridMap )
 576         return;
 577     GetMinMapSize( _nGridCols, _nGridRows );
 578     if( _pView->nWinBits & WB_ALIGN_TOP )
 579         _nGridRows += 50;  // avoid resize of gridmap too often
 580     else
 581         _nGridCols += 50;
 582
 583     size_t nCellCount = static_cast<size_t>(_nGridRows) * _nGridCols;
 584     _pGridMap = new bool[nCellCount];
 585     memset(_pGridMap, 0, nCellCount * sizeof(bool));
 586
 587     const size_t nCount = _pView->aEntries.size();
 588     for( size_t nCur=0; nCur < nCount; nCur++ )
 589         OccupyGrids( _pView->aEntries[ nCur ] );
 590 }
 591
 592 void IcnGridMap_Impl::GetMinMapSize( sal_uInt16& rDX, sal_uInt16& rDY ) const
 593 {
 594     long nX, nY;
 595     if( _pView->nWinBits & WB_ALIGN_TOP )
 596     {
 597         // The view grows in vertical direction. Its max. width is _pView->nMaxVirtWidth
 598         nX = _pView->nMaxVirtWidth;
 599         if( !nX )
 600             nX = _pView->pView->GetOutputSizePixel().Width();
 601         if( !(_pView->nFlags & F_ARRANGING) )
 602             nX -= _pView->nVerSBarWidth;
 603
 604         nY = _pView->aVirtOutputSize.Height();
 605     }
 606     else
 607     {
 608         // The view grows in horizontal direction. Its max. height is _pView->nMaxVirtHeight
 609         nY = _pView->nMaxVirtHeight;
 610         if( !nY )
 611             nY = _pView->pView->GetOutputSizePixel().Height();
 612         if( !(_pView->nFlags & F_ARRANGING) )
 613             nY -= _pView->nHorSBarHeight;
 614         nX = _pView->aVirtOutputSize.Width();
 615     }
 616
 617     if( !nX )
 618         nX = DEFAULT_MAX_VIRT_WIDTH;
 619     if( !nY )
 620         nY = DEFAULT_MAX_VIRT_HEIGHT;
 621
 622     long nDX = nX / _pView->nGridDX;
 623     long nDY = nY / _pView->nGridDY;
 624
 625     if( !nDX )
 626         nDX++;
 627     if( !nDY )
 628         nDY++;
 629
 630     rDX = (sal_uInt16)nDX;
 631     rDY = (sal_uInt16)nDY;
 632 }
 633
 634 GridId IcnGridMap_Impl::GetGrid( sal_uInt16 nGridX, sal_uInt16 nGridY )
 635 {
 636     Create();
 637     if( _pView->nWinBits & WB_ALIGN_TOP )
 638         return nGridX + ( static_cast<GridId>(nGridY) * _nGridCols );
 639     else
 640         return nGridY + ( static_cast<GridId>(nGridX) * _nGridRows );
 641 }
 642
 643 GridId IcnGridMap_Impl::GetGrid( const Point& rDocPos, bool* pbClipped )
 644 {
 645     Create();
 646
 647     long nX = rDocPos.X();
 648     long nY = rDocPos.Y();
 649     nX -= LROFFS_WINBORDER;
 650     nY -= TBOFFS_WINBORDER;
 651     nX /= _pView->nGridDX;
 652     nY /= _pView->nGridDY;
 653     bool bClipped = false;
 654     if( nX >= _nGridCols )
 655     {
 656         nX = _nGridCols - 1;
 657         bClipped = true;
 658     }
 659     if( nY >= _nGridRows )
 660     {
 661         nY = _nGridRows - 1;
 662         bClipped = true;
 663     }
 664     GridId nId = GetGrid( (sal_uInt16)nX, (sal_uInt16)nY );
 665     if( pbClipped )
 666         *pbClipped = bClipped;
 667     DBG_ASSERT(nId <(sal_uLong)(_nGridCols*_nGridRows),"GetGrid failed");
 668     return nId;
 669 }
 670
 671 Rectangle IcnGridMap_Impl::GetGridRect( GridId nId )
 672 {
 673     Create();
 674     sal_uInt16 nGridX, nGridY;
 675     GetGridCoord( nId, nGridX, nGridY );
 676     const long nLeft = nGridX * _pView->nGridDX+ LROFFS_WINBORDER;
 677     const long nTop = nGridY * _pView->nGridDY + TBOFFS_WINBORDER;
 678     return Rectangle(
 679         nLeft, nTop,
 680         nLeft + _pView->nGridDX,
 681         nTop + _pView->nGridDY );
 682 }
 683
 684 GridId IcnGridMap_Impl::GetUnoccupiedGrid( bool bOccupyFound )
 685 {
 686     Create();
 687     sal_uLong nStart = 0;
 688     bool bExpanded = false;
 689
 690     while( true )
 691     {
 692         const sal_uLong nCount = (sal_uInt16)(_nGridCols * _nGridRows);
 693         for( sal_uLong nCur = nStart; nCur < nCount; nCur++ )
 694         {
 695             if( !_pGridMap[ nCur ] )
 696             {
 697                 if( bOccupyFound )
 698                     _pGridMap[ nCur ] = true;
 699                 return (GridId)nCur;
 700             }
 701         }
 702         DBG_ASSERT(!bExpanded,"ExpandGrid failed");
 703         if( bExpanded )
 704             return 0; // prevent never ending loop
 705         bExpanded = true;
 706         Expand();
 707         nStart = nCount;
 708     }
 709 }
 710
 711 // An entry only means that there's a GridRect lying under its center. This
 712 // variant is much faster than allocating via the bounding rectangle but can
 713 // lead to small overlaps.
 714 void IcnGridMap_Impl::OccupyGrids( const SvxIconChoiceCtrlEntry* pEntry, bool bOccupy )
 715 {
 716     if( !_pGridMap || !SvxIconChoiceCtrl_Impl::IsBoundingRectValid( pEntry->aRect ))
 717         return;
 718     OccupyGrid( GetGrid( pEntry->aRect.Center()), bOccupy );
 719 }
 720
 721 void IcnGridMap_Impl::Clear()
 722 {
 723     if( _pGridMap )
 724     {
 725         delete[] _pGridMap, _pGridMap=0;
 726         _nGridRows = 0;
 727         _nGridCols = 0;
 728         _aLastOccupiedGrid.SetEmpty();
 729     }
 730 }
 731
 732 sal_uLong IcnGridMap_Impl::GetGridCount( const Size& rSizePixel, sal_uInt16 nDX, sal_uInt16 nDY)
 733 {
 734     long ndx = (rSizePixel.Width() - LROFFS_WINBORDER) / nDX;
 735     if( ndx < 0 ) ndx *= -1;
 736     long ndy = (rSizePixel.Height() - TBOFFS_WINBORDER) / nDY;
 737     if( ndy < 0 ) ndy *= -1;
 738     return (sal_uLong)(ndx * ndy);
 739 }
 740
 741 void IcnGridMap_Impl::OutputSizeChanged()
 742 {
 743     if( _pGridMap )
 744     {
 745         sal_uInt16 nCols, nRows;
 746         GetMinMapSize( nCols, nRows );
 747         if( _pView->nWinBits & WB_ALIGN_TOP )
 748         {
 749             if( nCols != _nGridCols )
 750                 Clear();
 751             else if( nRows >= _nGridRows )
 752                 Expand();
 753         }
 754         else
 755         {
 756             if( nRows != _nGridRows )
 757                 Clear();
 758             else if( nCols >= _nGridCols )
 759                 Expand();
 760         }
 761     }
 762 }
 763
 764 // Independently of the view's alignment (TOP or LEFT), the gridmap
 765 // should contain the data in a continuous region, to make it possible
 766 // to copy the whole block if the gridmap needs to be expanded.
 767 void IcnGridMap_Impl::GetGridCoord( GridId nId, sal_uInt16& rGridX, sal_uInt16& rGridY )
 768 {
 769     Create();
 770     if( _pView->nWinBits & WB_ALIGN_TOP )
 771     {
 772         rGridX = (sal_uInt16)(nId % _nGridCols);
 773         rGridY = (sal_uInt16)(nId / _nGridCols);
 774     }
 775     else
 776     {
 777         rGridX = (sal_uInt16)(nId / _nGridRows);
 778         rGridY = (sal_uInt16)(nId % _nGridRows);
 779     }
 780 }
 781
 782
 783
 784 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */