How to get a sub array of array in Java, without copying data?

Arrays.asList(array).subList(x, y).

This method doesn't give you an array, but a List, which is far more flexible.

There is no real way to wrap any data without copying and receive real array in Java. You just cannot create new array over existing memory. You have basically 2 options:

• Use methods that can accept range of array. This was already recommended.
• Use wrapper that gives some kind of abstraction that is close to array and is suitable for many applications. Will be described below.

You may use java.nio.Buffer classes hierarchy, especially java.nio.ByteBuffer which offers buffer abstraction on whole array or sub-ranges. Often it is what people need. This also offers many interesting abilities like 'zero copy' flip and flexible byte area representation.

Here is example of wrapping using java.nio.ByteBuffer. This should be very close to what you need. At least for some operations.

byte [] a1 = {0, 0, 1, 0};
ByteBuffer buf = ByteBuffer.wrap(a1,1,2);

Then you can do on buf any ByteBuffer operation.

Just a warning, buf.array() returns original a1 array (backend) with all elements.

There is no way to declare a subarray in Java if you use built in arrays like byte[]. The reason is: The length of the array is stored with the data, not with the declaration of the reference to it. Hence a subarray which does not copy the data has no place where it can store the length! So for basic types you can use the mentioned efficient byte array copies and for higher types (List) there are methods available.

You could take the same approach as the String class takes; create a class for immutable objects which are constructed from an array, a start offset and an end offset which offers access to the sub-array. The user of such an object does not have to know the distinction between the whole array or a sub-array. The constructor does not have to copy the array, just store the array reference and its boundaries.

Perhaps instead of working with arrays you should work with a different type that maintains a reference to a slice of the original array, instead of copying the data over, similar to ArraySegment in C#. An additional benefit to this is that you can also shift the slice over the original array on-demand, without creating new instances. Pseudo code:

public class ArraySegment<T> implements Iterable<T> 
{
      private int from, to;
      private T[] original;
      
      public ArraySegment<T>(T[] original, int from, int to)
      {
          //constructor stuff
      }

      public T get(int index)
      {
           return original[index + from];
      }

      public int size()
      {
          return to - from + 1;
      }
      
      @Override
      public Iterator<T> iterator()
      {
          //Iterator that iterates over the slice
      }

      //Can support setters on from/to variables
}

You could use (ArrayList).subList(value1, value2) i belive, perhaps that could help in your case? That is ofcourse if you want to use an ArrayList.

Google's Guava libraries support the slice concept in the form of a ByteSource.

Google Guava is a readily available open-source package of functionality, written from the ground up to follow Google best practices, which depend on significant array slicing capabilities.