45 for (; idx < _size; ++idx) {
46 if (_cumulativeDistribution.at(idx) > lKey) {
52 return _valueArray.at(idx);
55 return _valueArray.at(idx-1);
61 const T& lValueCurrentPoint = _valueArray.at(idx);
66 const T& lValuePreviousPoint = _valueArray.at(idx-1);
68 if (lCumulativePreviousPoint == lCumulativeCurrentPoint) {
69 return lValuePreviousPoint;
72 T oValue= lValuePreviousPoint + (lValueCurrentPoint - lValuePreviousPoint)
73 * (iCumulativeProbability - lCumulativePreviousPoint)
74 / (lCumulativeCurrentPoint - lCumulativePreviousPoint);
88 for (; idx < _size; ++idx) {
89 if (_valueArray.at(idx) > iValue) {
96 return 1 - oCumulativeProbability;
101 return 1 - oCumulativeProbability;
107 const T& lValueCurrentPoint = _valueArray.at(idx);
112 const T& lValuePreviousPoint = _valueArray.at(idx-1);
114 if (lValuePreviousPoint == lValueCurrentPoint) {
115 return 1 - lCumulativePreviousPoint;
119 lCumulativePreviousPoint + (lCumulativeCurrentPoint - lCumulativePreviousPoint)
120 * (iValue - lValuePreviousPoint)
121 / (lValueCurrentPoint - lValuePreviousPoint);
123 return 1 - oCumulativeProbability;
134 unsigned int idx = 0;
135 for (; idx < _size; ++idx) {
136 if (_valueArray.at(idx) > iKey) {
141 assert (idx != _size);
146 const T& lValueCurrentPoint = _valueArray.at(idx);
151 const T& lValuePreviousPoint = _valueArray.at(idx-1);
152 assert (lValueCurrentPoint != lValuePreviousPoint);
154 const double oValue= (lCumulativeCurrentPoint - lCumulativePreviousPoint)
155 / (lValueCurrentPoint - lValuePreviousPoint);