return 50;
            }
        });

        RescorerBuilder<?> result1 = ltrQueryRescorer.evaluate(params);
        assertNotNull(result1);

        // Second call without model name
        ComponentUtil.setFessConfig(new FessConfig.SimpleImpl() {
            @Override
            public String getLtrModelName() {
                return "";
            }

        assertTrue(authorizations.contains(mockAuthData1), "The list should contain the first mocked auth data.");
        assertTrue(authorizations.contains(mockAuthData2), "The list should contain the second mocked auth data.");
    }

        // First call should create a new Handler
        URLStreamHandler handler1 = cifsContextWrapper.getUrlHandler();
        assertNotNull(handler1);
        assertTrue(handler1 instanceof Handler);

        // Second call should return the same instance
        URLStreamHandler handler2 = cifsContextWrapper.getUrlHandler();
        assertEquals(handler1, handler2);
    }

    @Test
    void testGetSIDResolver() {

     */
    public final void setPid(final int pid) {
        this.pid = pid;
    }

    /**
     * Gets the user identifier
     * @return the uid
     */
    public final int getUid() {
        return this.uid;
    }

    /**
     * @param uid
     *            the uid to set
     */
    @Override
    public final void setUid(final int uid) {
        this.uid = uid;
    }

   * </pre>
   *
   * @throws IllegalArgumentException if there is a loop in the causal chain
   */
  public static Throwable getRootCause(Throwable throwable) {
    // Keep a second pointer that slowly walks the causal chain. If the fast pointer ever catches
    // the slower pointer, then there's a loop.
    Throwable slowPointer = throwable;
    boolean advanceSlowPointer = false;

    @Override
    public void clear() {
      backingMap.clear();
    }
  }

  /**
   * {@inheritDoc}
   *
   * <p>The set's iterator traverses the mappings for the first row, the mappings for the second
   * row, and so on.
   *
   * <p>Each cell is an immutable snapshot of a row key / column key / value mapping, taken at the
   * time the cell is returned by a method call to the set or its iterator.
   */

        ResourceManager.ManagedResource<TestResource> managed = resourceManager.manage(resource);

        managed.close();
        assertTrue(resource.isClosed());

        // Second close should not throw
        assertDoesNotThrow(managed::close);
    }

    @Test
    @DisplayName("Test null resource registration throws exception")
    void testNullResourceRegistration() {

     * 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
     *

      // return condition1 || condition2;
      if (nodeU().equals(other.nodeU())) { // check condition1
        // Here's the tricky bit. We don't have to explicitly check for condition2 in this case.
        // Why? The second half of condition2 requires that nodeV equals other.nodeU.
        // We already know that nodeU equals other.nodeU. Combined with the earlier statement,

        long total = requestsSent.get();
        if (total == 0)
            return 0.0;
        return (double) errors.get() / total;
    }

    /**
     * Get throughput in bytes per second
     *
     * @return throughput in bps
     */
    public long getThroughput() {
        long duration = System.currentTimeMillis() - establishedTime;
        if (duration == 0)
            return 0;