Lines Matching refs:end
68 * range from "start" to "end-1"
70 public HeaderParser subsequence (int start, int end) {
71 if (start == 0 && end == nkeys) {
74 if (start < 0 || start >= end || end > nkeys)
75 throw new IllegalArgumentException ("invalid start or end");
79 System.arraycopy (tab, start, n.tab, 0, (end-start));
80 n.nkeys= (end-start);
89 int beg = 0, end = 0, i = 0;
93 while (end < len) {
94 char c = ca[end];
95 if ((c == '=') && !inQuote) { // end of a key
96 tab[i][0] = new String(ca, beg, end-beg).toLowerCase();
98 end++;
99 beg = end;
102 tab[i++][1]= new String(ca, beg, end-beg);
105 end++;
106 } while (end < len && (ca[end] == ' ' || ca[end] == ','));
108 beg=end;
111 end++;
112 beg=end;
114 } else if (c == ' ' || c == ',') { // end key/val, of whatever we're in
116 end++;
119 tab[i++][0] = (new String(ca, beg, end-beg)).toLowerCase();
121 tab[i++][1] = (new String(ca, beg, end-beg));
123 while (end < len && (ca[end] == ' ' || ca[end] == ',')) {
124 end++;
127 beg = end;
129 end++;
139 if (--end > beg) {
141 if (ca[end] == '\"') {
142 tab[i++][1] = (new String(ca, beg, end-beg));
144 tab[i++][1] = (new String(ca, beg, end-beg+1));
147 tab[i++][0] = (new String(ca, beg, end-beg+1)).toLowerCase();
149 } else if (end == beg) {
151 if (ca[end] == '\"') {
152 tab[i++][1] = String.valueOf(ca[end-1]);
154 tab[i++][1] = String.valueOf(ca[end]);
157 tab[i++][0] = String.valueOf(ca[end]).toLowerCase();