1661     int     breakPos = -1;  in next()  local
1785     breakPos = p2;  in next()
1786     return breakPos;  in next()
1959     int     breakPos = -1;  in next()  local
2137     breakPos = p2;  in next()
2138     return breakPos;  in next()
2331     int     breakPos = -1;  in next()  local
2477     breakPos = p2;  in next()
2478     return breakPos;  in next()
3893         int32_t breakPos = 0;  in RunMonkey()  local
3896             breakPos = mk.next(breakPos);  in RunMonkey()
3897             if (breakPos == -1) {  in RunMonkey()
3900             if (breakPos > testText.length()) {  in RunMonkey()
3903             expectedBreaks[breakPos] = 1;  in RunMonkey()
3905             expected[expectedCount ++] = breakPos;  in RunMonkey()
3957             breakPos = bi->following(i);  in RunMonkey()
3958             if (breakPos <= i ||  in RunMonkey()
3959                 breakPos < lastBreakPos ||  in RunMonkey()
3960                 breakPos > testText.length() ||  in RunMonkey()
3961                 (breakPos > lastBreakPos && lastBreakPos > i)) {  in RunMonkey()
3965                          name, seed, i, breakPos, lastBreakPos);  in RunMonkey()
3968             followingBreaks[breakPos] = 1;  in RunMonkey()
3969             lastBreakPos = breakPos;  in RunMonkey()
3977             breakPos = bi->preceding(i);  in RunMonkey()
3978             if (breakPos >= i ||  in RunMonkey()
3979                 breakPos > lastBreakPos ||  in RunMonkey()
3980                 (breakPos < 0 && testText.getChar32Start(i)>0) ||  in RunMonkey()
3981                 (breakPos < lastBreakPos && lastBreakPos < testText.getChar32Start(i)) ) {  in RunMonkey()
3985                     name,  i, breakPos, lastBreakPos);  in RunMonkey()
3986                 if (breakPos >= 0 && breakPos < (int32_t)sizeof(precedingBreaks)) {  in RunMonkey()
3990                 if (breakPos >= 0) {  in RunMonkey()
3991                     precedingBreaks[breakPos] = 1;  in RunMonkey()
3993                 lastBreakPos = breakPos;  in RunMonkey()