Lines Matching refs:DBG_ASSERT
101 DBG_ASSERT( pTxtNode != NULL, "Text node is needed!" ); in SwAccessiblePortionData()
119 DBG_ASSERT( (nModelPosition + nLength) <= pTxtNode->GetTxt().Len(), in Text()
122 DBG_ASSERT( !bFinished, "We are already done!" ); in Text()
154 DBG_ASSERT( nModelPosition >= 0, "illegal position" ); in Special()
155 DBG_ASSERT( (nModelPosition + nLength) <= pTxtNode->GetTxt().Len(), in Special()
158 DBG_ASSERT( !bFinished, "We are already done!" ); in Special()
260 DBG_ASSERT( !bFinished, "We are already done!" ); in LineBreak()
267 DBG_ASSERT( !bFinished, "We are already done!" ); in Skip()
268 DBG_ASSERT( aModelPositions.size() == 0, "Never Skip() after portions" ); in Skip()
269 DBG_ASSERT( nLength <= pTxtNode->GetTxt().Len(), "skip exceeds model string!" ); in Skip()
276 DBG_ASSERT( !bFinished, "We are already done!" ); in Finish()
294 DBG_ASSERT( nPortionNo < aPortionAttrs.size(), in IsPortionAttrSet()
342 DBG_ASSERT( bFinished, "Shouldn't call this before we are done!" ); in GetAccessibleString()
394 DBG_ASSERT( aLineBreaks.size() >= 2, "need min + max value" ); in GetLastLineBoundary()
404 DBG_ASSERT( nPos >= 0, "illegal position" ); in GetModelPosition()
405 DBG_ASSERT( nPos <= sAccessibleString.getLength(), "illegal position" ); in GetModelPosition()
418 DBG_ASSERT( ( aModelPositions[nPortionNo+1] - nStartPos ) == in GetModelPosition()
428 DBG_ASSERT( (nStartPos >= 0) && (nStartPos < USHRT_MAX), in GetModelPosition()
447 DBG_ASSERT( rPositions.size() >= 2, "need min + max value" ); in FindBreak()
448 DBG_ASSERT( rPositions[0] <= nValue, "need min value" ); in FindBreak()
449 DBG_ASSERT( rPositions[rPositions.size()-1] >= nValue, in FindBreak()
451 DBG_ASSERT( rPositions[rPositions.size()-2] >= nValue, in FindBreak()
461 DBG_ASSERT( ( (nMin == 0) && (rPositions[nMin] <= nValue) ) || in FindBreak()
464 DBG_ASSERT( nValue <= rPositions[nMax], "max value not maximal" ); in FindBreak()
468 DBG_ASSERT( nMin < nMiddle, "progress?" ); in FindBreak()
469 DBG_ASSERT( nMiddle < nMax, "progress?" ); in FindBreak()
472 DBG_ASSERT( rPositions[nMin] <= rPositions[nMiddle], in FindBreak()
474 DBG_ASSERT( rPositions[nMiddle] <= rPositions[nMax], in FindBreak()
484 DBG_ASSERT( (nMax == nMin) || (nMax == nMin+1), "only two left" ); in FindBreak()
489 DBG_ASSERT( rPositions[nMin] <= nValue, "not smaller or equal" ); in FindBreak()
490 DBG_ASSERT( nValue <= rPositions[nMin+1], "not equal or larger" ); in FindBreak()
491 DBG_ASSERT( (nMin == 0) || (rPositions[nMin-1] <= nValue), in FindBreak()
494 DBG_ASSERT( nMin < rPositions.size()-1, in FindBreak()
525 DBG_ASSERT( nPos >= 0, "illegal position; check before" ); in GetSentenceBoundary()
526 DBG_ASSERT( nPos < sAccessibleString.getLength(), "illegal position" ); in GetSentenceBoundary()
530 DBG_ASSERT( pBreakIt != NULL, "We always need a break." ); in GetSentenceBoundary()
531 DBG_ASSERT( pBreakIt->GetBreakIter().is(), "No break-iterator." ); in GetSentenceBoundary()
580 DBG_ASSERT( pTxtNode != NULL, "Need SwTxtNode!" ); in GetAttributeBoundary()
590 DBG_ASSERT( nPos <= pTxtNode->GetTxt().Len(), "illegal position" ); in GetAccessiblePosition()
608 DBG_ASSERT( ( nEndPos - nStartPos ) == in GetAccessiblePosition()
618 DBG_ASSERT( (nRet >= 0) && (nRet <= sAccessibleString.getLength()), in GetAccessiblePosition()
654 DBG_ASSERT( nModelPos >= 0, "Can't happen." ); in FillSpecialPos()
655 DBG_ASSERT( nCorePortionNo >= nBeforePortions, "Can't happen." ); in FillSpecialPos()
657 DBG_ASSERT( nModelPos != nModelEndPos, in FillSpecialPos()
685 DBG_ASSERT( ( nModelEndPos - nModelPos ) == in FillSpecialPos()
696 DBG_ASSERT( rpPos == &rPos, "Yes!" ); in FillSpecialPos()
697 DBG_ASSERT( nRefPos <= nPos, "wrong reference" ); in FillSpecialPos()
698 DBG_ASSERT( (nExtend == SP_EXTEND_RANGE_NONE) || in FillSpecialPos()