apply {
        this.shutdownServer = shutdownServer
      }

    /**
     * Throttles the request reader and response writer to sleep for the given period after each
     * series of [bytesPerPeriod] bytes are transferred. Use this to simulate network behavior.
     */
    public fun throttleBody(
      bytesPerPeriod: Long,
      period: Long,
      unit: TimeUnit,

      }
    }
  }

  /**
   * Copies all of the mappings from the specified map to this map. The effect of this call is
   * equivalent to that of calling {@code put(k, v)} on this map once for each mapping from key
   * {@code k} to value {@code v} in the specified map. The behavior of this operation is undefined
   * if the specified map is modified while the operation is in progress.
   */

   * serialization code) which used a map with boxed integers for the values.
   */
  private static final class OldConcurrentHashMultiset<E> extends AbstractMultiset<E> {
    /** The number of occurrences of each element. */
    private final transient ConcurrentMap<E, Integer> countMap;

    /**
     * Creates a new, empty {@code OldConcurrentHashMultiset} using the default initial capacity,

 * default} methods. Instead, it inherits their default implementations. When those implementations
 * invoke methods, they invoke methods on the {@code ForwardingNavigableMap}.
 *
 * <p>Each of the {@code standard} methods uses the map's comparator (or the natural ordering of the
 * elements, if there is no comparator) to test element equality. As a result, if the comparator is

            // add week number label
            if (this.showWeekNumbers || this.showISOWeekNumbers)
                html += '<th class="week">' + this.locale.weekLabel + '</th>';

            $.each(this.locale.daysOfWeek, function(index, dayOfWeek) {
                html += '<th>' + dayOfWeek + '</th>';
            });

            html += '</tr>';
            html += '</thead>';
            html += '<tbody>';

    int val = bytes[0] & 0xFF;
    for (int i = 1; i < bytes.length; i++) {
      val |= (bytes[i] & 0xFF) << (i * 8);
    }
    return val;
  }

  /**
   * Returns a string containing each byte of {@link #asBytes}, in order, as a two-digit unsigned
   * hexadecimal number in lower case.
   *
   * <p>Note that if the output is considered to be a single hexadecimal number, whether this string

// but prevent requests to overload the server completely.
// Rejected clients are expected to retry.
const lockMutexWaitLimit = 1000

// lockRequesterInfo stores various info from the client for each lock that is requested.
type lockRequesterInfo struct {
	Name            string // name of the resource lock was requested for
	Writer          bool   // Bool whether write or read lock.

        byte[] buffer = new byte[65536];
        int offset = 0;

        setHeaderStart(response, 64);

        // Calculate space for notifications
        int notificationSize = 32; // Each notification
        int notificationCount = 100;
        int totalSize = notificationSize * notificationCount;

        // Write structure
        SMBUtil.writeInt2(9, buffer, offset);

        System.arraycopy(buffer, Smb2Constants.SMB2_HEADER_LENGTH + 8, actualBytes, 0, expectedBytes.length);

        assertArrayEquals(expectedBytes, actualBytes);

        // Verify it's actually UTF-16LE (each ASCII char should be followed by 0x00)
        int pathStart = Smb2Constants.SMB2_HEADER_LENGTH + 8;
        for (int i = 0; i < testPath.length(); i++) {
            char c = testPath.charAt(i);

    /*
     * The striding algorithm works roughly as follows: it is universally the case that
     * CRC(x ^ y) == CRC(x) ^ CRC(y).  The approach we take is to break the message as follows,
     * with each letter representing a 4-byte word: ABCDABCDABCDABCD... and to calculate
     * CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...)