tdf#164954 rename German abbreviation "Koeff" to English "Coeff" in vars, funcs
The German word "Koeffizient" translates to "Coefficient" in English. Change-Id: I38cbb327df085a607cb6922003fa3f07e27eca8e Reviewed-on: https://gerrit.libreoffice.org/c/core/+/184663 Tested-by: Jenkins Reviewed-by: Michael Stahl <michael.stahl@allotropia.de>
This commit is contained in:
committed by
Michael Stahl
parent
f6ad4397dc
commit
0661337767
@@ -996,7 +996,7 @@ private:
|
||||
double GetFDist(double x, double fF1, double fF2);
|
||||
double GetTDist( double T, double fDF, int nType );
|
||||
double Fakultaet(double x);
|
||||
static double BinomKoeff(double n, double k);
|
||||
static double BinomCoeff(double n, double k);
|
||||
double GetGamma(double x);
|
||||
static double GetLogGamma(double x);
|
||||
double GetBeta(double fAlpha, double fBeta);
|
||||
|
||||
@@ -459,7 +459,7 @@ double ScInterpreter::Fakultaet(double x)
|
||||
return x;
|
||||
}
|
||||
|
||||
double ScInterpreter::BinomKoeff(double n, double k)
|
||||
double ScInterpreter::BinomCoeff(double n, double k)
|
||||
{
|
||||
// this method has been duplicated as BinomialCoefficient()
|
||||
// in scaddins/source/analysis/analysishelper.cxx
|
||||
@@ -1181,7 +1181,7 @@ void ScInterpreter::ScCombin()
|
||||
if (k < 0.0 || n < 0.0 || k > n)
|
||||
PushIllegalArgument();
|
||||
else
|
||||
PushDouble(BinomKoeff(n, k));
|
||||
PushDouble(BinomCoeff(n, k));
|
||||
}
|
||||
}
|
||||
|
||||
@@ -1194,7 +1194,7 @@ void ScInterpreter::ScCombinA()
|
||||
if (k < 0.0 || n < 0.0 || k > n)
|
||||
PushIllegalArgument();
|
||||
else
|
||||
PushDouble(BinomKoeff(n + k - 1, k));
|
||||
PushDouble(BinomCoeff(n + k - 1, k));
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
@@ -590,7 +590,7 @@ double GetYearFrac( sal_Int32 nNullDate, sal_Int32 nStartDate, sal_Int32 nEndDat
|
||||
|
||||
double BinomialCoefficient( double n, double k )
|
||||
{
|
||||
// This method is a copy of BinomKoeff()
|
||||
// This method is a copy of BinomCoeff()
|
||||
// found in sc/source/core/tool/interpr3.cxx
|
||||
|
||||
double nVal = 0.0;
|
||||
|
||||
@@ -29,7 +29,7 @@ BitmapEx BitmapConvolutionMatrixFilter::execute(BitmapEx const& rBitmapEx) const
|
||||
if (!pWriteAcc)
|
||||
return BitmapEx();
|
||||
|
||||
std::array<std::array<sal_Int32, 256>, 9> aKoeff;
|
||||
std::array<std::array<sal_Int32, 256>, 9> aCoeff;
|
||||
|
||||
// create LUT of products of matrix value and possible color component values
|
||||
for (sal_Int32 nY = 0; nY < 9; nY++)
|
||||
@@ -37,7 +37,7 @@ BitmapEx BitmapConvolutionMatrixFilter::execute(BitmapEx const& rBitmapEx) const
|
||||
for (sal_Int32 nX = 0, nTmp = 0, nMatrixVal = mrMatrix[nY]; nX < 256;
|
||||
nX++, nTmp += nMatrixVal)
|
||||
{
|
||||
aKoeff[nY][nX] = nTmp;
|
||||
aCoeff[nY][nX] = nTmp;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -87,52 +87,52 @@ BitmapEx BitmapConvolutionMatrixFilter::execute(BitmapEx const& rBitmapEx) const
|
||||
for (sal_Int32 nX = 0; nX < nWidth; nX++)
|
||||
{
|
||||
// first row
|
||||
sal_Int32* pTmp = aKoeff[0].data();
|
||||
sal_Int32* pTmp = aCoeff[0].data();
|
||||
BitmapColor* pColor = pRowTmp1 + nX;
|
||||
sal_Int32 nSumR = pTmp[pColor->GetRed()];
|
||||
sal_Int32 nSumG = pTmp[pColor->GetGreen()];
|
||||
sal_Int32 nSumB = pTmp[pColor->GetBlue()];
|
||||
|
||||
pTmp = aKoeff[1].data();
|
||||
pTmp = aCoeff[1].data();
|
||||
nSumR += pTmp[(++pColor)->GetRed()];
|
||||
nSumG += pTmp[pColor->GetGreen()];
|
||||
nSumB += pTmp[pColor->GetBlue()];
|
||||
|
||||
pTmp = aKoeff[2].data();
|
||||
pTmp = aCoeff[2].data();
|
||||
nSumR += pTmp[(++pColor)->GetRed()];
|
||||
nSumG += pTmp[pColor->GetGreen()];
|
||||
nSumB += pTmp[pColor->GetBlue()];
|
||||
|
||||
// second row
|
||||
pTmp = aKoeff[3].data();
|
||||
pTmp = aCoeff[3].data();
|
||||
pColor = pRowTmp2 + nX;
|
||||
nSumR += pTmp[pColor->GetRed()];
|
||||
nSumG += pTmp[pColor->GetGreen()];
|
||||
nSumB += pTmp[pColor->GetBlue()];
|
||||
|
||||
pTmp = aKoeff[4].data();
|
||||
pTmp = aCoeff[4].data();
|
||||
nSumR += pTmp[(++pColor)->GetRed()];
|
||||
nSumG += pTmp[pColor->GetGreen()];
|
||||
nSumB += pTmp[pColor->GetBlue()];
|
||||
|
||||
pTmp = aKoeff[5].data();
|
||||
pTmp = aCoeff[5].data();
|
||||
nSumR += pTmp[(++pColor)->GetRed()];
|
||||
nSumG += pTmp[pColor->GetGreen()];
|
||||
nSumB += pTmp[pColor->GetBlue()];
|
||||
|
||||
// third row
|
||||
pTmp = aKoeff[6].data();
|
||||
pTmp = aCoeff[6].data();
|
||||
pColor = pRowTmp3 + nX;
|
||||
nSumR += pTmp[pColor->GetRed()];
|
||||
nSumG += pTmp[pColor->GetGreen()];
|
||||
nSumB += pTmp[pColor->GetBlue()];
|
||||
|
||||
pTmp = aKoeff[7].data();
|
||||
pTmp = aCoeff[7].data();
|
||||
nSumR += pTmp[(++pColor)->GetRed()];
|
||||
nSumG += pTmp[pColor->GetGreen()];
|
||||
nSumB += pTmp[pColor->GetBlue()];
|
||||
|
||||
pTmp = aKoeff[8].data();
|
||||
pTmp = aCoeff[8].data();
|
||||
nSumR += pTmp[(++pColor)->GetRed()];
|
||||
nSumG += pTmp[pColor->GetGreen()];
|
||||
nSumB += pTmp[pColor->GetBlue()];
|
||||
|
||||
Reference in New Issue
Block a user