-//##header\r
-//#if defined(FOUNDATION10) || defined(J2SE13) || defined(ECLIPSE_FRAGMENT)\r
-//##/*\r
-//## * *****************************************************************************\r
-//## * Copyright (C) 2006-2009, International Business Machines\r
-//## * Corporation and others. All Rights Reserved.\r
-//## * *****************************************************************************\r
-//## */\r
-//##// dlf13 internal 1.3 compatibility only\r
-//##\r
-//##package com.ibm.icu.impl;\r
-//##\r
-//##/**\r
-//## * @internal\r
-//## */\r
-//##public final class ByteBuffer {\r
-//## private byte[] data;\r
-//##\r
-//## private int pos;\r
-//##\r
-//## private int limit;\r
-//##\r
-//## private ByteBuffer() {\r
-//## }\r
-//##\r
-//## public byte[] array() {\r
-//## byte[] result = new byte[limit];\r
-//## for (int i = 0; i < limit; ++i) {\r
-//## result[i] = data[i];\r
-//## }\r
-//## return result;\r
-//## }\r
-//##\r
-//## public static ByteBuffer wrap(byte[] data) {\r
-//## if (data == null)\r
-//## throw new NullPointerException();\r
-//## ByteBuffer result = new ByteBuffer();\r
-//## result.data = data;\r
-//## result.pos = 0;\r
-//## result.limit = data.length;\r
-//## return result;\r
-//## }\r
-//##\r
-//## public int limit() {\r
-//## return limit;\r
-//## }\r
-//##\r
-//## public int position() {\r
-//## return pos;\r
-//## }\r
-//##\r
-//## public int remaining() {\r
-//## return limit - pos;\r
-//## }\r
-//##\r
-//## public byte get() {\r
-//## if (pos < limit)\r
-//## return data[pos++];\r
-//## throw new IndexOutOfBoundsException();\r
-//## }\r
-//##\r
-//## public void get(byte[] dst, int offset, int length) {\r
-//## if (offset < 0 || offset + length > dst.length || pos + length > limit) {\r
-//## throw new IndexOutOfBoundsException();\r
-//## }\r
-//## for (int i = 0; i < length; ++i) {\r
-//## dst[offset++] = data[pos++];\r
-//## }\r
-//## }\r
-//##\r
-//## public void put(byte b) {\r
-//## if (pos < limit) {\r
-//## data[pos++] = b;\r
-//## } else {\r
-//## throw new IndexOutOfBoundsException();\r
-//## }\r
-//## }\r
-//##\r
-//## public void put(byte[] src, int offset, int length) {\r
-//## if (offset < 0 || offset + length > src.length || pos + length > limit) {\r
-//## throw new IndexOutOfBoundsException();\r
-//## }\r
-//## for (int i = offset; i < offset + length; i++) {\r
-//## put(src[i]);\r
-//## }\r
-//## }\r
-//##\r
-//## public void put(byte[] src) {\r
-//## put(src, 0, src.length);\r
-//## }\r
-//##\r
-//## public static final ByteBuffer allocate(int size){\r
-//## ByteBuffer ret = new ByteBuffer();\r
-//## ret.data = new byte[size];\r
-//## ret.pos = 0;\r
-//## ret.limit = size;\r
-//## return ret;\r
-//## }\r
-//##}\r
-//#endif\r
+//##header J2SE15
+//#if defined(FOUNDATION10) || defined(J2SE13) || defined(ECLIPSE_FRAGMENT)
+//##/*
+//## * *****************************************************************************
+//## * Copyright (C) 2006-2009, International Business Machines
+//## * Corporation and others. All Rights Reserved.
+//## * *****************************************************************************
+//## */
+//##// dlf13 internal 1.3 compatibility only
+//##
+//##package com.ibm.icu.impl;
+//##
+//##/**
+//## * @internal
+//## */
+//##public final class ByteBuffer {
+//## private byte[] data;
+//##
+//## private int pos;
+//##
+//## private int limit;
+//##
+//## private ByteBuffer() {
+//## }
+//##
+//## public byte[] array() {
+//## byte[] result = new byte[limit];
+//## for (int i = 0; i < limit; ++i) {
+//## result[i] = data[i];
+//## }
+//## return result;
+//## }
+//##
+//## public static ByteBuffer wrap(byte[] data) {
+//## if (data == null)
+//## throw new NullPointerException();
+//## ByteBuffer result = new ByteBuffer();
+//## result.data = data;
+//## result.pos = 0;
+//## result.limit = data.length;
+//## return result;
+//## }
+//##
+//## public int limit() {
+//## return limit;
+//## }
+//##
+//## public int position() {
+//## return pos;
+//## }
+//##
+//## public int remaining() {
+//## return limit - pos;
+//## }
+//##
+//## public byte get() {
+//## if (pos < limit)
+//## return data[pos++];
+//## throw new IndexOutOfBoundsException();
+//## }
+//##
+//## public void get(byte[] dst, int offset, int length) {
+//## if (offset < 0 || offset + length > dst.length || pos + length > limit) {
+//## throw new IndexOutOfBoundsException();
+//## }
+//## for (int i = 0; i < length; ++i) {
+//## dst[offset++] = data[pos++];
+//## }
+//## }
+//##
+//## public void put(byte b) {
+//## if (pos < limit) {
+//## data[pos++] = b;
+//## } else {
+//## throw new IndexOutOfBoundsException();
+//## }
+//## }
+//##
+//## public void put(byte[] src, int offset, int length) {
+//## if (offset < 0 || offset + length > src.length || pos + length > limit) {
+//## throw new IndexOutOfBoundsException();
+//## }
+//## for (int i = offset; i < offset + length; i++) {
+//## put(src[i]);
+//## }
+//## }
+//##
+//## public void put(byte[] src) {
+//## put(src, 0, src.length);
+//## }
+//##
+//## public static final ByteBuffer allocate(int size){
+//## ByteBuffer ret = new ByteBuffer();
+//## ret.data = new byte[size];
+//## ret.pos = 0;
+//## ret.limit = size;
+//## return ret;
+//## }
+//##}
+//#endif