2bac61013e
Change-Id: Iade3fedac5d2f8e978b7dd9c30f001d7d1564946
214 lines
6.3 KiB
C++
214 lines
6.3 KiB
C++
/* -*- 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 <boost/unordered_map.hpp>
|
|
|
|
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 : 1;
|
|
bool mbString : 1;
|
|
QueryOp meOp : 2;
|
|
|
|
void deleteString()
|
|
{
|
|
if (mbAlloc && mbString)
|
|
delete mpStr;
|
|
}
|
|
|
|
// prevent usage
|
|
QueryCriteria();
|
|
QueryCriteria & operator=( const QueryCriteria & r );
|
|
|
|
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 * pStr )
|
|
{
|
|
deleteString();
|
|
mbAlloc = false;
|
|
mbString = true;
|
|
mpStr = pStr;
|
|
}
|
|
|
|
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();
|
|
/// Remove from document structure and delete (!) cache on modify hint.
|
|
virtual void Notify( const SfxHint& rHint ) SAL_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 : 2;
|
|
|
|
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 ::boost::unordered_map< QueryKey, QueryCriteriaAndResult, QueryKey::Hash, ::std::equal_to< QueryKey > > QueryMap;
|
|
QueryMap maQueryMap;
|
|
ScRange maRange;
|
|
ScDocument * mpDoc;
|
|
|
|
// prevent usage
|
|
ScLookupCache( const ScLookupCache & );
|
|
ScLookupCache & operator=( const ScLookupCache & );
|
|
|
|
};
|
|
|
|
|
|
typedef ::boost::unordered_map< ScRange, ScLookupCache*, ScLookupCache::Hash, ::std::equal_to< ScRange > > ScLookupCacheMap;
|
|
|
|
#endif
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|