Lines Matching defs:beg
63 public TokenList(Object[] tokens, int beg, int end) {
64 super(end - beg); // capacity
66 addTokens(tokens, beg, end);
69 public TokenList(Object[] tokens, int beg, int end, String separator) {
70 super(end - beg); // capacity
72 addTokens(tokens, beg, end);
179 public boolean addTokens(Object[] tokens, int beg, int end) {
181 for (int i = beg; i < end; i++) {
241 // { modCount, hint, -1==beg[0], end[0]==beg[1], ..., length }
242 // Note that each beg[i]..end[i] span includes a leading separator,
282 int beg = lengths[BEG0 + wh];
284 if (i >= beg && i < end) {
300 int beg = lengths[BEG0 + wh];
301 int j = i - beg;
309 public CharSequence subSequence(int beg, int end) {
310 //System.out.println("i: "+beg+".."+end);
311 if (beg == end) {
314 if (beg < 0) {
315 charAt(beg); // raise exception
317 if (beg > end) {
320 int begWh = which(beg);
330 if ((beg - begBase) < sepLength) {
331 begFrag = sepLength - (beg - begBase);
332 beg += begFrag;
341 System.out.print("beg[wbf]end[wbf]");
342 int pr[] = {begWh, begBase, begFrag, beg, endWh, endBase, endFrag, end};
350 beg -= begFrag;
352 return separator.substring(beg - begBase, end - begBase);
356 return getCS(begWh).subSequence(beg - begBase - sepLength,
370 int csBeg = (wh == begWh) ? (beg - begBase) - sepLength : 0;