assertTrue(length > 0);
        assertEquals(0, testBlock.wordCount);
        assertEquals(0, testBlock.byteCount);
    }

    @Test
    @DisplayName("Test decode with Snap server workaround")
    void testDecodeWithSnapServerWorkaround() throws SMBProtocolDecodingException {
        testBlock = new TestAndXServerMessageBlock(mockConfig, (byte) 0x25);
        byte[] buffer = new byte[1024];

             * so let's populate them here
             */

            andxCommand = buffer[bufferIndex];
            andxOffset = readInt2(buffer, bufferIndex + 2);

            if (andxOffset == 0) { /* Snap server workaround */
                andxCommand = (byte) 0xFF;
            }

            /*
             * no point in calling readParameterWordsWireFormat if there are no more

        int len = block.decode(buf, 0);
        assertTrue(len > 0);
        assertEquals(4, block.wordCount);
        assertNull(block.andx);
    }

    @Test
    @DisplayName("readAndXWireFormat applies Snap server workaround (offset 0)")
    void testReadAndXWireFormatSnapWorkaround() {
        DummyAndXBlock block = new DummyAndXBlock();
        block.headerStart = 0;

        byte[] buf = new byte[64];

// RegisterError registers the specified rendering function. This latter
// will be called for a pretty rendering of fatal errors.
func RegisterError(f func(string, error, bool) string) {
	errorFmtFunc = f
}

// uniq swaps away duplicate elements in data, returning the size of the
// unique set. data is expected to be pre-sorted, and the resulting set in
// the range [0:size] will remain in sorted order. Uniq, following a

             */

            this.andxCommand = buffer[bufferIndex];
            this.andxOffset = SMBUtil.readInt2(buffer, bufferIndex + 2);

            if (this.andxOffset == 0) { /* Snap server workaround */
                this.andxCommand = (byte) 0xFF;
            }

            /*
             * no point in calling readParameterWordsWireFormat if there are no more

    // array slot is read and written exactly once. However, it can have very poor memory locality:
    // benchmarking shows it can take 7 times longer than the other two in some cases. The other two
    // do n swaps, minus a delta (0 or 2 for Reversal, gcd(d, n) for Successive), so that's about
    // twice as many reads and writes. But benchmarking shows that they usually perform better than

    if (from + to - allRequired[low] - allRequired[high] > 0) {
      return high;
    } else {
      return low;
    }
  }

  /** Swaps the values at {@code i} and {@code j} in {@code array}. */
  private static void swap(double[] array, int i, int j) {
    double temp = array[i];
    array[i] = array[j];
    array[j] = temp;
  }

### Go 1.25

Go 1.25 added a new `decoratemappings` setting that controls whether the Go
runtime annotates OS anonymous memory mappings with context about their
purpose. These annotations appear in /proc/self/maps and /proc/self/smaps as
"[anon: Go: ...]". This setting is only used on Linux. For Go 1.25, it defaults
to `decoratemappings=1`, enabling annotations. Using `decoratemappings=0`