int newThreshold = currentThreshold;

            // If failure rate is high but response time is normal, be more lenient
            if (failureRate > 0.5 && avgResponseTime < 5000) {
                newThreshold = Math.min(currentThreshold + 2, 15);
            }
            // If failure rate is moderate but response time is very high, be stricter
            else if (failureRate > 0.2 && avgResponseTime > 10000) {

     */
    @Nonnull
    Path getRootDirectory();

    /**
     * Returns project parent project, if any.
     * <p>
     * Note that the model may have a parent defined, but an empty parent
     * project may be returned if the parent comes from a remote repository,
     * as a {@code Project} must refer to a buildable project.
     *
     * @return an optional containing the parent project

 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *

 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *

        byte[] data = new byte[32]; // Dummy data
        // The test will likely fail with "Checksum failed" as the data is not properly encrypted
        // but it proves the decryption path is taken.
        assertThrows(GeneralSecurityException.class, () -> KerberosEncData.decrypt(data, key, KerberosConstants.RC4_ENC_TYPE));
    }

    /**

 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *

        Path nonExistentPath = tempDir.resolve("nonexistent.properties");
        System.setProperty("jcifs.properties", nonExistentPath.toString());

        // Expect no exception to be thrown, but an error logged (which we can't directly assert here)
        assertDoesNotThrow(() -> SingletonContext.init(null));
        assertNotNull(SingletonContext.getInstance()); // Should still initialize
    }

    @Test

            responseDataArray[i] = new ResponseData();
            responseDataArray[i].setUrl("https://example.com/page" + i);
        }

        // Process all in sequence (could be parallel, but not necessary for this test)
        for (ResponseData responseData : responseDataArray) {
            processor.process(responseData);
        }

        // Verify all are unchanged

        assertTrue(output.contains("42"));
        assertTrue(output.contains("true"));

        // Test close
        logStream.close();
        // After close, the stream should not accept more writes
        // but PrintStream doesn't throw exceptions on write after close
    }

    @Test
    void testConcurrentAccess() throws InterruptedException {
        // Test thread safety of getInstance

   * Multimaps#asMap(SortedSetMultimap)} instead. <b>However</b>, the returned map <i>itself</i> is
   * not necessarily a {@link SortedMap}: A {@code SortedSetMultimap} must expose the <i>values</i>
   * for a given key in sorted order, but it need not expose the <i>keys</i> in sorted order.
   * Individual {@code SortedSetMultimap} implementations, like those built with {@link
   * MultimapBuilder#treeKeys()}, may make additional guarantees.
   */
  @Override