HeapIntBuffer


1   /*
2    * @(#)Heap-X-Buffer.java   1.28 03/12/19
3    *
4    * Copyright 2004 Sun Microsystems, Inc. All rights reserved.
5    * SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
6    */
7   
8   // -- This file was mechanically generated: Do not edit! -- //
9   
10  package java.nio;
11  
12  
13  /**
14  
15   * A read/write HeapIntBuffer.
16  
17  
18  
19  
20  
21  
22   */
23  
24  class HeapIntBuffer
25      extends IntBuffer  
26  {
27  
28      // For speed these fields are actually declared in X-Buffer;
29      // these declarations are here as documentation
30      /*
31  
32      protected final int[] hb;
33      protected final int offset;
34  
35      */
36  
37      HeapIntBuffer(int cap, int lim) {       // package-private
38  
39      super(-1, 0, lim, cap, new int[cap], 0);
40      /*
41      hb = new int[cap];
42      offset = 0;
43      */
44  
45  
46  
47  
48      }
49  
50      HeapIntBuffer(int[] buf, int off, int len) { // package-private
51  
52      super(-1, off, off + len, buf.length, buf, 0);
53      /*
54      hb = buf;
55      offset = 0;
56      */
57  
58  
59  
60  
61      }
62  
63      protected HeapIntBuffer(int[] buf,
64                     int mark, int pos, int lim, int cap,
65                     int off)
66      {
67  
68      super(mark, pos, lim, cap, buf, off);
69      /*
70      hb = buf;
71      offset = off;
72      */
73  
74  
75  
76  
77      }
78  
79      public IntBuffer   slice() {
80      return new HeapIntBuffer  (hb,
81                      -1,
82                      0,
83                      this.remaining(),
84                      this.remaining(),
85                      this.position() + offset);
86      }
87  
88      public IntBuffer   duplicate() {
89      return new HeapIntBuffer  (hb,
90                      this.markValue(),
91                      this.position(),
92                      this.limit(),
93                      this.capacity(),
94                      offset);
95      }
96  
97      public IntBuffer   asReadOnlyBuffer() {
98  
99      return new HeapIntBufferR  (hb,
100                      this.markValue(),
101                      this.position(),
102                      this.limit(),
103                      this.capacity(),
104                      offset);
105 
106 
107 
108     }
109 
110 
111 
112     protected int ix(int i) {
113     return i + offset;
114     }
115 
116     public int get() {
117     return hb[ix(nextGetIndex())];
118     }
119 
120     public int get(int i) {
121     return hb[ix(checkIndex(i))];
122     }
123 
124     public IntBuffer   get(int[] dst, int offset, int length) {
125     checkBounds(offset, length, dst.length);
126     if (length > remaining())
127         throw new BufferUnderflowException  ();
128     System.arraycopy(hb, ix(position()), dst, offset, length);
129     position(position() + length);
130     return this;
131     }
132 
133     public boolean isDirect() {
134     return false;
135     }
136 
137 
138 
139     public boolean isReadOnly() {
140     return false;
141     }
142 
143     public IntBuffer   put(int x) {
144 
145     hb[ix(nextPutIndex())] = x;
146     return this;
147 
148 
149 
150     }
151 
152     public IntBuffer   put(int i, int x) {
153 
154     hb[ix(checkIndex(i))] = x;
155     return this;
156 
157 
158 
159     }
160 
161     public IntBuffer   put(int[] src, int offset, int length) {
162 
163     checkBounds(offset, length, src.length);
164     if (length > remaining())
165         throw new BufferOverflowException  ();
166     System.arraycopy(src, offset, hb, ix(position()), length);
167     position(position() + length);
168     return this;
169 
170 
171 
172     }
173 
174     public IntBuffer   put(IntBuffer   src) {
175 
176     if (src instanceof HeapIntBuffer  ) {
177         if (src == this)
178         throw new IllegalArgumentException  ();
179         HeapIntBuffer   sb = (HeapIntBuffer  )src;
180         int n = sb.remaining();
181         if (n > remaining())
182         throw new BufferOverflowException  ();
183         System.arraycopy(sb.hb, sb.ix(sb.position()),
184                  hb, ix(position()), n);
185         sb.position(sb.position() + n);
186         position(position() + n);
187     } else if (src.isDirect()) {
188         int n = src.remaining();
189         if (n > remaining())
190         throw new BufferOverflowException  ();
191         src.get(hb, ix(position()), n);
192         position(position() + n);
193     } else {
194         super.put(src);
195     }
196     return this;
197 
198 
199 
200     }
201 
202     public IntBuffer   compact() {
203 
204     System.arraycopy(hb, ix(position()), hb, ix(0), remaining());
205     position(remaining());
206     limit(capacity());
207     return this;
208 
209 
210 
211     }
212 
213 
214 
215 
216 
217 
218 
219 
220 
221 
222 
223 
224 
225 
226 
227 
228 
229 
230 
231 
232 
233 
234 
235 
236 
237 
238 
239 
240 
241 
242 
243 
244 
245 
246 
247 
248 
249 
250 
251 
252 
253 
254 
255 
256 
257 
258 
259 
260 
261 
262 
263 
264 
265 
266 
267 
268 
269 
270 
271 
272 
273 
274 
275 
276 
277 
278 
279 
280 
281 
282 
283 
284 
285 
286 
287 
288 
289 
290 
291 
292 
293 
294 
295 
296 
297 
298 
299 
300 
301 
302 
303 
304 
305 
306 
307 
308 
309 
310 
311 
312 
313 
314 
315 
316 
317 
318 
319 
320 
321 
322 
323 
324 
325 
326 
327 
328 
329 
330 
331 
332 
333 
334 
335 
336 
337 
338 
339 
340 
341 
342 
343 
344 
345 
346 
347 
348 
349 
350 
351 
352 
353 
354 
355 
356 
357 
358 
359 
360 
361 
362 
363 
364 
365 
366 
367 
368 
369 
370 
371 
372 
373 
374 
375 
376 
377 
378 
379 
380 
381 
382 
383 
384 
385 
386 
387 
388 
389 
390 
391 
392 
393 
394 
395 
396 
397 
398 
399 
400 
401 
402 
403 
404 
405 
406 
407 
408 
409 
410 
411 
412 
413 
414 
415 
416 
417 
418 
419 
420 
421 
422 
423 
424 
425 
426 
427 
428 
429 
430 
431 
432 
433 
434 
435 
436 
437 
438 
439 
440 
441 
442 
443 
444 
445 
446 
447 
448 
449 
450 
451 
452 
453 
454 
455 
456 
457 
458 
459 
460 
461 
462 
463 
464 
465 
466 
467 
468 
469 
470 
471 
472 
473 
474 
475 
476 
477 
478 
479 
480 
481 
482 
483 
484 
485 
486 
487 
488 
489 
490 
491 
492 
493 
494 
495 
496 
497 
498 
499 
500 
501 
502 
503 
504 
505 
506 
507 
508 
509 
510 
511 
512 
513 
514 
515 
516 
517 
518 
519 
520 
521 
522 
523 
524 
525 
526 
527 
528 
529 
530 
531 
532 
533 
534 
535 
536 
537 
538 
539 
540 
541 
542 
543 
544 
545 
546 
547 
548 
549 
550 
551 
552 
553 
554 
555 
556 
557 
558 
559 
560 
561 
562 
563 
564 
565 
566 
567     public ByteOrder   order() {
568     return ByteOrder.nativeOrder();
569     }
570 
571 
572 
573 }
574
A to Z: JavaDoc & Examples Daily Java News & Articles Open Source Projects Open Source Codes Free Computer Books Remove Frame
Popular Tags