assertEquals(0, buffer[13]);
            assertEquals((byte) 0xFF, buffer[9]); // Should not modify before offset
            assertEquals((byte) 0xFF, buffer[14]); // Should not modify after encoded data
        }

        @Test
        @DisplayName("Should handle offset in decode")
        void testDecodeWithOffset() throws SMBProtocolDecodingException {
            // Arrange

  }

  /**
   * Returns true if this connection's route has the same address as any of [candidates]. This
   * requires us to have a DNS address for both hosts, which only happens after route planning. We
   * can't coalesce connections that use a proxy, since proxies don't tell us the origin server's IP
   * address.
   */
  private fun routeMatchesAny(candidates: List<Route>): Boolean =

            when(mockTreeHandle.isSMB2()).thenReturn(false);

            // The delete method for directories uses SmbComDelete with the directory flag
            // After checking SMB code, directories are deleted using SmbComDelete with ATTR_DIRECTORY
            when(mockTreeHandle.send(any(SmbComDelete.class), any(SmbComBlankResponse.class))).thenReturn(mock(SmbComBlankResponse.class));

    long bitSize = bits.bitSize();
    long bitCount = bits.bitCount();

    /*
     * Each insertion is expected to reduce the # of clear bits by a factor of
     * `numHashFunctions/bitSize`. So, after n insertions, expected bitCount is `bitSize * (1 - (1 -
     * numHashFunctions/bitSize)^n)`. Solving that for n, and approximating `ln x` as `x - 1` when x
     * is close to 1 (why?), gives the following formula.
     */

            iter = this.sessions.listIterator();
            while (iter.hasNext()) {
                final SmbSessionImpl ssn = iter.next();
                if (ssn.getExpiration() != null && ssn.getExpiration() < now && !ssn.isInUse()) {
                    if (log.isDebugEnabled()) {
                        log.debug("Closing session after timeout " + ssn);
                    }

      inverse.delegate.remove(entry.getValue());
      /*
       * Remove the mapping in inverse before removing from esDelegate because
       * if entry is part of esDelegate, entry might be invalidated after the
       * mapping is removed from esDelegate.
       */
      esDelegate.remove(entry);
      return true;
    }

    @Override
    public Iterator<Entry<K, V>> iterator() {

    }

    /**
     * Trims the prefix.
     *
     * @param propertyName
     *            The property name
     * @return The result after trimming
     */
    protected String trimPrefix(final String propertyName) {
        if (prefix == null) {
            return propertyName;
        }
        return propertyName.substring(prefix.length());

 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library 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

        assertEquals(9, SMBUtil.readInt2(buffer, bodyOffset));

        // Verify tree flags (0)
        assertEquals(0, SMBUtil.readInt2(buffer, bodyOffset + 2));

        // Verify path offset (points to after the 8-byte structure)
        int expectedPathOffset = bodyOffset + 8 - headerStart;
        assertEquals(expectedPathOffset, SMBUtil.readInt2(buffer, bodyOffset + 4));

        // Verify path length

     * Creates a new document helper instance.
     */
    public DocumentHelper() {
        // Default constructor
    }

    /**
     * Initializes the document helper after construction.
     * Sets up the TikaExtractor with configuration parameters for text processing.
     */
    @PostConstruct
    public void init() {
        if (logger.isDebugEnabled()) {