* higher value than you need can waste space and time, and a significantly lower value can lead
   * to thread contention. But overestimates and underestimates within an order of magnitude do not
   * usually have much noticeable impact. A value of one permits only one thread to modify the cache
   * at a time, but since read operations and cache loading computations can proceed concurrently,

        assertEquals(0x20, response.fileAttributes);
    }

    @Test
    void testSetLastWriteTime() {
        long time = System.currentTimeMillis();
        response.lastWriteTime = time;
        assertEquals(time, response.lastWriteTime);
    }

    @Test
    void testSetDataSize() {
        response.dataSize = 1024;
        assertEquals(1024, response.dataSize);
    }

    delegate().lockInterruptibly();
  }

  @Override
  public boolean tryLock() {
    return delegate().tryLock();
  }

  @Override
  public boolean tryLock(long time, TimeUnit unit) throws InterruptedException {
    return delegate().tryLock(time, unit);
  }

  @Override
  public void unlock() {
    delegate().unlock();
  }

  @Override
  public Condition newCondition() {

     *
     * @param initialDelay the time to delay first execution
     * @param delay the delay between the termination of one execution and the commencement of the
     *     next
     * @param unit the time unit of the initialDelay and delay parameters
     */
    @SuppressWarnings("GoodTime") // should accept a java.time.Duration

         *
         * @return channel identifier
         */
        public String getChannelId() {
            return channelId;
        }

        /**
         * Get failure time
         *
         * @return time of first failure
         */
        public long getFailureTime() {
            return failureTime;
        }

        /**
         * Get retry count
         *

 *
 * <p>{@code ByteSink} provides two kinds of methods:
 *
 * <ul>
 *   <li><b>Methods that return a stream:</b> These methods should return a <i>new</i>, independent
 *       instance each time they are called. The caller is responsible for ensuring that the
 *       returned stream is closed.
 *   <li><b>Convenience methods:</b> These are implementations of common operations that are

 *
 * <p>{@code ByteSink} provides two kinds of methods:
 *
 * <ul>
 *   <li><b>Methods that return a stream:</b> These methods should return a <i>new</i>, independent
 *       instance each time they are called. The caller is responsible for ensuring that the
 *       returned stream is closed.
 *   <li><b>Convenience methods:</b> These are implementations of common operations that are

            // Reserved (4 bytes)
            SMBUtil.writeInt4(0, buffer, bufferIndex + 4);
            // Creation Time (8 bytes)
            long creationTime = System.currentTimeMillis() * 10000L + 116444736000000000L;
            SMBUtil.writeInt8(creationTime, buffer, bufferIndex + 8);
            // Last Access Time (8 bytes)
            long lastAccessTime = creationTime + 1000000L;

   * // returns {"foo", "quux"}
   * }
   *
   * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log
   * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n
   * log n) time and O(n) space.
   *
   * @throws IllegalArgumentException if {@code k < 0}
   * @since 22.0
   */

     *
     * @param initialDelay the time to delay first execution
     * @param delay the delay between the termination of one execution and the commencement of the
     *     next
     * @param unit the time unit of the initialDelay and delay parameters
     */
    @SuppressWarnings("GoodTime") // should accept a java.time.Duration