// }
// and if the checks "i < 0" lead to the same stable result (almost always true or, little better,
// almost always false), then CPU can optimize this branching.
// System.out.println("QUICK");
final IPoint min = pattern.coordMin().toRoundedPoint();
final Pattern shiftedPattern = pattern.shift(min.symmetric().toPoint()); // "normalized" coordinates >=0
final Matrix<?> shiftedSrc = Matrices.asShifted(src, min.coordinates());
Matrix<? extends UpdatablePArray> clone = Arrays.SMM.newMatrix(UpdatablePArray.class, src);
Matrices.copy(arrayContext == null ? null : arrayContext.part(0.0, 0.05),
clone, shiftedSrc);
Matrix<? extends PArray> lazy = asProcessed(requiredType, clone, additionalMatrices, shiftedPattern);