*
   * (That would also have ensured that its cause was always an Error, rather than possibly another
   * kind of Throwable that was later passed to initCause. Then we could have declared the override
   * `public final Error getCause()`.)
   */

  /**
   * Creates a new instance with {@code null} as its detail message and no cause.
   *

 * href="https://github.com/ben-manes/caffeine/wiki">Caffeine</a>. Its API is designed to make it a
 * nearly drop-in replacement. Note that it is not available for Android or GWT/J2CL and that it may
 * have <a href="https://github.com/ben-manes/caffeine/wiki/Guava">different (usually better)
 * behavior</a> when multiple threads attempt concurrent mutations. Its equivalent to {@code
 * CacheBuilder} is its <a

   * orders its elements according to their {@linkplain Comparable natural ordering}.
   */
  public MonitorBasedPriorityBlockingQueue() {
    q = new PriorityQueue<E>();
  }

  /**
   * Creates a {@code MonitorBasedPriorityBlockingQueue} with the specified initial capacity that
   * orders its elements according to their {@linkplain Comparable natural ordering}.
   *

        }

        MavenProject lib = session.getProjects().get(1);
        MavenProject war = session.getProjects().get(2);

        assertNull(war.getArtifactMap()
                .get("org.apache.maven.its.mng6300:mng6300-lib")
                .getFile());

        lib.getArtifact().setFile(new File("lib.jar"));

        resolver.resolveProjectDependencies(

import java.util.Map;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A bimap (or "bidirectional map") is a map that preserves the uniqueness of its values as well as
 * that of its keys. This constraint enables bimaps to support an "inverse view", which is another
 * bimap containing the same entries as this bimap but with reversed keys and values.
 *
 * <h3>Implementations</h3>
 *

     * simple approach would be for each caller CAS it from null to a Set populated with its
     * exception. But there's another race: If the first thread fails with an exception and a second
     * thread immediately fails with the same exception:
     *
     * Thread1: calls setException(), which returns true, context switch before it can CAS
     * seenExceptionsField to its exception
     *

KIND, either express or implied.  See the License for the
specific language governing permissions and limitations
under the License.
-->

<project>
  <modelVersion>4.0.0</modelVersion>

  <groupId>org.apache.maven.its.it0063</groupId>
  <artifactId>maven-it-it0063</artifactId>
  <version>1.0</version>
  <packaging>jar</packaging>

  <name>Maven Integration Test :: it0063</name>

        // Verify independence
        assertEquals(2, t1.numThreads, "t1 should have its own numThreads value");
        assertEquals(5, t2.numThreads, "t2 should have its own numThreads value");
        assertEquals("smb://server1/share/file.txt", t1.url, "t1 should have its own URL");
        assertEquals("smb://server2/share/file.txt", t2.url, "t2 should have its own URL");
    }

   * perform better than its longhand equivalent, but should not perform worse.
   *
   * @since 12.0
   */
  HashCode hashInt(int input);

  /**
   * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given
   * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>
   * perform better than its longhand equivalent, but should not perform worse.

   * perform better than its longhand equivalent, but should not perform worse.
   *
   * @since 12.0
   */
  HashCode hashInt(int input);

  /**
   * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given
   * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>
   * perform better than its longhand equivalent, but should not perform worse.