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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
/* -*- 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 .
*/
#include "tabcol.hxx"
#include <limits.h>
#include <osl/diagnose.h>
SwTabCols::SwTabCols( sal_uInt16 nSize ) :
nLeftMin( 0 ),
nLeft( 0 ),
nRight( 0 ),
nRightMax( 0 ),
bLastRowAllowedToChange( true )
{
if ( nSize )
aData.reserve( nSize );
}
SwTabCols::SwTabCols( const SwTabCols& rCpy ) :
nLeftMin( rCpy.GetLeftMin() ),
nLeft( rCpy.GetLeft() ),
nRight( rCpy.GetRight() ),
nRightMax( rCpy.GetRightMax() ),
bLastRowAllowedToChange( rCpy.IsLastRowAllowedToChange() ),
aData( rCpy.GetData() )
{
#if OSL_DEBUG_LEVEL > 0
for ( sal_uInt16 i = 0; i < Count(); ++i )
{
SwTabColsEntry aEntry1 = aData[i];
SwTabColsEntry aEntry2 = rCpy.GetData()[i];
(void) aEntry1;
(void) aEntry2;
OSL_ENSURE( aEntry1.nPos == aEntry2.nPos &&
aEntry1.nMin == aEntry2.nMin &&
aEntry1.nMax == aEntry2.nMax &&
aEntry1.bHidden == aEntry2.bHidden,
"CopyContructor of SwTabColsEntries did not succeed!" );
}
#endif
}
SwTabCols &SwTabCols::operator=( const SwTabCols& rCpy )
{
nLeftMin = rCpy.GetLeftMin();
nLeft = rCpy.GetLeft();
nRight = rCpy.GetRight();
nRightMax= rCpy.GetRightMax();
bLastRowAllowedToChange = rCpy.IsLastRowAllowedToChange();
Remove( 0, Count() );
aData = rCpy.GetData();
return *this;
}
bool SwTabCols::operator==( const SwTabCols& rCmp ) const
{
sal_uInt16 i;
if ( !(nLeftMin == rCmp.GetLeftMin() &&
nLeft == rCmp.GetLeft() &&
nRight == rCmp.GetRight() &&
nRightMax== rCmp.GetRightMax()&&
bLastRowAllowedToChange== rCmp.IsLastRowAllowedToChange() &&
Count()== rCmp.Count()) )
return false;
for ( i = 0; i < Count(); ++i )
{
SwTabColsEntry aEntry1 = aData[i];
SwTabColsEntry aEntry2 = rCmp.GetData()[i];
if ( aEntry1.nPos != aEntry2.nPos || aEntry1.bHidden != aEntry2.bHidden )
return sal_False;
}
return true;
}
void SwTabCols::Insert( long nValue, long nMin, long nMax,
sal_Bool bValue, sal_uInt16 nPos )
{
SwTabColsEntry aEntry;
aEntry.nPos = nValue;
aEntry.nMin = nMin;
aEntry.nMax = nMax;
aEntry.bHidden = bValue;
aData.insert( aData.begin() + nPos, aEntry );
}
void SwTabCols::Insert( long nValue, sal_Bool bValue, sal_uInt16 nPos )
{
SwTabColsEntry aEntry;
aEntry.nPos = nValue;
aEntry.nMin = 0;
aEntry.nMax = LONG_MAX;
aEntry.bHidden = bValue;
aData.insert( aData.begin() + nPos, aEntry );
#if OSL_DEBUG_LEVEL > 1
SwTabColsEntries::iterator aPos = aData.begin();
for ( ; aPos != aData.end(); ++aPos )
{
aEntry =(*aPos);
}
#endif
}
void SwTabCols::Remove( sal_uInt16 nPos, sal_uInt16 nAnz )
{
SwTabColsEntries::iterator aStart = aData.begin() + nPos;
aData.erase( aStart, aStart + nAnz );
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
