Fallback to ArrayUtil.oversize if we overvflow

The default way is to always grow the byte[] to the
next power of two of the requested length. This can
overflow even if there might still be enough space.
We now fall back to Lucene's oversize implementation
in case of an overflow and try if we can make it fit.

Author: s1ck

core/src/main/java/org/neo4j/gds/core/loading/ChunkedAdjacencyLists.java

@@ -19,9 +19,10 @@
  */
 package org.neo4j.gds.core.loading;
 
+import org.neo4j.gds.collections.ArrayUtil;
 import org.neo4j.gds.collections.DrainingIterator;
-import org.neo4j.gds.collections.hsl.HugeSparseByteArrayList;
 import org.neo4j.gds.collections.hsa.HugeSparseCollections;
+import org.neo4j.gds.collections.hsl.HugeSparseByteArrayList;
 import org.neo4j.gds.collections.hsl.HugeSparseIntList;
 import org.neo4j.gds.collections.hsl.HugeSparseLongArrayList;
 import org.neo4j.gds.collections.hsl.HugeSparseLongList;
@@ -220,15 +221,31 @@ private long[] ensurePropertyCapacity(long index, int pos, int required, int pro
                 )
             );
         } else if (currentProperties.length <= pos + required) {
-//            int newLength = ArrayUtil.oversize(pos + required, Long.BYTES);
-            int newLength = BitUtil.nextHighestPowerOfTwo(pos + required);
+            var newLength = getNewLength(pos + required);
             currentProperties = Arrays.copyOf(currentProperties, newLength);
             this.properties[propertyIndex].set(index, currentProperties);
         }
 
         return currentProperties;
     }
 
+    static int getNewLength(int minLength) {
+        int newLength = BitUtil.nextHighestPowerOfTwo(minLength);
+        if (newLength < 0) {
+            // If we overflow, we try to grow by ~1/8th and :fingers_crossed: it's enough.
+            newLength = ArrayUtil.oversize(minLength, Long.BYTES);
+        }
+        if (newLength < 0) {
+            throw new IllegalArgumentException(
+                formatWithLocale(
+                    "Encountered numeric overflow in compressed buffer. Required a minimum length of %d.",
+                    minLength
+                )
+            );
+        }
+        return newLength;
+    }
+
     public long capacity() {
         return targetLists.capacity();
     }