sc/source/core/tool/collect.cxx

   1 /*************************************************************************
   2  *
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * Copyright 2008 by Sun Microsystems, Inc.
   6  *
   7  * OpenOffice.org - a multi-platform office productivity suite
   8  *
   9  * $RCSfile: collect.cxx,v $
  10  * $Revision: 1.14.32.3 $
  11  *
  12  * This file is part of OpenOffice.org.
  13  *
  14  * OpenOffice.org is free software: you can redistribute it and/or modify
  15  * it under the terms of the GNU Lesser General Public License version 3
  16  * only, as published by the Free Software Foundation.
  17  *
  18  * OpenOffice.org is distributed in the hope that it will be useful,
  19  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  20  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  21  * GNU Lesser General Public License version 3 for more details
  22  * (a copy is included in the LICENSE file that accompanied this code).
  23  *
  24  * You should have received a copy of the GNU Lesser General Public License
  25  * version 3 along with OpenOffice.org.  If not, see
  26  * <http://www.openoffice.org/license.html>
  27  * for a copy of the LGPLv3 License.
  28  *
  29  ************************************************************************/
  30
  31 // MARKER(update_precomp.py): autogen include statement, do not remove
  32 #include "precompiled_sc.hxx"
  33
  34
  35
  36 #include <string.h>
  37 #include <tools/stream.hxx>
  38 #include <unotools/transliterationwrapper.hxx>
  39
  40 #include "rechead.hxx"
  41 #include "collect.hxx"
  42 #include "document.hxx"                 // fuer TypedStrData Konstruktor
  43
  44 // -----------------------------------------------------------------------
  45
  46 ScDataObject::~ScDataObject()
  47 {
  48 }
  49
  50 //------------------------------------------------------------------------
  51 // Collection
  52 //------------------------------------------------------------------------
  53
  54 void lcl_DeleteScDataObjects( ScDataObject** p, USHORT nCount )
  55 {
  56     if ( p )
  57     {
  58         for (USHORT i = 0; i < nCount; i++) delete p[i];
  59         delete[] p;
  60         p = NULL;
  61     }
  62 }
  63
  64 ScCollection::ScCollection(USHORT nLim, USHORT nDel) :
  65     nCount ( 0 ),
  66     nLimit ( nLim ),
  67     nDelta ( nDel ),
  68     pItems ( NULL )
  69 {
  70     if (nDelta > MAXDELTA)
  71         nDelta = MAXDELTA;
  72     else if (nDelta == 0)
  73         nDelta = 1;
  74     if (nLimit > MAXCOLLECTIONSIZE)
  75         nLimit = MAXCOLLECTIONSIZE;
  76     else if (nLimit < nDelta)
  77         nLimit = nDelta;
  78     pItems = new ScDataObject*[nLimit];
  79 }
  80
  81 ScCollection::ScCollection(const ScCollection& rCollection)
  82     :   ScDataObject(),
  83         nCount ( 0 ),
  84         nLimit ( 0 ),
  85         nDelta ( 0 ),
  86         pItems ( NULL )
  87 {
  88     *this = rCollection;
  89 }
  90
  91 //------------------------------------------------------------------------
  92
  93 ScCollection::~ScCollection()
  94 {
  95     lcl_DeleteScDataObjects( pItems, nCount );
  96 }
  97
  98 //------------------------------------------------------------------------
  99 USHORT ScCollection::GetCount() const { return nCount; }
 100 void ScCollection::AtFree(USHORT nIndex)
 101 {
 102     if ((pItems) && (nIndex < nCount))
 103     {
 104         delete pItems[nIndex];
 105         --nCount;                               // before memmove
 106         memmove ( &pItems[nIndex], &pItems[nIndex + 1], (nCount - nIndex) * sizeof(ScDataObject*));
 107         pItems[nCount] = NULL;
 108     }
 109 }
 110
 111 //------------------------------------------------------------------------
 112
 113 void ScCollection::Free(ScDataObject* pScDataObject)
 114 {
 115     AtFree(IndexOf(pScDataObject));
 116 }
 117
 118 //------------------------------------------------------------------------
 119
 120 void ScCollection::FreeAll()
 121 {
 122     lcl_DeleteScDataObjects( pItems, nCount );
 123     nCount = 0;
 124     pItems = new ScDataObject*[nLimit];
 125 }
 126
 127 //------------------------------------------------------------------------
 128
 129 BOOL ScCollection::AtInsert(USHORT nIndex, ScDataObject* pScDataObject)
 130 {
 131     if ((nCount < MAXCOLLECTIONSIZE) && (nIndex <= nCount) && pItems)
 132     {
 133         if (nCount == nLimit)
 134         {
 135             ScDataObject** pNewItems = new ScDataObject*[nLimit + nDelta];
 136             if (!pNewItems)
 137                 return FALSE;
 138             nLimit = sal::static_int_cast<USHORT>( nLimit + nDelta );
 139             memmove(pNewItems, pItems, nCount * sizeof(ScDataObject*));
 140             delete[] pItems;
 141             pItems = pNewItems;
 142         }
 143         if (nCount > nIndex)
 144             memmove(&pItems[nIndex + 1], &pItems[nIndex], (nCount - nIndex) * sizeof(ScDataObject*));
 145         pItems[nIndex] = pScDataObject;
 146         nCount++;
 147         return TRUE;
 148     }
 149     return FALSE;
 150 }
 151
 152 //------------------------------------------------------------------------
 153
 154 BOOL ScCollection::Insert(ScDataObject* pScDataObject)
 155 {
 156     return AtInsert(nCount, pScDataObject);
 157 }
 158
 159 //------------------------------------------------------------------------
 160
 161 ScDataObject* ScCollection::At(USHORT nIndex) const
 162 {
 163     if (nIndex < nCount)
 164         return pItems[nIndex];
 165     else
 166         return NULL;
 167 }
 168
 169 //------------------------------------------------------------------------
 170
 171 USHORT ScCollection::IndexOf(ScDataObject* pScDataObject) const
 172 {
 173     USHORT nIndex = 0xffff;
 174     for (USHORT i = 0; ((i < nCount) && (nIndex == 0xffff)); i++)
 175     {
 176         if (pItems[i] == pScDataObject) nIndex = i;
 177     }
 178     return nIndex;
 179 }
 180
 181 //------------------------------------------------------------------------
 182
 183 ScCollection& ScCollection::operator=( const ScCollection& r )
 184 {
 185     lcl_DeleteScDataObjects( pItems, nCount );
 186
 187     nCount = r.nCount;
 188     nLimit = r.nLimit;
 189     nDelta = r.nDelta;
 190     pItems = new ScDataObject*[nLimit];
 191     for ( USHORT i=0; i<nCount; i++ )
 192         pItems[i] = r.pItems[i]->Clone();
 193
 194     return *this;
 195 }
 196
 197 //------------------------------------------------------------------------
 198
 199 ScDataObject*   ScCollection::Clone() const
 200 {
 201     return new ScCollection(*this);
 202 }
 203
 204 //------------------------------------------------------------------------
 205 // ScSortedCollection
 206 //------------------------------------------------------------------------
 207
 208 ScSortedCollection::ScSortedCollection(USHORT nLim, USHORT nDel, BOOL bDup) :
 209     ScCollection (nLim, nDel),
 210     bDuplicates ( bDup)
 211 {
 212 }
 213
 214 //------------------------------------------------------------------------
 215
 216 USHORT ScSortedCollection::IndexOf(ScDataObject* pScDataObject) const
 217 {
 218     USHORT nIndex;
 219     if (Search(pScDataObject, nIndex))
 220         return nIndex;
 221     else
 222         return 0xffff;
 223 }
 224
 225 //------------------------------------------------------------------------
 226
 227 BOOL ScSortedCollection::Search(ScDataObject* pScDataObject, USHORT& rIndex) const
 228 {
 229     rIndex = nCount;
 230     BOOL bFound = FALSE;
 231     short nLo = 0;
 232     short nHi = nCount - 1;
 233     short nIndex;
 234     short nCompare;
 235     while (nLo <= nHi)
 236     {
 237         nIndex = (nLo + nHi) / 2;
 238         nCompare = Compare(pItems[nIndex], pScDataObject);
 239         if (nCompare < 0)
 240             nLo = nIndex + 1;
 241         else
 242         {
 243             nHi = nIndex - 1;
 244             if (nCompare == 0)
 245             {
 246                 bFound = TRUE;
 247                 nLo = nIndex;
 248             }
 249         }
 250     }
 251     rIndex = nLo;
 252     return bFound;
 253 }
 254
 255 //------------------------------------------------------------------------
 256
 257 BOOL ScSortedCollection::Insert(ScDataObject* pScDataObject)
 258 {
 259     USHORT nIndex;
 260     BOOL bFound = Search(pScDataObject, nIndex);
 261     if (bFound)
 262     {
 263         if (bDuplicates)
 264             return AtInsert(nIndex, pScDataObject);
 265         else
 266             return FALSE;
 267     }
 268     else
 269         return AtInsert(nIndex, pScDataObject);
 270 }
 271
 272 //------------------------------------------------------------------------
 273
 274 BOOL ScSortedCollection::InsertPos(ScDataObject* pScDataObject, USHORT& nIndex)
 275 {
 276     BOOL bFound = Search(pScDataObject, nIndex);
 277     if (bFound)
 278     {
 279         if (bDuplicates)
 280             return AtInsert(nIndex, pScDataObject);
 281         else
 282             return FALSE;
 283     }
 284     else
 285         return AtInsert(nIndex, pScDataObject);
 286 }
 287
 288 //------------------------------------------------------------------------
 289
 290 BOOL ScSortedCollection::operator==(const ScSortedCollection& rCmp) const
 291 {
 292     if ( nCount != rCmp.nCount )
 293         return FALSE;
 294     for (USHORT i=0; i<nCount; i++)
 295         if ( !IsEqual(pItems[i],rCmp.pItems[i]) )
 296             return FALSE;
 297     return TRUE;
 298 }
 299
 300 //------------------------------------------------------------------------
 301
 302 //      IsEqual - komplette Inhalte vergleichen
 303
 304 BOOL ScSortedCollection::IsEqual(ScDataObject* pKey1, ScDataObject* pKey2) const
 305 {
 306     return ( Compare(pKey1, pKey2) == 0 );              // Default: nur Index vergleichen
 307 }
 308
 309 //------------------------------------------------------------------------
 310
 311 ScDataObject*   StrData::Clone() const
 312 {
 313     return new StrData(*this);
 314 }
 315
 316 //------------------------------------------------------------------------
 317
 318 short ScStrCollection::Compare(ScDataObject* pKey1, ScDataObject* pKey2) const
 319 {
 320     StringCompare eComp = ((StrData*)pKey1)->aStr.CompareTo(((StrData*)pKey2)->aStr);
 321     if (eComp == COMPARE_EQUAL)
 322         return 0;
 323     else if (eComp == COMPARE_LESS)
 324         return -1;
 325     else
 326         return 1;
 327 }
 328
 329 //------------------------------------------------------------------------
 330
 331 ScDataObject*   ScStrCollection::Clone() const
 332 {
 333     return new ScStrCollection(*this);
 334 }
 335
 336 //------------------------------------------------------------------------
 337 // TypedScStrCollection
 338 //------------------------------------------------------------------------
 339
 340 //UNUSED2008-05  TypedStrData::TypedStrData( ScDocument* pDoc, SCCOL nCol, SCROW nRow, SCTAB nTab,
 341 //UNUSED2008-05                                  BOOL bAllStrings )
 342 //UNUSED2008-05  {
 343 //UNUSED2008-05      if ( pDoc->HasValueData( nCol, nRow, nTab ) )
 344 //UNUSED2008-05      {
 345 //UNUSED2008-05          pDoc->GetValue( nCol, nRow, nTab, nValue );
 346 //UNUSED2008-05          if (bAllStrings)
 347 //UNUSED2008-05              pDoc->GetString( nCol, nRow, nTab, aStrValue );
 348 //UNUSED2008-05          nStrType = 0;
 349 //UNUSED2008-05      }
 350 //UNUSED2008-05      else
 351 //UNUSED2008-05      {
 352 //UNUSED2008-05          pDoc->GetString( nCol, nRow, nTab, aStrValue );
 353 //UNUSED2008-05          nValue = 0.0;
 354 //UNUSED2008-05          nStrType = 1;       //! Typ uebergeben ?
 355 //UNUSED2008-05      }
 356 //UNUSED2008-05  }
 357
 358 ScDataObject*   TypedStrData::Clone() const
 359 {
 360     return new TypedStrData(*this);
 361 }
 362 TypedScStrCollection::~TypedScStrCollection()
 363 {}
 364 ScDataObject* TypedScStrCollection::Clone() const
 365 {
 366     return new TypedScStrCollection(*this);
 367 }
 368
 369 short TypedScStrCollection::Compare( ScDataObject* pKey1, ScDataObject* pKey2 ) const
 370 {
 371     short nResult = 0;
 372
 373     if ( pKey1 && pKey2 )
 374     {
 375         TypedStrData& rData1 = (TypedStrData&)*pKey1;
 376         TypedStrData& rData2 = (TypedStrData&)*pKey2;
 377
 378         if ( rData1.nStrType > rData2.nStrType )
 379             nResult = 1;
 380         else if ( rData1.nStrType < rData2.nStrType )
 381             nResult = -1;
 382         else if ( !rData1.nStrType /* && !rData2.nStrType */ )
 383         {
 384             //--------------------
 385             // Zahlen vergleichen:
 386             //--------------------
 387             if ( rData1.nValue == rData2.nValue )
 388                 nResult = 0;
 389             else if ( rData1.nValue < rData2.nValue )
 390                 nResult = -1;
 391             else
 392                 nResult = 1;
 393         }
 394         else /* if ( rData1.nStrType && rData2.nStrType ) */
 395         {
 396             //---------------------
 397             // Strings vergleichen:
 398             //---------------------
 399             if ( bCaseSensitive )
 400                 nResult = (short) ScGlobal::GetCaseTransliteration()->compareString(
 401                     rData1.aStrValue, rData2.aStrValue );
 402             else
 403                 nResult = (short) ScGlobal::GetpTransliteration()->compareString(
 404                     rData1.aStrValue, rData2.aStrValue );
 405         }
 406     }
 407
 408     return nResult;
 409 }
 410
 411 BOOL TypedScStrCollection::FindText( const String& rStart, String& rResult,
 412                                     USHORT& rPos, BOOL bBack ) const
 413 {
 414     //  Die Collection ist nach String-Vergleichen sortiert, darum muss hier
 415     //  alles durchsucht werden
 416
 417     BOOL bFound = FALSE;
 418
 419     String aOldResult;
 420     if ( rPos != SCPOS_INVALID && rPos < nCount )
 421     {
 422         TypedStrData* pData = (TypedStrData*) pItems[rPos];
 423         if (pData->nStrType)
 424             aOldResult = pData->aStrValue;
 425     }
 426
 427     if ( bBack )                                                                        // rueckwaerts
 428     {
 429         USHORT nStartPos = nCount;
 430         if ( rPos != SCPOS_INVALID )
 431             nStartPos = rPos;                                           // weitersuchen...
 432
 433         for ( USHORT i=nStartPos; i>0; )
 434         {
 435             --i;
 436             TypedStrData* pData = (TypedStrData*) pItems[i];
 437             if (pData->nStrType)
 438             {
 439                 if ( ScGlobal::GetpTransliteration()->isMatch( rStart, pData->aStrValue ) )
 440                 {
 441                     //  If the collection is case sensitive, it may contain several entries
 442                     //  that are equal when compared case-insensitive. They are skipped here.
 443                     if ( !bCaseSensitive || !aOldResult.Len() ||
 444                             !ScGlobal::GetpTransliteration()->isEqual(
 445                             pData->aStrValue, aOldResult ) )
 446                     {
 447                         rResult = pData->aStrValue;
 448                         rPos = i;
 449                         bFound = TRUE;
 450                         break;
 451                     }
 452                 }
 453             }
 454         }
 455     }
 456     else                                                                                        // vorwaerts
 457     {
 458         USHORT nStartPos = 0;
 459         if ( rPos != SCPOS_INVALID )
 460             nStartPos = rPos + 1;                                       // weitersuchen...
 461
 462         for ( USHORT i=nStartPos; i<nCount; i++ )
 463         {
 464             TypedStrData* pData = (TypedStrData*) pItems[i];
 465             if (pData->nStrType)
 466             {
 467                 if ( ScGlobal::GetpTransliteration()->isMatch( rStart, pData->aStrValue ) )
 468                 {
 469                     //  If the collection is case sensitive, it may contain several entries
 470                     //  that are equal when compared case-insensitive. They are skipped here.
 471                     if ( !bCaseSensitive || !aOldResult.Len() ||
 472                             !ScGlobal::GetpTransliteration()->isEqual(
 473                             pData->aStrValue, aOldResult ) )
 474                     {
 475                         rResult = pData->aStrValue;
 476                         rPos = i;
 477                         bFound = TRUE;
 478                         break;
 479                     }
 480                 }
 481             }
 482         }
 483     }
 484
 485     return bFound;
 486 }
 487
 488         // Gross-/Kleinschreibung anpassen
 489
 490 BOOL TypedScStrCollection::GetExactMatch( String& rString ) const
 491 {
 492     for (USHORT i=0; i<nCount; i++)
 493     {
 494         TypedStrData* pData = (TypedStrData*) pItems[i];
 495         if ( pData->nStrType && ScGlobal::GetpTransliteration()->isEqual(
 496                 pData->aStrValue, rString ) )
 497         {
 498             rString = pData->aStrValue;                                                 // String anpassen
 499             return TRUE;
 500         }
 501     }
 502
 503     return FALSE;
 504 }
 505
 506
 507