1*b1cdbd2cSJim Jagielski /**************************************************************
2*b1cdbd2cSJim Jagielski *
3*b1cdbd2cSJim Jagielski * Licensed to the Apache Software Foundation (ASF) under one
4*b1cdbd2cSJim Jagielski * or more contributor license agreements. See the NOTICE file
5*b1cdbd2cSJim Jagielski * distributed with this work for additional information
6*b1cdbd2cSJim Jagielski * regarding copyright ownership. The ASF licenses this file
7*b1cdbd2cSJim Jagielski * to you under the Apache License, Version 2.0 (the
8*b1cdbd2cSJim Jagielski * "License"); you may not use this file except in compliance
9*b1cdbd2cSJim Jagielski * with the License. You may obtain a copy of the License at
10*b1cdbd2cSJim Jagielski *
11*b1cdbd2cSJim Jagielski * http://www.apache.org/licenses/LICENSE-2.0
12*b1cdbd2cSJim Jagielski *
13*b1cdbd2cSJim Jagielski * Unless required by applicable law or agreed to in writing,
14*b1cdbd2cSJim Jagielski * software distributed under the License is distributed on an
15*b1cdbd2cSJim Jagielski * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
16*b1cdbd2cSJim Jagielski * KIND, either express or implied. See the License for the
17*b1cdbd2cSJim Jagielski * specific language governing permissions and limitations
18*b1cdbd2cSJim Jagielski * under the License.
19*b1cdbd2cSJim Jagielski *
20*b1cdbd2cSJim Jagielski *************************************************************/
21*b1cdbd2cSJim Jagielski
22*b1cdbd2cSJim Jagielski
23*b1cdbd2cSJim Jagielski
24*b1cdbd2cSJim Jagielski // MARKER(update_precomp.py): autogen include statement, do not remove
25*b1cdbd2cSJim Jagielski #include "precompiled_sc.hxx"
26*b1cdbd2cSJim Jagielski
27*b1cdbd2cSJim Jagielski #include "lookupcache.hxx"
28*b1cdbd2cSJim Jagielski #include "document.hxx"
29*b1cdbd2cSJim Jagielski
30*b1cdbd2cSJim Jagielski #ifdef erDEBUG
31*b1cdbd2cSJim Jagielski #include <cstdio>
32*b1cdbd2cSJim Jagielski using ::std::fprintf;
33*b1cdbd2cSJim Jagielski static long nCacheCount = 0;
34*b1cdbd2cSJim Jagielski #endif
35*b1cdbd2cSJim Jagielski
36*b1cdbd2cSJim Jagielski
ScLookupCache(ScDocument * pDoc,const ScRange & rRange)37*b1cdbd2cSJim Jagielski ScLookupCache::ScLookupCache( ScDocument * pDoc, const ScRange & rRange ) :
38*b1cdbd2cSJim Jagielski maRange( rRange),
39*b1cdbd2cSJim Jagielski mpDoc( pDoc)
40*b1cdbd2cSJim Jagielski {
41*b1cdbd2cSJim Jagielski #ifdef erDEBUG
42*b1cdbd2cSJim Jagielski ++nCacheCount;
43*b1cdbd2cSJim Jagielski fprintf( stderr, "\nctor ScLookupCache %ld: %d, %d, %d, %d, %d, %d; buckets: %lu, size: %lu\n",
44*b1cdbd2cSJim Jagielski nCacheCount,
45*b1cdbd2cSJim Jagielski (int)getRange().aStart.Col(), (int)getRange().aStart.Row(),
46*b1cdbd2cSJim Jagielski (int)getRange().aStart.Tab(), (int)getRange().aEnd.Col(),
47*b1cdbd2cSJim Jagielski (int)getRange().aEnd.Row(), (int)getRange().aEnd.Tab(),
48*b1cdbd2cSJim Jagielski (unsigned long)maQueryMap.bucket_count(), (unsigned long)maQueryMap.size());
49*b1cdbd2cSJim Jagielski #endif
50*b1cdbd2cSJim Jagielski }
51*b1cdbd2cSJim Jagielski
52*b1cdbd2cSJim Jagielski
~ScLookupCache()53*b1cdbd2cSJim Jagielski ScLookupCache::~ScLookupCache()
54*b1cdbd2cSJim Jagielski {
55*b1cdbd2cSJim Jagielski #ifdef erDEBUG
56*b1cdbd2cSJim Jagielski fprintf( stderr, "\ndtor ScLookupCache %ld: %d, %d, %d, %d, %d, %d; buckets: %lu, size: %lu\n",
57*b1cdbd2cSJim Jagielski nCacheCount,
58*b1cdbd2cSJim Jagielski (int)getRange().aStart.Col(), (int)getRange().aStart.Row(),
59*b1cdbd2cSJim Jagielski (int)getRange().aStart.Tab(), (int)getRange().aEnd.Col(),
60*b1cdbd2cSJim Jagielski (int)getRange().aEnd.Row(), (int)getRange().aEnd.Tab(),
61*b1cdbd2cSJim Jagielski (unsigned long)maQueryMap.bucket_count(), (unsigned long)maQueryMap.size());
62*b1cdbd2cSJim Jagielski --nCacheCount;
63*b1cdbd2cSJim Jagielski #endif
64*b1cdbd2cSJim Jagielski }
65*b1cdbd2cSJim Jagielski
66*b1cdbd2cSJim Jagielski
lookup(ScAddress & o_rResultAddress,const QueryCriteria & rCriteria,const ScAddress & rQueryAddress) const67*b1cdbd2cSJim Jagielski ScLookupCache::Result ScLookupCache::lookup( ScAddress & o_rResultAddress,
68*b1cdbd2cSJim Jagielski const QueryCriteria & rCriteria, const ScAddress & rQueryAddress ) const
69*b1cdbd2cSJim Jagielski {
70*b1cdbd2cSJim Jagielski QueryMap::const_iterator it( maQueryMap.find( QueryKey( rQueryAddress,
71*b1cdbd2cSJim Jagielski rCriteria.getQueryOp())));
72*b1cdbd2cSJim Jagielski if (it == maQueryMap.end())
73*b1cdbd2cSJim Jagielski return NOT_CACHED;
74*b1cdbd2cSJim Jagielski const QueryCriteriaAndResult& rResult = (*it).second;
75*b1cdbd2cSJim Jagielski if (!(rResult.maCriteria == rCriteria))
76*b1cdbd2cSJim Jagielski return CRITERIA_DIFFERENT;
77*b1cdbd2cSJim Jagielski if (rResult.maAddress.Row() < 0 )
78*b1cdbd2cSJim Jagielski return NOT_AVAILABLE;
79*b1cdbd2cSJim Jagielski o_rResultAddress = rResult.maAddress;
80*b1cdbd2cSJim Jagielski return FOUND;
81*b1cdbd2cSJim Jagielski }
82*b1cdbd2cSJim Jagielski
83*b1cdbd2cSJim Jagielski
insert(const ScAddress & rResultAddress,const QueryCriteria & rCriteria,const ScAddress & rQueryAddress,const bool bAvailable)84*b1cdbd2cSJim Jagielski bool ScLookupCache::insert( const ScAddress & rResultAddress,
85*b1cdbd2cSJim Jagielski const QueryCriteria & rCriteria, const ScAddress & rQueryAddress,
86*b1cdbd2cSJim Jagielski const bool bAvailable )
87*b1cdbd2cSJim Jagielski {
88*b1cdbd2cSJim Jagielski #ifdef erDEBUG
89*b1cdbd2cSJim Jagielski size_t nBuckets = maQueryMap.bucket_count();
90*b1cdbd2cSJim Jagielski #endif
91*b1cdbd2cSJim Jagielski QueryKey aKey( rQueryAddress, rCriteria.getQueryOp());
92*b1cdbd2cSJim Jagielski QueryCriteriaAndResult aResult( rCriteria, rResultAddress);
93*b1cdbd2cSJim Jagielski if (!bAvailable)
94*b1cdbd2cSJim Jagielski aResult.maAddress.SetRow(-1);
95*b1cdbd2cSJim Jagielski bool bInserted = maQueryMap.insert( ::std::pair< const QueryKey,
96*b1cdbd2cSJim Jagielski QueryCriteriaAndResult>( aKey, aResult)).second;
97*b1cdbd2cSJim Jagielski #ifdef erDEBUG
98*b1cdbd2cSJim Jagielski if (nBuckets != maQueryMap.bucket_count())
99*b1cdbd2cSJim Jagielski {
100*b1cdbd2cSJim Jagielski fprintf( stderr, "\nbuck ScLookupCache: %d, %d, %d, %d, %d, %d; buckets: %lu, size: %lu\n",
101*b1cdbd2cSJim Jagielski (int)getRange().aStart.Col(), (int)getRange().aStart.Row(),
102*b1cdbd2cSJim Jagielski (int)getRange().aStart.Tab(), (int)getRange().aEnd.Col(),
103*b1cdbd2cSJim Jagielski (int)getRange().aEnd.Row(), (int)getRange().aEnd.Tab(),
104*b1cdbd2cSJim Jagielski (unsigned long)maQueryMap.bucket_count(), (unsigned long)maQueryMap.size());
105*b1cdbd2cSJim Jagielski }
106*b1cdbd2cSJim Jagielski #endif
107*b1cdbd2cSJim Jagielski return bInserted;
108*b1cdbd2cSJim Jagielski }
109*b1cdbd2cSJim Jagielski
110*b1cdbd2cSJim Jagielski
Notify(SvtBroadcaster &,const SfxHint & rHint)111*b1cdbd2cSJim Jagielski void ScLookupCache::Notify( SvtBroadcaster & /* rBC */ , const SfxHint & rHint )
112*b1cdbd2cSJim Jagielski {
113*b1cdbd2cSJim Jagielski if (!mpDoc->IsInDtorClear())
114*b1cdbd2cSJim Jagielski {
115*b1cdbd2cSJim Jagielski const ScHint* p = PTR_CAST( ScHint, &rHint );
116*b1cdbd2cSJim Jagielski if (p && (p->GetId() & (SC_HINT_DATACHANGED | SC_HINT_DYING)))
117*b1cdbd2cSJim Jagielski {
118*b1cdbd2cSJim Jagielski mpDoc->RemoveLookupCache( *this);
119*b1cdbd2cSJim Jagielski delete this;
120*b1cdbd2cSJim Jagielski }
121*b1cdbd2cSJim Jagielski }
122*b1cdbd2cSJim Jagielski }
123