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
|
/* -*- 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 <MinimumAndMaximumSupplier.hxx>
#include <com/sun/star/chart/TimeUnit.hpp>
#include <cmath>
#include <limits>
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 = std::numeric_limits<double>::infinity();
for (auto const& elem : m_aMinimumAndMaximumSupplierList)
{
double fLocalExtremum = elem->getMinimumX();
if(fLocalExtremum<fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(std::isinf(fGlobalExtremum))
return std::numeric_limits<double>::quiet_NaN();
return fGlobalExtremum;
}
double MergedMinimumAndMaximumSupplier::getMaximumX()
{
double fGlobalExtremum = -std::numeric_limits<double>::infinity();
for (auto const& elem : m_aMinimumAndMaximumSupplierList)
{
double fLocalExtremum = elem->getMaximumX();
if(fLocalExtremum>fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(std::isinf(fGlobalExtremum))
return std::numeric_limits<double>::quiet_NaN();
return fGlobalExtremum;
}
double MergedMinimumAndMaximumSupplier::getMinimumYInRange( double fMinimumX, double fMaximumX, sal_Int32 nAxisIndex )
{
double fGlobalExtremum = std::numeric_limits<double>::infinity();
for (auto const& elem : m_aMinimumAndMaximumSupplierList)
{
double fLocalExtremum = elem->getMinimumYInRange( fMinimumX, fMaximumX, nAxisIndex );
if(fLocalExtremum<fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(std::isinf(fGlobalExtremum))
return std::numeric_limits<double>::quiet_NaN();
return fGlobalExtremum;
}
double MergedMinimumAndMaximumSupplier::getMaximumYInRange( double fMinimumX, double fMaximumX, sal_Int32 nAxisIndex )
{
double fGlobalExtremum = -std::numeric_limits<double>::infinity();
for (auto const& elem : m_aMinimumAndMaximumSupplierList)
{
double fLocalExtremum = elem->getMaximumYInRange( fMinimumX, fMaximumX, nAxisIndex );
if(fLocalExtremum>fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(std::isinf(fGlobalExtremum))
return std::numeric_limits<double>::quiet_NaN();
return fGlobalExtremum;
}
double MergedMinimumAndMaximumSupplier::getMinimumZ()
{
double fGlobalExtremum = std::numeric_limits<double>::infinity();
for (auto const& elem : m_aMinimumAndMaximumSupplierList)
{
double fLocalExtremum = elem->getMinimumZ();
if(fLocalExtremum<fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(std::isinf(fGlobalExtremum))
return std::numeric_limits<double>::quiet_NaN();
return fGlobalExtremum;
}
double MergedMinimumAndMaximumSupplier::getMaximumZ()
{
double fGlobalExtremum = -std::numeric_limits<double>::infinity();
for (auto const& elem : m_aMinimumAndMaximumSupplierList)
{
double fLocalExtremum = elem->getMaximumZ();
if(fLocalExtremum>fGlobalExtremum)
fGlobalExtremum=fLocalExtremum;
}
if(std::isinf(fGlobalExtremum))
return std::numeric_limits<double>::quiet_NaN();
return fGlobalExtremum;
}
bool MergedMinimumAndMaximumSupplier::isExpandBorderToIncrementRhythm( sal_Int32 nDimensionIndex )
{
// only return true, if *all* suppliers want to scale to the main tick marks
for (auto const& elem : m_aMinimumAndMaximumSupplierList)
if( !elem->isExpandBorderToIncrementRhythm( nDimensionIndex ) )
return false;
return true;
}
bool MergedMinimumAndMaximumSupplier::isExpandIfValuesCloseToBorder( sal_Int32 nDimensionIndex )
{
// only return true, if *all* suppliers want to expand the range
for (auto const& elem : m_aMinimumAndMaximumSupplierList)
if( !elem->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 (auto const& elem : m_aMinimumAndMaximumSupplierList)
if( elem->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 (auto const& elem : m_aMinimumAndMaximumSupplierList)
if( elem->isExpandNarrowValuesTowardZero( nDimensionIndex ) )
return true;
return false;
}
bool MergedMinimumAndMaximumSupplier::isSeparateStackingForDifferentSigns( sal_Int32 nDimensionIndex )
{
// should not be called
for (auto const& elem : m_aMinimumAndMaximumSupplierList)
if( elem->isSeparateStackingForDifferentSigns( nDimensionIndex ) )
return true;
return false;
}
void MergedMinimumAndMaximumSupplier::clearMinimumAndMaximumSupplierList()
{
m_aMinimumAndMaximumSupplierList.clear();
}
tools::Long MergedMinimumAndMaximumSupplier::calculateTimeResolutionOnXAxis()
{
tools::Long nRet = css::chart::TimeUnit::YEAR;
for (auto const& elem : m_aMinimumAndMaximumSupplierList)
{
tools::Long nCurrent = elem->calculateTimeResolutionOnXAxis();
if(nRet>nCurrent)
nRet=nCurrent;
}
return nRet;
}
void MergedMinimumAndMaximumSupplier::setTimeResolutionOnXAxis( tools::Long nTimeResolution, const Date& rNullDate )
{
for (auto const& elem : m_aMinimumAndMaximumSupplierList)
elem->setTimeResolutionOnXAxis( nTimeResolution, rNullDate );
}
} //namespace chart
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
