sc/source/ui/view/invmerge.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 <vcl/window.hxx>
  21
  22 #include "invmerge.hxx"
  23
  24 ScInvertMerger::ScInvertMerger( ::std::vector< Rectangle >* pRectangles ) :
  25     pRects( pRectangles )
  26 {
  27     //  collect rectangles instead of inverting
  28 }
  29
  30 ScInvertMerger::~ScInvertMerger()
  31 {
  32     Flush();
  33 }
  34
  35 void ScInvertMerger::Flush()
  36 {
  37     FlushLine();
  38     FlushTotal();
  39
  40     OSL_ENSURE( aLineRect.IsEmpty() && aTotalRect.IsEmpty(), "Flush: not empty" );
  41
  42     if ( pRects )
  43     {
  44
  45         // also join vertically if there are non-adjacent columns involved
  46
  47         size_t nComparePos = 0;
  48         while ( nComparePos < pRects->size() )
  49         {
  50             Rectangle aCompRect = (*pRects)[nComparePos];
  51             sal_Int32 nBottom = aCompRect.Bottom();
  52             size_t nOtherPos = nComparePos + 1;
  53
  54             while ( nOtherPos < pRects->size() )
  55             {
  56                 Rectangle aOtherRect = (*pRects)[nOtherPos];
  57                 if ( aOtherRect.Top() > nBottom + 1 )
  58                 {
  59                     // rectangles are sorted, so we can stop searching
  60                     break;
  61                 }
  62                 if ( aOtherRect.Top() == nBottom + 1 &&
  63                      aOtherRect.Left() == aCompRect.Left() &&
  64                      aOtherRect.Right() == aCompRect.Right() )
  65                 {
  66                     // extend first rectangle
  67                     nBottom = aOtherRect.Bottom();
  68                     aCompRect.Bottom() = nBottom;
  69                     (*pRects)[nComparePos].Bottom() = nBottom;
  70
  71                     // remove second rectangle
  72                     pRects->erase( pRects->begin() + nOtherPos );
  73
  74                     // continue at unmodified nOtherPos
  75                 }
  76                 else
  77                     ++nOtherPos;
  78             }
  79
  80             ++nComparePos;
  81         }
  82     }
  83 }
  84
  85 void ScInvertMerger::FlushTotal()
  86 {
  87     if( aTotalRect.IsEmpty() )
  88         return;                         // nothing to do
  89
  90     if ( pRects )
  91         pRects->push_back( aTotalRect );
  92
  93     aTotalRect.SetEmpty();
  94 }
  95
  96 void ScInvertMerger::FlushLine()
  97 {
  98     if( aLineRect.IsEmpty() )
  99         return;                         // nothing to do
 100
 101     if ( aTotalRect.IsEmpty() )
 102     {
 103         aTotalRect = aLineRect;         // start new total rect
 104     }
 105     else
 106     {
 107         if ( aLineRect.Left()  == aTotalRect.Left()  &&
 108              aLineRect.Right() == aTotalRect.Right() &&
 109              aLineRect.Top()   == aTotalRect.Bottom() + 1 )
 110         {
 111             // extend total rect
 112             aTotalRect.Bottom() = aLineRect.Bottom();
 113         }
 114         else
 115         {
 116             FlushTotal();                   // draw old total rect
 117             aTotalRect = aLineRect;         // and start new one
 118         }
 119     }
 120
 121     aLineRect.SetEmpty();
 122 }
 123
 124 void ScInvertMerger::AddRect( const Rectangle& rRect )
 125 {
 126     Rectangle aJustified = rRect;
 127     if ( rRect.Left() > rRect.Right() )     // switch for RTL layout
 128     {
 129         aJustified.Left() = rRect.Right();
 130         aJustified.Right() = rRect.Left();
 131     }
 132
 133     if ( aLineRect.IsEmpty() )
 134     {
 135         aLineRect = aJustified;             // start new line rect
 136     }
 137     else
 138     {
 139         bool bDone = false;
 140         if ( aJustified.Top()    == aLineRect.Top()    &&
 141              aJustified.Bottom() == aLineRect.Bottom() )
 142         {
 143             // try to extend line rect
 144             if ( aJustified.Left() == aLineRect.Right() + 1 )
 145             {
 146                 aLineRect.Right() = aJustified.Right();
 147                 bDone = true;
 148             }
 149             else if ( aJustified.Right() + 1 == aLineRect.Left() )  // for RTL layout
 150             {
 151                 aLineRect.Left() = aJustified.Left();
 152                 bDone = true;
 153             }
 154         }
 155         if (!bDone)
 156         {
 157             FlushLine();                // use old line rect for total rect
 158             aLineRect = aJustified;     // and start new one
 159         }
 160     }
 161 }
 162
 163 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */