Lines Matching refs:i
218 for (short i = nMax-1; i >= 0; i--) in taylor() local
220 nVal = pPolynom[i] + (nVal * x); in taylor()
1209 for (sal_uLong i = (sal_uLong)k-1; i >= 1; i--) in ScVariationen() local
1210 nVal *= n-(double)i; in ScVariationen()
1245 for (sal_uInt32 i = 0; i < max && fFactor > 0.0; i++) in GetBinomDistPMF() local
1246 fFactor *= (n-i)/(i+1)*q/p; in GetBinomDistPMF()
1253 for (sal_uInt32 i = 0; i < max && fFactor > 0.0; i++) in GetBinomDistPMF() local
1254 fFactor *= (n-i)/(i+1)*p/q; in GetBinomDistPMF()
1263 sal_uInt32 i; in lcl_GetBinomDistRange() local
1267 for (i = 1; i <= nXs && fFactor > 0.0; i++) in lcl_GetBinomDistRange()
1268 fFactor *= (n-i+1)/i * p/q; in lcl_GetBinomDistRange()
1271 for (i = nXs+1; i <= nXe && fFactor > 0.0; i++) in lcl_GetBinomDistRange()
1273 fFactor *= (n-i+1)/i * p/q; in lcl_GetBinomDistRange()
1398 for (sal_uInt32 i = 0; i < max && fFactor > 0.0; i++) in ScBinomDist() local
1400 fFactor *= (n-i)/(i+1)*q/p; in ScBinomDist()
1438 sal_uLong i; in ScCritBinom() local
1440 for ( i = 0; i < max && fSum >= alpha; i++) in ScCritBinom()
1442 fFactor *= (n-i)/(i+1)*q/p; in ScCritBinom()
1445 PushDouble(n-i); in ScCritBinom()
1451 sal_uLong i; in ScCritBinom() local
1453 for ( i = 0; i < max && fSum < alpha; i++) in ScCritBinom()
1455 fFactor *= (n-i)/(i+1)*p/q; in ScCritBinom()
1458 PushDouble(i); in ScCritBinom()
1478 for (double i = 0.0; i < x; i++) in ScNegBinomDist() local
1479 fFactor *= (i+r)/(i+1.0)*q; in ScNegBinomDist()
1696 for (int i = 1; i <= nEnd; i++) in ScPoissonDist() local
1698 fSummand = (fSummand * lambda)/(double)i; in ScPoissonDist()
1713 for ( double i = fLower; i <= fUpper; ++i ) in lcl_PutFactorialElements() local
1715 double fVal = fBase - i; in lcl_PutFactorialElements()
2342 for ( SCSIZE i = 0; i < nCount; i++ ) in ScZTest() local
2344 fVal= pMat->GetDouble(i); in ScZTest()
2352 for (SCSIZE i = 0; i < nCount; i++) in ScZTest() local
2353 if (!pMat->IsString(i)) in ScZTest()
2355 fVal= pMat->GetDouble(i); in ScZTest()
2393 SCSIZE i,j; in CalculateTest() local
2394 for (i = 0; i < nC1; i++) in CalculateTest()
2397 if (!pMat1->IsString(i,j)) in CalculateTest()
2399 fVal = pMat1->GetDouble(i,j); in CalculateTest()
2405 for (i = 0; i < nC2; i++) in CalculateTest()
2408 if (!pMat2->IsString(i,j)) in CalculateTest()
2410 fVal = pMat2->GetDouble(i,j); in CalculateTest()
2474 SCSIZE i, j; in ScTTest() local
2489 for (i = 0; i < nC1; i++) in ScTTest()
2492 if (!pMat1->IsString(i,j) && !pMat2->IsString(i,j)) in ScTTest()
2494 fVal1 = pMat1->GetDouble(i,j); in ScTTest()
2495 fVal2 = pMat2->GetDouble(i,j); in ScTTest()
2545 SCSIZE i, j; in ScFTest() local
2555 for (i = 0; i < nC1; i++) in ScFTest()
2558 if (!pMat1->IsString(i,j)) in ScFTest()
2560 fVal = pMat1->GetDouble(i,j); in ScFTest()
2566 for (i = 0; i < nC2; i++) in ScFTest()
2569 if (!pMat2->IsString(i,j)) in ScFTest()
2571 fVal = pMat2->GetDouble(i,j); in ScFTest()
2632 for (SCSIZE i = 0; i < nC1; i++) in ScChiTest() local
2636 if (!pMat1->IsString(i,j) && !pMat2->IsString(i,j)) in ScChiTest()
2638 double fValX = pMat1->GetDouble(i,j); in ScChiTest()
2639 double fValE = pMat2->GetDouble(i,j); in ScChiTest()
2699 for (size_t i = 0; i < values.size(); i++) in ScKurt() local
2700 vSum += (values[i] - fMean) * (values[i] - fMean); in ScKurt()
2712 for (size_t i = 0; i < values.size(); i++) in ScKurt() local
2714 dx = (values[i] - fMean) / fStdDev; in ScKurt()
3097 for (size_t i = 0; i < values.size(); i++) in ScSkew() local
3098 vSum += (values[i] - fMean) * (values[i] - fMean); in ScSkew()
3110 for (size_t i = 0; i < values.size(); i++) in ScSkew() local
3112 dx = (values[i] - fMean) / fStdDev; in ScSkew()
3233 SCSIZE i; in ScModalValue() local
3235 for ( i = 1; i < nSize; i++) in ScModalValue()
3237 if (aSortArray[i] == nOldVal) in ScModalValue()
3241 nOldVal = aSortArray[i]; in ScModalValue()
3245 nMaxIndex = i-1; in ScModalValue()
3253 nMaxIndex = i-1; in ScModalValue()
3346 SCSIZE i; in ScPercentrank() local
3347 for (i = 1; i < nSize && aSortArray[i] < fNum; i++) in ScPercentrank()
3349 if (aSortArray[i] != fOldVal) in ScPercentrank()
3351 nOldCount = i; in ScPercentrank()
3352 fOldVal = aSortArray[i]; in ScPercentrank()
3355 if (aSortArray[i] != fOldVal) in ScPercentrank()
3356 nOldCount = i; in ScPercentrank()
3357 if (fNum == aSortArray[i]) in ScPercentrank()
3406 for (SCSIZE i = nIndex; i < nSize-nIndex; i++) in ScTrimMean() local
3407 fSum += aSortArray[i]; in ScTrimMean()
3469 for (SCSIZE i = 0; i < nCount; ++i) in GetNumberSequenceArray() local
3470 rArray.push_back( pMat->GetDouble(i)); in GetNumberSequenceArray()
3474 for (SCSIZE i = 0; i < nCount; ++i) in GetNumberSequenceArray() local
3475 if (!pMat->IsString(i)) in GetNumberSequenceArray()
3476 rArray.push_back( pMat->GetDouble(i)); in GetNumberSequenceArray()
3567 for (long i = 0; i < n; ++i) in QuickSort() local
3568 pIndexOrder->push_back(i); in QuickSort()
3575 for (size_t i = 0; (i + 4) <= nValCount-1; i += 4) in QuickSort() local
3578 ::std::swap( rSortArray[i], rSortArray[nInd]); in QuickSort()
3580 ::std::swap( pIndexOrder->at(i), pIndexOrder->at(nInd)); in QuickSort()
3672 for (SCSIZE i = 0; i < nCount; i++) in ScRank() local
3674 double x = pMat->GetDouble(i); in ScRank()
3684 for (SCSIZE i = 0; i < nCount; i++) in ScRank() local
3685 if (!pMat->IsString(i)) in ScRank()
3687 double x = pMat->GetDouble(i); in ScRank()
3908 for ( SCSIZE i = 0; i < nCount1 && !bStop; i++ ) in ScProbability() local
3910 if (pMatP->IsValue(i) && pMatW->IsValue(i)) in ScProbability()
3912 fP = pMatP->GetDouble(i); in ScProbability()
3913 fW = pMatW->GetDouble(i); in ScProbability()
3984 for (SCSIZE i = 0; i < nC1; i++) in CalculatePearsonCovar() local
3988 if (!pMat1->IsString(i,j) && !pMat2->IsString(i,j)) in CalculatePearsonCovar()
3990 double fValX = pMat1->GetDouble(i,j); in CalculatePearsonCovar()
3991 double fValY = pMat2->GetDouble(i,j); in CalculatePearsonCovar()
4004 for (SCSIZE i = 0; i < nC1; i++) in CalculatePearsonCovar() local
4008 if (!pMat1->IsString(i,j) && !pMat2->IsString(i,j)) in CalculatePearsonCovar()
4010 const double fValX = pMat1->GetDouble(i,j); in CalculatePearsonCovar()
4011 const double fValY = pMat2->GetDouble(i,j); in CalculatePearsonCovar()
4092 for (SCSIZE i = 0; i < nC1; i++) in CalculateSlopeIntercept() local
4096 if (!pMat1->IsString(i,j) && !pMat2->IsString(i,j)) in CalculateSlopeIntercept()
4098 double fValX = pMat1->GetDouble(i,j); in CalculateSlopeIntercept()
4099 double fValY = pMat2->GetDouble(i,j); in CalculateSlopeIntercept()
4112 for (SCSIZE i = 0; i < nC1; i++) in CalculateSlopeIntercept() local
4116 if (!pMat1->IsString(i,j) && !pMat2->IsString(i,j)) in CalculateSlopeIntercept()
4118 double fValX = pMat1->GetDouble(i,j); in CalculateSlopeIntercept()
4119 double fValY = pMat2->GetDouble(i,j); in CalculateSlopeIntercept()
4177 for (SCSIZE i = 0; i < nC1; i++) in ScForecast() local
4181 if (!pMat1->IsString(i,j) && !pMat2->IsString(i,j)) in ScForecast()
4183 double fValX = pMat1->GetDouble(i,j); in ScForecast()
4184 double fValY = pMat2->GetDouble(i,j); in ScForecast()
4197 for (SCSIZE i = 0; i < nC1; i++) in ScForecast() local
4201 if (!pMat1->IsString(i,j) && !pMat2->IsString(i,j)) in ScForecast()
4203 double fValX = pMat1->GetDouble(i,j); in ScForecast()
4204 double fValY = pMat2->GetDouble(i,j); in ScForecast()