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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#ifndef INCLUDED_SC_SOURCE_FILTER_INC_NAMEBUFF_HXX
#define INCLUDED_SC_SOURCE_FILTER_INC_NAMEBUFF_HXX
#include <rtl/ustring.hxx>
#include <osl/diagnose.h>
#include "compiler.hxx"
#include "root.hxx"
#include "xiroot.hxx"
#include "rangenam.hxx"
#include "formulacell.hxx"
#include <boost/unordered_map.hpp>
#include <list>
class ScTokenArray;
class NameBuffer;
class StringHashEntry
{
private:
friend class NameBuffer;
OUString aString;
sal_uInt32 nHash;
static sal_uInt32 MakeHashCode( const OUString& );
public:
inline StringHashEntry( const OUString& );
inline StringHashEntry( void );
inline void operator =( const sal_Char* );
inline void operator =( const OUString& );
inline void operator =( const StringHashEntry& );
inline bool operator ==( const StringHashEntry& ) const;
};
inline StringHashEntry::StringHashEntry( void )
{
}
inline StringHashEntry::StringHashEntry( const OUString& r ) : aString( r )
{
nHash = MakeHashCode( r );
}
inline void StringHashEntry::operator =( const sal_Char* p )
{
aString = OUString(p, strlen(p), RTL_TEXTENCODING_ASCII_US);
nHash = MakeHashCode( aString );
}
inline void StringHashEntry::operator =( const OUString& r )
{
aString = r;
nHash = MakeHashCode( r );
}
inline void StringHashEntry::operator =( const StringHashEntry& r )
{
nHash = r.nHash;
aString = r.aString;
}
inline bool StringHashEntry::operator ==( const StringHashEntry& r ) const
{
return ( nHash == r.nHash && aString == r.aString );
}
class NameBuffer : public ExcRoot
{
private:
sal_uInt16 nBase; // Index-Base
std::vector<StringHashEntry*> maHashes;
public:
inline NameBuffer( RootData* );
inline NameBuffer( RootData*, sal_uInt16 nNewBase );
virtual ~NameBuffer();
inline const OUString* Get( sal_uInt16 nIndex ) const;
inline sal_uInt16 GetLastIndex() const;
inline void SetBase( sal_uInt16 nNewBase = 0 );
void operator <<( const OUString& rNewString );
};
inline NameBuffer::NameBuffer( RootData* p ) : ExcRoot( p )
{
nBase = 0;
}
inline NameBuffer::NameBuffer( RootData* p, sal_uInt16 nNewBase ) : ExcRoot( p )
{
nBase = nNewBase;
}
inline const OUString* NameBuffer::Get ( sal_uInt16 n ) const
{
if( n < nBase || n >= maHashes.size() )
return NULL;
return &(maHashes[n]->aString);
}
inline sal_uInt16 NameBuffer::GetLastIndex () const
{
int size = maHashes.size() + nBase;
OSL_ENSURE( size <= 0xFFFF, "*NameBuffer::GetLastIndex(): I'm sick and tired!" );
return static_cast<sal_uInt16>( size );
}
inline void NameBuffer::SetBase( sal_uInt16 nNewBase )
{
nBase = nNewBase;
}
/**
* Store and manage shared formula tokens.
*/
class SharedFormulaBuffer : public ExcRoot
{
typedef boost::unordered_map<ScAddress, ScTokenArray*, ScAddressHashFunctor> TokenArraysType;
TokenArraysType maTokenArrays;
public:
SharedFormulaBuffer( RootData* pRD );
virtual ~SharedFormulaBuffer();
void Clear();
void Store( const ScAddress& rPos, const ScTokenArray& rArray );
const ScTokenArray* Find( const ScAddress& rRefPos ) const;
};
class RangeNameBufferWK3
{
private:
struct Entry
{
StringHashEntry aStrHashEntry;
ScComplexRefData aScComplexRefDataRel;
OUString aScAbsName;
sal_uInt16 nAbsInd; // == 0 -> no Abs-Name yet!
sal_uInt16 nRelInd;
bool bSingleRef;
Entry( const OUString& rName, const OUString& rScName, const ScComplexRefData& rCRD )
: aStrHashEntry( rName )
, aScComplexRefDataRel( rCRD )
, aScAbsName( rScName )
, nAbsInd(0)
, nRelInd(0)
, bSingleRef(false)
{
aScAbsName = "_ABS";
}
};
LOTUS_ROOT* m_pLotRoot;
ScTokenArray* pScTokenArray;
sal_uInt16 nIntCount;
std::vector<Entry> maEntries;
public:
RangeNameBufferWK3(LOTUS_ROOT* pLotRoot);
virtual ~RangeNameBufferWK3();
void Add( const OUString& rName, const ScComplexRefData& rCRD );
inline void Add( const OUString& rName, const ScRange& aScRange );
bool FindRel( const OUString& rRef, sal_uInt16& rIndex );
bool FindAbs( const OUString& rRef, sal_uInt16& rIndex );
};
inline void RangeNameBufferWK3::Add( const OUString& rName, const ScRange& aScRange )
{
ScComplexRefData aCRD;
ScSingleRefData* pSRD;
pSRD = &aCRD.Ref1;
pSRD->InitAddress(aScRange.aStart);
pSRD->SetFlag3D(true);
pSRD = &aCRD.Ref2;
pSRD->InitAddress(aScRange.aEnd);
pSRD->SetFlag3D(true);
Add( rName, aCRD );
}
class ExtSheetBuffer : public ExcRoot
{
private:
struct Cont
{
OUString aFile;
OUString aTab;
sal_uInt16 nTabNum; // 0xFFFF -> not set yet
// 0xFFFE -> tried to set, but failed
// 0xFFFD -> should be in the same workbook, but not found
bool bSWB;
bool bLink;
Cont( const OUString& rFilePathAndName, const OUString& rTabName ) :
aFile( rFilePathAndName ),
aTab( rTabName )
{
nTabNum = 0xFFFF; // -> table not created yet
bSWB = bLink = false;
}
Cont( const OUString& rFilePathAndName, const OUString& rTabName,
const bool bSameWB ) :
aFile( rFilePathAndName ),
aTab( rTabName )
{
nTabNum = 0xFFFF; // -> table not created yet
bSWB = bSameWB;
bLink = false;
}
};
std::vector<Cont> maEntries;
public:
inline ExtSheetBuffer( RootData* );
sal_Int16 Add( const OUString& rFilePathAndName,
const OUString& rTabName, const bool bSameWorkbook = false );
bool GetScTabIndex( sal_uInt16 nExcSheetIndex, sal_uInt16& rIn_LastTab_Out_ScIndex );
bool IsLink( const sal_uInt16 nExcSheetIndex ) const;
bool GetLink( const sal_uInt16 nExcSheetIndex, OUString &rAppl, OUString &rDoc ) const;
void Reset( void );
};
inline ExtSheetBuffer::ExtSheetBuffer( RootData* p ) : ExcRoot( p )
{
}
struct ExtName
{
OUString aName;
sal_uInt32 nStorageId;
sal_uInt16 nFlags;
inline ExtName( const OUString& r, sal_uInt16 n ) : aName( r ), nStorageId( 0 ), nFlags( n ) {}
bool IsDDE( void ) const;
bool IsOLE( void ) const;
};
class ExtNameBuff : protected XclImpRoot
{
public:
explicit ExtNameBuff( const XclImpRoot& rRoot );
void AddDDE( const OUString& rName, sal_Int16 nRefIdx );
void AddOLE( const OUString& rName, sal_Int16 nRefIdx, sal_uInt32 nStorageId );
void AddName( const OUString& rName, sal_Int16 nRefIdx );
const ExtName* GetNameByIndex( sal_Int16 nRefIdx, sal_uInt16 nNameIdx ) const;
void Reset();
private:
typedef ::std::vector< ExtName > ExtNameVec;
typedef ::std::map< sal_Int16, ExtNameVec > ExtNameMap;
ExtNameMap maExtNames;
};
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|