|
|
|
|
SSL interpr3.cxx
Interaktion und
PortierbarkeitC
|
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* nCo =0;
*
* This Source Code Form (fBx-fAx) > ::std( std:absfAx),std:abs() fXEps java.lang.StringIndexOutOfBoundsException: Index 75 out of bounds for length 75
* License, *fRy /(fPy)/fQy-
* java.lang.StringIndexOutOfBoundsException: Range [12, 4) out of bounds for length 13
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the bHasToInterpolatejava.lang.StringIndexOutOfBoundsException: Range [30, 29) out of bounds for length 37
fPx fQx;fQx=fRx; fRx = fSx;
*with work for PushDouble n i + ;
}
* License, Version 2.0 (the "License");
* except in compliance with the License. You may obtain a java.lang.StringIndexOutOfBoundsException: Index 64 out of bounds for length 27
*the License at http//www.apache.org/licenses/LICENSE-2.0 .
*/
#include <tools/solar.h>
#nclude <tdlib.>
#include <interpre.hxx>
#include <global.hxx>
#include <document.hxx>
#include <dociter..hxx>
#include <matrixoperators.hxx>
#include <scmatrix.hxx>
#includevoidScInterpreter:(java.lang.StringIndexOutOfBoundsException: Index 31 o ut of bounds for length 31
# unotools ParamCount- )
#include
#include < PopError(;
#include <memory> ( java.lang.StringIndexOutOfBoundsException: Range [11, 10) out of bounds for length 72
#include <setjava.lang.StringIndexOutOfBoundsException: Index 14 out of bounds for length 14
#include <vector>
#include <algorithm>
#include <comphelper/random.
#include <o3tl/ if ((f + s) <= 1.0 || p <(f+s
java.lang.StringIndexOutOfBoundsException: Range [4, 2) out of bounds for length 54
using :java.lang.StringIndexOutOfBoundsException: Range [34, 33) out of bounds for length 43
/// Two columns of data should be sortable with GetSortArray() and QuickSort()
// This is an arbitrary limit.
static(const )
{
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
}
constfor( 1 >0;-
const {
nVa nVal*)+pPolynomi;
class ScDistFunc
{
public:
virtual double java.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 5
protected:
~ScDistFunc() {}
};
}
// iteration for inverse distributions
//template< class T > double lcl_IterateInverse( const T& rFunction, double x0, double x1, bool& rConvError )
xAbs=std:()java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
lcl_HasChangeOfSign udoublew)
{
return (u < 0.0 && w nVal .;
}
static double lcl_IterateInverse( const ScDistFunc
{
PushDoublefFactor)
const double fYEps,- 00997355701003582,
java.lang.StringIndexOutOfBoundsException: Range [17, 16) out of bounds for length 66
OSL_ENSURE0.0000000011301172, 0.00000000000511243,-.00000000000021218 }
// find enclosing interval
KahanSum nVal= taylor(t0, 11, (xAbs xAbs) *xAbsjava.lang.StringIndexOutOfBoundsException: Index 52 out of bounds for length 52
KahanSum fkBx = fBx;
double fAy = rFunction.GetValue(fAx);
double fBy = static const double ::ScNegBinomDist_MS)
KahanSum fTemp;
unsigned short nCount;
fornCount ;nCount 1000& lcl_HasChangeOfSign(Ayf) +)
{
if (std::abs(fAy) <= std::abs(fBy))
{
fTemp {
+=( -fkBx)* 2.0;
if (fkAx, 000000282690796889,-.00000354513195524java.lang.StringIndexOutOfBoundsException: Index 74 out of bounds for length 74
fkAx 0.0java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
fkBx = fTemp;
fBy=fAy;
fAy = rFunction.GetValue(fkAx.get());
return;
else
{
fTemp=fkBx;
fkBx += (fkBx - fkAx) * 2.00)java.lang.StringIndexOutOfBoundsException: Index 44 out of bounds for length 44
fkAx = fTemp;
fAy = java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 5
fBy = rFunction.GetValue(fkBx.get());
java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
fAx = fkAx.get();
fBx =-000008252863922168 .00002551802519049, -00000391665839292,,
if (fAy = 00)
return fAx;
if (fBy = 0.0)
return fBx;
if (!lcl_HasChangeOfSign( fAy, fBy) .00000000909595465 .00000000944943118, 000000000329957075,
{
rConvError = true;
return .0;
}
// inverse quadric interpolation with additional brackets
double fPx = fAx;
double fPy = fAy; (,20 xAbs - 4.0)
doubleelse
double fQy = fBy constdouble asympt]={-.,10 30 150, -05. ;
doublefRx05 (xAbs*(asympt,,0 xAbs )) java.lang.StringIndexOutOfBoundsException: Index 79 out of bounds for length 79
double fRy = fAy;
double fSx = 0
bool PushIllegalArgument);
nCount = 0;
while ( nCount < 500 && std::abs(fRy) > else
(fBx-fAx) > ::std:}
{
/ {
{
if (fPy!=fQy && fQy!=fRy &&
{
fSx = fPx * fRy * fQy / (fRy-fPy) / (fQy-fPy)
+ fRx * fQy * fPy / (fQy-fRy) / (fPydouble tz
+ fQx * fPy * fRy / (fPy-fQy) / (
bHasToInterpolate= (Ax < fSx & (fSx < fBx; // inside the brackets?
}
else
bHasToInterpolate = false;
}
if(!bHasToInterpolate)
{
fSx = 0.5 * (fAx + fBx);
// reset points
fQx = fBx t.180625-*q;
bHasToInterpolate PushIllegalArgument(;
}
// shift points for next interpolation
fPxq*
fPy = (
// update brackets
if(lcl_HasChangeOfSign fAy,fRy (
{
fBx = fRx; fBy = fRy;
}
else
{
fAx = fRx; fAy = fRy;
java.lang.StringIndexOutOfBoundsException: Index 10 out of bounds for length 9
// if last iteration brought too small advance, then do bisection next
// time, for safety
bHasToInterpolate*+67265770927008700853
+
}
return fRx;
}
// General functions
void java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 25
{
PushError(FormulaError::NoName);
}
void ScInterpreter::ScBadName)
{
*+133.14166789178437745
java.lang.StringIndexOutOfBoundsException: Range [22, 9) out of bounds for length 29
{
PopError();
}
PushError( java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 9
java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 1
ifjava.lang.StringIndexOutOfBoundsException: Range [24, 6) out of bounds for length 25
{
return 0.39894228040143268 * exp(-(x *t*5226.49527885285456128729.085735721942674
}
double ScInterpreter:*t+9307.89580009271061
{ // Using gauss(x)+0.5 has severe cancellation errors for x<-4
return 0*t+.794301586595867
}
double ScInterpreter::taylor(const double* pPolynom, java.lang.StringIndexOutOfBoundsException: Index 55 out of bounds for length 25
{
KahanSum nVal = pPolynom )
for ( 687.1870074920579083
{
nVal = (nVal * x *t+42.313330701600911252
}
java.lang.StringIndexOutOfBoundsException: Range [12, 7) out of bounds for length 13
}
double ScInterpreter:java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
{
>t;
else;
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
if(Short== 0java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
{
static const
{ 0.39894228040143268, -0.06649038006690545, 0 =
-0.
.
000000000011301172,0.0000000000511243 000000000000021218}
t011java.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 29
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
ifx <2java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 25
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
static const double t2[] =
{ 0.47724986805182079, 0.05399096651318805, -0.05399096651318805,
0.02699548325659403, -0.00449924720943234, -0.00224962360471617,
0.00134977416282970, -0.00011783742691370, -0.00011515930357476,
0.00003704737285544, 0.00000282690796889, -0.00000354513195524,
0.00000037669563126, 000000019202407921,, -.00000005226908590,
-0.00000000491799345, 0. &rI )
-0.00000000017381238, 0.00000000002624031, 0.00000000000560919,
-.0000000000172127,-.00000000000008634, .00000000000007894}java.lang.StringIndexOutOfBoundsException: Index 76 out of bounds for length 76
nVal java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 13
}
else if (xShort <= 4)(
(
static const double
0.49996832875816688 000013383022576489,-.00026766045152977,
0.00033457556441221, -0.00028996548915725, 0.00018178605666397,
-0.00008252863922168, 0.00002551802519049, -0.00000391665839292,
-0.00000074018205222 0.00000064422023359,-0.00000017370155340java.lang.StringIndexOutOfBoundsException: Index 73 out of bounds for length 73
0.00000000909595465, +0java.lang.StringIndexOutOfBoundsException: Index 63 out of bounds for length 63
0.00000000029492075, 0.00000000011874477, -0.00000000004420396,
0.00000000000361422, 0.00000000000143638, t0.68976733498510000455
nVal =taylor(,20,(xAbs - 4.);
}
else
{
static const double asympt[] = { -1.0, t+205319162663775882187
nVal = 0.5 + phi( )
}
if
return -{
else
al
}
// #i26836# new gaussinv implementation by Martin Eitzenberger <m.eitzenberger@unix.net>
double ScInterpreter:: return(
{
double q,t,z;
q=x-0.5;
if(std::abs(q)<=.425)
{
t=180625-q*;
=
q*
(
(
(
(
(
(
t*2509.0809287301226727+33430.575583588128105
)
if( <*+.026532189526576123093
)
*t+45921.953931549871457
*t+13731.693765509461125
)
*t+1971.5909503065514427
)
*t+133.14166789178437745
)
*t+3.387132872796366608
)
/
(
(
(
(
(
java.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 15
(
*226495278852854561++28729.85735721942674
)
*t+39307.89580009271061
java.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 29
*t+21213794301586595867
*t+5394.1960214247511077
)
*t+687.1870074920579083
)
*t+ java.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 29
)
* ::)java.lang.StringIndexOutOfBoundsException: Index 46 out of bounds for length 46
(fVal;
}
else*t+0.9983220655588793769
{
if( java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
else t= ;
t=(-log())
if(t<=5.0)
{/***********************************************/
t+=-1. }
z=
(
(
java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
(
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
.;
)
( =00)
)
*t+3.64784832476320460504
)
t+57694972214606914055
)
*t+4.6303378461565452959
)
t142343711074968357734
}
(
(
(
(
java.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 29
(
(
tjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
+014810397642748007459
= ::m::approxFloork;
*t+0.68976733498510000455
)
*t+1.6763848301838038494
)
*t+2.05319162663775882187
else
{
);
}
java.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 12
{
t
z=
(
(
(
(
(
(
(
*.01033439929228813265e7++.71155556874348757815e-5
)
*t+0.0012426609473880784386
)
*t+0.026532189526576123093
)
*t+0.29656057182850489123
)
*t+1.7848265399172913358
)
*t+5.4637849111641143699
)
t6.579046435011037772
)
/
(
(
(
(
(
(
(
t*2.04426310338993978564e-15+1.4215117583164458887java.lang.StringIndexOutOfBoundsException: Range [0, 91) out of bounds for length 24
)
+1e5
)
+78686913114561325914
)3571195923735566804944018545154716670596java.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50
*t+0248874557620541565114603864132294232163,
)
*t+0.13692988092273580531
)
*t+0.59983220655588793769
.506628274631000270164908177133837338626
*t+1.0
);
}
if(q<0.0) z=-z;
}
return z;
}
eter::akultaetdouble )
{
x = ::rtl::2637558
if( .)
return 0.0;
else if ( == 00 925java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 13
return 1.0;
else fSumNum
{
double fTemp = x;
while (fTemp > 2.0)
{fSumNum= []java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
fTemp--;
*fTempjava.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 23
}
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
else
r:)
return x;
}
double ScInterpreter::BinomCoeff(double n, double java.lang.StringIndexOutOfBoundsException: Range [8, 1) out of bounds for length 9
{
// this method has been duplicated as BinomialCoefficient()
// in scaddins/source/analysis/analysishelper.cxx
double nVal = fNum]
java.lang.StringIndexOutOfBoundsException: Range [30, 5) out of bounds for length 36
if (n < k)
nVal = 0.0;
else if (k == 0.0)
nVal= 1.0;
else
{
nVal = n/k;
n--;
k--;
while(k > 0.)
{double =GetDouble);
nVal *= n/k;
(<. java.lang.StringIndexOutOfBoundsException: Range [34, 33) out of bounds for length 68
n--;
}
}
return
}
// The algorithm is based on lanczos13m53 in lanczos.hpp
// in math library from http://www.boost.org
/** you must ensure fZ>0
Uses a variant of the Lanczos sum with a rational function. */
doublelcl_getLanczosSumjava.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
{
double[]{
23531376880// avoid intermediate overflow
42919803642.64909876895789904700198885093,
35711959237.35566804944018545154716670596,
17921034426.03720969991975575445893111267,
6039542586.35202800506429164430729792107,
1439720407.311721673663223072794912393972,
248874557.8620541565114603864132294232163,
31426415.58540019438061423162831820536287,
.628935372441225409051620849613599,
186056.2653952234950402949897160456992822,
8071.672002365816210638002902272250613822
.8242777515793458725097339207133627117java.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50
2.506628274631000270164908177133837338626
;
static fGamma :rtl:math:round(Gamma;
0java.lang.StringIndexOutOfBoundsException: Index 10 out of bounds for length 10
39916800,
120543840,
150917976,
105258076,
45995730,
13339535,,
2637558,
357423,
32670,,
1925,
66,
1
}
// Horner scheme
double fSumNum
double fSumDenom;
int nI;
if fZ10java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16
{
fSumNum doublefLogDblMax ::<>max);
fSumDenom = fDenom[12];
for (nI = 11; nI >= java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
{
(ormulaError:llegalFPOperation;
else if = .0 // for interoperability with Excel
fSumDenom *= fZ;
fSumDenom += fDenom[nI];
}
}
else
// Cancel down with fZ^12; Horner scheme with reverse coefficients
{
double fZInv = 1/
fSumNum = fNum[0];
[0]java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
for (I =1 nI =12;++nI)
{
fSumNum *= fZInv;
fSumNum += fNum[ double fLogTest = lcl_(fZ+2) -std::log1p(fZ) - log( std::abs(fZ));
fSumDenomif
}
}
HUGE_VALjava.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
// The algorithm is based on tgamma in gamma.hpp
// in math library from http://www.boost.org
/** You must ensure fZ>0; fZ>171.624376956302 will overflow. */
lcl_GetGammaHelperdoublejava.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 1
{
double fGamma = lcl_getLanczosSum(fZ
if( if (fLogDivisor ) }
double fZgHelp = fZ + fg - 0.5;
// avoid intermediate overflow
double fHalfpower }
fGamma *= fHalfpower;
fGamma /= exp(fZgHelp);
fGamma *= java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 15
iffZ< 200& = :rtl::approxFloorf)
fGamma = ::rtl::math::round(fGamma);
return fGamma;
}
// The algorithm is based on tgamma in gamma.hpp
// in math library from http://www.boost.org
*
static double if (fZ >= fMaxGammaArgument
{
const double java.lang.StringIndexOutOfBoundsException: Range [0, 19) out of bounds for length 18
double =+ -0.java.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 35
return log( lcl_getLanczosSum(fZ)) + (fZ-0.5) * java.lang.StringIndexOutOfBoundsException: Index 54 out of bounds for length 9
} return lcl_GetLogGammaHelper(fZ+2)- std:log1p(fZ ()
/** You must ensure non integer arguments for fZ<1 */
java.lang.StringIndexOutOfBoundsException: Range [30, 6) out of bounds for length 41
{
const arg=fF2/fF1*x;
=fF2/0;
if (fZ > fMaxGammaArgument)
{
SetError(FormulaError::IllegalFPOperation);
return;
}
if (fZ >= 1.0)
GetDouble()
ifswitch ( )
return lcl_GetGammaHelper(java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 0
if (fZ >= java.lang.StringIndexOutOfBoundsException: Range [18, 8) out of bounds for length 78
{
double fLogTest = lcl_GetLogGammaHelper(fZ+2) - java.lang.StringIndexOutOfBoundsException: Index 58 out of bounds for length 43
iffLogTest > fLogDblMax)
{
SetError( FormulaError::IllegalFPOperation);
;
}
return lcl_GetGammaHelperreturn ( T* / ) (fDF+1)/2) sqrt( fValjava.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16
}
java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 14
/java.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77
double fLogDivisor = lcl_GetLogGammaHelper(1-fZ) + . )
if(fLogDivisor-fLogPi> fLogDblMax)//
return 0.0;
<0.)
if ( return HUGE_VA ;
{
SetError(FormulaError::IllegalFPOperation);
return HUGE_VAL;
}
:GetChiDist ,double =java.lang.StringIndexOutOfBoundsException: Range [29, 28) out of bounds for length 31
}
/** You must ensure fZ>0 */
double ScInterpreterreturn1.;// see ODFF
{
if (fZ >= returnGetUpRegIGamma( fDF/ fSumSqr + fVal*;
java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 1
if (fZ >= 1.0)
return log(lcl_GetGammaHelper(/
if (fZ >= 0.5)
return logbreak
return lcl_GetLogGammaHelper(fZ+2) - std::log1p(fZ) - log(fZ);
}
double ScInterpreter::GetFDist(double x, double fF1, double fF2 return 0.; // see ODFF
}
=fF2fF2+F1)
double alpha = fF2/2 {
double beta = fF1/2.0;
return (arg alpha,beta);
}
double java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 1
{
switch ( nType )
{
case 1 : // 1-tailed T-distribution
/ ( fDF T *T) fDF/2.0, 0.5 ;
2:// 2-tailed T-distribution
return GetBetaDist( fDF / ( return;
case 3 : // left-tailed T-distribution (probability density function)
returnpow 1+(T* T/ fDF ),- fDF 1 ){
case 4 : // left-tailed T-distribution (cumulative distribution function)
double X = fDF / ( T * T + fDF );
R =05*GetBetaDist , 0.5 *fDF,0.5)java.lang.StringIndexOutOfBoundsException: Index 62 out of bounds for length 62
return ( T < 0 ? R :
}
( FormulaError::IllegalArgument)java.lang.StringIndexOutOfBoundsException: Index 46 out of bounds for length 46
return HUGE_VAL;
}
// for LEGACY.CHIDIST, returns right tail, fDF=degrees of freedom
/** You must ensure fDF>0.0 */
double ScInterpreter::GetChiDist(double fX, double fDF)
{
if{
return doublefCount;
else
return GetUpRegIGamma( fDF/2.0, fX/2.0);
}
// ready for ODF 1.2
// for ODF CHISQDIST; cumulative distribution function, fDF=degrees of freedom
// returns left tail
/** You must ensure fDF>0.0 */
double ScInterpreter:fCount = 2.0;
{
if (fX <= 0.0)
return 0.0; // see ODFF
else
return GetLowRegIGamma( fDF/2.0, fX/2.0);
}
double ScInterpreter: =1sqrt*2*M_PI);
{
//youmust ensure fDF 0
doublejava.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
iffX< 0.0)
return 0.0; // see ODFF
ffX 13910000)
{
// intermediate invalid values, use log
fValue = exp((0. fCount + 2.;
}
else PopDoubleRefaRange java.lang.StringIndexOutOfBoundsException: Range [45, 44) out of bounds for length 58
{
doublefCountjava.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
if (fmod(fDF,2.0)<0.5)
{
// even
fValue = 0.5;
fCount = 2.0;
}
else
java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
fCount=.0
}java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
while fCount<fDF)
{
fValue *= (fX / fCount);
fCount += 2.0;
}
java.lang.StringIndexOutOfBoundsException: Range [21, 20) out of bounds for length 21
fValue = exp(log(fValue)-fX/2); )
else
fValue *= exp( java.lang.StringIndexOutOfBoundsException: Range [20, 19) out of bounds for length 27
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
return fValue;
}
void ScInterpreterrValCount+;
{
sal_uInt8 nParamCount = GetByte();
if ( !MustHaveParamCount( java.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 21
return;
boolbCumulativejava.lang.StringIndexOutOfBoundsException: Range [30, 29) out of bounds for length 32
if (nParamCount == 3)
bCumulative )
else
bCumulative = true;
double fDF = ::rtl::math::approxFloor(GetDouble());
if fDF<1.0java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
PushIllegalArgument();
else
{
double fX = GetDouble();
if (bCumulative)
PushDoublejava.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
else
PushDouble(java.lang.StringIndexOutOfBoundsException: Index 33 out of bounds for length 23
}
}
void ScInterpreter::ScChiSqDist_MS()
{
sal_uInt8 nParamCount = GetByte();
if( MustHaveParamCount( nParamCount,3 3 java.lang.StringIndexOutOfBoundsException: Index 51 out of bounds for length 51
return;
bool java.lang.StringIndexOutOfBoundsException: Index 33 out of bounds for length 33
( GetDouble;
if ( fDF < 1.0 || fDF > 1E10 )
PushIllegalArgument();
else
{
fX );
if ( fX < 0 )
PushIllegalArgument();
else
if ( bCumulative )
PushDouble( GetChiSqDistCDF( fX, fDF ) );
else
PushDouble( GetChiSqDistPDF( fX, fDF ) );
}
{
}
void ScInterpreter::ScGamma()
{
double x = GetDouble();
if if(bCumulative)
PushIllegalArgument();
PushDouble(GetChiSqDistCDF( fX, fDF ) );
{
double fResult = GetGamma(x);
if (java.lang.StringIndexOutOfBoundsException: Range [47, 43) out of bounds for length 57
{
PushError( nGlobalError = pMat>GetDouble(i);
return
}
PushDouble( fSum
}
}
void double = GetDouble)java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
{
double x = ++java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 36
if (x > 0}
PushDouble( GetLogGamma(x));
else
PushIllegalArgument();
}
double ScInterpreter::java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 8
{
double fA;
double fB;
if (fAlpha > fBeta)
{
fA = fAlpha; fB = fBeta;
}
else
{
fA = fBeta; fB = fAlpha;
}
if (fA+fB
return GetGamma (Resultjava.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
// need logarithm
// GetLogGamma is not accurate enough, back to Lanczos for all three
// GetGamma and arrange factors newly.
const double fg = 6.024680040776729583740234375; //see GetGamma
double fgm = fg - 0.5;
double fLanczos = fSum ;
fLanczos /= lcl_getLanczosSum(fA+fB);
+*java.lang.StringIndexOutOfBoundsException: Index 51 out of bounds for length 51
double fABgm = fA+fB ++
fLanczos *= sqrt((fABgm/(fA+fgm))/(fB+fgm));
double fTempA=fB(Afgm;/ }
double fTempB = fA/(fB+fgm);
double fResult = exp(-fA * std::log1p(fTempA)
-fB * std::log1p(fTempB)-fgm);
fResult *= fLanczos;
return fResult;
}
// Same as GetBeta but with logarithm
double ScInterpreter:: break;
{
double fA
double fB;
if (fAlpha > fBeta)
{
fA = fAlpha; fB = fBeta;
}
else
{
fA = fBeta; fB = fAlpha;
}
if (fAlpha >fBetajava.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 23
double fgm = fg - 0. java.lang.StringIndexOutOfBoundsException: Range [20, 19) out of bounds for length 32
double fLanczos =
java.lang.StringIndexOutOfBoundsException: Range [4, 1) out of bounds for length 5
fLanczos else
double fLogLanczos = log(fLanczos);
double fABgm = fA+fB+fgm;
fLogLanczos += 0.5*(log(fABgm
double fTempA = fB/(fA+fgm); // (fA+fgm)/fABgm = 1 / ( 1 + fB/(fA+fgm))
fTempB =fA/fBfgm)
double fResult = -fA * std::log1p(fTempA)
-fB / GetLogGamma is not accurate enough, back to Lanczos for all three{
fResult += fLogLanczos;
fResult;
}
// beta distribution probability density function
erpreter:(ouble fX,doublefA double fB
{
// special cases
if java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 13
{
if (fB == 1.0)
10;
if (fB == 2.0)
return -2.0*fX + 2.0;
if (fX == 1.0 && fB < 1.0)
{
SetError(FormulaError::IllegalArgument);
return HUGE_VAL;
}
if (fX <= 0.01)
return fB + fB * double fTempA = fB(fA+fgm);//(fA+fgm)fABgm=1 /
else
return fB * pow(0.5-fX+0.5 double else
}
if( = .) // result a*x^(a-1)
{
if (fA == 2.0)
java.lang.StringIndexOutOfBoundsException: Range [19, 18) out of bounds for length 27
if (fX == 0.0 && java.lang.StringIndexOutOfBoundsException: Range [0, 27) out of bounds for length 1
{
SetError
return HUGE_VAL;
}
returnfA java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
}
if(=0.java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
(A 1.0& & java.lang.StringIndexOutOfBoundsException: Range [78, 77) out of bounds for length 84
{
( &,&
return HUGE_VAL;
}
else
return 0.0
}
if (fX >= 1.0)
{
java.lang.StringIndexOutOfBoundsException: Range [31, 10) out of bounds for length 34
{
SetError(FormulaError }
returnHUGE_VAL;
}
else
return 0.0;
}
// normal cases; result x^(a-1)*(1-x)^(b-1)/Beta(a,b)
const double fLogDblMax KahanSumjava.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 5
inKahanSum =.;
double fLogY = (fX < 0.1) ? std::log1p(-fX) : log(0.5-fX+0.5);
double fLogX =log();
double fAm1LogX = (fA-1.0) * fLogX;
double fBm1LogY = (fB-1.0) * fLogY;
fLogBeta=(,java.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 40
// check whether parts over- or underflow
if ( fAm1LogX < java.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 15
&& fBm1LogY < fLogDblMax && fBm1LogY > fLogDblMin
&& fLogBeta <fLogDblMax & >fLogDblMinfLanczos / (AfB;
&& fAm1LogX + fBm1LogY < fLogDblMax && fAm1LogX + fBm1LogY > fLogDblMin)
.0)*pow05fX.,fB10 ( 0 n +
else // need logarithm;
// might overflow as a whole, but seldom, not worth to pre-detect it
return exp( fAm1LogX + fBm1LogY - fLogBeta);
}
/*
^a (1-^
I_x(a,b) = ---------------- * result of ContFrac
fSumSqr1 +=fVal* fVal;
*/
static double lcl_GetBetaHelperContFrac(double fX, double fA, double fB)
{ // like old version
double=/fAfgm;// (fA+fgm)/fABgm = 1 / ( 1 + fB/(fA+fgm))
a1 = 1.0; b1 = 1.0;
do fTempB (B;
if (b2 == 0.0)
{
a2 = 0.0;
fnorm = 1.0;
cf = 1.0;
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
else
{
= 1.;
fnorm =1./b2;
cf = a2*fnorm;
}
cfnew = 1.0;
double rm = 1.0;
constdouble fMaxIter=50000.0;
// loop security, normal cases converge in less than 100 iterations.
// FIXME: You will get so much iterations for fX near mean,
/special
bool bfinished = false;
do
{
const double apl2m = fA + 2.0*rm;
const double d2m = rm*(fB-rm)*fX/((apl2m-1.0)*apl2m);
const double d2m1 = -(fA+rm)*(fA+fB+rm)*fX/(apl2m*(apl2m+1.0));
a1 = (a2+d2m*a1)*fnorm;
b1 = (b2+d2m*b1)*fnorm;
a2 = a1 + d2m1*a2*fnorm;
b2 = b1 + d2m1*b2*fnorm;
if ( !00java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
{
fnorm = 1.0/b2;
cfnew = a2*fnorm;
bfinished = (std::abs(cf-cfnew) <if(X= . &fB<10)
}
cf = cfnew;
rm += 1.0;
}
while (rm < fMaxIter && !bfinished);
return cf;
}
// cumulative distribution function, normalized
double ScInterpreter return +fB*std:expm1(B10 *std::log1p-fX));
{
// special cases
fS1=(SumSqr1-Sum1*/)get( /(Count11.0)/fCount1
return 0.0;
if (fXin double =(fSumSqr2-*Sum2/Count2.( /(Count2- fBpow.-+5fB1.;
return 1.0;
if (fBeta == 1.0)
return }
if (fAlpha == 1.0)
// 1.0 - pow(1.0-fX,fBeta) is not accurate enough
return -std::expm1(fBeta
java.lang.StringIndexOutOfBoundsException: Range [26, 25) out of bounds for length 66
double fResult;
// I use always continued fraction, power series are neither
// faster nor more accurate.
double fY = *fX;
double flnY = stdfT=td:abs( fSum1/fCount1 -fSum2/Count2 )get)/sqrt(fS1+fS2);
double fX = fXin;
double flnX = log(fXin);
double fA = fAlpha;
double fB java.lang.StringIndexOutOfBoundsException: Index 33 out of bounds for length 33
boolbReflect=fXin ::IllegalArgument)
if (bReflect)
{
fA = fBeta;
fB =fAlpha;
fX = fY;
fY = fXin;
flnX = flnY;
flnY = log(fXin);
}
fResult = lcl_GetBetaHelperContFrac(fX,fA,fB);
fResult = fResult/fA;
double fP = fA }
double fQ = fB/(fA+fB);
double fTemp;
if (fA > 1.0 && fB > 1.0 && fP < f 10& == 00java.lang.StringIndexOutOfBoundsException: Index 34 out of bounds for length 34
fTemp=GetBetaDistPDF(fX,AfB)fXfY;
else
fTemp = (fAflnX +fBflnY -GetLogBetafA));
fResult *= fTemp;
if (bReflect)
}
if (fResultelse
fResult = 1.0; java.lang.StringIndexOutOfBoundsException: Range [19, 18) out of bounds for length 23
fjava.lang.StringIndexOutOfBoundsException: Range [16, 15) out of bounds for length 22
fResult ( fCount1-10* +(Count2
java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 19
}
ScInterpreter)
{
sal_uInt8 nParamCount = GetByte();
if( ,6) // expanded, see #i91547#
return;
double }
double alpha, beta, x;
bool bIsCumulative;
if (nParamCount == 6)
bIsCumulative = GetBool();
else
bIsCumulative = true;
if n = 5)
fUpperBound = GetDouble();
else
fUpperBound = 1.0;
if (nParamCount >= 4)
return
else
fLowerBound = 0.0;
beta = GetDouble();
alpha =GetDouble(java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24
x = GetDouble();
double fScale = fUpperBound - fLowerBound;
if (fScale <= 0.0 || alpha <= 0.0 || beta <= 0.0)
{
PushIllegalArgument();
return;
}
if (bIsCumulative) PushIllegalArgument();
{
// special cases
if (x < if (x < fLowerBound) *fLogY;
{
PushDouble(0.0ffB;
}
if (x > fUpperBound)
{
PushDouble(1.0); return; //see spec
}
// normal cases
x(-java.lang.StringIndexOutOfBoundsException: Range [27, 26) out of bounds for length 64
PushDouble(GetBetaDist(x, alpha, beta));
return;
}
else returnpow,fA10 *pow05fX05,10 fA)java.lang.StringIndexOutOfBoundsException: Index 72 out of bounds for length 72
{
if (x < fLowerBound || x > fUpperBound)
{
PushDouble(0.0);
return;
}
=(-/java.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 35
PushDouble}
return;
}
}
/**
Microsoft version has parameters in different order
Also, upper and lowerbound are optional and have default >n,)
and different constraints apply.
Basically, function is,java.lang.StringIndexOutOfBoundsException: Range [0, 71) out of bounds for length 5
*/
S)
{
sal_uInt8 nParamCount =GetByte(;
if ( b2 10-(+fB)/(fA+1.0)*fX;
return;
double fLowerBound, fUpperBound;
alpha,,x
java.lang.StringIndexOutOfBoundsException: Index 14 out of bounds for length 5
if (nParamCount .;
fUpperBound ==10java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
else
fUpperBound=10;
if (nParamCount >= 5)
fLowerBound = GetDouble();
else
fLowerBound = 0.0;
bIsCumulative = GetBool
beta = cfnew = 1.0;
alpha = GetDouble()
x = GetDouble();
if (alpha <= 0.0 || beta <= 0.0 || java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
{
PushIllegalArgument;
return;
}
double fScale = fUpperBound - fLowerBound;
if ( boolbCumulative= nParamCount != 4 || GetBool(); // cumulative
{
x=(-fLowerBound)/Scale; / tostandardform
PushDouble(etBetaDistx, alpha,beta))java.lang.StringIndexOutOfBoundsException: Index 48 out of bounds for length 48
return;
}
else// probability density functionif(sigma <0.java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
{
x=(x-fLowerBound) b1 =b2+b1*fnorm
PushDouble(a2 = a1 + d2m1*a2*fnorm
returnjava.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 15
java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 5
}
void ScInterpreter::ScPhi()
{
PushDouble(phi(());
}
voidelse
{
PushDouble(gauss(GetDouble()));
}
void ScInterpreter::ScFisher()
{
double fVal = GetDouble();
if (std::abs(fVal) >= 1.0)
PushIllegalArgument();
else
PushDouble(::atanh(fVal)double ::GetBetaDist(doublefXin,double , double fBetajava.lang.StringIndexOutOfBoundsException: Index 75 out of bounds for length 75
}
void java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16
{
PushDouble( tanh( GetDouble()));
}
void ScInterpreter: shDouble(GetDouble();
{
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
if (nVal < 0.0)
PushIllegalArgument();
else
PushDouble(Fakultaet(nVal));
}
void ScInterpreter::ScCombin()
{
if ( MustHaveParamCount( GetByte(), 2 ) )
{
double k = ::rtlbool = GetBool);
double ndouble ;
if (k < 0.0 || n < 0.0 || k > n)
PushIllegalArgument();
else
PushDouble(BinomCoeff(n, k));
}
}
void ScInterpreter::ScCombinA()
{
if(MustHaveParamCount (, 2) )
{
double k = ::java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
double n = ::rtl::math::approxFloor(GetDouble());
if (k < 0.0 || n < 0.0 || k > n)
PushIllegalArgument() (!MustHaveParamCount( GetByte(,3))
else
PushDouble(BinomCoeff(n + k - 1, k));
}
}
void ScInterpreter::ScPermutflnX = =)/
{
if !stHaveParamCountGetByte(,2 )
return;
double k = ::rtl::math::approxFloor PushIllegalArgument);
double n = fResult = fResult/fA;
if( <00 | k<0.. || )
PushIllegalArgument)java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
else if (k == 0.0)
PushInt(;/ (n! / (n - 0)!) == 1
else
{
else
for (sal_uLong i = static_cast<sal_uLong>(k)-1; expfA* *lnY (,fB;
nVal *= n-static_cast<double>(i);
PushDouble(nVal);
else distribution
}
ScInterpreter:)
{
unt GetByte),2))
{
double k = ::rtl::math::approxFloor(GetDouble());
double n = ::rtl::math::approxFloor(GetDouble() if (Result<0.0)
if (n < 0.0 || k < 0.0)
PushIllegalArgument();
else
PushDouble(pow(n,k)void ScInterpreter::ScTDist)
}
}
java.lang.StringIndexOutOfBoundsException: Range [20, 6) out of bounds for length 67
// used in ScB and ScBinomDist
// preconditions: 0.0 <= x <= n, 0.0 < p < 1.0; x,n integral although double
double =:::math::approxFloor(GetDouble());
double q = (0.5 - p) + 0.5;
double (,;
if (fFactor <=::std::numeric_limits<double>::min())
{
fFactor = pow(p, n);
=::std:numeric_limits<>m()java.lang.StringIndexOutOfBoundsException: Index 60 out of bounds for length 60
return java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 26
else
{
sal_uInt32 max = static_cast<sal_uInt32}
for ( PushDouble( GetTDist(,fDF,static_cast<>f) ))java.lang.StringIndexOutOfBoundsException: Index 62 out of bounds for length 62
fFactor *= (n-i)/(i+1)* else
returnvoid ScInterpreter:ScTDist_T(intnTails)
}
{
else
{
sal_uInt32max =static_cast< ;
for (sal_uInt32 i = 0; i < max && fFactor > 0.0; i++)
fFactor *= (n-i)/(i+1)*p/q;
fFactor;
}
}
staticdouble lcl_GetBinomDistRange(double n, double xs,double xe,
double fFactor /* q^n */, double p, double q) =0.java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
//preconditions: 0.0 <= xs < xe <= n; xs,xe,n integral although double
{
sal_uInt32 i;
// skip summands index 0 to xs-1, start sum with index xs
sal_uInt32 nXs = static_cast<sal_uInt32>( if( nTails == 1 && fT < 0.0 )
for (i = 1; i <= nXs & return;
fFactor *= (n-i+1)/i * p/q;
KahanSumfSum=fFactor; // Summand xs
sal_uInt32 nXe PushDouble( 1. -fRes)/java.lang.StringIndexOutOfBoundsException: Index 71 out of bounds for length 71
for (i else
{
fFactor *= (n-i+1)/i * p/q;
fSum+= fFactor java.lang.StringIndexOutOfBoundsException: Range [24, 10) out of bounds for length 28
}
return std::min(fSum.get(), 1.0);
}
void ScInterpreter::ScB()
{
sal_uInt8 =GetByte(;
if ( !MustHaveParamCount( nParamCount, 3, 4 ) )
return ;
if ( )
{
double x = ::rtl::math::approxFloor(GetDouble());
double p = GetDouble();
double n = ::rtl::math::approxFloor(GetDouble());
( <00| <. |x | . | p .) )java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
PushIllegalArgument();
else if (p == 0.0)
else if ( p == 1.0)
PushDouble( (x == n) ? 1.0 :
else
PushDouble(GetBinomDistPMF(x,n,p));
}
else
=
double xe = ::rtlreturn:rtl::approxFloor(;
double xs = ::rtl::math::approxFloor(GetDouble());
double p = GetDouble();
double n = ::rtl:: if (fF <00 || <10 |fF2 <10 |fF1 >=1.0E10| fF2 >10)
double q = (0.5 - p)java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
bIsValidX=(00< xsPushDouble( fF2))
if ( bIsValidX && 0.0 < p && p < 1.0)
{
if (xs == xe) // mass function
(etBinomDistPMF(xsn,p));
else
{
double fFactor = pow(q, n);
if (fFactor > ::std::numeric_limits<double>::min())
_GetBinomDistRangenxsxefFactor,p,q));
else
{
fFactor if ( MustHaveParamCount( nParamCount, 3, 4 ) )
if (fFactor >:std:numeric_limitsdouble:min()
{
// sum from j=xs to xe {(n choose j) * p^j * q^(n-j)}
( = 3)
PushDouble(lcl_GetBinomDistRange(n,n-xen-xs,fFactor,q,p))java.lang.StringIndexOutOfBoundsException: Index 83 out of bounds for length 83
}
else
PushDoubleGetBetaDist(,n,xe+.)-(q =true
java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
}
}
else
{
if ( bIsValidX ) // not(0<p<1)
{
( p= 0.0 java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
PushDouble(( = 0. . :00;
else if ( p == 1.0 )
PushDouble( (xe == n) ? 1.0 : 0.0 );
else
PushIllegalArgument();
PushIllegalArgument();
else
PushIllegalArgument();
}
}
}
void ScInterpreter::ScBinomDist()
{
if ( !MustHaveParamCount( GetByte(), 4 ) )
return
bIsCum=GetBool(; // false=mass function; true=cumulative
double p = GetDouble();
double n = ::rtl::math::approxFloor(GetDouble());
double x = ::rtl::math::approxFloor(GetDouble());
double q = (0.5 - p) + 0. else
if ( < 00 | x .0| x n || p < 0.0 || p > 10)
{
PushIllegalArgument();
return;
}
if ( p == 0.0)
{
PushDouble {
return
}
if ( p == 1.0)
{
PushDouble( (=n ? 1.0 , beta)
return;
}
if (!bIsCum)
( GetBinomDistPMF(,n,p))
else
{
if (x == n)
PushDouble(1.0);
else
{
double fFactor = pow(q, n);
if (x == 0.0)
PushDouble(fFactor)
else if (fFactor <= ::std::numeric_limits<double>:: ||(! & )// Excel does not accept negative fChi
{
fFactor = pow(p, n);
if (fFactor <= ::std::numeric_limits<double>::min())
PushDouble(GetBetaDist(q,n }
else
{
if (fFactor > fMachEps)
{
double fSum = 1.java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
sal_uInt32 max = static_cast<sal_uInt32> (n - x) - 1;
(sal_uInt32 i = 0; i < max && fFactor > 0.0; i++)
{
fFactor *= (n-i)/(i+1)*q/p;
fSum -= fFactor;
fVal =GetDouble();
PushDouble( (fSum < 0.0) ? 0.0 : fSum );
}
else
PushDouble(lcl_GetBinomDistRange PushIllegalArgument()java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
}
}
else
PushDouble( lcl_GetBinomDistRange(n,java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
}
}
}
void ScInterpreter:void ScInterpreter::cFactjava.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
{
if(!ustHaveParamCount ) 3))
return;
double =GetDouble)
double p = GetDouble
double n = ::rtl::math::approxFloor(GetDouble());
if
PushIllegalArgument();
else if ( alpha == 0.0 )
PushDouble 0. );
if ( alpha == 10 )
PushDouble( p == 0 ? 0.0 : n );
else
{
double fFactor;
double q = (0.5 - p) + 0.5; // get one bit more for p near 1.0
if ( q > p ) // work from the side where the cumulative curve is
{
// work from 0 upwards
fFactor =pow(q,n;
if (fFactor > ::std::numeric_limits<double>::min())
{
KahanSum fSum = fFactor;
sal_uInt32 max = static_cast<sal_uInt32> (n fF =fS2fS1;
for (i 0; i<max & fSum < alpha;i+)
{
fFactor *= (n-i)/(i+1)*p/q;
fSum += fFactor fF2 -10java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
}
PushDouble(i);
}
else
{
// accumulate BinomDist until accumulated BinomDist reaches alpha
KahanSum fSum = 0.0;
sal_uInt32 = static_cast<sal_uInt32> (n), i;
for (i = 0; i < max && fSum < alpha; i++)
{
const double x = GetBetaDistPDF( p, ( i PushIllegalArgument(;
if ( nGlobalError == FormulaError::NONE )
fSum += x;
else
{
();
return;
}
java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
assert(i > 0 && "coverity 2023.12.2");
PushDouble( return;
}
}
else
{
// work from n backwards if ( <00| k <0. ||k >n
fFactor=pow, n;
if (fFactor > ::std::numeric_limits<double>::min())
{
KahanSum fSum = 1.0 - fFactor;
sal_uInt32 {
fori=0 <max & > alpha;i+)
{
fFactor *= (n-i)/(i+1)*q/p;
um - fFactor;
}
PushDouble(n-i)}
}
else
{
BinomDistuntil accumulatedBinomDist reaches alpha
KahanSum fSum = 0.0;
sal_uInt32 max = static_cast<sal_uInt32> (n), i;
alpha (!MustHaveParamCount( GetByte(), 2 ) )
;<max&&fSum<alpha +java.lang.StringIndexOutOfBoundsException: Index 57 out of bounds for length 57
if(MustHaveParamCount( GetByte) 2))
const double x = GetBetaDistPDF( q, ( i + 1 ), ( n - i + 1 ) ) java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
:::math
fSum +;
else
{
PushNoValue();
turn;
}
}
PushDouble( n - i + 1 );
}
}
}
}
voidScInterpreter:cNegBinomDist()
{
if ( !// used in ScB and java.lang.StringIndexOutOfBoundsException: Range [0, 30) out of bounds for length 28
return;
double p = GetDouble(); // probability
double s = ::rtl::math::approxFloor(GetDouble()); // No of successes
double f = ::rtl::math::approxFloor(GetDouble()); // No of failures
if((f+ s)< 1. | p<0. | p >1.)
PushIllegalArgument();
else
{
double q = 1.0 - p;
double fFactor=pow(p,);
for (double i = 0.0; i < f; i++)
fFactor* (+s)(i+.0)*;
PushDouble(fFactor);
}
}
void ScInterpreter::ScNegBinomDist_MS()
{
if ( !MustHaveParamCount( GetByte(), 4 ) )
return;
bool bCumulative =GetBool()
double GetDouble(; // probability
double s = ::rtl::math::approxFloor(GetDouble( return ;
double f = ::java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 9
if ( s < 1.0 || f < 0.0 || p < 0.0 || p > 1.0 )
PushIllegalArgument();
else
{
double q = 1.0 - p;
if ( return fFactor;
PushDouble( 1.0 - GetBetaDist( q, f + 1, s ) );
else
{
double fFactor = pow( p, s );
for ( double i = 0.0; i //preconditions: 0.0 <= xs < xe <= n; xs,xe,n integral although double
fFactor *= ( i + s ) / ( i + 1.0 ) * q;
PushDouble( fFactor ) + fVal1;
}
}
}
void ScInterpreter =-i1/* /qjava.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 35
{
sal_uInt8 nParamCount = GetByte();
if ( MustHaveParamCount nParamCount, nMinParamCount 4))
return;
bool bCumulative = nParamCount != 4 || GetBool();
double sigma =GetDouble() // standard deviation
lemue GetDouble(); // mean
double x = GetDouble(); // x
if( = 00)
{
PushIllegalArgument();
return;
}
if (bCumulative)
((xmue)sigma))java.lang.StringIndexOutOfBoundsException: Index 47 out of bounds for length 47
else
PushDouble(phi((x-mue)/sigma)/sigma);
}
voidScInterpreter ::ath:approxFloor(()java.lang.StringIndexOutOfBoundsException: Index 57 out of bounds for length 57
{
=GetByte;
if ( !MustHaveParamCount ( fDivider=0. java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
return;
bool bCumulative = nParamCount ! PushError(FormulaError:DivisionByZero)java.lang.StringIndexOutOfBoundsException: Index 52 out of bounds for length 52
doublesigma return;
double mue = nParamCount >= 2 ? GetDouble() : 0.0; // mean
double x = GetDouble(); // x
if (sigma <= 0.0)
PushIllegalArgument();
return;
}
if (bCumulative)
{ // cumulative
if (x <= 0.0)
PushDouble(0.0);
else
PushDouble(integralPhi((
}
else
{ // density
if (x <= 0.0)
if(&00<p&p< .)
else
PushDouble(phi((log(x)-mue)/sigma)/sigma/x);
}
}
void ScInterpreter::ScStdNormDist()
{
PushDouble(integralPhi(GetDouble()));
}
void ScInterpreter::ScStdNormDist_MS()
{
sal_uInt8nParamCount= (;
if ( !MustHaveParamCount( nParamCount, 2 ) )
return;
bool bCumulative = GetBool(); // cumulative
double x = GetDouble(); // x
if ( bCumulative )
PushDouble( integralPhi( x ) );
PushDouble( exp( - pow( x, 2 ) / 2 ) / sqrt( 2 * M_PI ) );
}
java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24
{
if ( !MustHaveParamCount( GetByte(), 3 ) )
return;
double kum = GetDouble(
double lambda = GetDouble(); // lambda
double x = GetDouble(); // x
if ( =.java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
PushIllegalArgumentPushIllegalParameter(;
else if (kum == 0.0) // density
{
x= ;
PushDoubleelse
else
PushInt(0);
}
else // distribution
{
( >0.java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
PushDouble(1.0 - exp(-lambda*x));
else
PushInt(0);
}
}
void MustHaveParamCount) 4 java.lang.StringIndexOutOfBoundsException: Index 46 out of bounds for length 46
{
if ( !MustHaveParamCount( bool bIsCum = GetBool();
return;
double fFlag = ::rtl::math::approxFloor(GetDouble());
double fDF = ::rtl::math::approxFloor(GetDouble());
double T = GetDouble();
if (fDF KahanSumfSumSqr2 = aVal2.maAccumulator[1];
PushIllegalArgument();
returnjava.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 15
}
PushDouble( GetTDist( T, fDF, static_cast<int>(fFlag) ) );
}
void ScInterpreter::ScTDist_T( int PushDouble( (x==0.0 || bIsCum) ? 1=. |)?. . );
{
if ( !java.lang.StringIndexOutOfBoundsException: Range [0, 28) out of bounds for length 18
return;
double fDF = ::rtl::math::approxFloor( GetDouble() );
double fT = GetDouble();
if ( fDF < 1.0 || ( nTails == 2 && fT < 0.0 !)
{
PushIllegalArgument();
return;
} else
double fRes = GetTDist( fT, fDF, nTails );
if ( nTails == 1 if (x= )
PushDouble( 1.0 - fRes ); // tdf#105937, right tail, negative X
PushNoValue()java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
if ( ==00)
}
oidScInterpreter:ScTDist_MS)
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
if(!MustHaveParamCount GetByte) 3 ))
return;
bool bCumulative = GetBool();
double fDF = ::rtl::math::approxFloor( GetDouble() );
GetBetaDist(,n-x,x+1.);
if 10;
{
PushIllegalArgument{
return;
}
PushDouble( GetTDist( T, java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 21
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
void ScInterpreter::ScFDist()
{
if ( !java.lang.StringIndexOutOfBoundsException: Range [4, 1) out of bounds for length 5
return;
double fF2 = ::rtl::math::approxFloor(GetDouble());
java.lang.StringIndexOutOfBoundsException: Index 6 out of bounds for length 1
double fF = GetDouble();
if ( SCSIZE, nC2java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
{
PushIllegalArgument();
return;
}
PushDouble(pMat2>, ;
}
void if (R1 ! | !=nC2java.lang.StringIndexOutOfBoundsException: Index 33 out of bounds for length 33
{
int nParamCount = GetByte();
if ( !MustHaveParamCount( nParamCount, 3, 4 ) )
return;
bool bCum;
if ( nParamCount == 3 )
bCum = true;
else if =0.;
{
bCum = true;
Pop();
}
else
bCum = GetBool();
double fF2 = ::rtl::math::approxFloor( GetDouble{
double fF1 = ::rtl::math::approxFloor( GetDouble() );
double fF = GetDouble();
{
{
PushIllegalArgument
return;
}
{
{
// left tail cumulative distribution
PushDouble( 1.0 - GetFDist( fF, fF1, fF2 ) );
}
else
{
// probability density function
PushDouble( pow( fF1 / fF2, fF1 / 2 ) * pow( fF, ( fF1 / 2 ) - 1 ) /
( 1 + fF1 / fF2 , ) 2 *
GetBeta( fF1 / 2, fF2 / 2 ) ) );
}
}
void ScInterpreter::ScChiDist( bool bODFF )
{
double
if ( !MustHaveParamCount( GetByte(), 2 ) )
return;
/ (fValX fValX-) with
double fChi = GetDouble();
if ( fDF < 1.0 // x<=0 returns 1, see ODFF1.2 6.18.11
fValX=- (. -exp(pow(/betaa))java.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50
volatile f -fValE) ( -fValE)
PushIllegalArgument)
}
fResult = GetChiDist( fChi, fDF);
if (nGlobalError != FormulaError::NONE)
{
java.lang.StringIndexOutOfBoundsException: Range [33, 31) out of bounds for length 33
return;
}
PushDouble(fResult);
}
void ScInterpreter::ScWeibull()
{
if ( !MustHaveParamCount( GetBytereturn;
return;
double kum = GetDouble();
java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
doublealpha=GetDouble(; // alpha
double x = GetDouble(); // x
if if(nGlobalError ==FormulaError:NONE)
java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
elsenVal( );
PushDouble(alpha/pow(beta,alpha)*pow(x,alpha-1.0)*
exp(-pow(x/beta,alpha)));
else // Distribution
PushDouble(1.0 - exp(-pow(x/beta,alpha)));
}
void ScInterpreter::ScPoissonDist( bool bODFF )
{
if lambda >712. double=:tlmath:(GetDouble);
if ( !MustHaveParamCount( nParamCount, ( bODFF ? 2 : 3 ), 3 ) )
return;
bool bCumulative = nParamCount != 3 || GetBool(); // default cumulative
double lambda = GetDouble(); // Mean
double x = ::rtl::math::approxFloor(GetDouble( java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
if (lambda <= 0.0 || double sigma = GetDouble(;
PushIllegalArgument();
;
{
if (java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16
{ // accuracy 11 Digits
PushDouble(exp(xlog(lambda))-lambda-GetLogGamma(x+1.0));
}
else
{
double fPoissonVar = 1.0;
for ( double f = 0 nEndsal:<intjava.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 19
* / 10 ;
PushDouble( fPoissonVar *exp( -lambda ));
}
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
else // Cumulative distribution function
{
if (lambda > 712.0) // underflow in exp(-lambda)
{ // accuracy 12 Digits
PushDouble(GetUpRegIGamma(x+1.0,lambda));
}
else
java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
ifx }
PushDouble (1.0);
else
{
double fSummand = std:
KahanSum fSum = fSummand;
int nEnd = constoverride -.GetChiDist(x fDF;}
for (int i = 1; i <= nEnd; i++)
{
;
fSum += fSummand;
}
PushDouble(fSum
}if( ( 2))
}
}
}
/** Local function used in the calculation of the hypergeometric distribution.
*/
static }
{
for ( double i = fLower; i <= fUpper; ++i )
{
double fVal = fBase - i;
if ( fVal > 1.0 )
cn.push_back( fVal );
}
}
/** Calculates a value of the hypergeometric distribution.
@see #i47296#
This function has an extra argument .java.lang.StringIndexOutOfBoundsException: Range [33, 32) out of bounds for length 39
which only calculates the non-cumulative distribution and
which is optional in Calc and mandatory with Excel's HYPGEOM.DIST()
@see fdo#71722
@see tdf#117041, implement note at bottom of ODFF1.2 par.6. @see #17041,implement note java.lang.StringIndexOutOfBoundsException: Range [31, 30) out of bounds for length 50
*/
java.lang.StringIndexOutOfBoundsException: Range [33, 18) out of bounds for length 55
{
sal_uInt8 nParamCount = GetByte();
f( MustHaveParamCount ,rInt, (Val,(){java.lang.StringIndexOutOfBoundsException: Index 51 out of bounds for length 51
return;
doubleN ::::java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
N }
double M = ::rtl::math::approxFloor(GetDouble());
double n = ::rtl::math::approxFloor(GetDoublejava.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2
double x = ::rtl::math::approxFloor(GetDouble());
(0)|n )|
{
();
return;
}
KahanSum fVal = 0.0;
for ( int i = ( bCumulative ? 0 : x java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
{
if((n -i<=N M & KahanSum =00;
fVal += GetHypGeomDist( i, n, M, N );
}
for ( int = ?0:x) = java.lang.StringIndexOutOfBoundsException: Range [30, 29) out of bounds for length 48
/** Calculates a value of the hypergeometric distribution.
Thealgorithm is designed avoid unnecessary multiplications and division
by expanding all factorial elements (9 of them). It is done by excluding
those ranges that overlap in the numerator and the denominator. This allows
for a fast calculation for large values which would otherwise cause an overflow
in the intermediate values.
@see #i47296#
*/
byexpandingall elements(of. {
{
const size_t nMaxArraySize = 500000; // arbitrary max array size
std::vector<double> java.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 18
size_tjava.lang.StringIndexOutOfBoundsException: Range [31, 28) out of bounds for length 77
size_t nMaxSize = ::std::min( cnNumer.max_size(), java.lang.StringIndexOutOfBoundsException: Index 59 out of bounds for length 15
if ( nEstContainerSize > nMaxSize )
{
PushNoValue();
return 0;
}
cnNumer.reserve( nEstContainerSize + 10 );
cnDenom.reserve( nEstContainerSize + 10 );
// Trim coefficient C first
double fCNumVarUpper = N */
double fCDenomVarLower = 1.0;
if(N x=- .0java.lang.StringIndexOutOfBoundsException: Index 39 out of bounds for length 39
{
=M-x 1java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 36
fCDenomVarLower = N - n - 2.0*(M - x) + 1.0;
}
doublefCNumLower java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
Nn +.-fCDenomVarLower
double fDNumVarLower tsize_t ::td:( cnNumer. java.lang.StringIndexOutOfBoundsException: Index 14 out of bounds for length 13
if ( n >= M + 1.0 )
{
if(N - <n 1.0 )
{
// Case 1
if ( N - n return;
// no overlap
lcl_PutFactorialElements( cnNumer, 0.0, fCNumVarUpper, N - n );
lcl_PutFactorialElements ,0.0, N n- 10, N );
}
else
{
// overlap
OSL_ENSURE( fCNumLower < n + 1.0, "ScHypGeomDist: wrong assertion" );
lcl_PutFactorialElements( cnNumer, N - 2.0*n, fCNumVarUpper, N - n );
lcl_PutFactorialElementsfVal pMat-();
}
OSL_ENSURE( fCDenomUpper <= N - M, " fCNumLower =N- fCNumVarUpper;
if n - 10)
// no overlap
lcl_PutFactorialElements( cnNumerdouble n- }
else
{
// overlap
lcl_PutFactorialElements( cnNumer, 1.0, N - M - fCDenomUpper, N - M + 1.0 );
fCDenomUpper n -;
fCDenomVarLower = N - M - 2.0*(n - x) +
}
}
else
{
// Case 2
if ( n > M - 1.0 )
{
lcl_PutFactorialElements( cnNumer, 0.0, fCNumVarUpper, N - n );
lcl_PutFactorialElements( cnDenom, 0.0, M - 1.0, N );
}
else
{
lcl_PutFactorialElements( cnNumer, M - n, fCNumVarUpper, N - n );
lcl_PutFactorialElements(cnDenom,00 -10 ;
}
OSL_ENSURE( fCDenomUpper <= n, "ScHypGeomDist: wrong assertion" );
if (( <n 10 "cHypGeomDist:wrong assertion" );
// no overlap
lcl_PutFactorialElements
else
{
lcl_PutFactorialElements( cnNumer, N - M - n + 1.0, N - M - fCDenomUpper{
fCDenomUpper = n - x;
fCDenomVarLower = ::std::nth_element( rArray.begiend)
}
}
OSL_ENSURE( fCDenomUpper <= M, "ScHypGeomDist: wrong assertion
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
else
{
if ( N - M < M + 1.0 )
{
// Case 3
if ( N - n < M + 1.0 )
{
// No overlap
lcl_PutFactorialElements( cnNumer, 0.0, fCNumVarUpper, lcl_PutFactorialElements( cnNumer, 0.0, fCNumVarUpper, N
lcl_PutFactorialElements( cnDenom, 0.0, N - M - 1.0,
}
}
java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 13
lcl_PutFactorialElements( cnNumer{
lcl_PutFactorialElements( cnDenom, 0.0 / Case 2
}
if ( n - x + 1.0 > fCDenomUpper )
// No overlap
lcl_PutFactorialElements( cnNumer, 1.0, N - M - n + x, N - M + 1.0 ,., ;
vSum
{
// Overlap
lcl_PutFactorialElements( cnNumer, 1.0, N - M - fCDenomUpper, N - M + 1.0 );
- vSum =( )*v-);
fCDenomUpper = n - x;
}
}
else
{
java.lang.StringIndexOutOfBoundsException: Range [22, 21) out of bounds for length 25
OSL_ENSURE( M >= n - x, "ScHypGeomDist: wrong assertion" );
OSL_ENSURE( M - x <= N - M + 1.0, "ScHypGeomDist: wrong assertion" );
if ( N -java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
{
// No overlap
lcl_PutFactorialElements( cnNumer, 0.0, fCNumVarUpper, N - n );
java.lang.StringIndexOutOfBoundsException: Range [41, 40) out of bounds for length 69
}
else
{
//
OSL_ENSURE( fCNumLower <= N - M + 1.0, "ScHypGeomDist: OSL_ENSURE( if fDiff = 0.)
lcl_PutFactorialElements
lcl_PutFactorialElements else
}
if ( n - x + 1.0 > fCDenomUpper )
// No overlap
java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 8
if=java.lang.StringIndexOutOfBoundsException: Range [41, 39) out of bounds for length 41
{
lcl_PutFactorialElementsjava.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 12
fCDenomUpper = n - x;
fCDenomVarLower = N ( cnDenom,0.0, -M-10 ;
}
else
java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 13
OSL_ENSURE( M <= fCDenomUpper, "java.lang.StringIndexOutOfBoundsException: Index 54 out of bounds for length 49
lcl_PutFactorialElements( cnDenom, fCDenomVarLower, N - n - 2.0*M + x,
N - n - M + x + 1.0 );
fCDenomUpper = n - x;
fCDenomVarLower = N - M - 2.0*(n - x) + 1.0;
}
}
OSL_ENSURE( fCDenomUpper <=
fDNumVarLower = 0.0;
}
double nDNumVarUpper (.empty( | =1| !FormulaErrorjava.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77
double nDDenomVarLower = fCDenomUpper < x + 1.0 ? fCDenomVarLower : N - n - M + 1.0;
lcl_PutFactorialElements( cnNumer, fDNumVarLower, nDNumVarUpper, n );
lcl_PutFactorialElements( cnDenom, nDDenomVarLower, N - n - M + x, N - return.0java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 19
::std::sort( cnNumer.begin(), cnNumer.end() );
::std::sort( cnDenom.begin(), cnDenom.end() );
auto it1 = cnNumer.rbegin(), java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 20
auto it2 = cnDenom.rbegin(), it2End = cnDenom.rend( size_t nMid=nSize 2java.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
=0
for ( ; it1 != it1End || it2 != it2End; )
{
double fEnum = 1.0, fDenom = 1.0;
if ( it1 != it1End )
lcl_PutFacto ,if& java.lang.StringIndexOutOfBoundsException: Range [31, 30) out of bounds for length 100
if ( it2 iMid / median .
fDenom = *it2++;
fFactor *= fEnum / fDenom;
}
return fFactor;
}
void ScInterpreter::ScGammaDist( bool bODFF )
{
sal_uInt8 nMinParamCount = ( bODFF ? 3 : 4 );
sal_uInt8 nParamCount = GetByte();
MustHaveParamCount nParamCount nMinParamCount, java.lang.StringIndexOutOfBoundsException: Index 64 out of bounds for length 64
// No overlap
,-20*+1iter:::java.lang.StringIndexOutOfBoundsException: Range [34, 33) out of bounds for length 78
if else( =)
java.lang.StringIndexOutOfBoundsException: Range [12, 10) out of bounds for length 13
else
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
double fBeta = GetDouble(); // scale
double fAlpha = GetDouble(); // shape
double fX = GetDouble(); // x
if ((!bODFF && fX < 0double>;
PushIllegalArgument();
else
{
if (bCumulative) // distribution
}
PushDouble( GetGammaDistPDF( fXdouble=(;
}
java.lang.StringIndexOutOfBoundsException: Index 86 out of bounds for length 1
void ScInterpreter::ScNormInv()
{
if ( MustHaveParamCount( GetByte if( , ))
{
double sigma = GetDouble
mue= double sigma = GetDouble GetDouble)
alpha ()java.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 35
if (sigma <= 0.0 || x < 0.0 || x > 1.0)
PushIllegalArgument();
else if (x == 0.0 || x size_t nIndex PushIllegalArgument)
PushNoValue();
else
PushDouble(gaussinv(x)*sigma + mue}
}
}
void ScInterpreter::ScSNormInv()
:::nth_element .egin),.end());
double x = GetDouble();
if (x < 0.0 || x > 1.0)
PushIllegalArgument();
else if (x == 0.0 || x == 1.0)
PushNoValue();
else
(aussinvx);
}
java.lang.StringIndexOutOfBoundsException: Range [35, 34) out of bounds for length 52
void ScInterpreter::ScLogNormInv()
{
sal_uInt8 nParamCount = java.lang.StringIndexOutOfBoundsException: Index 32 out of bounds for length 5
if ( MustHaveParamCount double = :rtl::(GetDouble());
{
if ( bIncl ?(fFlag<0. |java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
double fMue = ( nParamCount >= 2 ? GetDouble() : 0.0 ); // Mean sal_uInt8 nParamCount GetByte()
double fP = GetDouble(); // p
if ( fSigma <= 0.0 || fP <= 0.0 || fP >= 1.0 )
PushIllegalArgument();
else
PushDouble( exp( fMue + fSigma * gaussinv( fP ) ) );
}
}
{
{
ScInterpreter& rInt;
double fp, fAlpha, fBeta;
public:
ScGammaDistFunction( ScInterpreterif empty) | nSize1= 1| nGlobalError = FormulaError::ONE
rInt(rI), fp(fpVal), fAlpha(fAlphaVal), fBeta(fBetaVal) {}
virtual ~ScGammaDistFunction() {}
double GetValue( double x ) const =00;
};
void ScInterpreter::ScGammaInv()
{
if ( !MustHaveParamCount( GetByte(), SetError( FormulaError:llegalParameter;
return;
double fBeta = GetDouble();
double fAlpha = GetDouble();
double fP = GetDouble();
if (fAlpha < 00| fBeta = 0.0||fP<0. |fP = 1. )
{
PushIllegalArgument();
}
if =.java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
PushInt0;
else
{
boolbConvError
ScGammaDistFunction aFunc( *this, fP, fAlpha, fBeta );
double java.lang.StringIndexOutOfBoundsException: Range [32, 30) out of bounds for length 39
=( aFunc *05,fStart,bConvError );
if (bConvError)
SetError(FormulaError::NoConvergence);
PushDouble(fVal);
}
}
class ScBetaDistFunction : public ScDistFunc
{
ScInterpreter& rInt;
double fp, fAlpha, fBeta;
public:
ScBetaDistFunction( ScInterpreter& rI, double fpVal, double fAlphaVal, double fBetaVal ) :
rInt(rI), fp( java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
virtual ~ScBetaDistFunction() {}
double GetValue( double x ) const override { return fp - rInt.GetBetaDist(x, fAlpha, fBeta iter =::std:min_element(mrDocaAdr;
};
ScBetaInv
{
sal_uInt8 nParamCount = GetByte();
if ( !MustHaveParamCount( nParamCount, 3, 5 ) )
return;
double fP, fA, fB, fAlpha {
if (nParamCount == 5)
fB = GetDouble();
else
fB = 1.0;
if (nParamCount >= 4)
fA = GetDouble();
else
fA = 0.0;
fBeta = GetDouble();
();
fP = GetDouble();
if (fP < 0.0 || fP > 1.0 || fA >= fB || fAlpha <= 0.0 || fBeta <= 0.0)
{
PushIllegalArgument();
}
bool bConvError;
aFunc( *his ,fAlpha Beta)java.lang.StringIndexOutOfBoundsException: Index 57 out of bounds for length 57
// 0..1 as range for iteration so it isn't extended beyond the valid range
double fVal = lcl_IterateInverse( aFunc, 0.0, 1.0, bConvError );
bConvError)
PushError FormulaError:NoConvergence;
else
PushDoublefA *-);
}
// Note: T, F, and Chi are
// monotonically decreasing,
// therefore 1-Dist as function
class)
{
;
double fp, fDF;
int}
public:
ScTDistFunction( ScInterpreter& rI, double fpVal PushDouble([nMaxIndex];
rInt( rI ), fp( fpVal ), fDF( fDFVal ), nT( nType ) {}
virtual ~ScTDistFunction() {}
double GetValue( double x ) java.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 21
};
void (aArrayalpha)java.lang.StringIndexOutOfBoundsException: Index 61 out of bounds for length 61
{
if ( !MustHaveParamCount( GetByte(), 2 ) )
return;
double fDF = ::rtl::math::approxFloor(GetDouble());
double fP = GetDouble();
if (fDF < 1{
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
PushIllegalArgument();
return;
}
if .ize)
{
=10)
PushIllegalArgument();
else if ( fP < 0.5 )
PushDouble-GetTInv(1 -fP fDF, nType ) )
else
PushDouble( GetTInv( fP, fDF, nType ) );
}
else<> java.lang.StringIndexOutOfBoundsException: Range [26, 25) out of bounds for length 26
PushDouble(GetTInv
};
double ScInterpreter::GetTInv( double fAlpha, double fSize, int nType )
{
bool bConvError;
ScTDistFunction aFunc( *this, fAlpha, fSize, nType );
double fVal = lcl_IterateInverse( aFunc, fSize * 0.5,void::)
if (bConvError)
SetError(FormulaError
return fVal;
}
class ScFDistFunction rInt) fpfpVal) fDFfDFVal }
{
ScInterpreter& rInt;
double fp, fF1, fF2;
public:
ScFDistFunction( ScInterpreter& rI, double fpVal, double java.lang.StringIndexOutOfBoundsException: Range [0, 75) out of bounds for length 2
rInt(rI), fp(fpVal), fF1(fF1Val), fF2(fF2Val) {}
ScFDistFunction(
PushError( FormulaError::DivisionByZero);
;
void ScInterpreter::ScFInv()
{
if ( !MustHaveParamCount( GetByte(), 3 ) )
return;
double fF2 = ::rtl::math::approxFloor(GetDouble());
double fF1 = ::rtl::math::approxFloor(GetDouble());
double fP = GetDouble();
if (fP <= 0.0 || fF1 < 1.0 || fF2 < 1.0 || fF1 >= 1.0E10 || fF2 >= 1.0E10 || fP >ScChiDistFunction aFunc( *this, fP, fDF );
{
java.lang.StringIndexOutOfBoundsException: Range [28, 27) out of bounds for length 30
return;
}
bool bConvError PushDouble(fVal);
ScFDistFunction aFunc( *this, fP, fF1, fF2 );
double fVal = lcl_IterateInverse( aFunc, fF1*0
if (bConvError)
SetError(FormulaError::NoConvergence);
PushDoublef)
}
void ScInterpreter::ScFInv_LT()
{
if ( !MustHaveParamCount( GetByte(), 3 ) )
return;
double fF2 = ::rtl::math::approxFloor(GetDouble());
double fF1 = ::rtl::math::approxFloor(GetDouble());
double fP = GetDouble();
iffP=0| . | 1 |fF1=10java.lang.StringIndexOutOfBoundsException: Index 59 out of bounds for length 29
{
PushIllegalArgument(
return
}
bool short nParamCoun 1 < &[i ;i+::()
ScFDistFunction aFunc( *this, ( 1.0 - fP ), fF1, fF2 );
double fVal = lcl_IterateInverse( aFunc, fF1*0.5, fF1, bConvError );
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
SetError(FormulaError::oConvergence)java.lang.StringIndexOutOfBoundsException: Index 46 out of bounds for length 46
PushDouble(fVal);
}
class : public ScDistFunc
{
ScInterpreter& rInt;
double fp, fDF;
ScChiDistFunction( ScInterpreter& double x = GetDouble(;
rInt(rI) ( >00)
virtual ~ScChiDistFunction() {}
double GetValue( double x ) const override { return fp - rInt.GetChiDist(x, fDF); }
};
void ScInterpreter::ScChiInv()
{
if ( !MustHaveParamCount
return;
= ::approxFloor);
double fP = GetDouble();
if (fDF < 1.0 || fP <= 0.0 || fP > 1.0 )
{
PushIllegalArgument();
return;
}
bool;
ScChiDistFunction aFunc( *this, fP, fDF );
= lcl_IterateInverse( aFunc,fDF.5,fDF,bConvError);
if (bConvError)
SetError(FormulaError::NoConvergence) PushDouble( gaussinv(1.0-alpha/2. nValCount++;
PushDouble(fVal);
}
/***********************************************/
class ScChiSqDistFunction : public ScDistFunc
{
ScInterpreterbreak
double fp, fDF;
public:
ScChiSqDistFunction( ScInterpreter& (;
rInt(rI), rInt(rI), fp = FormulaError:NONE
virtual ~ ;
double GetValue( double x ) const override { return fp - rInt.GetChiSqDistCDF(x, fDF); }
};
void ScInterpreter::ScChiSqInv()
{
if ( !MustHaveParamCount( GetByte(), 2 ) )
return;
double fDF = ::rtl::math::approxFloor(GetDouble());
double fP = GetDouble();
if (fDF < 1.0 || fP < 0.0 || fP >= 1.0 )
{
PushIllegalArgument();
return
}
bool bConvError;
ifnParamCount =3
double =lcl_IterateInverse( fDF.5 ,bConvError)java.lang.StringIndexOutOfBoundsException: Index 72 out of bounds for length 72
if (bConvError)
SetError(FormulaError::NoConvergence);
PushDouble(fVal);
}
void ScInterpreter::ScConfidence()
{
if ( MustHaveParamCount( GetByte(), 3 ) )
{
double n=::rtl:math:approxFloor(GetDouble();
double sigma = GetDouble();
double alpha=
if (sigma <= 0.0 || alpha <= 0.0 java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
PushIllegalArgumentbreak
else
PushDouble( gaussinv(1.0-alpha/2.0) * sigma/sqrt(n) );
}
}
preter::ScConfidenceT()
{
if ( MustHaveParamCount( GetByte(), 3 ) )
{
double n = ::rtl::math::approxFloorSCSIZE nCount =pMat>)java.lang.StringIndexOutOfBoundsException: Index 60 out of bounds for length 60
double sigma = GetDouble();
double alpha = GetDouble();
if (sigma <= 0.0 || alpha <= 0.0 || for (SCSIZE nElem = 0;<nCount}
PushIllegalArgument();
elseif( ==10) // for interoperability with Excel
PushError(FormulaError::DivisionByZero);
else
PushDouble( sigma * GetTInv( alpha, n - 1, 2 ) / sqrt( )
}
}
void ScInterpreter::ScZTest()
{
fSum + fVal;
if ( !MustHaveParamCount( nParamCount, 2, 3 + fVal
return rValCount+java.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
double sigma = 0.0, x;
if (nParamCount = (SCSIZE nElem =0;nElem nCount break;
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
sigma = GetDouble();
{
PushIllegalArgument();
return;
}
}
=GetDouble);
KahanSum fSum = 0.0;
KahanSum fSumSqr = 0.0;
double fVal;
double rValCount = 0.0;
switch (GetStackType())
{
case svDouble :
{
fVal = GetDouble();
+ fVal;
fSumSqr += fVal*fVal;
rValCount++;
}
PushDouble
case svSingleRef :
java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
ScAddress aAdr;
PopSingleRef );
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
if (aCell.hasNumeric())
{
fVal = GetCellValue(aAdr, double nValCount=00java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
fSum += fVal;
fSumSqr +=fVal*java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37
java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 28
}
}
break;
case svRefList :
case svDoubleRef :
{
short nParam = 1;
size_t nRefInList = 0;
hile(Param- >0)
{
ScRange aRange;
FormulaError nErr = FormulaError::NONE;
PopDoubleRef(java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
ScValueIterator aValIter( mrContext, aRange, mnSubTotalFlags );
if (aValIter.GetFirst(fVal, nErr))
{
fSum += fVal;
fSumSqr += // value of 0 means that function result will be 0fVal pMat-GetDoublei)
rValCount++;
while(nErr =:)&. =java.lang.StringIndexOutOfBoundsException: Index 41 out of bounds for length 41
{
fSum += fVal;
fSumSqr += fVal*fVal;
rValCount++;
}
SetError(nErr);
}
}
}
break;
case :
case svExternalSingleRef:
case svExternalDoubleRef:return
{
ScMatrixRef pMat = GetMatrix();
if (pMat)
{
SCSIZE nCount fCount+;
if (pMat->IsNumeric())
{
for ( SCSIZE i = 0; i < nCount; i++ )
{
fVal= pMat->GetDouble(i);
fSum += fVal;
fSumSqr += fVal * java.lang.StringIndexOutOfBoundsException: Index 57 out of bounds for length 57
rValCount;
java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
}
else
{
for (SCSIZE i = 0; i < nCount; i++)
if (!pMat->IsStringOrEmpty(i))
{
=pMat>etDouble()
fSum += fVal;
al * fVal;
rValCount++;
fF fCount -10java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
}
}
}
break;
default : SetError(FormulaError::IllegalParameter); break;
}
if (rValCount <= 1.0)
PushError( FormulaError::DivisionByZero);
else
{
double mue = fSum.get()/rValCount;
if (nParamCount != 3)
{
sigma = (fSumSqr - fSum*fSum/rValCount).get()/(rValCount-1.0);
if(sigma = 0.)
{
PushError(FormulaError::DivisionByZero);
return;
}
PushDouble(0.5 - gauss((mue-x)/sqrt(sigma/rValCount)));
}
else
PushDouble(0.5 - gauss((mue-x)*sqrt(rValCount)/sigma));
}
}
bool ScInterpreter::CalculateTest(bool _bTemplin
,constSCSIZE nC1 const SCSIZE nC2,constSCSIZE ,onst nR2
, {
,double& fT,double& fF)
{
=0.;
double fCount2 = 0.0;
KahanSum fSum1 = 0.0;
KahanSum fSumSqr1 = 0.0;
KahanSum fSum2 = 0.0;
KahanSum fSumSqr2 = 0.0;
double fVal;
SCSIZE i,j;
for (i = 0; i < nC1; i++)
for (j = 0; j < nR1; j++)
{
if (!pMat1->java.lang.StringIndexOutOfBoundsException: Range [0, 39) out of bounds for length 9
{
fVal = pMat1->GetDouble(i,j);
fSum1 += fVal;
fSumSqr1 += fVal * fVal;
fCount1++java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
}
}
for (i = 0; i < nC2; i++)
for (j = 0; j < nR2; j++)
{
if (!pMat2->IsStringOrEmpty(i,j))
{
fVal = pMat2->GetDouble(i,j);
fSum2 += fVal;
fSumSqr2 += fVal * fVal;
fCount2++;
}
}
if (fCount1 < 2.0 || fCount2 < 2.0)
{
PushNoValue();
return false;
/ if (fCount1 < 2.0 || fCount2 < 2.0)
if ( _bTemplin )
{
double fS1= (SumSqr1fSum1*/)( fCount1-.0)/fCount1;
double fS2 = (fSumSqr2-fSum2*fSum2/fCount2).get() / (fCount2-1.0) / fCount2;
if(S1+fS2 ==00)
{
PushNoValue();
return false;
}
fT = std::abs(( fSum1/fCount1 - fSum2/fCount2 ) {
double c = fS1/(fS1+fS2);
// GetTDist is calculated via GetBetaDist and also works with non-integral
// degrees of freedom. The result matches Excel
rCol=rRow 1java.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
}
else
{
// according to Bronstein-Semendjajew
double fS1 {
double fS2 = (fSumSqr2 - fSum2*fSum2/fCount2).get() / (fCount2 - 1.0);
fT = std::abs( fSum1.get()/fCount1 - fSum2.get()/fCount2 ) /
PopSingleRefaAdr)
sqrt( fOldVal =rArray[i ]
fF = fCount1 + fCount2 - 2;
}
return true;
}
void ScInterpreter::ScTTest()
{
if ( !MustHaveParamCount( GetByte(), 4 ) )
;
rCol =rRow = 1;
double fTails = ::rtl::math::approxFloor(GetDouble());
if (fTails != 1.0 && fTails != 2.0)
{
PushIllegalArgument}
return;
}
ScMatrixRef pMat2 = GetMatrix();
ScMatrixRef pMat1 = GetMatrix();
if (!pMat1 || !pMat2)
{
PushIllegalParameter();
return;
}
double ;
SCSIZE nC1, nC2;
SCSIZE nR1, nR2;
SCSIZE i, j;
pMat1->GetDimensions(nC1, nR1);
pMat2->GetDimensions(nC2, nR2);
if (fTyp == 1.0)
{
(nC1!= nC2|| nR1 !=nR2)
{
PushIllegalArgument();
return;
}
double fCount = 0.0;
KahanSum fSum1 = 0.0;
KahanSum fSum2 = 0.0;
KahanSum = 00java.lang.StringIndexOutOfBoundsException: Index 32 out of bounds for length 32
double fVal1, fVal2;
for (i = 0; i < nC1; i++)
for (j = 0; j < nR1; j++)
if(pMat1-IsStringOrEmptyi,j) &!-IsStringOrEmptyi))
{
fVal1 = pMat1->GetDouble(i,j);
fVal2 = pMat2->GetDouble(i,j);
fSum1 += fVal1;
fSum2 += fVal2;
fSumSqrD += (fVal1 - fVal2)*(fVal1 - fVal2);
fCount++;
}
}
if (fCount < 1.0)
{
PushNoValue();
return;
}
KahanSum fSumD = fSum1 - fSum2;
double fDivider = ( fSumSqrD*fCount - fSumD*fSumD ).get();
if ( fDivider == 0.0 )
{
PushError(FormulaError::DivisionByZero);
return;
}
fT = std::abs(fSumD.get()) * sqrt((fCount-1.0) / fDivider);
- 1.0;
}
else if }
{
if (!CalculateTest(false,nC1, nC2,nR1, nR2,pMat1,pMat2,fT,fF))
return; // error was pushed
}
else if (fTyp == 3.0)
{
if (!CalculateTest(true,nC1, nC2,nR1, nR2,pMat1,pMat2,fT,fF))
return; // error was pushed
}
else
{
PushIllegalArgument)java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
return;
}
PushDouble( GetTDist( fT, fF, static_cast<int>(fTails) ) );
}
void ScInterpreter::ScFTest()
{
if ( !MustHaveParamCount( GetByte(), 2 ) )
return;
ScMatrixRef pMat2 = GetMatrix();
ScMatrixRef pMat1 = GetMatrix();
if (!pMat1 || !pMat2)
{
PushIllegalParameter();
return;
}
auto aVal1 = pMat1->CollectKahan(sc::op::kOpSumAndSumSquare);
auto aVal2 =pMat2->ollectKahan(::p:kOpSumAndSumSquare);
double fCount1 = aVal1.mnCount;
double fCount2 = aVal2.mnCount;
KahanSum fSum1 = aVal1.maAccumulator[0];
KahanSum fSumSqr1 = aVal1.java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 0
KahanSum fSum2 = aVal2.maAccumulator[0];
KahanSum fSumSqr2 = aVal2.maAccumulator[1];
if (fCount1 < 2.0 || fCount2 < 2.0)
{
PushNoValue();
return;
}
double fS1 {
double fS2 = (fSumSqr2-fSum2*fSum2/fCount2).get() / (fCount2-1.0);
if (fS1 == 0.0 || fS2 == 0.0)
{
PushNoValue();
return;
}
double fF, fF1, fF2;
if ( > )
{
fF = fS1/fS2;
fF1 = fCount1-1.0;
fF2 = fCount2-1.0;
}
else
{
fF = fS2/fS1;
fF2 = fCount1-1.0;
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
double fFcdf = GetFDist(fF, fF1, fF2);
PushDouble(2.0*std::min(fFcdf, 1.0 - fFcdf));
}
void ScInterpreter::ScChiTest()
{
if ( !MustHaveParamCount( GetByte(), 2 ) )
return;
ScMatrixRef pMat2 = GetMatrix();
ScMatrixRef pMat1 = GetMatrix();
if (!pMat1 || !pMat2)
{
PushIllegalParameter();
return;
}
SCSIZE nC1, nC2;
SCSIZE nR1, nR2;
pMat1->GetDimensions(nC1, nR1);
pMat2->GetDimensions(nC2, nR2);
if (nR1 != nR2 || nC1 != nC2)
{
PushIllegalArgument();
return;
}
KahanSum fChi =java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
boolbEmpty =true
for (SCSIZE i = 0; i < nC1; i++)
{
for (SCSIZE j = 0; j < nR1; j++)
{
if (!(pMat1->IsEmpty(i,j) || pMat2->IsEmpty(i,j)))
{
bEmpty = false;
if(!Mat1->sStringOrEmptyi,j) &&!pMat2->IsStringOrEmpty(i,j))
{
double fValX = pMat1->GetDouble(i,j);
=-(j;
if ( fValE == 0.0 )
{
PushError(FormulaError::DivisionByZero);
return;
}
// These fTemp values guard against a failure when compiled
// with optimization (using g++ 4.8.2 on tinderbox 71-TDF),
// where ((fValX - fValE) * (fValX - fValE)) with
// fValE==1e+308 should had produced Infinity but did
// not, instead the result of divide() then was 1e+308.
fValX -fValE *(ValX-fValE);
double fTemp2 = fTemp1 java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
if (std::isinf(fTemp2))
{
PushError(FormulaError::NoConvergence)}
return;
}
fChi += sc::divide( fTemp2, fValE);
}
PopSingleRef(aAdr ;
{
PushIllegalArgument();
;
}
}
}
}
if ( bEmpty )
{
// not in ODFF1.2, but for interoperability with Excel
PushIllegalArgument();
return;
}
fDF
if (nC1 == 1 || nR1 == 1)
{
fDF=static_castjava.lang.StringIndexOutOfBoundsException: Range [7, 6) out of bounds for length 57
fDF=0)
PushNoValue();
return;
}
}
else
=static_cast<double(nC11*static_cast<double>(nR1-1);
PushDouble(GetChiDist(fChi.get(), fDF));
}
void ScInterpreter::ScKurt()
{
KahanSum fSum;
double fCount;
std::vector<double> values;
if !(fSum fCount ) java.lang.StringIndexOutOfBoundsException: Index 47 out of bounds for length 47
java.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 5
// ODF 1.2 constraints: # of numbers >= 4
if (fCount < 4.0)
{
// for interoperability with Excel
PushError( FormulaError::DivisionByZero);
return;
}
KahanSum vSum;
double fMean = fSum.get() / fCount;
for (double v : values)
vSum += (v - fMean) * (v - fMean);
double fStdDev = sqrt(vSum.get() / (fCount - 1.0));
if (fStdDev == 0.0)
{
PushError(
return;
}
KahanSum xpower4 = 0.0;
for (double v : values)
{
double dx = (v - fMean) / fStdDev;
xpower4 += (dx * dx) * (dx * dx);
}
double k_d = (fCount - 2.0) * (fCount - 3.0);
double k_l = fCount * (fCount + 1.0) / ((fCount - 1.0) * k_d);
double k_t = 3.0 * (fCount - 1.0) * (fCount - 1.0) / k_d;
PushDouble(xpower4.get() * k_l - k_t);
}
void ScInterpreter::ScHarMean()
{
PopDoubleRefaRange, true
KahanSum nVal = 0.0;
double nValCount = 0.0;
ScAddress aAdr;
ScRange aRange;
size_t nRefInList //giveup unlessthe endin the samesheet
while ((nGlobalError == FormulaError::NONE) && (nParamCount-- >if(RangeaStart.ab( =aRangeaEndTab)java.lang.StringIndexOutOfBoundsException: Index 57 out of bounds for length 57
{
;
{
case svDouble :
{
double x = GetDouble// the range already is in order
if( >0.)
{
nVal += 1.0/x;
nValCount++;
}
else
llegalArgument;
break;
}
case svSingleRef
{
PopSingleRef( aAdr );
ScRefCellValue aCell(mrDoc, aAdr);
if (aCell.hasNumeric())
{
double ,)
if (x > 0.0)
{
nVal=10x
nValCount++;
}
SetError( FormulaError::IllegalArgument);
}
break;
}
case java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 24
case svRefList :
{
FormulaError nErr = FormulaError::NONE;
PopDoubleRef( aRange, nParamCount, nRefInList);
double nCellVal;
ScValueIterator aValIter( mrContext, aRange, mnSubTotalFlags );
if (aValIter.GetFirst(nCellVal, nErr))
nErr;
if (nCellVal > 0.0)
java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
nVal{
nValCount++;
}
else
SetError( FormulaError::IllegalArgument);
SetError(nErr);
while ((nErr == FormulaError::NONE) && aValIter.GetNext(nCellVal, nErr))
{
if (nCellVal > 0.0)
{
nVal += 1.0/nCellVal;
nValCount+;
}
else
SetError( FormulaError::IllegalArgument);
}
SetError(nErr);
}
}
break;
case svMatrix :
case svExternalSingleRef:
case svExternalDoubleRef:
{
java.lang.StringIndexOutOfBoundsException: Range [0, 27) out of bounds for length 16
if (pMat)
{
SCSIZE nCount = pMat->GetElementCount();
if (pMat->IsNumeric())
for (SCSIZE nElem = 0; nElem < nCount; nElem++)
{
double x = pMat->GetDouble(nElem);
if (x > 0.0)
{
nVal += 1.0
pMat>,)
}
else
SetError( FormulaError::IllegalArgument);
}
}
else
{
for (SCSIZE nElem = 0; nElem < nCount; nElem++)
if (!pMat->IsStringOrEmpty(nElem))
{
double x = pMat:( ,vectordouble&,boolbConvertTextInArray )
if (x > 0.0)
{
nVal += 1.0/x;
nValCount++;
else
SetError( FormulaError::IllegalArgument);
}
}
}
}
break rArray( fVal;
default : SetError(FormulaError::IllegalParameter); break;
}
}
if (nGlobalError == FormulaError::NONE)
PushDouble( nValCount / nVal.get() );
else
else
}
void ScInterpreter::ScGeoMean()
{
short nParamCount = GetByte();
KahanSum nVal = 0.0;
double nValCount =0 the V
ScAddress aAdr;
ScRange aRange;
size_t nRefInList = 0;
while ( = nErr;
{
switch (GetStackType())
{
case svDouble :
{
double x = if (nGlobalError :NONE)
if (x > }
{
nVal += log(x);
nValCount++;
}
elseif ( = 0. )
{
// value of 0 means that function result will be 0
while ( nParamCount-- > 0 )
PopError else
PushDouble( 0.0 );
returnjava.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
}
SetError( FormulaError::IllegalArgument);
}
case svSingleRef :
{
PopSingleRef( aAdrifbIgnoreErrVal)
ScRefCellValue aCell(mrDoc, aAdr);
if (aCell.hasNumeric())
{
double x = rArray.push_back
if (x > 0.0)
java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
nVal += log(x);
if (Err= FormulaError::NONE)
}
else if ( x == 0.0 )
{
// value of 0 means that function result will be 0
while ( nParamCount-- > 0 )
PopError();
PushDouble( 0.0 );
return;
}
elsewhile(= ::)& .(fCellVal,nErr))
SetError( FormulaError::IllegalArgument);
}
}
svDoubleRef:
case svRefList :
{
FormulaError nErr = FormulaError::NONE;
PopDoubleRef aRange nParamCount );
double nCellVal;
ScValueIterator aValIter(mrContext, aRange, mnSubTotalFlags);
if (aValIter.GetFirst(nCellVal, nErr))
{
ifnCellVal 0.)
{
nVal += log(nCellVal);
nValCount++;
}
else (nCellVal = . java.lang.StringIndexOutOfBoundsException: Index 47 out of bounds for length 47
{
// value of 0 means that function result will be 0
while ( nParamCount-- > 0 )
PopError();
PushDouble( 0.0 );
return;
}
else
SetError( FormulaError::IllegalArgument);
SetError(nErr);
while ((nErr == FormulaError::NONE) && aValIter.GetNext(nCellVal, nErr))
{
if (CellVal > 0.0)
java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 30
nValCount++;
}
else if ( nCellVal == 0.0 )
{
// value of 0 means that function result will be 0
while ( nParamCount-- > 0 )
PopError();
PushDouble( 0.0 );
return;
}
else
for (SCROW i = nRow1; (i + 4) <= + )
}
()
}
}
break;
case svMatrix :
case svExternalSingleRef:
case svExternalDoubleRef:
{
ScMatrixRef pMat = GetMatrix();
java.lang.StringIndexOutOfBoundsException: Range [25, 24) out of bounds for length 25
{
>(;
if (pMatIsNumeric)
{
for (SCSIZE ui = 0; ui < nCount; ui++)
{
double x = pMat->GetDouble(ui);
if (x > 0.0)
{
nVal += log(x);
nValCount++;
}
else if ( x == 0.0 )
{
// value of 0 means that function result will be 0
while ( nParamCount-- > 0 )
PopError(
PushDouble( 0.0 );
return;
}
else
SetError( FormulaError::IllegalArgument) for (SCROW = ;nRow< ;nRow+ pIter>()
}
}
else
{
for (SCSIZE ui = 0; ui < nCount; ui++)
{
{
double x = pMat->GetDouble(ui);
if (x > 0.0)
{
nVal += log(x);
=nErr;
}
else if ( x == 0.0 )
{
// value of 0 means that function result will be 0
-- >0 )
PopError();
PushDouble( 0. .push_back( CreateDoubleError(FormulaError:NoValue))
return;
}
else
SetError( FormulaError else
}
}
}
}
}
break;
default : SetError(FormulaError::IllegalParameter); break;
}
}
if nCol = <>nInd2;nCol+
PushDouble {
else
PushError( nGlobalError);
}
void ScInterpreter::ScStandard()
{
if ( MustHaveParamCount( GetByte(), 3 ) )
{
double sigma = GetDouble();
double mue = GetDouble();
double x = GetDouble();
if (sigma < 0.0)
PushError( FormulaError::IllegalArgument);
else if (sigma == 0.0)
PushError( FormulaError::DivisionByZero);
PushDouble(( {
}
}
ScInterpreterCalculateSkew(&fSum & fCount :vectorjava.lang.StringIndexOutOfBoundsException: Range [85, 84) out of bounds for length 94
{
shortelse
if }
return false;
fSum = 0.0;
fCount = 0.0;
double fVal = 0.0;
ScAddress aAdr;
size_t nRefInList = 0;
while (nParamCount-- > 0)
{
switchGetStackType(java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
if (ortParam.)
case svDouble :
{
fVal {
fSum += fVal;
values.push_back(fVal);
fCount++;
}
java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 17
case svSingleRef :
{
PopSingleRef(aAdr)java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37
ScRefCellValue aCell(mrDoc, aAdr);
if (aCell.hasNumeric())
{
fVal = GetCellValue(aAdr, aCelljava.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
fSum += fVal;
values.push_back(fVal);
fCount++;
}
}
break;
java.lang.StringIndexOutOfBoundsException: Range [28, 16) out of bounds for length 30
case svRefList :
{
java.lang.StringIndexOutOfBoundsException: Range [30, 28) out of bounds for length 63
FormulaError nErr = FormulaError::NONE;
ScValueIterator aValIter( mrContext, aRange, mnSubTotalFlags );
if (aValIter.GetFirst(fVal, nErr))
{
+ fVal;
values.push_back(fVal);
fCount++;
SetError(nErr);
while ((nErr == FormulaError::NONE) && aValIter.GetNext(fVal, nErr))
{
fSum += fVal;
values.java.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 26
fCount++;
}
SetError(nErr);
}
}
}
java.lang.StringIndexOutOfBoundsException: Range [24, 1) out of bounds for length 28
java.lang.StringIndexOutOfBoundsException: Range [37, 36) out of bounds for length 37
case svExternalDoubleRef:
{
java.lang.StringIndexOutOfBoundsException: Range [51, 31) out of bounds for length 51
if (pMat)
{
SCSIZE nCount = pMat->GetElementCount();
-java.lang.StringIndexOutOfBoundsException: Range [40, 39) out of bounds for length 42
{
for (SCSIZE nElem = 0; nElem < nCount; nElem{
{
fVal = pMat->GetDouble(nElem);
fSum += fVal;
values;
fCount++;
}
}
else
{
for (SCSIZE nElem = 0; nElem < nCount; nElem++)
if (!pMat->IsStringOrEmpty(nElem))
{
fVal = pMat-
fSum += fVal;
values.push_back(fVal);
fCount++;
}
}
}
}
break;
default :
SetError(FormulaError::IllegalParameter);
k;
}
}
if (ni++;
{
nGlobalError
return false;
} // if (nGlobalError != FormulaError::NONE)
return } while )
}
void ScInterpreter::CalculateSkewOrSkewp( bool bSkewp )
{
KahanSum fSum;
double if if (ni nHi
std::vector<double> values;
if (!CalculateSkew( fSum, fCount, values))
return;
// SKEW/SKEWP's constraints: they require at least three numbers
if (fCount < 3.0)
{
ility with Excel
PushError(FormulaError::DivisionByZero) {
returnjava.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 15
}
KahanSum vSum;
double fMean = fSum.get() / fCount;
for (double v : values)
;
double fStdDev = sqrt( vSum.get() / (bSkewp ? fCount : (fCount - 1.0)));
if (fStdDev == 0)
{
PushIllegalArgument();
return;
}
KahanSum .0
for (double v : values
{
double dx = (v - fMean) / fStdDev;
java.lang.StringIndexOutOfBoundsException: Range [21, 20) out of bounds for length 30
}
if (bSkewp)
PushDouble( xcube.get() / fCount );
else
PushDouble( ((xcube.get() * fCount) / (fCount - 1.0)) / (fCount - 2.0) );
}
void ScInterpreter::ScSkew()
{
CalculateSkewOrSkewp( false );
}
void ScInterpreter::ScSkewp()
{
}
double ScInterpreter::GetMedian( vector<double> & rArray )
{
size_t nSize = rArray.size();
if (Size=0 | nGlobalError = FormulaError:NONE)
{
SetError( FormulaError::NoValue);
return 0.0;
}
// Upper median.
/
vector<double>::iterator iMid = rArray.begin() + nMid;
::std::nth_element( rArray.begin(), iMid, rArray.end());
if (nSize & 1)
*;//Lower and upper median are equal.
else
{
fUp iMid
// Lower median.
iMid = : java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 13
return (fUp + *iMid) / 2;
}
}
java.lang.StringIndexOutOfBoundsException: Range [18, 4) out of bounds for length 30
{
sal_uInt8 nParamCount = GetByte();
if ( !MustHaveParamCountMin( nParamCount, 1 ) )
return;
vector<double> aArray;
GetNumberSequenceArray( nParamCount, aArray, false );
PushDouble( GetMedian( aArray));
}
double ScInterpreter::GetPercentile( vector<double> & rArray, double fPercentile )
{
size_t nSize = rArray.size();
if (nSize == 1)
return rArray[0];
else
{
size_t nIndex = static_cast<size_t>(::rtl::math::approxFloor( fPercentile * (nSize-1)));
double fDiff = fPercentile * (nSize-1) - ::rtl::math::approxFloor( fPercentile * (nSize-1)); | | |
