package algorithmus;

import java.util.Arrays;

public class Utils {
	
	public static byte[] crop(byte[] arr) {
		for(int i = 0; i<arr.length; i++)
			if(arr[i] == (byte)0x00)
				return Arrays.copyOfRange(arr, 0, i);
		return arr;
	}
	
	public static byte[] fill(byte[] arr, int length) {
		return Arrays.copyOf(arr, length);
	}
	
	public static int inArr(Object[] arr, Object tofind) {
		for(int i = 0; i<arr.length; i++)
			if(arr[i] == tofind)
				return i;
		return 0;
	}
	
	public static int inArr(char[] arr, char tofind) {
		for(int i = 0; i<arr.length; i++)
			if(arr[i] == tofind)
				return i;
		return 0;
	}
	
	public static int inArrEq(Object[] arr, Object tofind) {
		for(int i = 0; i<arr.length; i++)
			if(arr[i].equals(tofind))
				return i;
		return 0;
	}

}