public static long nextArrayOffset(Object[] curr)
    {
        return REF_ARRAY_BASE + ((long) (length(curr) - 1) << REF_ELEMENT_SHIFT);
    }
This method assumes index is actually (index << 1) because lower bit is
used for resize. This is compensated for by reducing the element shift.
The computation is constant folded, so there's no cost.
jctools-core/src/main/java/org/jctools/queues/LinkedArrayQueueUtil.java