// Call the decode method with the mocked NdrBuffer
        ndrHyper.decode(mockNdrBuffer);

        // Verify that dec_ndr_hyper was called exactly once
        verify(mockNdrBuffer, times(1)).dec_ndr_hyper();
        verifyNoMoreInteractions(mockNdrBuffer);

        // Verify that the NdrHyper object's value was updated correctly
        assertEquals(decodedValue, ndrHyper.value, "Decode should update the value correctly.");

   * Returns an immutable sorted multiset containing the given elements sorted by their natural
   * ordering. To create a copy of a {@code SortedMultiset} that preserves the comparator, call
   * {@link #copyOfSorted} instead. This method iterates over {@code elements} at most once.
   *
   * <p>Note that if {@code s} is a {@code Multiset<String>}, then {@code
   * ImmutableSortedMultiset.copyOf(s)} returns an {@code ImmutableSortedMultiset<String>}

  static final String NODE_REMOVED_FROM_GRAPH =
      "Node %s that was used to generate this set is no longer in the graph.";
  static final String NODE_PAIR_REMOVED_FROM_GRAPH =
      "Node %s or node %s that were used to generate this set are no longer in the graph.";
  static final String EDGE_REMOVED_FROM_GRAPH =
      "Edge %s that was used to generate this set is no longer in the graph.";
  static final String REUSING_EDGE =

    /**
     * Gets the exceptions that occurred while resolving the version range.
     *
     * @return The list of exceptions that occurred during resolution, never {@code null}
     */
    @Nonnull
    List<Exception> getExceptions();

    /**
     * Gets the versions (in ascending order) that matched the requested range.
     *

        TestFessSystemException exception = new TestFessSystemException(message, true, true);

        assertEquals(message, exception.getMessage());
        assertNull(exception.getCause());

        // Test that suppression is enabled
        RuntimeException suppressed = new RuntimeException("Suppressed exception");
        exception.addSuppressed(suppressed);
        assertEquals(1, exception.getSuppressed().length);

import okhttp3.internal.connection.RealConnection
import okio.IOException
import org.junit.jupiter.api.Assertions

internal open class RecordingConnectionListener(
  /**
   * An override to ignore the normal order that is enforced.
   * EventListeners added by Interceptors will not see all events.
   */
  private val enforceOrder: Boolean = true,
) : ConnectionListener() {
  val eventSequence: Deque<ConnectionEvent> = ConcurrentLinkedDeque()

  /** Returns a possibly-empty list of certificates that identify this peer. */
  @get:JvmName("localCertificates") val localCertificates: List<Certificate>,
  // Delayed provider of peerCertificates, to allow lazy cleaning.
  peerCertificatesFn: () -> List<Certificate>,
) {
  /** Returns a possibly-empty list of certificates that identify the remote peer. */
  @get:JvmName("peerCertificates")

            if (field.getType() == int.class) {
                String name = field.getName();
                // Check that constant names follow UPPER_SNAKE_CASE convention
                assertTrue(name.matches("[A-Z_]+"), "Constant " + name + " should follow UPPER_SNAKE_CASE convention");
                // Check that all constants end with _SECURITY_INFO

   * while other events occur sequentially; cancels may occur concurrently with other events. For
   * example, thread A may be executing [responseBodyStart] while thread B executes [canceled].
   * Implementations must support such concurrent calls.
   *
   * Note that cancellation is best-effort and that a call may proceed normally after it has been

 *       to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new
 *       "safe" edge is created.
 *   <li>If a cycle is detected, an "unsafe" (cyclic) edge is created to represent a potential
 *       deadlock situation, and the appropriate Policy is executed.
 * </ul>
 *
 * <p>Note that detection of potential deadlock does not necessarily indicate that deadlock will