Sky at Night 2007 June/SAN CD 6-2007 CD-ROM 25.iso/pc/Software/AstroGrav_Win/Java/jre1.6.0/lib/rt.jar/java/nio/DirectCharBufferS.class

Java Class File | 2006-11-29 | 3.8 KB | 235 lines

package java.nio;

import sun.misc.Cleaner;
import sun.misc.Unsafe;
import sun.nio.ch.DirectBuffer;

class DirectCharBufferS extends CharBuffer implements DirectBuffer {
   protected static final Unsafe unsafe = Bits.unsafe();
   protected static final boolean unaligned = Bits.unaligned();
   protected Object viewedBuffer = null;

   public Object viewedBuffer() {
      return this.viewedBuffer;
   }

   public Cleaner cleaner() {
      return null;
   }

   DirectCharBufferS(DirectBuffer var1, int var2, int var3, int var4, int var5, int var6) {
      super(var2, var3, var4, var5);
      this.address = var1.address() + (long)var6;
      this.viewedBuffer = var1;
   }

   public CharBuffer slice() {
      int var1 = this.position();
      int var2 = this.limit();

      assert var1 <= var2;

      int var3 = var1 <= var2 ? var2 - var1 : 0;
      int var4 = var1 << 1;

      assert var4 >= 0;

      return new DirectCharBufferS(this, -1, 0, var3, var3, var4);
   }

   public CharBuffer duplicate() {
      return new DirectCharBufferS(this, this.markValue(), this.position(), this.limit(), this.capacity(), 0);
   }

   public CharBuffer asReadOnlyBuffer() {
      return new DirectCharBufferRS(this, this.markValue(), this.position(), this.limit(), this.capacity(), 0);
   }

   public long address() {
      return this.address;
   }

   // $FF: renamed from: ix (int) long
   private long method_0(int var1) {
      return this.address + (long)(var1 << 1);
   }

   public char get() {
      return Bits.swap(unsafe.getChar(this.method_0(this.nextGetIndex())));
   }

   public char get(int var1) {
      return Bits.swap(unsafe.getChar(this.method_0(this.checkIndex(var1))));
   }

   public CharBuffer get(char[] var1, int var2, int var3) {
      if (var3 << 1 > 6) {
         checkBounds(var2, var3, var1.length);
         int var4 = this.position();
         int var5 = this.limit();

         assert var4 <= var5;

         int var6 = var4 <= var5 ? var5 - var4 : 0;
         if (var3 > var6) {
            throw new BufferUnderflowException();
         }

         if (this.order() != ByteOrder.nativeOrder()) {
            Bits.copyToCharArray(this.method_0(var4), var1, (long)(var2 << 1), (long)(var3 << 1));
         } else {
            Bits.copyToByteArray(this.method_0(var4), var1, (long)(var2 << 1), (long)(var3 << 1));
         }

         this.position(var4 + var3);
      } else {
         super.get(var1, var2, var3);
      }

      return this;
   }

   public CharBuffer put(char var1) {
      unsafe.putChar(this.method_0(this.nextPutIndex()), Bits.swap(var1));
      return this;
   }

   public CharBuffer put(int var1, char var2) {
      unsafe.putChar(this.method_0(this.checkIndex(var1)), Bits.swap(var2));
      return this;
   }

   public CharBuffer put(CharBuffer var1) {
      if (var1 instanceof DirectCharBufferS) {
         if (var1 == this) {
            throw new IllegalArgumentException();
         }

         DirectCharBufferS var2 = (DirectCharBufferS)var1;
         int var3 = var2.position();
         int var4 = var2.limit();

         assert var3 <= var4;

         int var5 = var3 <= var4 ? var4 - var3 : 0;
         int var6 = this.position();
         int var7 = this.limit();

         assert var6 <= var7;

         int var8 = var6 <= var7 ? var7 - var6 : 0;
         if (var5 > var8) {
            throw new BufferOverflowException();
         }

         unsafe.copyMemory(var2.method_0(var3), this.method_0(var6), (long)(var5 << 1));
         var2.position(var3 + var5);
         this.position(var6 + var5);
      } else if (var1.hb != null) {
         int var9 = var1.position();
         int var10 = var1.limit();

         assert var9 <= var10;

         int var11 = var9 <= var10 ? var10 - var9 : 0;
         this.put(var1.hb, var1.offset + var9, var11);
         var1.position(var9 + var11);
      } else {
         super.put(var1);
      }

      return this;
   }

   public CharBuffer put(char[] var1, int var2, int var3) {
      if (var3 << 1 > 6) {
         checkBounds(var2, var3, var1.length);
         int var4 = this.position();
         int var5 = this.limit();

         assert var4 <= var5;

         int var6 = var4 <= var5 ? var5 - var4 : 0;
         if (var3 > var6) {
            throw new BufferOverflowException();
         }

         if (this.order() != ByteOrder.nativeOrder()) {
            Bits.copyFromCharArray(var1, (long)(var2 << 1), this.method_0(var4), (long)(var3 << 1));
         } else {
            Bits.copyFromByteArray(var1, (long)(var2 << 1), this.method_0(var4), (long)(var3 << 1));
         }

         this.position(var4 + var3);
      } else {
         super.put(var1, var2, var3);
      }

      return this;
   }

   public CharBuffer compact() {
      int var1 = this.position();
      int var2 = this.limit();

      assert var1 <= var2;

      int var3 = var1 <= var2 ? var2 - var1 : 0;
      unsafe.copyMemory(this.method_0(var1), this.method_0(0), (long)(var3 << 1));
      this.position(var3);
      this.limit(this.capacity());
      return this;
   }

   public boolean isDirect() {
      return true;
   }

   public boolean isReadOnly() {
      return false;
   }

   public String toString(int var1, int var2) {
      if (var2 <= this.limit() && var1 <= var2) {
         try {
            int var3 = var2 - var1;
            char[] var4 = new char[var3];
            CharBuffer var5 = CharBuffer.wrap(var4);
            CharBuffer var6 = this.duplicate();
            var6.position(var1);
            var6.limit(var2);
            var5.put(var6);
            return new String(var4);
         } catch (StringIndexOutOfBoundsException var7) {
            throw new IndexOutOfBoundsException();
         }
      } else {
         throw new IndexOutOfBoundsException();
      }
   }

   public CharSequence subSequence(int var1, int var2) {
      int var3 = this.position();
      int var4 = this.limit();

      assert var3 <= var4;

      var3 = var3 <= var4 ? var3 : var4;
      int var5 = var4 - var3;
      if (var1 >= 0 && var2 <= var5 && var1 <= var2) {
         int var6 = var2 - var1;
         int var7 = var3 + var1 << 1;

         assert var7 >= 0;

         return new DirectCharBufferS(this, -1, 0, var6, var6, var7);
      } else {
         throw new IndexOutOfBoundsException();
      }
   }

   public ByteOrder order() {
      return ByteOrder.nativeOrder() == ByteOrder.BIG_ENDIAN ? ByteOrder.LITTLE_ENDIAN : ByteOrder.BIG_ENDIAN;
   }
}