void shouldDecodeFromMiddleOfBuffer() throws SMBProtocolDecodingException {
            // Given
            byte[] buffer = new byte[100];
            int offset = 40;
            ByteBuffer bb = ByteBuffer.wrap(buffer, offset, 32).order(ByteOrder.LITTLE_ENDIAN);
            bb.putLong(5000L);
            bb.putLong(2500L);
            bb.putLong(2500L);
            bb.putInt(16);

[![Java CI](https://github.com/apache/maven/actions/workflows/maven.yml/badge.svg?branch=master)][gh-build]

- [4.0.x](https://github.com/apache/maven/tree/maven-4.0.x): 
[![Maven Central](https://img.shields.io/maven-central/v/org.apache.maven/apache-maven.svg?label=Maven%20Central&versionPrefix=4.0)](https://central.sonatype.com/artifact/org.apache.maven/apache-maven)

	SHA256MSG2 X2, X11       // 440f38cdda
	SHA256MSG2 X11, X11      // 450f38cddb
	// Test VPERMQ with both uint8 and int8 immediate args
	VPERMQ $-40, Y8, Y8 // c443fd00c0d8
	VPERMQ $216, Y8, Y8 // c443fd00c0d8
	// Test that VPERMPD that shares ytab list with VPERMQ continues to work too.
	VPERMPD $-40, Y7, Y7 // c4e3fd01ffd8
	VPERMPD $216, Y7, Y7 // c4e3fd01ffd8
	// Check that LEAL is permitted to use overflowing offset.

Shinsuke Sugaya <******@****.***> 1755149504 +0900

                    alreadyEncoded = true,
                  )
                this.encodedUsername =
                  if (hasUsername) {
                    this.encodedUsername + "%40" + canonicalUsername
                  } else {
                    canonicalUsername
                  }
                if (passwordColonOffset != componentDelimiterOffset) {
                  hasPassword = true

Shinsuke Sugaya <******@****.***> 1755149504 +0900

* **Fast to code**: Increase the speed to develop features by about 200% to 300%. *
* **Fewer bugs**: Reduce about 40% of human (developer) induced errors. *
* **Intuitive**: Great editor support. <dfn title="also known as auto-complete, autocompletion, IntelliSense">Completion</dfn> everywhere. Less time debugging.

Shinsuke Sugaya <******@****.***> 1755751893 +0900

Sebastián Ramírez <******@****.***> 1774026397 +0100

      return b;
    } else if (b == 0) {
      return a; // similar logic
    }
    /*
     * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm. This is
     * >40% faster than the Euclidean algorithm in benchmarks.
     */
    int aTwos = Integer.numberOfTrailingZeros(a);
    a >>= aTwos; // divide out all 2s
    int bTwos = Integer.numberOfTrailingZeros(b);