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
|
/* -*- 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_SVX_SOURCE_TABLE_CELLTYPES_HXX
#define INCLUDED_SVX_SOURCE_TABLE_CELLTYPES_HXX
#include <rtl/ref.hxx>
#include <vector>
namespace sdr { namespace table {
class Cell;
class TableModel;
class TableRow;
class TableColumn;
class TableRows;
class TableColumns;
typedef rtl::Reference< Cell > CellRef;
typedef rtl::Reference< TableModel > TableModelRef;
typedef rtl::Reference< TableRow > TableRowRef;
typedef rtl::Reference< TableColumn > TableColumnRef;
typedef rtl::Reference< TableRows > TableRowsRef;
typedef rtl::Reference< TableColumns > TableColumnsRef;
typedef std::vector< CellRef > CellVector;
typedef std::vector< TableRowRef > RowVector;
typedef std::vector< TableColumnRef > ColumnVector;
class TableDesignUser
{
public:
virtual bool isInUse() = 0;
protected:
~TableDesignUser() {}
};
template< typename T >
class RangeIterator
{
public:
/** creates an iterator from rStart (including) to rEnd (excluding) if
bForeward is true or from nEnd (excluding to nStart (including).
rStart must be <= rEnd.
*/
RangeIterator( const T& rStart, const T& rEnd, bool bForeward = true )
{
if( bForeward )
{
maIter = rStart;
maEnd = rEnd;
}
else
{
maIter = rEnd-1;
maEnd = rStart-1;
}
}
/* returns true if the next call to next() will return true also. */
bool hasNext() const
{
return maIter != maEnd;
}
/* iterates in the configured direction and returns true if rValue
now contains a valid position in the range of this iterator */
bool next( T& rValue )
{
if( maIter == maEnd )
return false;
rValue = maIter;
if( maIter < maEnd )
maIter++;
else
maIter--;
return true;
}
private:
T maEnd;
T maIter;
};
} }
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
