* implementation. Experimentally determined.
   */
  static final int MAX_HASH_BUCKET_LENGTH = 8;

  // entries in insertion order
  @VisibleForTesting final transient Entry<K, V>[] entries;
  // array of linked lists of entries
  private final transient @Nullable ImmutableMapEntry<K, V> @Nullable [] table;
  // 'and' with an int to get a table index
  private final transient int mask;

  url: https://github.com/its0x08
linsein:
  login: linsein
  count: 2
  avatarUrl: https://avatars.githubusercontent.com/u/23748021?u=4db169ce262b69aa7292f82b785436544f69fb88&v=4
  url: https://github.com/linsein
0xflotus:
  login: 0xflotus
  count: 2

                impl.fixupHost("server2.example.com");
                impl.fixupDomain("otherdomain.com");
            });
        }

        @Test
        @DisplayName("Should handle linked list of referrals")
        void testLinkedListOfReferrals() {
            DfsReferralDataImpl first = createInitializedDfsReferralDataImpl();
            DfsReferralDataImpl second = createInitializedDfsReferralDataImpl();

            // Should not throw exception
            referralData.replaceCache();
            assertTrue(cacheMap.isEmpty());
        }
    }

    @Nested
    @DisplayName("Linked List Operations Tests")
    class LinkedListTests {

        @Test
        @DisplayName("Should append referral data")
        void testAppend() {
            DfsReferralDataImpl second = new DfsReferralDataImpl();

      if (count == 0 && !isLinkedHash) {
        contents = new ObjectCountLinkedHashMap<E>(contents);
        isLinkedHash = true;
        // to preserve insertion order through deletions, we have to switch to an actual linked
        // implementation at least for now, but this should be a super rare case
      } else if (buildInvoked) {
        contents = new ObjectCountHashMap<E>(contents);
        isLinkedHash = false;
      }

  private ExecutionSequencer() {}

  /** Creates a new instance. */
  public static ExecutionSequencer create() {
    return new ExecutionSequencer();
  }

  /** This reference acts as a pointer tracking the head of a linked list of ListenableFutures. */
  private final AtomicReference<ListenableFuture<@Nullable Void>> ref =
      new AtomicReference<>(immediateVoidFuture());

  ASSERT_EQ(TF_OK, TF_GetCode(s_)) << TF_Message(s_);
  TF_GraphCopyFunction(host_graph_, grad_func, nullptr, s_);
  ASSERT_EQ(TF_OK, TF_GetCode(s_)) << TF_Message(s_);

  // Check that functions are added but not linked
  GraphDef gdef;
  GetGraphDef(host_graph_, &gdef);
  std::vector<std::string> func_names = GetFuncNames(gdef);
  ASSERT_EQ(2, func_names.size());
  ASSERT_EQ("FooFunc", func_names[0]);

                if (i > 0) {
                    assertTrue(messages[0].chain(messages[i]));
                }
            }

            // Verify chain is properly linked
            ServerMessageBlock2 current = messages[0];
            for (int i = 1; i < messages.length; i++) {
                current = current.getNext();
                assertEquals(messages[i], current);

        "//tensorflow/core:lib_internal_impl",
        "//tensorflow/core/profiler:profiler_impl",
        "//tensorflow/core/util:determinism",  # Must be linked and exported to libtensorflow_framework.so.
        "//tensorflow/lite/kernels/shim:tf_kernel_shim",
        "@xla//xla/stream_executor:stream_executor_impl",
        "@xla//xla/tsl/framework:bfc_allocator",

which are not part of the work.  For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.