Branch Coverage

src/nsHebrewProber.cpp
Criterion Covered Total %
branch 13 46 28.2


line true false branch
66 8 0 return ((c == FINAL_KAF) || (c == FINAL_MEM) || (c == FINAL_NUN) || (c == FINAL_PE) || (c == FINAL_TSADI));
8 0 return ((c == FINAL_KAF) || (c == FINAL_MEM) || (c == FINAL_NUN) || (c == FINAL_PE) || (c == FINAL_TSADI));
8 0 return ((c == FINAL_KAF) || (c == FINAL_MEM) || (c == FINAL_NUN) || (c == FINAL_PE) || (c == FINAL_TSADI));
71 0 0 return ((c == NORMAL_KAF) || (c == NORMAL_MEM) || (c == NORMAL_NUN) || (c == NORMAL_PE));
0 0 return ((c == NORMAL_KAF) || (c == NORMAL_MEM) || (c == NORMAL_NUN) || (c == NORMAL_PE));
112 4 0 if (GetState() == eNotMe)
118 46 4 for (curPtr = (char*)aBuf; curPtr < endPtr; ++curPtr)
121 0 46 if (cur == ' ') // We stand on a space - a word just ended
123 0 0 if (mBeforePrev != ' ') // *(curPtr-2) was not a space so prev is not a 1 letter word
125 0 0 if (isFinal(mPrev)) // case (1) [-2:not space][-1:final letter][cur:space]
127 0 0 else if (isNonFinal(mPrev)) // case (2) [-2:not space][-1:Non-Final letter][cur:space]
133 8 38 if ((mBeforePrev == ' ') && (isFinal(mPrev)) && (cur != ' ')) // case (3) [-2:space][-1:final letter][cur:not space]
0 8 if ((mBeforePrev == ' ') && (isFinal(mPrev)) && (cur != ' ')) // case (3) [-2:space][-1:final letter][cur:not space]
0 0 if ((mBeforePrev == ' ') && (isFinal(mPrev)) && (cur != ' ')) // case (3) [-2:space][-1:final letter][cur:not space]
0 46 if ((mBeforePrev == ' ') && (isFinal(mPrev)) && (cur != ' ')) // case (3) [-2:space][-1:final letter][cur:not space]
149 0 0 if (finalsub >= MIN_FINAL_CHAR_DISTANCE)
151 0 0 if (finalsub <= -(MIN_FINAL_CHAR_DISTANCE))
156 0 0 if (modelsub > MIN_MODEL_DISTANCE)
158 0 0 if (modelsub < -(MIN_MODEL_DISTANCE))
162 0 0 if (finalsub < 0)
184 0 4 if ((mLogicalProb->GetState() == eNotMe) && (mVisualProb->GetState() == eNotMe))
0 0 if ((mLogicalProb->GetState() == eNotMe) && (mVisualProb->GetState() == eNotMe))
4 0 if ((mLogicalProb->GetState() == eNotMe) && (mVisualProb->GetState() == eNotMe))