public MaskedLong invShiftRight(MaskedLong n) throws SolverException {
		if (!n.isFullyDefined()) {
			throw new UnsupportedOperationException("Cannot left shift by an unknown amount");
		}
		return invShiftRight(n.longValue());
	}
Invert an arithmetic right shift of {@code n} positions, that is shift left

<p>
This is different from a normal shift left, in that it inserts unknowns at the right. The
normal left shift inserts zeros. Additionally, all bits that fall off the left must match the
resulting sign bit, or else the inversion is undefined.

@param n the number of positions
@return the result
@throws SolverException if the inversion is undefined
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/app/plugin/assembler/sleigh/expr/MaskedLong.java