1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
// INCLUDE ---------------------------------------------------------------
#include <tools/table.hxx>
#include "chartpos.hxx"
#include "document.hxx"
#include "rechead.hxx"
namespace
{
bool lcl_hasValueDataButNoDates( ScDocument* pDocument, SCCOL nCol, SCROW nRow, SCTAB nTab )
{
bool bReturn = false;
if (pDocument->HasValueData( nCol, nRow, nTab ))
{
//treat dates like text #i25706#
sal_uInt32 nNumberFormat = pDocument->GetNumberFormat( ScAddress( nCol, nRow, nTab ) );
short nType = pDocument->GetFormatTable()->GetType(nNumberFormat);
bool bIsDate = (nType & NUMBERFORMAT_DATE);
bReturn = !bIsDate;
}
return bReturn;
}
}
ScChartPositioner::ScChartPositioner( ScDocument* pDoc, SCTAB nTab,
SCCOL nStartColP, SCROW nStartRowP, SCCOL nEndColP, SCROW nEndRowP) :
pDocument( pDoc ),
pPositionMap( NULL ),
eGlue( SC_CHARTGLUE_NA ),
nStartCol(0),
nStartRow(0),
bColHeaders( false ),
bRowHeaders( false ),
bDummyUpperLeft( false )
{
SetRangeList( ScRange( nStartColP, nStartRowP, nTab, nEndColP, nEndRowP, nTab ) );
CheckColRowHeaders();
}
ScChartPositioner::ScChartPositioner( ScDocument* pDoc, const ScRangeListRef& rRangeList ) :
aRangeListRef( rRangeList ),
pDocument( pDoc ),
pPositionMap( NULL ),
eGlue( SC_CHARTGLUE_NA ),
nStartCol(0),
nStartRow(0),
bColHeaders( false ),
bRowHeaders( false ),
bDummyUpperLeft( false )
{
if ( aRangeListRef.Is() )
CheckColRowHeaders();
}
ScChartPositioner::ScChartPositioner( const ScChartPositioner& rPositioner ) :
aRangeListRef( rPositioner.aRangeListRef ),
pDocument(rPositioner.pDocument),
pPositionMap( NULL ),
eGlue(rPositioner.eGlue),
nStartCol(rPositioner.nStartCol),
nStartRow(rPositioner.nStartRow),
bColHeaders(rPositioner.bColHeaders),
bRowHeaders(rPositioner.bRowHeaders),
bDummyUpperLeft( rPositioner.bDummyUpperLeft )
{
}
ScChartPositioner::~ScChartPositioner()
{
delete pPositionMap;
}
sal_Bool ScChartPositioner::operator==(const ScChartPositioner& rCmp) const
{
return bColHeaders == rCmp.bColHeaders
&& bRowHeaders == rCmp.bRowHeaders
&& *aRangeListRef == *rCmp.aRangeListRef;
}
void ScChartPositioner::SetRangeList( const ScRange& rRange )
{
aRangeListRef = new ScRangeList;
aRangeListRef->Append( rRange );
InvalidateGlue();
}
void ScChartPositioner::GlueState()
{
if ( eGlue != SC_CHARTGLUE_NA )
return;
bDummyUpperLeft = false;
ScRange* pR;
if ( aRangeListRef->size() <= 1 )
{
if ( !aRangeListRef->empty() )
{
pR = aRangeListRef->front();
if ( pR->aStart.Tab() == pR->aEnd.Tab() )
eGlue = SC_CHARTGLUE_NONE;
else
eGlue = SC_CHARTGLUE_COLS; // mehrere Tabellen spaltenweise
nStartCol = pR->aStart.Col();
nStartRow = pR->aStart.Row();
}
else
{
InvalidateGlue();
nStartCol = 0;
nStartRow = 0;
}
return;
}
pR = aRangeListRef->front();
nStartCol = pR->aStart.Col();
nStartRow = pR->aStart.Row();
SCCOL nMaxCols, nEndCol;
SCROW nMaxRows, nEndRow;
nMaxCols = nEndCol = 0;
nMaxRows = nEndRow = 0;
for ( size_t i = 1, nRanges = aRangeListRef->size(); i <= nRanges; ++i ) // <= so 1 extra pass after last item
{ // umspannenden Bereich etc. feststellen
SCCOLROW nTmp, n1, n2;
if ( (n1 = pR->aStart.Col()) < nStartCol ) nStartCol = static_cast<SCCOL>(n1 );
if ( (n2 = pR->aEnd.Col() ) > nEndCol ) nEndCol = static_cast<SCCOL>(n2 );
if ( (nTmp = n2 - n1 + 1 ) > nMaxCols ) nMaxCols = static_cast<SCCOL>(nTmp);
if ( (n1 = pR->aStart.Row()) < nStartRow ) nStartRow = static_cast<SCROW>(n1 );
if ( (n2 = pR->aEnd.Row() ) > nEndRow ) nEndRow = static_cast<SCROW>(n2 );
if ( (nTmp = n2 - n1 + 1 ) > nMaxRows ) nMaxRows = static_cast<SCROW>(nTmp);
if ( i < nRanges ) // in last pass; i = nRanges so don't use at()
pR = (*aRangeListRef)[i];
}
SCCOL nC = nEndCol - nStartCol + 1;
if ( nC == 1 )
{
eGlue = SC_CHARTGLUE_ROWS;
return;
}
SCROW nR = nEndRow - nStartRow + 1;
if ( nR == 1 )
{
eGlue = SC_CHARTGLUE_COLS;
return;
}
sal_uLong nCR = (sal_uLong)nC * nR;
//2do:
/*
Erstmal simpel ohne Bitmaskiererei, maximal koennten so 8MB alloziert
werden (256 Cols mal 32000 Rows), das liesse sich mit 2 Bit je Eintrag
auf 2MB reduzieren, andererseits ist es so schneller.
Weitere Platz-Optimierung waere, in dem Array nur die wirklich benutzten
Zeilen/Spalten abzulegen, wuerde aber ein weiteres durchlaufen der
RangeList und indirekten Zugriff auf das Array bedeuten.
*/
const sal_uInt8 nHole = 0;
const sal_uInt8 nOccu = 1;
const sal_uInt8 nFree = 2;
const sal_uInt8 nGlue = 3;
sal_uInt8* p;
sal_uInt8* pA = new sal_uInt8[ nCR ];
memset( pA, 0, nCR * sizeof(sal_uInt8) );
SCCOL nCol, nCol1, nCol2;
SCROW nRow, nRow1, nRow2;
for ( size_t i = 0, nRanges = aRangeListRef->size(); i < nRanges; ++i )
{ // Selektionen 2D als belegt markieren
pR = (*aRangeListRef)[i];
nCol1 = pR->aStart.Col() - nStartCol;
nCol2 = pR->aEnd.Col() - nStartCol;
nRow1 = pR->aStart.Row() - nStartRow;
nRow2 = pR->aEnd.Row() - nStartRow;
for ( nCol = nCol1; nCol <= nCol2; nCol++ )
{
p = pA + (sal_uLong)nCol * nR + nRow1;
for ( nRow = nRow1; nRow <= nRow2; nRow++, p++ )
*p = nOccu;
}
}
sal_Bool bGlue = sal_True;
sal_Bool bGlueCols = false;
for ( nCol = 0; bGlue && nCol < nC; nCol++ )
{ // Spalten probieren durchzugehen und als frei markieren
p = pA + (sal_uLong)nCol * nR;
for ( nRow = 0; bGlue && nRow < nR; nRow++, p++ )
{
if ( *p == nOccu )
{ // Wenn einer mittendrin liegt ist keine Zusammenfassung
// moeglich. Am Rand koennte ok sein, wenn in dieser Spalte
// in jeder belegten Zeile einer belegt ist.
if ( nRow > 0 && nCol > 0 )
bGlue = false; // nCol==0 kann DummyUpperLeft sein
else
nRow = nR;
}
else
*p = nFree;
}
if ( bGlue && *(p = (pA + ((((sal_uLong)nCol+1) * nR) - 1))) == nFree )
{ // Spalte als komplett frei markieren
*p = nGlue;
bGlueCols = sal_True; // mindestens eine freie Spalte
}
}
sal_Bool bGlueRows = false;
for ( nRow = 0; bGlue && nRow < nR; nRow++ )
{ // Zeilen probieren durchzugehen und als frei markieren
p = pA + nRow;
for ( nCol = 0; bGlue && nCol < nC; nCol++, p+=nR )
{
if ( *p == nOccu )
{
if ( nCol > 0 && nRow > 0 )
bGlue = false; // nRow==0 kann DummyUpperLeft sein
else
nCol = nC;
}
else
*p = nFree;
}
if ( bGlue && *(p = (pA + ((((sal_uLong)nC-1) * nR) + nRow))) == nFree )
{ // Zeile als komplett frei markieren
*p = nGlue;
bGlueRows = sal_True; // mindestens eine freie Zeile
}
}
// n=1: die linke obere Ecke koennte bei Beschriftung automagisch
// hinzugezogen werden
p = pA + 1;
for ( sal_uLong n = 1; bGlue && n < nCR; n++, p++ )
{ // ein unberuehrtes Feld heisst, dass es weder spaltenweise noch
// zeilenweise zu erreichen war, also nichts zusamenzufassen
if ( *p == nHole )
bGlue = false;
}
if ( bGlue )
{
if ( bGlueCols && bGlueRows )
eGlue = SC_CHARTGLUE_BOTH;
else if ( bGlueRows )
eGlue = SC_CHARTGLUE_ROWS;
else
eGlue = SC_CHARTGLUE_COLS;
if ( *pA != nOccu )
bDummyUpperLeft = sal_True;
}
else
{
eGlue = SC_CHARTGLUE_NONE;
}
delete [] pA;
}
void ScChartPositioner::CheckColRowHeaders()
{
SCCOL nCol1, nCol2, iCol;
SCROW nRow1, nRow2, iRow;
SCTAB nTab1, nTab2;
sal_Bool bColStrings = sal_True;
sal_Bool bRowStrings = sal_True;
GlueState();
if ( aRangeListRef->size() == 1 )
{
aRangeListRef->front()->GetVars( nCol1, nRow1, nTab1, nCol2, nRow2, nTab2 );
if ( nCol1 > nCol2 || nRow1 > nRow2 )
bColStrings = bRowStrings = false;
else
{
for (iCol=nCol1; iCol<=nCol2 && bColStrings; iCol++)
{
if (lcl_hasValueDataButNoDates( pDocument, iCol, nRow1, nTab1 ))
bColStrings = false;
}
for (iRow=nRow1; iRow<=nRow2 && bRowStrings; iRow++)
{
if (lcl_hasValueDataButNoDates( pDocument, nCol1, iRow, nTab1 ))
bRowStrings = false;
}
}
}
else
{
sal_Bool bVert = (eGlue == SC_CHARTGLUE_NONE || eGlue == SC_CHARTGLUE_ROWS);
for ( size_t i = 0, nRanges = aRangeListRef->size();
(i < nRanges) && (bColStrings || bRowStrings);
++i
)
{
ScRange* pR = (*aRangeListRef)[i];
pR->GetVars( nCol1, nRow1, nTab1, nCol2, nRow2, nTab2 );
sal_Bool bTopRow = (nRow1 == nStartRow);
if ( bRowStrings && (bVert || nCol1 == nStartCol) )
{ // NONE oder ROWS: RowStrings in jeder Selektion moeglich
// COLS oder BOTH: nur aus der ersten Spalte
if ( nCol1 <= nCol2 )
for (iRow=nRow1; iRow<=nRow2 && bRowStrings; iRow++)
{
if (lcl_hasValueDataButNoDates( pDocument, nCol1, iRow, nTab1 ))
bRowStrings = false;
}
}
if ( bColStrings && bTopRow )
{ // ColStrings nur aus der ersten Zeile
if ( nRow1 <= nRow2 )
for (iCol=nCol1; iCol<=nCol2 && bColStrings; iCol++)
{
if (lcl_hasValueDataButNoDates( pDocument, iCol, nRow1, nTab1 ))
bColStrings = false;
}
}
}
}
bColHeaders = bColStrings;
bRowHeaders = bRowStrings;
}
const ScChartPositionMap* ScChartPositioner::GetPositionMap()
{
CreatePositionMap();
return pPositionMap;
}
void ScChartPositioner::CreatePositionMap()
{
if ( eGlue == SC_CHARTGLUE_NA && pPositionMap )
{
delete pPositionMap;
pPositionMap = NULL;
}
if ( pPositionMap )
return ;
SCSIZE nColAdd = bRowHeaders ? 1 : 0;
SCSIZE nRowAdd = bColHeaders ? 1 : 0;
SCCOL nCol, nCol1, nCol2;
SCROW nRow, nRow1, nRow2;
SCTAB nTab, nTab1, nTab2;
//
// wirkliche Groesse (ohne versteckte Zeilen/Spalten)
//
SCSIZE nColCount = 0;
SCSIZE nRowCount = 0;
GlueState();
sal_Bool bNoGlue = (eGlue == SC_CHARTGLUE_NONE);
Table* pCols = new Table;
Table* pNewRowTable = new Table;
ScAddress* pNewAddress = new ScAddress;
Table* pCol;
ScAddress* pPos;
SCROW nNoGlueRow = 0;
for ( size_t i = 0, nRanges = aRangeListRef->size(); i < nRanges; ++i )
{
ScRange* pR = (*aRangeListRef)[i];
pR->GetVars( nCol1, nRow1, nTab1, nCol2, nRow2, nTab2 );
for ( nTab = nTab1; nTab <= nTab2; nTab++ )
{
// nTab im ColKey, um gleiche Col/Row in anderer Table haben zu koennen
sal_uLong nInsCol = (static_cast<sal_uLong>(nTab) << 16) | (bNoGlue ? 0 :
static_cast<sal_uLong>(nCol1));
for ( nCol = nCol1; nCol <= nCol2; ++nCol, ++nInsCol )
{
if ( bNoGlue || eGlue == SC_CHARTGLUE_ROWS )
{ // meistens gleiche Cols
if ( (pCol = (Table*) pCols->Get( nInsCol ))==NULL )
{
pCols->Insert( nInsCol, pNewRowTable );
pCol = pNewRowTable;
pNewRowTable = new Table;
}
}
else
{ // meistens neue Cols
if ( pCols->Insert( nInsCol, pNewRowTable ) )
{
pCol = pNewRowTable;
pNewRowTable = new Table;
}
else
pCol = (Table*) pCols->Get( nInsCol );
}
// bei anderer Tabelle wurde bereits neuer ColKey erzeugt,
// die Zeilen muessen fuer's Dummy fuellen gleich sein!
sal_uLong nInsRow = (bNoGlue ? nNoGlueRow : nRow1);
for ( nRow = nRow1; nRow <= nRow2; nRow++, nInsRow++ )
{
if ( pCol->Insert( nInsRow, pNewAddress ) )
{
pNewAddress->Set( nCol, nRow, nTab );
pNewAddress = new ScAddress;
}
}
}
}
// bei NoGlue werden zusammengehoerige Tabellen als ColGlue dargestellt
nNoGlueRow += nRow2 - nRow1 + 1;
}
delete pNewAddress;
delete pNewRowTable;
// Anzahl der Daten
nColCount = static_cast< SCSIZE >( pCols->Count());
if ( (pCol = (Table*) pCols->First())!=NULL )
{
if ( bDummyUpperLeft )
pCol->Insert( 0, (void*)0 ); // Dummy fuer Beschriftung
nRowCount = static_cast< SCSIZE >( pCol->Count());
}
else
nRowCount = 0;
if ( nColCount > 0 )
nColCount -= nColAdd;
if ( nRowCount > 0 )
nRowCount -= nRowAdd;
if ( nColCount==0 || nRowCount==0 )
{ // einen Eintrag ohne Daten erzeugen
if ( pCols->Count() > 0 )
pCol = (Table*) pCols->First();
else
{
pCol = new Table;
pCols->Insert( 0, pCol );
}
nColCount = 1;
if ( pCol->Count() > 0 )
{ // kann ja eigentlich nicht sein, wenn nColCount==0 || nRowCount==0
pPos = (ScAddress*) pCol->First();
if ( pPos )
{
delete pPos;
pCol->Replace( pCol->GetCurKey(), (void*)0 );
}
}
else
pCol->Insert( 0, (void*)0 );
nRowCount = 1;
nColAdd = 0;
nRowAdd = 0;
}
else
{
if ( bNoGlue )
{ // Luecken mit Dummies fuellen, erste Spalte ist Master
Table* pFirstCol = (Table*) pCols->First();
sal_uLong nCount = pFirstCol->Count();
pFirstCol->First();
for ( sal_uLong n = 0; n < nCount; n++, pFirstCol->Next() )
{
sal_uLong nKey = pFirstCol->GetCurKey();
pCols->First();
while ( (pCol = (Table*) pCols->Next())!=NULL )
pCol->Insert( nKey, (void*)0 ); // keine Daten
}
}
}
pPositionMap = new ScChartPositionMap( static_cast<SCCOL>(nColCount), static_cast<SCROW>(nRowCount),
static_cast<SCCOL>(nColAdd), static_cast<SCROW>(nRowAdd), *pCols );
// Aufraeumen
for ( pCol = (Table*) pCols->First(); pCol; pCol = (Table*) pCols->Next() )
{ //! nur Tables loeschen, nicht die ScAddress*
delete pCol;
}
delete pCols;
}
ScChartPositionMap::ScChartPositionMap( SCCOL nChartCols, SCROW nChartRows,
SCCOL nColAdd, SCROW nRowAdd, Table& rCols ) :
ppData( new ScAddress* [ nChartCols * nChartRows ] ),
ppColHeader( new ScAddress* [ nChartCols ] ),
ppRowHeader( new ScAddress* [ nChartRows ] ),
nCount( (sal_uLong) nChartCols * nChartRows ),
nColCount( nChartCols ),
nRowCount( nChartRows )
{
OSL_ENSURE( nColCount && nRowCount, "ScChartPositionMap without dimension" );
ScAddress* pPos;
SCCOL nCol;
SCROW nRow;
Table* pCol = (Table*) rCols.First();
// Zeilen-Header
pPos = (ScAddress*) pCol->First();
if ( nRowAdd )
pPos = (ScAddress*) pCol->Next();
if ( nColAdd )
{ // eigenstaendig
for ( nRow = 0; nRow < nRowCount; nRow++ )
{
ppRowHeader[ nRow ] = pPos;
pPos = (ScAddress*) pCol->Next();
}
}
else
{ // Kopie
for ( nRow = 0; nRow < nRowCount; nRow++ )
{
ppRowHeader[ nRow ] = ( pPos ? new ScAddress( *pPos ) : NULL );
pPos = (ScAddress*) pCol->Next();
}
}
if ( nColAdd )
pCol = (Table*) rCols.Next();
// Daten spaltenweise und Spalten-Header
sal_uLong nIndex = 0;
for ( nCol = 0; nCol < nColCount; nCol++ )
{
if ( pCol )
{
pPos = (ScAddress*) pCol->First();
if ( nRowAdd )
{
ppColHeader[ nCol ] = pPos; // eigenstaendig
pPos = (ScAddress*) pCol->Next();
}
else
ppColHeader[ nCol ] = ( pPos ? new ScAddress( *pPos ) : NULL );
for ( nRow = 0; nRow < nRowCount; nRow++, nIndex++ )
{
ppData[ nIndex ] = pPos;
pPos = (ScAddress*) pCol->Next();
}
}
else
{
ppColHeader[ nCol ] = NULL;
for ( nRow = 0; nRow < nRowCount; nRow++, nIndex++ )
{
ppData[ nIndex ] = NULL;
}
}
pCol = (Table*) rCols.Next();
}
}
ScChartPositionMap::~ScChartPositionMap()
{
for ( sal_uLong nIndex=0; nIndex < nCount; nIndex++ )
{
delete ppData[nIndex];
}
delete [] ppData;
SCCOL j;
for ( j=0; j < nColCount; j++ )
{
delete ppColHeader[j];
}
delete [] ppColHeader;
SCROW i;
for ( i=0; i < nRowCount; i++ )
{
delete ppRowHeader[i];
}
delete [] ppRowHeader;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|