long time = finish - session.getRequest().getStartTime().getTime();

        String wallClock = session.getRequest().getDegreeOfConcurrency() > 1 ? " (Wall Clock)" : "";

        logger.info("Total time:  {}{}", formatDuration(time), wallClock);

        logger.info("Finished at: {}", formatTimestamp(finish));
    }

    @Override
    public void projectSkipped(ExecutionEvent event) {

     */
    public PathValidator() {
        this(260, 255, true, false);
    }

    /**
     * Create path validator with custom settings
     *
     * @param maxPathLength maximum total path length
     * @param maxComponentLength maximum length for path components
     * @param allowUncPaths whether to allow UNC paths
     * @param strictMode strict validation mode
     */

 * elements. A multiset is also sometimes called a <i>bag</i>.
 *
 * <p>Elements of a multiset that are equal to one another are referred to as <i>occurrences</i> of
 * the same single element. The total number of occurrences of an element in a multiset is called
 * the <i>count</i> of that element (the terms "frequency" and "multiplicity" are equivalent, but

        offset += 2;

        // 4. MaxDataCount (2 bytes)
        int maxDataCount = SMBUtil.readInt2(dst, offset);
        assertTrue(maxDataCount > 0);
        offset += 2;

        // Verify total bytes written
        assertEquals(offset, bytesWritten);
    }

    // Helper methods

    private Object getFieldValue(Object obj, String fieldName) {
        try {

 * elements. A multiset is also sometimes called a <i>bag</i>.
 *
 * <p>Elements of a multiset that are equal to one another are referred to as <i>occurrences</i> of
 * the same single element. The total number of occurrences of an element in a multiset is called
 * the <i>count</i> of that element (the terms "frequency" and "multiplicity" are equivalent, but

      List<Constructor<X>> constructors) {
    return WITH_STRING_PARAM_THEN_WITH_THROWABLE_PARAM.sortedCopy(constructors);
  }

  // TODO: b/296487962 - Consider defining a total order over constructors.
  private static final Ordering<List<Class<?>>> ORDERING_BY_CONSTRUCTOR_PARAMETER_LIST =
      Ordering.natural()
          .onResultOf((List<Class<?>> params) -> params.contains(String.class))

                    i = i == 1 ? 0 : 1;
                    off += read;
                }

                if (log.isDebugEnabled()) {
                    log.debug(String.format("Copied a total of %d bytes", off));
                }

                if (dh.isSMB2()) {
                    final Smb2SetInfoRequest req = new Smb2SetInfoRequest(dh.getConfig(), dfd.getFileId());

    return this;
  }

  Equivalence<Object> getKeyEquivalence() {
    return MoreObjects.firstNonNull(keyEquivalence, getKeyStrength().defaultEquivalence());
  }

  /**
   * Sets the minimum total size for the internal hash tables. For example, if the initial capacity
   * is {@code 60}, and the concurrency level is {@code 8}, then eight segments are created, each

        buffer[bufferIndex + 36] = 0x00; // reserved

        int bytesRead = response.readParameterWordsWireFormat(buffer, bufferIndex);

        // Verify the correct number of bytes were read (37 bytes total)
        assertEquals(37, bytesRead);

        // Verify values through reflection
        Field totalParamField = response.getClass().getSuperclass().getSuperclass().getDeclaredField("totalParameterCount");

        ContentOutputStream cos = new ContentOutputStream(5, Curl.tmpDir);
        cos.write(new byte[] { 0, 1, 2 });
        assertTrue(cos.isInMemory());
        cos.write(new byte[] { 3, 4, 5 }); // Total 6 bytes, exceeds threshold of 5
        assertFalse(cos.isInMemory());
        File file = cos.getFile();
        assertTrue(file.exists());
        cos.close();
    }

    @Test