@Nullable ValueReference<K, V> getValueReference();

  /** Sets the value reference for this entry. */
  void setValueReference(ValueReference<K, V> valueReference);

  /** Returns the next entry in the chain. */
  @Nullable ReferenceEntry<K, V> getNext();

  /** Returns the entry's hash. */
  int getHash();

  /** Returns the key for this entry. */
  @Nullable K getKey();

  /*

##
## readlink() {
##     return /bin/readlink -f "$1"
## }
##
readlink() {
	TARGET_FILE=$1

	cd $(dirname $TARGET_FILE)
	TARGET_FILE=$(basename $TARGET_FILE)

	# Iterate down a (possible) chain of symlinks
	while [ -L "$TARGET_FILE" ]; do
		TARGET_FILE=$(env readlink $TARGET_FILE)
		cd $(dirname $TARGET_FILE)
		TARGET_FILE=$(basename $TARGET_FILE)
	done

    /**
     * Creates a new SMB1 logoff request to end a user session.
     *
     * @param config the CIFS configuration
     * @param andx the next command in the AndX chain, or null
     */
    public SmbComLogoffAndX(final Configuration config, final ServerMessageBlock andx) {
        super(config, SMB_COM_LOGOFF_ANDX, andx);
    }

    @Override

      client
        .newBuilder()
        .addInterceptor(
          Interceptor { chain: Interceptor.Chain ->
            ready.countDown()
            try {
              proceed.await(5, TimeUnit.SECONDS)
            } catch (e: InterruptedException) {
              throw RuntimeException(e)
            }
            chain.proceed(chain.request())
          },
        ).build()

    firstException = expected;
    // Second time should also fail, with a cached causal chain.
    expected = assertThrows(PotentialDeadlockException.class, () -> lockA.lock());
    checkMessage(expected, "LockB -> LockA", "LockA -> LockB");
    // The causal chain should be cached.
    assertThat(expected.getCause()).isEqualTo(firstException.getCause());
    // lockA should work after lockB is released.

    firstException = expected;
    // Second time should also fail, with a cached causal chain.
    expected = assertThrows(PotentialDeadlockException.class, () -> lockA.lock());
    checkMessage(expected, "LockB -> LockA", "LockA -> LockB");
    // The causal chain should be cached.
    assertThat(expected.getCause()).isEqualTo(firstException.getCause());
    // lockA should work after lockB is released.

    private byte[] blob = null;

    /**
     * Constructs a session setup AndX response.
     *
     * @param config the configuration to use
     * @param andx the next command in the AndX chain, or null
     */
    public SmbComSessionSetupAndXResponse(final Configuration config, final ServerMessageBlock andx) {
        super(config, andx);
    }

    /**

   */
  abstract fun <T : Any> plus(
    key: KClass<T>,
    value: T?,
  ): Tags

  abstract operator fun <T : Any> get(key: KClass<T>): T?
}

/** An empty tags. This is always the tail of a [LinkedTags] chain. */
internal object EmptyTags : Tags() {
  override fun <T : Any> plus(
    key: KClass<T>,
    value: T?,
  ): Tags =
    when {
      value != null -> LinkedTags(key, value, this)
      else -> this
    }

    } catch (ignored: IllegalArgumentException) {
    }
  }

  @Test fun clonedInterceptorsListsAreIndependent() {
    val interceptor =
      Interceptor { chain: Interceptor.Chain ->
        chain.proceed(chain.request())
      }
    val original = clientTestRule.newClient()
    original
      .newBuilder()
      .addInterceptor(interceptor)
      .addNetworkInterceptor(interceptor)

    private String nativeFileSystem = "";

    /**
     * Constructs a tree connect AndX response.
     *
     * @param config the configuration to use
     * @param andx the next command in the AndX chain, or null
     */
    public SmbComTreeConnectAndXResponse(final Configuration config, final ServerMessageBlock andx) {
        super(config, andx);
    }

    /**
     * @return the service
     */