// For this test, we'll simulate that no auth header means we should challenge
        // Since we can't mock the internal transport operations easily without real network,
        // we'll test the simpler case where no NTLM negotiation is needed
        when(request.getHeader("Authorization")).thenReturn(null);

        filter.doFilter(request, response, filterChain);

        // Should challenge the client

 * the methods of the delegate. For example, overriding {@link #add(Object, int)} alone <b>will
 * not</b> change the behavior of {@link #add(Object)}, which can lead to unexpected behavior. In
 * this case, you should override {@code add(Object)} as well, either providing your own
 * implementation, or delegating to the provided {@code standardAdd} method.
 *

https://cs.opensource.google/boringssl/boringssl/+/master:crypto/fipsmodule/bn/prime.c.inc;l=208-283;drc=3a138e43 bits := mr.w.BitLen() var iterations int switch { case bits >= 3747: iterations = 3 case bits >= 1345: iterations = 4 case bits >= 476: iterations = 5 case bits >= 400: iterations = 6 case bits >= 347: iterations = 7 case bits >= 308: iterations = 8 case bits >= 55: iterations = 27 default: iterations = 34 } b := make([]byte, (bits+7)/8) for { drbg.Read(b) excess := len(b)*8 - bits b[0] &= 0b1111_1111...

   * This is December 31, 9999 if the cookie is not [persistent], in which case it will expire at the
   * end of the current session.
   *
   * This may return a value less than the current time, in which case the cookie is already
   * expired. Webservers may return expired cookies as a mechanism to delete previously set cookies

    }

    /**
     * The number of permutations with repeated elements is calculated as follows:
     *
     * <ul>
     *   <li>For an empty list, it is 1 (base case).
     *   <li>When r numbers are added to a list of n-r elements, the number of permutations is
     *       increased by a factor of (n choose r).
     * </ul>
     */
    private static <E> int calculateSize(

            assertTrue(init.getContextFlag(NegTokenInit.CONFIDENTIALITY));
            assertFalse(init.getContextFlag(NegTokenInit.MUTUAL_AUTHENTICATION));
        }
    }

    @Nested
    @DisplayName("Edge Cases and Error Conditions")
    class EdgeCasesTests {

        @Test
        @DisplayName("Parse handles empty token gracefully")
        void testParseEmptyToken() {
            byte[] emptyToken = new byte[0];

        try {
            // Execute operations to generate metrics
            for (int i = 0; i < 5; i++) {
                cbWithEnhanced.executeWithCircuitBreaker(() -> "success");
            }

            // Cause some failures
            for (int i = 0; i < 2; i++) {
                try {
                    cbWithEnhanced.executeWithCircuitBreaker(() -> {
                        throw new RuntimeException("failure");

   * may be false for some instances where the statistics are mathematically equal, including
   * instances constructed from the same values in a different order... or (in the general case)
   * even in the same order. (It is guaranteed to return true for instances constructed from the
   * same values in the same order if {@code strictfp} is in effect, or if the system architecture

        assertEquals(builder, result); // Test method chaining
        assertEquals("test_index", builder.settingsIndexName);

        // Test setting index name with mixed case
        builder.setSettingsIndexName("TeSt_InDeX_NaMe");
        assertEquals("test_index_name", builder.settingsIndexName);

        // Test setting index name that's already lowercase

        assertTrue(ace.isInherited());

        ace.flags = ACE.FLAGS_INHERITED | ACE.FLAGS_INHERIT_ONLY;
        assertTrue(ace.isInherited());
    }

    @Test
    @DisplayName("Test edge cases in getApplyToText")
    void testGetApplyToTextEdgeCases() {
        // Test with only FLAGS_INHERIT_ONLY (should return Invalid)
        ace.flags = ACE.FLAGS_INHERIT_ONLY;