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