/**
     * Removes an entry from within a table. All entries following the removed node can stay, but
     * all preceding ones need to be cloned.
     *
     * <p>This method does not decrement count for the removed entry, but does decrement count for
     * all partially collected entries which are skipped. As such callers which are modifying count
     * must re-read it after calling removeFromChain.
     *

    /**
     * Removes an entry from within a table. All entries following the removed node can stay, but
     * all preceding ones need to be cloned.
     *
     * <p>This method does not decrement count for the removed entry, but does decrement count for
     * all partially collected entries which are skipped. As such callers which are modifying count
     * must re-read it after calling removeFromChain.
     *

                if (cleanupData != null) {
                    cleanupData.set(data);
                }
                if (cleanupReturns) {
                    // Simulate cleanup success: retry with decremented count
                    return tryStartOperation(operationName, data, remainingRetries - 1);
                }
                return false;
            }
        };
    }

    @Test

     *
     * @param <E> the element type of {@link Vector}
     * @param initialCapacity the initial capacity of the vector
     * @param capacityIncrement the capacity increment when the vector overflows
     * @return a new instance of {@link Vector}
     * @see Vector#Vector(int, int)
     */
    public static <E> Vector<E> newVector(final int initialCapacity, final int capacityIncrement) {