382         A nE = ::std::min( this->pData[nIndex].nEnd, nEnd);  in SumValuesContinuation()  local
384         unsigned long nNew = (unsigned long) this->pData[nIndex].aValue * (nE - nS + 1);  in SumValuesContinuation()
388         nS = nE + 1;  in SumValuesContinuation()
404         A nE = ::std::min( this->pData[nIndex].nEnd, nEnd);  in SumScaledValuesContinuation()  local
407         unsigned long nNew = nScaledVal * (nE - nS + 1);  in SumScaledValuesContinuation()
411         nS = nE + 1;  in SumScaledValuesContinuation()
434             A nE = ::std::min( this->pData[nIndex].nEnd, nEnd);  in AndValue()  local
435             this->SetValue( nS, nE, this->pData[nIndex].aValue & rValueToAnd);  in AndValue()
436             if (nE >= nEnd)  in AndValue()
438             nIndex = this->Search( nE + 1);  in AndValue()
461             A nE = ::std::min( this->pData[nIndex].nEnd, nEnd);  in OrValue()  local
462             this->SetValue( nS, nE, this->pData[nIndex].aValue | rValueToOr);  in OrValue()
463             if (nE >= nEnd)  in OrValue()
465             nIndex = this->Search( nE + 1);  in OrValue()
610             A nE = ::std::min( this->pData[nIndex].nEnd, nEnd);  in CountForCondition()  local
611             nRet += nE - nS + 1;  in CountForCondition()
633             A nE = ::std::min( this->pData[nIndex].nEnd, nEnd);  in FillArrayForCondition()  local
634             while (nS <= nE && nUsed < nArraySize)  in FillArrayForCondition()
673             A nE = ::std::min( this->pData[nIndex].nEnd, nEnd);  in CountForAnyBitCondition()  local
674             nRet += nE - nS + 1;  in CountForAnyBitCondition()