Line data Source code
1 : /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 : /*
3 : * This file is part of the LibreOffice project.
4 : *
5 : * This Source Code Form is subject to the terms of the Mozilla Public
6 : * License, v. 2.0. If a copy of the MPL was not distributed with this
7 : * file, You can obtain one at http://mozilla.org/MPL/2.0/.
8 : *
9 : * This file incorporates work covered by the following license notice:
10 : *
11 : * Licensed to the Apache Software Foundation (ASF) under one or more
12 : * contributor license agreements. See the NOTICE file distributed
13 : * with this work for additional information regarding copyright
14 : * ownership. The ASF licenses this file to you under the Apache
15 : * License, Version 2.0 (the "License"); you may not use this file
16 : * except in compliance with the License. You may obtain a copy of
17 : * the License at http://www.apache.org/licenses/LICENSE-2.0 .
18 : */
19 :
20 : #ifndef SC_RANGELST_HXX
21 : #define SC_RANGELST_HXX
22 :
23 : #include "global.hxx"
24 : #include "address.hxx"
25 : #include <tools/solar.h>
26 : #include <vector>
27 :
28 : class ScDocument;
29 :
30 : class SC_DLLPUBLIC ScRangeList : public SvRefBase
31 : {
32 : public:
33 : ScRangeList();
34 : ScRangeList( const ScRangeList& rList );
35 : ScRangeList( const ScRange& rRange );
36 : virtual ~ScRangeList();
37 :
38 : ScRangeList& operator=(const ScRangeList& rList);
39 : void Append( const ScRange& rRange );
40 :
41 : sal_uInt16 Parse( const String&, ScDocument* = NULL,
42 : sal_uInt16 nMask = SCA_VALID,
43 : formula::FormulaGrammar::AddressConvention eConv = formula::FormulaGrammar::CONV_OOO,
44 : SCTAB nDefaultTab = 0, sal_Unicode cDelimiter = 0 );
45 :
46 : void Format( String&, sal_uInt16 nFlags = 0, ScDocument* = NULL,
47 : formula::FormulaGrammar::AddressConvention eConv = formula::FormulaGrammar::CONV_OOO,
48 : sal_Unicode cDelimiter = 0 ) const;
49 : void Format( OUString&, sal_uInt16 nFlags = 0, ScDocument* = NULL,
50 : formula::FormulaGrammar::AddressConvention eConv = formula::FormulaGrammar::CONV_OOO,
51 : sal_Unicode cDelimiter = 0 ) const;
52 :
53 : void Join( const ScRange&, bool bIsInList = false );
54 :
55 : bool UpdateReference( UpdateRefMode, ScDocument*,
56 : const ScRange& rWhere,
57 : SCsCOL nDx,
58 : SCsROW nDy,
59 : SCsTAB nDz
60 : );
61 :
62 : /** For now this method assumes that nTab1 == nTab2
63 : * The algorithm will be much more complicated if nTab1 != nTab2
64 : */
65 : void DeleteArea( SCCOL nCol1, SCROW nRow1, SCTAB nTab1, SCCOL nCol2,
66 : SCROW nRow2, SCTAB nTab2 );
67 :
68 : const ScRange* Find( const ScAddress& ) const;
69 : ScRange* Find( const ScAddress& );
70 : bool operator==( const ScRangeList& ) const;
71 : bool operator!=( const ScRangeList& r ) const;
72 : bool Intersects( const ScRange& ) const;
73 : bool In( const ScRange& ) const;
74 : size_t GetCellCount() const;
75 : ScAddress GetTopLeftCorner() const;
76 :
77 : ScRangeList GetIntersectedRange(const ScRange& rRange) const;
78 :
79 : ScRange* Remove(size_t nPos);
80 : void RemoveAll();
81 :
82 : ScRange Combine() const;
83 :
84 : bool empty() const;
85 : size_t size() const;
86 : ScRange* operator[](size_t idx);
87 : const ScRange* operator[](size_t idx) const;
88 : ScRange* front();
89 : const ScRange* front() const;
90 : ScRange* back();
91 : const ScRange* back() const;
92 : void push_back(ScRange* p);
93 :
94 : private:
95 : ::std::vector<ScRange*> maRanges;
96 : typedef std::vector<ScRange*>::iterator iterator;
97 : typedef std::vector<ScRange*>::const_iterator const_iterator;
98 : };
99 16295 : SV_DECL_IMPL_REF( ScRangeList );
100 :
101 :
102 : // RangePairList:
103 : // aRange[0]: actual range,
104 : // aRange[1]: data for that range, e.g. Rows belonging to a ColName
105 2917 : class SC_DLLPUBLIC ScRangePairList : public SvRefBase
106 : {
107 : public:
108 : virtual ~ScRangePairList();
109 : ScRangePairList* Clone() const;
110 11 : void Append( const ScRangePair& rRangePair )
111 : {
112 11 : ScRangePair* pR = new ScRangePair( rRangePair );
113 11 : maPairs.push_back( pR );
114 11 : }
115 : void Join( const ScRangePair&, bool bIsInList = false );
116 : bool UpdateReference( UpdateRefMode, ScDocument*,
117 : const ScRange& rWhere,
118 : SCsCOL nDx, SCsROW nDy, SCsTAB nDz );
119 : void DeleteOnTab( SCTAB nTab );
120 : ScRangePair* Find( const ScAddress& ) const;
121 : ScRangePair* Find( const ScRange& ) const;
122 : ScRangePair** CreateNameSortedArray( size_t& nCount, ScDocument* ) const;
123 : bool operator==( const ScRangePairList& ) const;
124 :
125 : ScRangePair* Remove(size_t nPos);
126 : ScRangePair* Remove(ScRangePair* pAdr);
127 :
128 : size_t size() const;
129 : ScRangePair* operator[](size_t idx);
130 : const ScRangePair* operator[](size_t idx) const;
131 :
132 : private:
133 : ::std::vector< ScRangePair* > maPairs;
134 : };
135 17870 : SV_DECL_IMPL_REF( ScRangePairList );
136 :
137 : extern "C"
138 : int SAL_CALL ScRangePairList_QsortNameCompare( const void*, const void* );
139 :
140 :
141 : #endif
142 :
143 : /* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
