* {@link Long#MAX_VALUE} or {@link Long#MIN_VALUE}. This behavior can be useful when decomposing
   * a duration in order to call a legacy API which requires a {@code long, TimeUnit} pair.
   */
  // We use this method only for cases in which we need to decompose to primitives.
  @SuppressWarnings({"GoodTime-ApiWithNumericTimeUnit", "GoodTime-DecomposeToPrimitive"})
  @IgnoreJRERequirement
  static long toNanosSaturated(Duration duration) {

        verify(mockAllocInfo, times(1)).getCapacity();
        verify(mockAllocInfo, times(1)).getFree();
    }

    /**
     * Parameterised test of capacity values, including edge cases such as
     * zero and negative capacities.
     */
    @ParameterizedTest
    @ValueSource(longs = { 0L, -1L, Long.MAX_VALUE })
    @DisplayName("capacity may be any long value")

### Certificate Renewal { #certificate-renewal }

At some point in the future, each certificate would **expire** (about 3 months after acquiring it).

And then, there would be another program (in some cases it's another program, in some cases it could be the same TLS Termination Proxy) that would talk to Let's Encrypt, and renew the certificate(s).

<img src="/img/deployment/https/https.drawio.svg">

                "System.arraycopy should throw for insufficient destination space");
    }

    @Test
    @DisplayName("encode() throws when dstIndex causes overflow")
    void encodeThrowsWhenDstIndexCausesOverflow() {
        byte[] src = makeSeq(5);
        Encodable enc = new ByteEncodable(src, 0, 5);

     */
    @Test
    void testGetMessageByDcerpcError_largerThanAny() {
        int unknownCode = 0x7FFFFFFF; // Max int value

        // The current implementation has a bug in the binary search that causes ArrayIndexOutOfBoundsException
        assertThrows(ArrayIndexOutOfBoundsException.class, () -> {
            DcerpcException.getMessageByDcerpcError(unknownCode);

            fail("Expected NullPointerException");
        } catch (NullPointerException e) {
            // Expected when null listener is set
        }
    }

    // Test helper classes
    private static class TestScriptEngine implements ScriptEngine {
        private String lastScript;
        private Map<String, Object> lastParams;
        private final String prefix;

    "output": null
  },
  {
    "input": "%C2%AD",
    "output": null
  },
  {
    "input": "xn--",
    "output": null
  },
  {
    "comment": "Interesting UseSTD3ASCIIRules=false cases",
    "input": "≠",
    "output": "xn--1ch"
  },
  {
    "input": "≮",
    "output": "xn--gdh"
  },
  {
    "input": "≯",
    "output": "xn--hdh"
  }

            };
          }
        },
        "HashMap w/out null values",
        ALLOWS_NULL_KEYS);
  }

  /**
   * Map generator that verifies that {@code setUp()} methods are called in all the test cases. The
   * {@code setUpRan} parameter is set true by the {@code setUp} that every test case is supposed to
   * have registered, and set false by the {@code tearDown}. We use a dynamic proxy to intercept all

import java.util.SortedSet;
import java.util.TreeSet;
import org.jspecify.annotations.Nullable;

/**
 * A wrapper around {@code TreeSet} that aggressively checks to see if elements are mutually
 * comparable. This implementation passes the navigable set test suites.
 *
 * @author Louis Wasserman
 */
@GwtIncompatible
public final class SafeTreeSet<E> implements Serializable, NavigableSet<E> {
  @SuppressWarnings("unchecked")

        }
    }

    @Override
    public void omitForCycle(Artifact omitted) {
        logger.debug(indent + omitted + " (removed - causes a cycle in the graph)");
    }

    @Override
    public void updateScopeCurrentPom(Artifact artifact, String ignoredScope) {