267     const xub_StrLen nOtherStart, const xub_StrLen nOtherEnd, bool bOtherDummy)  in lcl_DoSplitNew()  argument
270     const xub_StrLen nSplitPos( (bSplitAtStart) ? nOtherStart : nOtherEnd );  in lcl_DoSplitNew()
394             const xub_StrLen nOtherEnd  ( *(pOther)->GetEnd()   );  in TryInsertNesting()  local
395             if (isOverlap(nNewStart, nNewEnd, nOtherStart, nOtherEnd ))  in TryInsertNesting()
406                             nOtherStart, nOtherEnd, pOther->HasDummyChar());  in TryInsertNesting()
417             else if (isNestedAny(nNewStart, nNewEnd, nOtherStart, nOtherEnd))  in TryInsertNesting()
432                     } else if (nNewEnd < nOtherEnd) {  in TryInsertNesting()
462         const xub_StrLen nOtherEnd  ( *(*itOther)->GetEnd()   );  in TryInsertNesting()  local
474                                     nOtherStart,    nOtherEnd))  in TryInsertNesting()
521                                     nSplitNewStart, nOtherEnd ) );  in TryInsertNesting()
552         const xub_StrLen nOtherEnd  ( *(*itOther)->GetEnd()   );  in TryInsertNesting()  local
555         if ((nNewStart <= nOtherStart) && (nOtherEnd <= nNewEnd))  in TryInsertNesting()
562             ASSERT((nOtherStart < nNewStart) && (nNewEnd < nOtherEnd), "huh?");  in TryInsertNesting()
573                     rNode, **itOther, nNewEnd, nOtherEnd ) );  in TryInsertNesting()
623             const xub_StrLen nOtherEnd = *pOther->GetEnd();  in BuildPortions()  local
627             if ( nOtherStart < nThisStart && nThisStart < nOtherEnd )  in BuildPortions()
644             if ( nOtherStart < nThisEnd && nThisEnd < nOtherEnd )  in BuildPortions()
689             const xub_StrLen nOtherEnd = *pOther->End();  in BuildPortions()  local
692             aBounds.insert( nOtherEnd );  in BuildPortions()
2820             const xub_StrLen nOtherEnd = *pOtherHt->End();  in lcl_CheckSortNumber()  local
2822             if ( nOtherStart == nHtStart && nOtherEnd == nHtEnd )  in lcl_CheckSortNumber()