assertEquals("Malformed PAC", exception.getMessage());
    }

    @Test
    @DisplayName("Test getters return expected values using mocks")
    void testGetters() throws Exception {
        // Use mocking to test getters without complex PAC data creation
        PacLogonInfo logonInfo = mock(PacLogonInfo.class);

        // Setup mock responses
        when(logonInfo.getUserName()).thenReturn(TEST_USERNAME);

   * All registered subscribers, indexed by event type.
   *
   * <p>The {@link CopyOnWriteArraySet} values make it easy and relatively lightweight to get an
   * immutable snapshot of all current subscribers to an event without any locking.
   */
  private final ConcurrentMap<Class<?>, CopyOnWriteArraySet<Subscriber>> subscribers =
      Maps.newConcurrentMap();

  /** The event bus this registry belongs to. */
  @Weak private final EventBus bus;

            verify(mockSession, times(1)).unwrap(SmbSession.class);
            verify(mockSession, times(1)).close();
        }

        @Test
        @DisplayName("Should support partial mocking scenarios")
        void shouldSupportPartialMockingScenarios() {
            SmbSession mockSession = mock(SmbSession.class);
            Configuration mockConfig = mock(Configuration.class);

server to create representative test cases. Or test that your code survives in
awkward-to-reproduce situations like 500 errors or slow-loading responses.


### Example

Use MockWebServer the same way that you use mocking frameworks like
[Mockito](https://github.com/mockito/mockito):

1. Script the mocks.
2. Run application code.
3. Verify that the expected requests were made.

Here's a complete example:

### Java
```java

import org.junit.jupiter.params.ParameterizedTest;
import org.junit.jupiter.params.provider.ValueSource;

import jcifs.pac.PACDecodingException;

class KerberosApRequestTest {

    // Helper: build a minimal, valid-looking ASN.1 AP-REQ sequence with tags 0/1/2
    private ASN1Sequence buildMinimalApReqSeq(byte apOptions) {
        ASN1EncodableVector v = new ASN1EncodableVector();
        // pvno [0] INTEGER 5

        // to create the stream handler for the connection.
        URLStreamHandlerFactory mockFactory = mock(URLStreamHandlerFactory.class);

        // Create a concrete URLStreamHandler subclass instead of mocking
        URLStreamHandler mockStreamHandler = new URLStreamHandler() {
            @Override
            protected URLConnection openConnection(URL u) throws IOException {
                return mock(HttpURLConnection.class);

        } catch (Exception e) {
            context.parsingFailed = true;
            context.cwd = getCanonicalPath(Paths.get("."));
            parserRequest.logger().error("Error determining working directory", e);
        }
        try {
            context.installationDirectory = getInstallationDirectory(context);
        } catch (Exception e) {
            context.parsingFailed = true;

      } catch (ClassCastException wastNotComparableToOurType) {
        return false;
      }
    }
    return false;
  }

  // Prevent "missing hashCode" warning by explicitly forcing subclasses implement it
  @Override
  public abstract int hashCode();

  /*
   * The implementation neither produces nor consumes any non-null instance of type C, so
   * casting the type parameter is safe.

            if (headerNameIndex in 2..7) {
              // Only search a subset of the static header table. Most entries have an empty value, so
              // it's unnecessary to waste cycles looking at them. This check is built on the
              // observation that the header entries we care about are in adjacent pairs, and we
              // always know the first index of the pair.

    // way for it to return a false negative would be for the target value to jump around in the map
    // such that none of the subsequent iterations observed it, despite the fact that at every point
    // in time it was present somewhere int the map. This becomes increasingly unlikely as
    // CONTAINS_VALUE_RETRIES increases, though without locking it is theoretically possible.