RegularLinearTransformation(double slope, double yIntercept) {
      this.slope = slope;
      this.yIntercept = yIntercept;
      this.inverse = null; // to be lazily initialized
    }

    RegularLinearTransformation(double slope, double yIntercept, LinearTransformation inverse) {
      this.slope = slope;
      this.yIntercept = yIntercept;
      this.inverse = inverse;
    }

    @Override

        return time + this.serverTimeZoneOffset;
    }

    @Override
    public long getLastWriteTime() {
        return convertTime(this.lastWriteTime);
    }

    @Override
    public long getLastAccessTime() {
        // Fake access time
        return convertTime(this.lastWriteTime);
    }

    @Override
    public long getSize() {
        return this.fileSize;
    }

    @Override

  }

  /**
   * Creates a fluent iterable with the first {@code size} elements of this fluent iterable. If this
   * fluent iterable does not contain that many elements, the returned fluent iterable will have the
   * same behavior as this fluent iterable. The returned fluent iterable's iterator supports {@code
   * remove()} if this fluent iterable's iterator does.
   *

        super(config);
        this.data = b;
        this.offset = off;
    }

    void setParam(final byte[] b, final int off) {
        this.data = b;
        this.offset = off;
    }

    /**
     * Gets the read data buffer.
     *
     * @return the read data
     */
    public final byte[] getData() {
        return this.data;
    }

    /**

  private final int end; // exclusive

  private ImmutableIntArray(int[] array) {
    this(array, 0, array.length);
  }

  private ImmutableIntArray(int[] array, int start, int end) {
    this.array = array;
    this.start = start;
    this.end = end;
  }

  /** Returns the number of values in this array. */
  public int length() {

        buffer[bufferIndex++] = (byte) 0x00; // Reserved

        this.totalParameterCount = SMBUtil.readInt4(buffer, bufferIndex);
        if (this.bufDataStart == 0) {
            this.bufDataStart = this.totalParameterCount;
        }
        bufferIndex += 4;
        this.totalDataCount = SMBUtil.readInt4(buffer, bufferIndex);
        bufferIndex += 4;
        this.parameterCount = SMBUtil.readInt4(buffer, bufferIndex);

    }

    /**
     * Sets the indices timeout.
     * @param timeout The indices timeout.
     * @return This builder instance.
     */
    public SuggestSettingsBuilder indicesTimeout(final String timeout) {
        timeoutSettings.setIndicesTimeout(timeout);
        return this;
    }

    /**
     * Sets the cluster timeout.
     * @param timeout The cluster timeout.

    /**
     * Create a new lease V2 context request
     */
    public LeaseV2CreateContextRequest() {
        this.leaseKey = new Smb2LeaseKey();
        this.parentLeaseKey = new Smb2LeaseKey(new byte[16]); // Zero parent key by default
        this.leaseState = 0;
        this.leaseFlags = 0;
        this.epoch = 1;
    }

    /**
     * Create a new lease V2 context request with specified parameters
     *

    this.nameFormat = nameFormat;
    return this;
  }

  /**
   * Sets daemon or not for new threads created with this ThreadFactory.
   *
   * <p><b>Java 21+ users:</b> use {@link Thread.Builder.OfPlatform#daemon(boolean)} instead.
   *
   * @param daemon whether or not new Threads created with this ThreadFactory will be daemon threads
   * @return this for the builder pattern
   */

   * #iterator} to forward to this implementation.
   *
   * @since 7.0
   */
  protected Iterator<E> standardIterator() {
    return Multisets.iteratorImpl(this);
  }

  /**
   * A sensible, albeit inefficient, definition of {@link #size} in terms of {@link #entrySet}. If
   * you override {@link #entrySet}, you may wish to override {@link #size} to forward to this
   * implementation.
   *