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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: MinimumAndMaximumSupplier.cxx,v $
* $Revision: 1.3 $
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_chart2.hxx"
#include "MinimumAndMaximumSupplier.hxx"
#include <rtl/math.hxx>
#include <com/sun/star/awt/Size.hpp>
//.............................................................................
namespace chart
{
//.............................................................................
using namespace ::com::sun::star;
MergedMinimumAndMaximumSupplier::MergedMinimumAndMaximumSupplier()
{
}
MergedMinimumAndMaximumSupplier::~MergedMinimumAndMaximumSupplier()
{
}
void MergedMinimumAndMaximumSupplier::addMinimumAndMaximumSupplier( MinimumAndMaximumSupplier* pMinimumAndMaximumSupplier )
{
m_aMinimumAndMaximumSupplierList.insert( pMinimumAndMaximumSupplier );
}
bool MergedMinimumAndMaximumSupplier::hasMinimumAndMaximumSupplier( MinimumAndMaximumSupplier* pMinimumAndMaximumSupplier )
{
return m_aMinimumAndMaximumSupplierList.count( pMinimumAndMaximumSupplier ) != 0;
}
double MergedMinimumAndMaximumSupplier::getMinimumX()
{
double fGlobalExtremum;
::rtl::math::setInf(&fGlobalExtremum, false);
for( MinimumAndMaximumSupplierSet::iterator aIt = begin(), aEnd = end(); aIt != aEnd; ++aIt )
{
double fLocalExtremum = (*aIt)->getMinimumX();
if(fLocalExtremum<fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(::rtl::math::isInf(fGlobalExtremum))
::rtl::math::setNan(&fGlobalExtremum);
return fGlobalExtremum;
}
double MergedMinimumAndMaximumSupplier::getMaximumX()
{
double fGlobalExtremum;
::rtl::math::setInf(&fGlobalExtremum, true);
for( MinimumAndMaximumSupplierSet::iterator aIt = begin(), aEnd = end(); aIt != aEnd; ++aIt )
{
double fLocalExtremum = (*aIt)->getMaximumX();
if(fLocalExtremum>fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(::rtl::math::isInf(fGlobalExtremum))
::rtl::math::setNan(&fGlobalExtremum);
return fGlobalExtremum;
}
double MergedMinimumAndMaximumSupplier::getMinimumYInRange( double fMinimumX, double fMaximumX, sal_Int32 nAxisIndex )
{
double fGlobalExtremum;
::rtl::math::setInf(&fGlobalExtremum, false);
for( MinimumAndMaximumSupplierSet::iterator aIt = begin(), aEnd = end(); aIt != aEnd; ++aIt )
{
double fLocalExtremum = (*aIt)->getMinimumYInRange( fMinimumX, fMaximumX, nAxisIndex );
if(fLocalExtremum<fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(::rtl::math::isInf(fGlobalExtremum))
::rtl::math::setNan(&fGlobalExtremum);
return fGlobalExtremum;
}
double MergedMinimumAndMaximumSupplier::getMaximumYInRange( double fMinimumX, double fMaximumX, sal_Int32 nAxisIndex )
{
double fGlobalExtremum;
::rtl::math::setInf(&fGlobalExtremum, true);
for( MinimumAndMaximumSupplierSet::iterator aIt = begin(), aEnd = end(); aIt != aEnd; ++aIt )
{
double fLocalExtremum = (*aIt)->getMaximumYInRange( fMinimumX, fMaximumX, nAxisIndex );
if(fLocalExtremum>fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(::rtl::math::isInf(fGlobalExtremum))
::rtl::math::setNan(&fGlobalExtremum);
return fGlobalExtremum;
}
double MergedMinimumAndMaximumSupplier::getMinimumZ()
{
double fGlobalExtremum;
::rtl::math::setInf(&fGlobalExtremum, false);
for( MinimumAndMaximumSupplierSet::iterator aIt = begin(), aEnd = end(); aIt != aEnd; ++aIt )
{
double fLocalExtremum = (*aIt)->getMinimumZ();
if(fLocalExtremum<fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(::rtl::math::isInf(fGlobalExtremum))
::rtl::math::setNan(&fGlobalExtremum);
return fGlobalExtremum;
}
double MergedMinimumAndMaximumSupplier::getMaximumZ()
{
double fGlobalExtremum;
::rtl::math::setInf(&fGlobalExtremum, true);
for( MinimumAndMaximumSupplierSet::iterator aIt = begin(), aEnd = end(); aIt != aEnd; ++aIt )
{
double fLocalExtremum = (*aIt)->getMaximumZ();
if(fLocalExtremum>fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(::rtl::math::isInf(fGlobalExtremum))
::rtl::math::setNan(&fGlobalExtremum);
return fGlobalExtremum;
}
bool MergedMinimumAndMaximumSupplier::isExpandBorderToIncrementRhythm( sal_Int32 nDimensionIndex )
{
// only return true, if *all* suppliers want to scale to the main tick marks
for( MinimumAndMaximumSupplierSet::iterator aIt = begin(), aEnd = end(); aIt != aEnd; ++aIt )
if( !(*aIt)->isExpandBorderToIncrementRhythm( nDimensionIndex ) )
return false;
return true;
}
bool MergedMinimumAndMaximumSupplier::isExpandIfValuesCloseToBorder( sal_Int32 nDimensionIndex )
{
// only return true, if *all* suppliers want to expand the range
for( MinimumAndMaximumSupplierSet::iterator aIt = begin(), aEnd = end(); aIt != aEnd; ++aIt )
if( !(*aIt)->isExpandIfValuesCloseToBorder( nDimensionIndex ) )
return false;
return true;
}
bool MergedMinimumAndMaximumSupplier::isExpandWideValuesToZero( sal_Int32 nDimensionIndex )
{
// already return true, if at least one supplier wants to expand the range
for( MinimumAndMaximumSupplierSet::iterator aIt = begin(), aEnd = end(); aIt != aEnd; ++aIt )
if( (*aIt)->isExpandWideValuesToZero( nDimensionIndex ) )
return true;
return false;
}
bool MergedMinimumAndMaximumSupplier::isExpandNarrowValuesTowardZero( sal_Int32 nDimensionIndex )
{
// already return true, if at least one supplier wants to expand the range
for( MinimumAndMaximumSupplierSet::iterator aIt = begin(), aEnd = end(); aIt != aEnd; ++aIt )
if( (*aIt)->isExpandNarrowValuesTowardZero( nDimensionIndex ) )
return true;
return false;
}
bool MergedMinimumAndMaximumSupplier::isSeperateStackingForDifferentSigns( sal_Int32 nDimensionIndex )
{
// should not be called
for( MinimumAndMaximumSupplierSet::iterator aIt = begin(), aEnd = end(); aIt != aEnd; ++aIt )
if( (*aIt)->isSeperateStackingForDifferentSigns( nDimensionIndex ) )
return true;
return false;
}
void MergedMinimumAndMaximumSupplier::clearMinimumAndMaximumSupplierList()
{
m_aMinimumAndMaximumSupplierList.clear();
}
//.............................................................................
} //namespace chart
//.............................................................................
|
