chart2/source/view/axes/MinimumAndMaximumSupplier.cxx

   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 #include <MinimumAndMaximumSupplier.hxx>
  21
  22 #include <com/sun/star/chart/TimeUnit.hpp>
  23
  24 #include <rtl/math.hxx>
  25 #include <com/sun/star/awt/Size.hpp>
  26
  27 namespace chart
  28 {
  29 using namespace ::com::sun::star;
  30
  31 MergedMinimumAndMaximumSupplier::MergedMinimumAndMaximumSupplier()
  32 {
  33 }
  34
  35 MergedMinimumAndMaximumSupplier::~MergedMinimumAndMaximumSupplier()
  36 {
  37 }
  38
  39 void MergedMinimumAndMaximumSupplier::addMinimumAndMaximumSupplier( MinimumAndMaximumSupplier* pMinimumAndMaximumSupplier )
  40 {
  41     m_aMinimumAndMaximumSupplierList.insert( pMinimumAndMaximumSupplier );
  42 }
  43
  44 bool MergedMinimumAndMaximumSupplier::hasMinimumAndMaximumSupplier( MinimumAndMaximumSupplier* pMinimumAndMaximumSupplier )
  45 {
  46     return m_aMinimumAndMaximumSupplierList.count( pMinimumAndMaximumSupplier ) != 0;
  47 }
  48
  49 double MergedMinimumAndMaximumSupplier::getMinimumX()
  50 {
  51     double fGlobalExtremum;
  52     ::rtl::math::setInf(&fGlobalExtremum, false);
  53     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
  54     {
  55         double fLocalExtremum = elem->getMinimumX();
  56         if(fLocalExtremum<fGlobalExtremum)
  57             fGlobalExtremum=fLocalExtremum;
  58     }
  59     if(::rtl::math::isInf(fGlobalExtremum))
  60         ::rtl::math::setNan(&fGlobalExtremum);
  61     return fGlobalExtremum;
  62 }
  63
  64 double MergedMinimumAndMaximumSupplier::getMaximumX()
  65 {
  66     double fGlobalExtremum;
  67     ::rtl::math::setInf(&fGlobalExtremum, true);
  68     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
  69     {
  70         double fLocalExtremum = elem->getMaximumX();
  71         if(fLocalExtremum>fGlobalExtremum)
  72             fGlobalExtremum=fLocalExtremum;
  73     }
  74     if(::rtl::math::isInf(fGlobalExtremum))
  75         ::rtl::math::setNan(&fGlobalExtremum);
  76     return fGlobalExtremum;
  77 }
  78
  79 double MergedMinimumAndMaximumSupplier::getMinimumYInRange( double fMinimumX, double fMaximumX, sal_Int32 nAxisIndex )
  80 {
  81     double fGlobalExtremum;
  82     ::rtl::math::setInf(&fGlobalExtremum, false);
  83     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
  84     {
  85         double fLocalExtremum = elem->getMinimumYInRange( fMinimumX, fMaximumX, nAxisIndex );
  86         if(fLocalExtremum<fGlobalExtremum)
  87             fGlobalExtremum=fLocalExtremum;
  88     }
  89     if(::rtl::math::isInf(fGlobalExtremum))
  90         ::rtl::math::setNan(&fGlobalExtremum);
  91     return fGlobalExtremum;
  92 }
  93
  94 double MergedMinimumAndMaximumSupplier::getMaximumYInRange( double fMinimumX, double fMaximumX, sal_Int32 nAxisIndex )
  95 {
  96     double fGlobalExtremum;
  97     ::rtl::math::setInf(&fGlobalExtremum, true);
  98     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
  99     {
 100         double fLocalExtremum = elem->getMaximumYInRange( fMinimumX, fMaximumX, nAxisIndex );
 101         if(fLocalExtremum>fGlobalExtremum)
 102             fGlobalExtremum=fLocalExtremum;
 103     }
 104     if(::rtl::math::isInf(fGlobalExtremum))
 105         ::rtl::math::setNan(&fGlobalExtremum);
 106     return fGlobalExtremum;
 107 }
 108
 109 double MergedMinimumAndMaximumSupplier::getMinimumZ()
 110 {
 111     double fGlobalExtremum;
 112     ::rtl::math::setInf(&fGlobalExtremum, false);
 113     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
 114     {
 115         double fLocalExtremum = elem->getMinimumZ();
 116         if(fLocalExtremum<fGlobalExtremum)
 117             fGlobalExtremum=fLocalExtremum;
 118     }
 119     if(::rtl::math::isInf(fGlobalExtremum))
 120         ::rtl::math::setNan(&fGlobalExtremum);
 121     return fGlobalExtremum;
 122 }
 123
 124 double MergedMinimumAndMaximumSupplier::getMaximumZ()
 125 {
 126     double fGlobalExtremum;
 127     ::rtl::math::setInf(&fGlobalExtremum, true);
 128     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
 129     {
 130         double fLocalExtremum = elem->getMaximumZ();
 131         if(fLocalExtremum>fGlobalExtremum)
 132             fGlobalExtremum=fLocalExtremum;
 133     }
 134     if(::rtl::math::isInf(fGlobalExtremum))
 135         ::rtl::math::setNan(&fGlobalExtremum);
 136     return fGlobalExtremum;
 137 }
 138
 139 bool MergedMinimumAndMaximumSupplier::isExpandBorderToIncrementRhythm( sal_Int32 nDimensionIndex )
 140 {
 141     // only return true, if *all* suppliers want to scale to the main tick marks
 142     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
 143         if( !elem->isExpandBorderToIncrementRhythm( nDimensionIndex ) )
 144             return false;
 145     return true;
 146 }
 147
 148 bool MergedMinimumAndMaximumSupplier::isExpandIfValuesCloseToBorder( sal_Int32 nDimensionIndex )
 149 {
 150     // only return true, if *all* suppliers want to expand the range
 151     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
 152         if( !elem->isExpandIfValuesCloseToBorder( nDimensionIndex ) )
 153             return false;
 154     return true;
 155 }
 156
 157 bool MergedMinimumAndMaximumSupplier::isExpandWideValuesToZero( sal_Int32 nDimensionIndex )
 158 {
 159     // already return true, if at least one supplier wants to expand the range
 160     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
 161         if( elem->isExpandWideValuesToZero( nDimensionIndex ) )
 162             return true;
 163     return false;
 164 }
 165
 166 bool MergedMinimumAndMaximumSupplier::isExpandNarrowValuesTowardZero( sal_Int32 nDimensionIndex )
 167 {
 168     // already return true, if at least one supplier wants to expand the range
 169     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
 170         if( elem->isExpandNarrowValuesTowardZero( nDimensionIndex ) )
 171             return true;
 172     return false;
 173 }
 174
 175 bool MergedMinimumAndMaximumSupplier::isSeparateStackingForDifferentSigns( sal_Int32 nDimensionIndex )
 176 {
 177     // should not be called
 178     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
 179         if( elem->isSeparateStackingForDifferentSigns( nDimensionIndex ) )
 180             return true;
 181     return false;
 182 }
 183
 184 void MergedMinimumAndMaximumSupplier::clearMinimumAndMaximumSupplierList()
 185 {
 186     m_aMinimumAndMaximumSupplierList.clear();
 187 }
 188
 189 long MergedMinimumAndMaximumSupplier::calculateTimeResolutionOnXAxis()
 190 {
 191     long nRet = css::chart::TimeUnit::YEAR;
 192     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
 193     {
 194         long nCurrent = elem->calculateTimeResolutionOnXAxis();
 195         if(nRet>nCurrent)
 196             nRet=nCurrent;
 197     }
 198     return nRet;
 199 }
 200
 201 void MergedMinimumAndMaximumSupplier::setTimeResolutionOnXAxis( long nTimeResolution, const Date& rNullDate )
 202 {
 203     for (auto const& elem : m_aMinimumAndMaximumSupplierList)
 204         elem->setTimeResolutionOnXAxis( nTimeResolution, rNullDate );
 205 }
 206
 207 } //namespace chart
 208
 209 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */