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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright IBM Corporation 2009.
* Copyright 2009 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: dpglobal.cxx,v $
* $Revision: 1.0 $
*
* 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.
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_sc.hxx"
#include "dpglobal.hxx"
#include "document.hxx"
#include <stdio.h>
namespace ScDPGlobal
{
Rectangle operator *( const Rectangle &rLeft, const std::pair<double,double> & rRight )
{
Rectangle rcResult( rLeft );
rcResult.Bottom() = rcResult.Top() + static_cast<long>( rcResult.GetHeight() * rRight.second );
rcResult.Right() = rcResult.Left() + static_cast<long>( rcResult.GetWidth() * rRight.first);
return rcResult;
}
String GetFuncString( const String &rString, const USHORT nIndex )
{
if ( nIndex <= 1 ) return rString;
ULONG uch = rString.Len() ? rString.GetChar( rString.Len()-1 ) : (L'9'+1);
bool bEndWithDigital = ( L'0'<=uch && uch<=L'9');
char szTemp[__MAX_NUM_LEN+1];
int nLen = sprintf( szTemp, bEndWithDigital ? DATA_RENAME_SEPARATOR"%hu" : "%hu", nIndex );
String strRet = rString;
strRet.Append( String::CreateFromAscii( szTemp, static_cast<USHORT>(nLen) ));
return strRet;
}
bool ChkDPTableOverlap( ScDocument *pDestDoc, std::list<ScDPObject> & rClipboard, SCCOL nClipStartCol, SCROW nClipStartRow, SCCOL nStartCol, SCROW nStartRow, SCTAB nStartTab, USHORT nEndTab, BOOL bExcludeClip /*= FALSE*/ )
{
if ( ScDPCollection* pDPCollection = pDestDoc->GetDPCollection() )
{
USHORT nCount = pDPCollection->GetCount();
SCsCOL nOffsetX = nStartCol - nClipStartCol;
SCsROW nOffsetY = nStartRow - nClipStartRow;
for( std::list<ScDPObject>::iterator iter = rClipboard.begin(); iter!=rClipboard.end(); iter++ )
{
ScRange aRange = iter->GetOutRange();
for( USHORT nCurrTab = nStartTab; nCurrTab<=nEndTab; nCurrTab++ )
{
SCsTAB nOffsetZ = nCurrTab - aRange.aStart.Tab();
aRange.Move( nOffsetX, nOffsetY, nOffsetZ );
for ( USHORT i = 0; i<nCount; i++)
{
if ( (*pDPCollection)[i] && aRange.Intersects( (*pDPCollection)[i]->GetOutRange()))
{
if ( bExcludeClip && iter->GetOutRange() == (*pDPCollection)[i]->GetOutRange() )
{
continue;
}
return false;
}
}
}
}
}
return true;
}
//end
}
// --------------------------------------------------------------------
// ScDPItemDataPool
// Construct
ScDPItemDataPool::ScDPItemDataPool(void)
{
}
//
ScDPItemDataPool::ScDPItemDataPool(const ScDPItemDataPool& r):
maItems(r.maItems),
maItemIds(r.maItemIds)
{
}
ScDPItemDataPool::~ScDPItemDataPool(void)
{
}
const ScDPItemData* ScDPItemDataPool::getData( sal_Int32 nId )
{
if ( nId >= static_cast<sal_Int32>(maItems.size()) )
return NULL;
else
return &(maItems[nId]);
}
sal_Int32 ScDPItemDataPool::getDataId( const ScDPItemData& aData )
{
DataHash::const_iterator itr = maItemIds.find( aData),
itrEnd = maItemIds.end();
if ( itr == itrEnd )
// not exist
return -1;
else //exist
return itr->second;
}
sal_Int32 ScDPItemDataPool::insertData( const ScDPItemData& aData )
{
sal_Int32 nResult = getDataId( aData );
if( nResult < 0 )
{
maItemIds.insert( DataHash::value_type( aData, nResult = maItems.size() ) );
maItems.push_back( aData );
}
return nResult;
}
|
