266     const xub_StrLen nNewStart,  in lcl_DoSplitNew()  argument
269     const bool bSplitAtStart(nNewStart < nOtherStart);  in lcl_DoSplitNew()
368     const xub_StrLen nNewStart( *rNewHint.GetStart() );  in TryInsertNesting()  local
395             if (isOverlap(nNewStart, nNewEnd, nOtherStart, nOtherEnd ))  in TryInsertNesting()
405                         lcl_DoSplitNew(SplitNew, rNode, nNewStart,  in TryInsertNesting()
417             else if (isNestedAny(nNewStart, nNewEnd, nOtherStart, nOtherEnd))  in TryInsertNesting()
425                 else if ((nNewStart == nOtherStart) && pOther->HasDummyChar())  in TryInsertNesting()
439                         ASSERT(*pStart == nNewStart, "how did that happen?");  in TryInsertNesting()
440                         *pStart = nNewStart + 1;  in TryInsertNesting()
555         if ((nNewStart <= nOtherStart) && (nOtherEnd <= nNewEnd))  in TryInsertNesting()
562             ASSERT((nOtherStart < nNewStart) && (nNewEnd < nOtherEnd), "huh?");  in TryInsertNesting()
568             *(*itOther)->GetEnd() = nNewStart;  in TryInsertNesting()