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
|
/* -*- 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_LOTRANGE_HXX
#define INCLUDED_SC_SOURCE_FILTER_INC_LOTRANGE_HXX
#include <refdata.hxx>
#include <types.hxx>
struct LOTUS_ROOT;
typedef sal_uInt16 LR_ID;
#define ID_FAIL 0xFFFF
class LotusRange
{
friend class LotusRangeList;
private:
sal_uInt32 nHash;
SCCOL nColStart;
SCROW nRowStart;
SCCOL nColEnd;
SCROW nRowEnd;
LR_ID nId;
void MakeHash();
inline void Copy( const LotusRange& );
inline void SetId( LR_ID nId );
public:
LotusRange( SCCOL nCol, SCROW nRow );
LotusRange( SCCOL nColS, SCROW nRowS, SCCOL nColE, SCROW nRowE );
LotusRange( const LotusRange& );
inline LotusRange &operator =( const LotusRange& );
inline bool operator ==( const LotusRange& ) const;
inline bool IsSingle() const;
};
inline void LotusRange::Copy( const LotusRange& rCpy )
{
nHash = rCpy.nHash;
nColStart = rCpy.nColStart;
nRowStart = rCpy.nRowStart;
nColEnd = rCpy.nColEnd;
nRowEnd = rCpy.nRowEnd;
nId = rCpy.nId;
}
inline void LotusRange::SetId( LR_ID nNewId )
{
nId = nNewId;
}
inline LotusRange &LotusRange::operator =( const LotusRange& rCpy )
{
Copy( rCpy );
return *this;
}
inline bool LotusRange::operator ==( const LotusRange& rRef ) const
{
return ( nHash == rRef.nHash && nColStart == rRef.nColStart &&
nRowStart == rRef.nRowStart && nColEnd == rRef.nColEnd &&
nRowEnd == rRef.nRowEnd );
}
inline bool LotusRange::IsSingle() const
{
return ( nColStart == nColEnd && nRowStart == nRowEnd );
}
class LotusRangeList
{
private:
LR_ID nIdCnt;
ScComplexRefData aComplRef;
std::vector<std::unique_ptr<LotusRange>> maRanges;
public:
LotusRangeList();
~LotusRangeList();
inline LR_ID GetIndex( SCCOL nCol, SCROW nRow );
inline LR_ID GetIndex( SCCOL nColS, SCROW nRowS, SCCOL nColE, SCROW nRowE );
LR_ID GetIndex( const LotusRange& );
void Append( std::unique_ptr<LotusRange> pLR );
};
inline LR_ID LotusRangeList::GetIndex( SCCOL nCol, SCROW nRow )
{
LotusRange aRef( nCol, nRow );
return GetIndex( aRef );
}
inline LR_ID LotusRangeList::GetIndex( SCCOL nColS, SCROW nRowS, SCCOL nColE, SCROW nRowE )
{
LotusRange aRef( nColS, nRowS, nColE, nRowE );
return GetIndex( aRef );
}
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
