/* * Copyright (c) 2013, OpenCloudDB/MyCAT and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software;Designed and Developed mainly by many Chinese * opensource volunteers. you can redistribute it and/or modify it under the * terms of the GNU General Public License version 2 only, as published by the * Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Any questions about this component can be directed to it's project Web address * https://code.google.com/p/opencloudb/. * */ package com.talent.nio.utils.clone; import java.io.InputStream; /** * ByteArrayInputStream implementation that does not synchronize methods. */ public class FastByteArrayInputStream extends InputStream { /** * Our byte buffer */ protected byte[] buf = null; /** * Number of bytes that we can read from the buffer */ protected int count = 0; /** * Number of bytes that have been read from the buffer */ protected int pos = 0; public FastByteArrayInputStream(byte[] buf, int count) { this.buf = buf; this.count = count; } @Override public final int available() { return count - pos; } @Override public final int read() { return (pos < count) ? (buf[pos++] & 0xff) : -1; } @Override public final int read(byte[] b, int off, int len) { if (pos >= count) return -1; if ((pos + len) > count) len = (count - pos); System.arraycopy(buf, pos, b, off, len); pos += len; return len; } @Override public final long skip(long n) { if ((pos + n) > count) n = count - pos; if (n < 0) return 0; pos += n; return n; } }