}

    /**
     * Removes the mapping for a key from this map if it is present.
     *
     * @param key the key whose mapping is to be removed from the map
     * @return the previous value associated with key, or null if no mapping existed
     */
    @Override
    public Object remove(final Object key) {
        return parent.remove(key);
    }

    /**

   * formally, removes an element {@code e} such that {@code o.equals(e)}, if this queue contains
   * one or more such elements. Returns {@code true} if this queue contained the specified element
   * (or equivalently, if this queue changed as a result of the call).
   *
   * @param o element to be removed from this queue, if present
   * @return {@code true} if this queue changed as a result of the call
   */
  @CanIgnoreReturnValue
  @Override

      removeEntryValueHashKnown(entry, valueHash);
      return key;
    }
  }

  /** Removes the entry at the specified index with no additional data. */
  private void removeEntry(int entry) {
    removeEntryKeyHashKnown(entry, Hashing.smearedHash(keys[entry]));
  }

  /** Removes the entry at the specified index, given the hash of its key and value. */

        recurse(level + 1);
      }
    }
  }

  private void compareResultsForThisListOfStimuli() {
    int removes = frequency(asList(stimuli), remove);
    if ((!features.contains(IteratorFeature.SUPPORTS_REMOVE) && removes > 1)
        || (stimuli.length >= 5 && removes > 2)) {
      // removes are the most expensive thing to test, since they often throw exceptions with stack
      // traces, so we test them a bit less aggressively

            } else {
                // Remove failed handle
                handles.remove(path);
                guidToHandle.remove(info.createGuid);
                removePersistedHandle(info);
            }
        }
    }
    
    public void releaseHandle(String path) {
        HandleInfo info = handles.remove(path);
        if (info != null) {
            guidToHandle.remove(info.createGuid);

        if (metrics != null) {
            metrics.recordFailure();
        }
    }

    /**
     * Record connection success for recovery tracking
     */
    private void recordConnectionSuccess(String key) {
        consecutiveFailures.remove(key);
        lastFailureTimes.remove(key);

        ConnectionMetrics metrics = connectionMetrics.get(key);
        if (metrics != null) {
            metrics.recordSuccess();

        /** The wrapped credential resolver. */
        private final TypicalLoginAssist<String, FessUserBean, FessUser>.CredentialResolver resolver;

        /**
         * Creates a new login credential resolver.
         *
         * @param resolver the credential resolver to wrap
         */
        public LoginCredentialResolver(final CredentialResolver resolver) {
            this.resolver = resolver;
        }

        /**

   */
  @CanIgnoreReturnValue
  public E removeFirst() {
    return remove();
  }

  /**
   * Retrieves, but does not remove, the least element of this queue, or returns {@code null} if the
   * queue is empty.
   */
  public @Nullable E peekFirst() {
    return peek();
  }

  /**
   * Removes and returns the greatest element of this queue, or returns {@code null} if the queue is
   * empty.
   */

     */
    public SmbException withContext(String key, Object value) {
        this.context.put(key, value);
        return this;
    }

    /**
     * Sets a recovery hint for the error
     *
     * @param hint the recovery hint
     * @return this exception for chaining
     */
    public SmbException withRecoveryHint(String hint) {
        this.recoveryHint = hint;
        return this;
    }

        recurse(level + 1);
      }
    }
  }

  private void compareResultsForThisListOfStimuli() {
    int removes = frequency(asList(stimuli), remove);
    if ((!features.contains(IteratorFeature.SUPPORTS_REMOVE) && removes > 1)
        || (stimuli.length >= 5 && removes > 2)) {
      // removes are the most expensive thing to test, since they often throw exceptions with stack
      // traces, so we test them a bit less aggressively