editeng/source/outliner/paralist.cxx

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*************************************************************************
   3  *
   4  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   5  *
   6  * Copyright 2000, 2010 Oracle and/or its affiliates.
   7  *
   8  * OpenOffice.org - a multi-platform office productivity suite
   9  *
  10  * This file is part of OpenOffice.org.
  11  *
  12  * OpenOffice.org is free software: you can redistribute it and/or modify
  13  * it under the terms of the GNU Lesser General Public License version 3
  14  * only, as published by the Free Software Foundation.
  15  *
  16  * OpenOffice.org is distributed in the hope that it will be useful,
  17  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  18  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  19  * GNU Lesser General Public License version 3 for more details
  20  * (a copy is included in the LICENSE file that accompanied this code).
  21  *
  22  * You should have received a copy of the GNU Lesser General Public License
  23  * version 3 along with OpenOffice.org.  If not, see
  24  * <http://www.openoffice.org/license.html>
  25  * for a copy of the LGPLv3 License.
  26  *
  27  ************************************************************************/
  28
  29
  30 #include <paralist.hxx>
  31
  32 #include <editeng/outliner.hxx>  // only because of Paragraph, this must be changed!
  33 #include <editeng/numdef.hxx>
  34
  35 #include <osl/diagnose.h>
  36 #include <tools/debug.hxx>
  37
  38 DBG_NAME(Paragraph)
  39
  40 ParagraphData::ParagraphData()
  41 : nDepth( -1 )
  42 , mnNumberingStartValue( -1 )
  43 , mbParaIsNumberingRestart( sal_False )
  44 {
  45 }
  46
  47 ParagraphData::ParagraphData( const ParagraphData& r )
  48 : nDepth( r.nDepth )
  49 , mnNumberingStartValue( r.mnNumberingStartValue )
  50 , mbParaIsNumberingRestart( r.mbParaIsNumberingRestart )
  51 {
  52 }
  53
  54 ParagraphData& ParagraphData::operator=( const ParagraphData& r)
  55 {
  56     nDepth = r.nDepth;
  57     mnNumberingStartValue = r.mnNumberingStartValue;
  58     mbParaIsNumberingRestart = r.mbParaIsNumberingRestart;
  59     return *this;
  60 }
  61
  62 bool ParagraphData::operator==(const ParagraphData& rCandidate) const
  63 {
  64     return (nDepth == rCandidate.nDepth
  65         && mnNumberingStartValue == rCandidate.mnNumberingStartValue
  66         && mbParaIsNumberingRestart == rCandidate.mbParaIsNumberingRestart);
  67 }
  68
  69 Paragraph::Paragraph( sal_Int16 nDDepth )
  70 : aBulSize( -1, -1)
  71 {
  72     DBG_CTOR( Paragraph, 0 );
  73
  74     DBG_ASSERT(  ( nDDepth >= -1 ) && ( nDDepth < SVX_MAX_NUM ), "Paragraph-CTOR: nDepth invalid!" );
  75
  76     nDepth = nDDepth;
  77     nFlags = 0;
  78     bVisible = sal_True;
  79 }
  80
  81 Paragraph::Paragraph( const Paragraph& rPara )
  82 : ParagraphData( rPara )
  83 , aBulText( rPara.aBulText )
  84 , aBulSize( rPara.aBulSize )
  85 {
  86     DBG_CTOR( Paragraph, 0 );
  87
  88     nDepth = rPara.nDepth;
  89     nFlags = rPara.nFlags;
  90     bVisible = rPara.bVisible;
  91 }
  92
  93 Paragraph::Paragraph( const ParagraphData& rData )
  94 : nFlags( 0 )
  95 , aBulSize( -1, -1)
  96 , bVisible( sal_True )
  97 {
  98     DBG_CTOR( Paragraph, 0 );
  99
 100     nDepth = rData.nDepth;
 101     mnNumberingStartValue = rData.mnNumberingStartValue;
 102     mbParaIsNumberingRestart = rData.mbParaIsNumberingRestart;
 103 }
 104
 105 Paragraph::~Paragraph()
 106 {
 107     DBG_DTOR( Paragraph, 0 );
 108 }
 109
 110 void Paragraph::SetNumberingStartValue( sal_Int16 nNumberingStartValue )
 111 {
 112     mnNumberingStartValue = nNumberingStartValue;
 113     if( mnNumberingStartValue != -1 )
 114         mbParaIsNumberingRestart = true;
 115 }
 116
 117 void Paragraph::SetParaIsNumberingRestart( sal_Bool bParaIsNumberingRestart )
 118 {
 119     mbParaIsNumberingRestart = bParaIsNumberingRestart;
 120     if( !mbParaIsNumberingRestart )
 121         mnNumberingStartValue = -1;
 122 }
 123
 124 void ParagraphList::Clear( sal_Bool bDestroyParagraphs )
 125 {
 126     if ( bDestroyParagraphs )
 127     {
 128         std::vector<Paragraph*>::iterator iter;
 129         for (iter = maEntries.begin(); iter != maEntries.end(); ++iter)
 130             delete *iter;
 131     }
 132
 133     maEntries.clear();
 134 }
 135
 136 void ParagraphList::Append( Paragraph* pPara)
 137 {
 138     maEntries.push_back(pPara);
 139 }
 140
 141 void ParagraphList::Insert( Paragraph* pPara, sal_uLong nAbsPos)
 142 {
 143     OSL_ASSERT(nAbsPos != ULONG_MAX && nAbsPos <= maEntries.size());
 144
 145     maEntries.insert(maEntries.begin()+nAbsPos,pPara);
 146 }
 147
 148 void ParagraphList::Remove( sal_uLong nPara )
 149 {
 150     OSL_ASSERT(nPara < maEntries.size());
 151
 152     maEntries.erase(maEntries.begin() + nPara );
 153 }
 154
 155 void ParagraphList::MoveParagraphs( sal_uLong nStart, sal_uLong nDest, sal_uLong _nCount )
 156 {
 157     OSL_ASSERT(nStart < maEntries.size() && nDest < maEntries.size());
 158
 159     if ( ( nDest < nStart ) || ( nDest >= ( nStart + _nCount ) ) )
 160     {
 161         std::vector<Paragraph*> aParas;
 162         std::vector<Paragraph*>::iterator iterBeg = maEntries.begin() + nStart;
 163         std::vector<Paragraph*>::iterator iterEnd = iterBeg + _nCount;
 164
 165         std::copy(iterBeg,iterEnd,std::back_inserter(aParas));
 166
 167         maEntries.erase(iterBeg,iterEnd);
 168
 169         if ( nDest > nStart )
 170             nDest -= _nCount;
 171
 172         std::vector<Paragraph*>::iterator iterIns = maEntries.begin() + nDest;
 173
 174         std::copy(aParas.begin(),aParas.end(),std::inserter(maEntries,iterIns));
 175     }
 176     else
 177     {
 178         OSL_FAIL( "MoveParagraphs: Invalid Parameters" );
 179     }
 180 }
 181
 182 sal_Bool ParagraphList::HasChildren( Paragraph* pParagraph ) const
 183 {
 184     sal_uLong n = GetAbsPos( pParagraph );
 185     Paragraph* pNext = GetParagraph( ++n );
 186     return ( pNext && ( pNext->GetDepth() > pParagraph->GetDepth() ) ) ? sal_True : sal_False;
 187 }
 188
 189 sal_Bool ParagraphList::HasHiddenChildren( Paragraph* pParagraph ) const
 190 {
 191     sal_uLong n = GetAbsPos( pParagraph );
 192     Paragraph* pNext = GetParagraph( ++n );
 193     return ( pNext && ( pNext->GetDepth() > pParagraph->GetDepth() ) && !pNext->IsVisible() ) ? sal_True : sal_False;
 194 }
 195
 196 sal_Bool ParagraphList::HasVisibleChildren( Paragraph* pParagraph ) const
 197 {
 198     sal_uLong n = GetAbsPos( pParagraph );
 199     Paragraph* pNext = GetParagraph( ++n );
 200     return ( pNext && ( pNext->GetDepth() > pParagraph->GetDepth() ) && pNext->IsVisible() ) ? sal_True : sal_False;
 201 }
 202
 203 sal_uLong ParagraphList::GetChildCount( Paragraph* pParent ) const
 204 {
 205     sal_uLong nChildCount = 0;
 206     sal_uLong n = GetAbsPos( pParent );
 207     Paragraph* pPara = GetParagraph( ++n );
 208     while ( pPara && ( pPara->GetDepth() > pParent->GetDepth() ) )
 209     {
 210         nChildCount++;
 211         pPara = GetParagraph( ++n );
 212     }
 213     return nChildCount;
 214 }
 215
 216 Paragraph* ParagraphList::GetParent( Paragraph* pParagraph /*, sal_uInt16& rRelPos */ ) const
 217 {
 218     /* rRelPos = 0 */;
 219     sal_uLong n = GetAbsPos( pParagraph );
 220     Paragraph* pPrev = GetParagraph( --n );
 221     while ( pPrev && ( pPrev->GetDepth() >= pParagraph->GetDepth() ) )
 222     {
 223 //      if ( pPrev->GetDepth() == pParagraph->GetDepth() )
 224 //          rRelPos++;
 225         pPrev = GetParagraph( --n );
 226     }
 227
 228     return pPrev;
 229 }
 230
 231 void ParagraphList::Expand( Paragraph* pParent )
 232 {
 233     sal_uLong nChildCount = GetChildCount( pParent );
 234     sal_uLong nPos = GetAbsPos( pParent );
 235
 236     for ( sal_uLong n = 1; n <= nChildCount; n++  )
 237     {
 238         Paragraph* pPara = GetParagraph( nPos+n );
 239         if ( !( pPara->IsVisible() ) )
 240         {
 241             pPara->bVisible = sal_True;
 242             aVisibleStateChangedHdl.Call( pPara );
 243         }
 244     }
 245 }
 246
 247 void ParagraphList::Collapse( Paragraph* pParent )
 248 {
 249     sal_uLong nChildCount = GetChildCount( pParent );
 250     sal_uLong nPos = GetAbsPos( pParent );
 251
 252     for ( sal_uLong n = 1; n <= nChildCount; n++  )
 253     {
 254         Paragraph* pPara = GetParagraph( nPos+n );
 255         if ( pPara->IsVisible() )
 256         {
 257             pPara->bVisible = sal_False;
 258             aVisibleStateChangedHdl.Call( pPara );
 259         }
 260     }
 261 }
 262
 263 sal_uLong ParagraphList::GetAbsPos( Paragraph* pParent ) const
 264 {
 265     sal_uLong pos = 0;
 266     std::vector<Paragraph*>::const_iterator iter;
 267     for (iter = maEntries.begin(); iter != maEntries.end(); ++iter, ++pos)
 268     {
 269         if (*iter == pParent)
 270             return pos;
 271     }
 272
 273     return ~0;
 274 }
 275
 276 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */