/*
* This is free and unencumbered software released into the public domain.
*
* Anyone is free to copy, modify, publish, use, compile, sell, or
* distribute this software, either in source code form or as a compiled
* binary, for any purpose, commercial or non-commercial, and by any
* means.
*
* In jurisdictions that recognize copyright laws, the author or authors
* of this software dedicate any and all copyright interest in the
* software to the public domain. We make this dedication for the benefit
* of the public at large and to the detriment of our heirs and
* successors. We intend this dedication to be an overt act of
* relinquishment in perpetuity of all present and future rights to this
* software under copyright law.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*
* For more information, please refer to <http://unlicense.org/>
*/
package jxtn.core.unix;
import java.nio.ByteBuffer;
final class ByteArrays {
public static byte[] copy(ByteBuffer buffer) {
byte[] dst = new byte[buffer.remaining()];
System.arraycopy(buffer.array(), buffer.arrayOffset() + buffer.position(), dst, 0, buffer.remaining());
return dst;
}
public static int indexOf(byte[] source, int sourceOffset, byte ch) {
return indexOf(source, sourceOffset, source.length - sourceOffset, ch);
}
public static int indexOf(byte[] source, int sourceOffset, int sourceCount, byte ch) {
for (int i = sourceOffset; i < sourceOffset + sourceCount; i++) {
if (source[i] == ch) {
return i;
}
}
return -1;
}
public static int lastIndexOf(byte[] source, int sourceOffset, int sourceCount, byte ch) {
int i = sourceOffset + sourceCount - 1;
for (; i >= sourceOffset; i--) {
if (source[i] == ch) {
return i;
}
}
return -1;
}
}