void testReadBytesWireFormatPreservesBuffer() throws SMBProtocolDecodingException {
        byte[] buffer = new byte[1024];
        int bufferIndex = 0;

        // Fill buffer with test data
        for (int i = 0; i < buffer.length; i++) {
            buffer[i] = (byte) (i % 256);
        }

        // Set structure size to 2
        SMBUtil.writeInt2(2, buffer, bufferIndex);

   * Truncates the given character sequence to the given maximum length. If the length of the
   * sequence is greater than {@code maxLength}, the returned string will be exactly {@code
   * maxLength} chars in length and will end with the given {@code truncationIndicator}. Otherwise,
   * the sequence will be returned as a string with no changes to the content.
   *
   * <p>Examples:
   *
   * {@snippet :

        assertTrue(length >= 0);
    }

    @Test
    @DisplayName("Test decode operation")
    void testDecode() {
        byte[] buffer = new byte[1024];
        // Fill with basic SMB header structure
        System.arraycopy(new byte[] { (byte) 0xFF, 'S', 'M', 'B' }, 0, buffer, 0, 4);
        buffer[4] = 1; // wordCount
        buffer[7] = 0; // byteCount low

// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *
   * <p>Duplicate elements are considered equal. For example, the list [1, 1] will have only one
   * permutation, instead of two. This is why the elements have to implement {@link Comparable}.
   *

        final List<SearchLog> searchLogList = new ArrayList<>();
        final Map<String, UserInfo> userInfoMap = new HashMap<>();
        while (!queue.isEmpty()) {
            final SearchLog searchLog = queue.poll();
            if (searchLog != null) {
                final String userAgent = searchLog.getUserAgent();
                final boolean isBot =

     * notification nearly simultaneously, we sometimes receive only an interrupt. Thus, when we're
     * interrupted, we can't just poll whether it's time to end the wait because our "end the wait"
     * notification has been lost. (This is in contrast to how we can poll with, say, a
     * CountDownLatch.) In order to avoid hiding the requested notification from the caller, we need

 * inserted by producers and extracted by consumers. Once created, the capacity cannot be increased.
 * Attempts to {@code put} an element into a full queue will result in the operation blocking;
 * attempts to {@code take} an element from an empty queue will similarly block.
 *
 * <p>This class supports an optional fairness policy for ordering waiting producer and consumer

        assertArrayEquals(zeroGuid, extractedGuid);
    }

    @Test
    @DisplayName("Test encode with all 0xFF GUID")
    void testEncodeWithMaxGuid() {
        byte[] maxGuid = new byte[16];
        Arrays.fill(maxGuid, (byte) 0xFF);

        ValidateNegotiateInfoRequest request =
                new ValidateNegotiateInfoRequest(DEFAULT_CAPABILITIES, maxGuid, DEFAULT_SECURITY_MODE, defaultDialects);

By default, `fastapi dev` will start with auto-reload enabled for local development.

You can read more about it in the [FastAPI CLI docs](https://fastapi.tiangolo.com/fastapi-cli/).

</details>

### Check it { #check-it }

Open your browser at [http://127.0.0.1:8000/items/5?q=somequery](http://127.0.0.1:8000/items/5?q=somequery).

You will see the JSON response as:

```JSON