Lines Matching refs:length

48     int length;

76 int length = this.length;
77 if (length + 1 > data.length) {
80 data[length++] = (byte) b;
81 this.length = length;
94 int length = this.length;
95 if (length + 2 > data.length) {
99 data[length++] = (byte) b1;
100 data[length++] = (byte) b2;
101 this.length = length;
113 int length = this.length;
114 if (length + 2 > data.length) {
118 data[length++] = (byte) (s >>> 8);
119 data[length++] = (byte) s;
120 this.length = length;
133 int length = this.length;
134 if (length + 3 > data.length) {
138 data[length++] = (byte) b;
139 data[length++] = (byte) (s >>> 8);
140 data[length++] = (byte) s;
141 this.length = length;
153 int length = this.length;
154 if (length + 4 > data.length) {
158 data[length++] = (byte) (i >>> 24);
159 data[length++] = (byte) (i >>> 16);
160 data[length++] = (byte) (i >>> 8);
161 data[length++] = (byte) i;
162 this.length = length;
174 int length = this.length;
175 if (length + 8 > data.length) {
180 data[length++] = (byte) (i >>> 24);
181 data[length++] = (byte) (i >>> 16);
182 data[length++] = (byte) (i >>> 8);
183 data[length++] = (byte) i;
185 data[length++] = (byte) (i >>> 24);
186 data[length++] = (byte) (i >>> 16);
187 data[length++] = (byte) (i >>> 8);
188 data[length++] = (byte) i;
189 this.length = length;
201 int charLength = s.length();
202 if (length + 2 + charLength > data.length) {
205 int len = length;
207 // optimistic algorithm: instead of computing the byte length and then
209 // length is equal to char length (which is the most frequent case), and
231 data[length] = (byte) (byteLength >>> 8);
232 data[length + 1] = (byte) byteLength;
233 if (length + 2 + byteLength > data.length) {
234 length = len;
254 length = len;
270 if (length + len > data.length) {
274 System.arraycopy(b, off, data, length, len);
276 length += len;
287 int length1 = 2 * data.length;
288 int length2 = length + size;
290 System.arraycopy(data, 0, newData, 0, length);