All 15 Arrays & Multidimensional Arrays questions
More in Arrays & Multidimensional Arrays
How does Java handle array bounds checking, and what exception is thrown when accessing an invalid index? How do you correctly iterate a 2D array using both traditional indexed for-loops and the enhanced for-each loop, and when is each approach preferable? What is array covariance's relationship to generic arrays, and why can't you directly create a generic array like new T[10] or new List<String>[10]? How would you flatten a 2D array into a 1D array, and conversely, reshape a 1D array into a 2D array? How would you efficiently copy, resize, or merge large arrays in Java, and what are the performance trade-offs between System.arraycopy(), Arrays.copyOf(), and manual loops? How would you implement an efficient in-place algorithm on a 2D array, such as rotating a matrix 90 degrees, while minimizing extra memory allocation? How would you implement a custom, resizable dynamic array (similar to ArrayList's internal mechanism) from scratch using a raw Java array, including the amortized doubling growth strategy? How would you implement a memory-efficient sparse matrix representation in Java when a large 2D array would mostly contain zero/default values, avoiding the memory waste of a full dense array? How does the JVM lay out array objects in memory, including the array header overhead, and how does this affect memory efficiency for very large arrays of primitives versus boxed wrapper types?
Advertisement
Java › Arrays & Multidimensional Arrays

How does Java implement covariant array typing, and why is this considered a design flaw that can lead to runtime ArrayStoreException?

Advanced

Answer

Java arrays are covariant, meaning Object[] arr = new String[3] is legal (a String[] reference can be assigned to an Object[] variable) since arrays retain their actual runtime component type -- but this creates a loophole where code operating on the Object[] reference can attempt to insert an incompatible type at runtime (arr[0] = Integer.valueOf(1)), which the compiler cannot catch statically and instead throws ArrayStoreException only when that specific line actually executes, illustrating why generics deliberately chose invariance instead to catch such errors at compile time.
Object[] arr = new String[3];  // legal due to covariance
arr[0] = "hello";  // fine, actual runtime type is String[]
arr[1] = Integer.valueOf(42);  // compiles fine (Object accepts Integer)... but throws ArrayStoreException at RUNTIME
Real-world example A library method accepting an Object[] parameter unknowingly receives a String[] and attempts to insert a non-String object into it, causing a production ArrayStoreException that a compile-time type system (like Java Generics' intentional invariance) would have caught much earlier during development instead.

Common follow-ups: Why did Java's generics designers choose invariance (List<String> is NOT a List<Object>) specifically to avoid this exact array pitfall?;How does the JVM implement the runtime check that throws ArrayStoreException?

Generics;Exceptions
All 15 Arrays & Multidimensional Arrays questions