int shift2 = shift1 + 10;
    loader.setValuePrefix(shift2);
    // fill with new data - has to live for 20 ms more
    for (int i = 0; i < 10; i++) {
      cache.invalidate(keyPrefix + i);
      assertWithMessage("key: %s%s", keyPrefix, i)
          .that(cache.getUnchecked(keyPrefix + i))
          .isEqualTo(i + shift2);
    }

"src/compress/flate/testdata/huffman-rand-max.in", "src/compress/flate/testdata/huffman-shifts.dyn.expect", "src/compress/flate/testdata/huffman-shifts.dyn.expect-noinput", "src/compress/flate/testdata/huffman-shifts.golden", "src/compress/flate/testdata/huffman-shifts.in", "src/compress/flate/testdata/huffman-shifts.wb.expect", "src/compress/flate/testdata/huffman-shifts.wb.expect-noinput", "src/compress/flate/testdata/huffman-text-shift.dyn.expect", "src/compress/flate/testdata/huffman-text-shift.dyn.expect-noinput",...

"src/compress/flate/testdata/huffman-rand-max.in", "src/compress/flate/testdata/huffman-shifts.dyn.expect", "src/compress/flate/testdata/huffman-shifts.dyn.expect-noinput", "src/compress/flate/testdata/huffman-shifts.golden", "src/compress/flate/testdata/huffman-shifts.in", "src/compress/flate/testdata/huffman-shifts.wb.expect", "src/compress/flate/testdata/huffman-shifts.wb.expect-noinput", "src/compress/flate/testdata/huffman-text-shift.dyn.expect", "src/compress/flate/testdata/huffman-text-shift.dyn.expect-noinput",...

	ADDS	R7@>2, R5, R16                                   // ERROR "unsupported shift operator"
	ADDSW	R7@>2, R5, R16                                   // ERROR "unsupported shift operator"
	SUB	R7@>2, R5, R16                                   // ERROR "unsupported shift operator"
	SUBW	R7@>2, R5, R16                                   // ERROR "unsupported shift operator"

and adjust the corresponding coefficient. if u.IsOdd() == no { rshift1(u, 0) if A.IsOdd() == yes || B.IsOdd() == yes { rshift1(A, A.add(m)) rshift1(B, B.add(a)) } else { rshift1(A, 0) rshift1(B, 0) } } else { // v.IsOdd() == no rshift1(v, 0) if C.IsOdd() == yes || D.IsOdd() == yes { rshift1(C, C.add(m)) rshift1(D, D.add(a)) } else { rshift1(C, 0) rshift1(D, 0) } } if v.IsZero() == yes { return u, A, nil } } } //go:norace func rshift1(a *Nat, carry uint) { size := len(a.limbs) aLimbs := a.limbs[:size]...

and adjust the corresponding coefficient. if u.IsOdd() == no { rshift1(u, 0) if A.IsOdd() == yes || B.IsOdd() == yes { rshift1(A, A.add(m)) rshift1(B, B.add(a)) } else { rshift1(A, 0) rshift1(B, 0) } } else { // v.IsOdd() == no rshift1(v, 0) if C.IsOdd() == yes || D.IsOdd() == yes { rshift1(C, C.add(m)) rshift1(D, D.add(a)) } else { rshift1(C, 0) rshift1(D, 0) } } if v.IsZero() == yes { return u, A, nil } } } //go:norace func rshift1(a *Nat, carry uint) { size := len(a.limbs) aLimbs := a.limbs[:size]...

			}
		case lex.LSH:
			p.next()
			shift := p.factor()
			if int64(shift) < 0 {
				p.errorf("negative left shift count")
			}
			return value << shift
		case lex.RSH:
			p.next()
			shift := p.term()
			if int64(shift) < 0 {
				p.errorf("negative right shift count")
			}
			if int64(value) < 0 {
				p.errorf("right shift of value with high bit set")
			}
			value >>= shift

	MOVB	R0>>8, R2          // ERROR "illegal shift"
	MOVH	R0<<16, R2         // ERROR "illegal shift"
	MOVBS	R0->8, R2          // ERROR "illegal shift"
	MOVHS	R0<<24, R2         // ERROR "illegal shift"
	MOVBU	R0->24, R2         // ERROR "illegal shift"
	MOVHU	R0@>1, R2          // ERROR "illegal shift"
	XTAB	R0>>8, R2          // ERROR "illegal shift"
	XTAH	R0<<16, R2         // ERROR "illegal shift"

    val sink = sink()
    val bitCount = 64 - java.lang.Long.numberOfLeadingZeros(v)
    val byteCount = (bitCount + 6) / 7
    for (shift in (byteCount - 1) * 7 downTo 0 step 7) {
      val lastBit = if (shift == 0) 0 else 0b1000_0000
      sink.writeByte(((v shr shift) and 0b0111_1111).toInt() or lastBit)
    }
  }

  override fun toString(): String = path.joinToString(separator = " / ")

     * top SIGNIFICAND_BITS + 1.
     *
     * It helps to consider the real number signif = absX * 2^(SIGNIFICAND_BITS - exponent).
     */
    int shift = exponent - SIGNIFICAND_BITS - 1;
    long twiceSignifFloor = absX.shiftRight(shift).longValue();
    long signifFloor = twiceSignifFloor >> 1;
    signifFloor &= SIGNIFICAND_MASK; // remove the implied bit

    /*