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
|
/* -*- 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_INC_LOOKUPCACHE_HXX
#define INCLUDED_SC_INC_LOOKUPCACHE_HXX
#include "address.hxx"
#include "global.hxx"
#include <formula/token.hxx>
#include <svl/listener.hxx>
#include <unordered_map>
class ScDocument;
struct ScQueryEntry;
/** Lookup cache for one range used with interpreter functions such as VLOOKUP
and MATCH. Caches query for a specific row and the resulting address looked
up, in case other lookups of the same query in the same row are to be
performed, which usually occur to obtain a different offset column of the
same query.
*/
class ScLookupCache : public SvtListener
{
public:
enum Result
{
NOT_CACHED, /// Query not found in cache.
CRITERIA_DIFFERENT, /// Different criteria for same query position exists.
NOT_AVAILABLE, /// Criteria not available in lookup range.
FOUND /// Criteria found.
};
enum QueryOp
{
UNKNOWN,
EQUAL,
LESS_EQUAL,
GREATER_EQUAL
};
class QueryCriteria
{
union
{
double mfVal;
const OUString *mpStr;
};
bool mbAlloc;
bool mbString;
QueryOp meOp;
void deleteString()
{
if (mbAlloc && mbString)
delete mpStr;
}
QueryCriteria & operator=( const QueryCriteria & r ) = delete;
public:
explicit QueryCriteria( const ScQueryEntry & rEntry );
QueryCriteria( const QueryCriteria & r );
~QueryCriteria();
QueryOp getQueryOp() const { return meOp; }
void setDouble( double fVal )
{
deleteString();
mbAlloc = mbString = false;
mfVal = fVal;
}
void setString( const OUString & rStr )
{
deleteString();
mbAlloc = mbString = true;
mpStr = new OUString( rStr);
}
bool operator==( const QueryCriteria & r ) const
{
return meOp == r.meOp && mbString == r.mbString &&
(mbString ? (*mpStr == *r.mpStr) : (mfVal == r.mfVal));
}
};
/// MUST be new'd because Notify() deletes.
ScLookupCache( ScDocument * pDoc, const ScRange & rRange );
virtual ~ScLookupCache() override;
/// Remove from document structure and delete (!) cache on modify hint.
virtual void Notify( const SfxHint& rHint ) override;
/// @returns document address in o_rAddress if Result==FOUND
Result lookup( ScAddress & o_rResultAddress,
const QueryCriteria & rCriteria,
const ScAddress & rQueryAddress ) const;
/** Insert query and result.
@param bAvailable
Pass sal_False if the search didn't deliver a result. A subsequent
lookup() then will return Result::NOT_AVAILABLE.
@returns successful insertion.
*/
bool insert( const ScAddress & rResultAddress,
const QueryCriteria & rCriteria,
const ScAddress & rQueryAddress,
const bool bAvailable );
inline const ScRange& getRange() const { return maRange; }
struct Hash
{
size_t operator()( const ScRange & rRange ) const
{
// Lookups are performed on the first column.
return rRange.hashStartColumn();
}
};
private:
struct QueryKey
{
SCROW mnRow;
SCTAB mnTab;
QueryOp meOp;
QueryKey( const ScAddress & rAddress, const QueryOp eOp ) :
mnRow( rAddress.Row()),
mnTab( rAddress.Tab()),
meOp( eOp)
{
}
bool operator==( const QueryKey & r ) const
{
return mnRow == r.mnRow && mnTab == r.mnTab && meOp == r.meOp && meOp != UNKNOWN;
}
struct Hash
{
size_t operator()( const QueryKey & r ) const
{
return (static_cast<size_t>(r.mnTab) << 24) ^
(static_cast<size_t>(r.meOp) << 22) ^
static_cast<size_t>(r.mnRow);
}
};
};
struct QueryCriteriaAndResult
{
QueryCriteria maCriteria;
ScAddress maAddress;
QueryCriteriaAndResult( const QueryCriteria & rCriteria, const ScAddress & rAddress ) :
maCriteria( rCriteria),
maAddress( rAddress)
{
}
~QueryCriteriaAndResult()
{
}
};
typedef std::unordered_map< QueryKey, QueryCriteriaAndResult, QueryKey::Hash > QueryMap;
QueryMap maQueryMap;
ScRange maRange;
ScDocument * mpDoc;
ScLookupCache( const ScLookupCache & ) = delete;
ScLookupCache & operator=( const ScLookupCache & ) = delete;
};
typedef std::unordered_map< ScRange, ScLookupCache*, ScLookupCache::Hash > ScLookupCacheMap;
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
