referralData.replaceCache();
            assertEquals(referralData, cacheMap.get("test-key"));
        }

        @Test
        @DisplayName("Should replace cache entry with key")
        void testReplaceCache() {
            String key = "cache-key";
            referralData.setKey(key);
            referralData.setCacheMap(cacheMap);

            referralData.replaceCache();

and is not guaranteed to be the same from one iteration to the next.
If a map entry that has not yet been reached is removed during iteration,
the corresponding iteration value will not be produced. If a map entry is
created during iteration, that entry may be produced during the iteration or
may be skipped. The choice may vary for each entry created and from one
iteration to the next.

      DirectoryStream<Path> dir) {
    Collection<IOException> exceptions = null;
    try {
      for (Path entry : dir) {
        exceptions = concat(exceptions, deleteRecursivelyInsecure(entry));
      }

      return exceptions;
    } catch (DirectoryIteratorException e) {
      return addException(exceptions, e.getCause());
    }
  }

  /**

    //                                                                        ============
    // -----------------------------------------------------
    //                                            Entry Page
    //                                            ----------
    /**
     * Displays the form for creating a new synonym item.
     *
     * @param dictId the dictionary ID

                });
                int count = 0;
                for (final Map<String, String> entry : aliases) {
                    if (indexName.equals(entry.get("index"))) {
                        count++;
                    }
                }
                return count;
            }
        } catch (final Exception e) {

import org.jspecify.annotations.Nullable;

/**
 * An object that can traverse the nodes that are reachable from a specified (set of) start node(s)
 * using a specified {@link SuccessorsFunction}.
 *
 * <p>There are two entry points for creating a {@code Traverser}: {@link
 * #forTree(SuccessorsFunction)} and {@link #forGraph(SuccessorsFunction)}. You should choose one
 * based on your answers to the following questions:
 *
 * <ol>

		// Previously, this value was set right before a response was sent to
		// the client. So, logger and Error response XML were not using this
		// value. This is set here so that this header can be logged as
		// part of the log entry, Error response XML and auditing.
		// Set custom headers such as x-amz-request-id for each request.
		w.Header().Set(xhttp.AmzRequestID, mustGetRequestID(UTCNow()))
		if globalLocalNodeName != "" {

      if (maxSize() < thatMinSize) {
        return false; // this.size() < that.size()
      }

      // the base implementation from AbstractSet uses size() and containsAll()
      // both require iterating over the entire SetView
      // we avoid iterating twice by doing the equivalent of both in one iteration
      int thisSize = 0;
      for (E e : this) {
        try {
          if (!that.contains(e)) {
            return false;

// Return a new options object.
TF_CAPI_EXPORT extern TF_SessionOptions* TF_NewSessionOptions(void);

// Set the target in TF_SessionOptions.options.
// target can be empty, a single entry, or a comma separated list of entries.
// Each entry is in one of the following formats :
// "local"
// ip:port
// host:port
TF_CAPI_EXPORT extern void TF_SetTarget(TF_SessionOptions* options,

 *   <li><b>Warning:</b> a view collection such as {@link ImmutableMap#keySet} or {@link
 *       ImmutableList#subList} may retain a reference to the entire data set, preventing it from
 *       being garbage collected. If some of the data is no longer reachable through other means,
 *       this constitutes a memory leak. Pass the view collection to the appropriate {@code copyOf}