src/java.base/share/classes/java/util/IdentityHashMap.java

*** 1,7 ***
  /*
!  * Copyright (c) 2000, 2024, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.  Oracle designates this
--- 1,7 ---
  /*
!  * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.  Oracle designates this

*** 33,12 ***
  import java.util.function.Consumer;
  import jdk.internal.access.SharedSecrets;
  
  /**
   * This class implements the {@code Map} interface with a hash table, using
!  * reference-equality in place of object-equality when comparing keys (and
!  * values).  In other words, in an {@code IdentityHashMap}, two keys
   * {@code k1} and {@code k2} are considered equal if and only if
   * {@code (k1==k2)}.  (In normal {@code Map} implementations (like
   * {@code HashMap}) two keys {@code k1} and {@code k2} are considered equal
   * if and only if {@code (k1==null ? k2==null : k1.equals(k2))}.)
   *
--- 33,12 ---
  import java.util.function.Consumer;
  import jdk.internal.access.SharedSecrets;
  
  /**
   * This class implements the {@code Map} interface with a hash table, using
!  * `==` in place of object-equality when comparing keys (and values).
!  * In other words, in an {@code IdentityHashMap}, two keys
   * {@code k1} and {@code k2} are considered equal if and only if
   * {@code (k1==k2)}.  (In normal {@code Map} implementations (like
   * {@code HashMap}) two keys {@code k1} and {@code k2} are considered equal
   * if and only if {@code (k1==null ? k2==null : k1.equals(k2))}.)
   *