Java library for handling byte arrays?

Question

Is there a free library that contains common methods for managing an array of bytes?

It should be able to perform the following operations, at least in byte arrays, but other types of arrays would also be nice:

• Sub array search
• Search and Replace
• Insert items at a specific position
• Delete sub-matrix at a specific position

I know that all these functions are not high magic, but they fully implement them, and errors with errors and errors, including tests with the corresponding modules, take some time.

So I'm looking for a library (not the GPL) that includes these features. Does anyone know such a library?

Answer 1

If you work with arrays of primitive types, the Guava library may help. For more details, see PrimitivesExplained - guava-libraries - Guava primitive utilities, explained. - Guava: core Google libraries for Java 1.6+ - hosting Google Project

Interesting class com.google.common.primitives.Bytes

Answer 2

I think your first three problems can be solved by the Java.util.Arrays class, you do not need to use a third-party library.

 Arrays.binarySearch() method is for your first problem. Arrays.fill() method for your second problem. 

For the latter problem, I can offer some third-party packages that I know.

Google Guava, the Apache community API can help.

Answer 3

I think you can do what you need by turning your array into Collection . If you do not want to use Collections , and you only deal with byte[] , you can do it something like this:

 public class A { public static byte[] deleteSubarray(byte[] array, byte[] subArray) { int p = searchFor(array, subArray); if (p == -1) return array; byte[] result = new byte[array.length - subArray.length + 1]; for (int i = 0; i < p; i++) result[i] = array[i]; for (int i = p + subArray.length - 1; i < array.length; i++) { result[p] = array[i]; p++; } return result; } public static byte[] insertElementAt(byte[] array, byte element, int position) { byte[] result = new byte[array.length + 1]; for (int i = 0; i <= position - 1; i++) result[i] = array[i]; result[position] = element; for (int i = position + 1; i < array.length; i++) { result[i] = array[i]; } return result; } public static byte[] searchAndReplace(byte[] array, byte[] search, byte[] replace) { if (search.length != replace.length) return array; int p = searchFor(array, search); if (p == -1) return array; byte[] result = Arrays.copyOf(array, array.length); for (int i = 0; i < replace.length; i++) { result[p] = replace[i]; p++; } return result; } public static int searchFor(byte[] array, byte[] subArray) { if (subArray.length > array.length) return -1; int p = (new String(array)).indexOf(new String(subArray)); for (int i = 1; i < subArray.length; i++) { if (array[p + i] != subArray[i]) return -1; } return p; } public static void main(String[] args) { String a = "hello world!"; String b = "lo w"; System.out.println(searchFor(a.getBytes(), b.getBytes())); System.out.println(new String(searchAndReplace(a.getBytes(), b.getBytes(), "mn x".getBytes()))); System.out.println(new String(insertElementAt(a.getBytes(), "-".getBytes()[0], 5))); System.out.println(new String(deleteSubarray(a.getBytes(), b.getBytes()))); } } 

Conclusion:

 3 helmn xorld! hello-world! helworld! 

If you are dealing with other types of arrays, then searchFor does not work, but you can easily generalize :)