- If unable to complete the review, tag another reviewer (e.g., `@username please take over`).

4. **Shared Responsibility**:
   - All MinIO contributors are reviewers. The first commenter on a PR owns the review unless they delegate.
   - Multiple reviewers are encouraged for complex PRs.

5. **No Self-Edits**:

          node.setNext(oldHead);
          if (casWaiters(oldHead, node)) {
            while (true) {
              OverflowAvoidingLockSupport.parkNanos(this, remainingNanos);
              // Check interruption first, if we woke up due to interruption we need to honor that.
              if (Thread.interrupted()) {
                removeWaiter(node);
                throw new InterruptedException();
              }

    void testMockServiceNotifications() {
        // Test notification sending (just logs for mock)
        mockService.sendNotification(WitnessEventType.RESOURCE_CHANGE, "TestResource");

        // Register a witness first
        String regId = mockService.registerWitness("TestResource", "192.168.1.100", 1);

        // Send notification affecting the registration

        assertEquals(expectedFlags, context.ntlmsspFlags);
    }

    @Test
    void testInitSecContext_state1_type1Message() throws Exception {
        // Test the first step of context initialization (creating Type 1 message)
        when(mockAuth.getDomain()).thenReturn(domain);
        NtlmContext context = new NtlmContext(mockAuth, true);

        assertEquals("First group should be TestGroup", TestGroup.class, multiAnnotation.groups()[0]);
        assertEquals("Second group should be AnotherTestGroup", AnotherTestGroup.class, multiAnnotation.groups()[1]);

        assertEquals("Should have 2 payloads", 2, multiAnnotation.payload().length);
        assertEquals("First payload should be TestPayload", TestPayload.class, multiAnnotation.payload()[0]);

	mac, err := k.conn.MAC(ctx, req)
	k.updateMetrics(err, time.Since(start))

	return mac, err
}

func (k *KMS) updateMetrics(err error, latency time.Duration) {
	// First, update the latency histogram
	// Therefore, find the first bucket that holds the counter for
	// requests with a latency at least as large as the given request
	// latency and update its and all subsequent counters.

            // -1
            //  or QUALIFIERS.size and then resort to lexical ordering. Most comparisons are decided by the first
            // character,
            // so this is still fast. If more characters are needed then it requires a lexical sort anyway.
            return i == -1 ? (QUALIFIERS.size() + "-" + qualifier) : String.valueOf(i);

   *
   * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated; use the
   * equivalent {@link Long#compareUnsigned(long, long)} method instead.
   *
   * @param a the first unsigned {@code long} to compare
   * @param b the second unsigned {@code long} to compare
   * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is

                        return true; // This is a duplicate
                    } else {
                        seenDependencies.put(key, dependency);
                        return false; // This is the first occurrence
                    }
                })
                .toList();

        // Remove duplicates while preserving formatting
        duplicates.forEach(DomUtils::removeElement);

        ShutdownListener listener2 = new ShutdownListener() {
            @Override
            public void onShutdown() {
                callCount.addAndGet(10);
            }
        };

        // Add first listener
        jobExecutor.addShutdownListener(listener1);
        assertEquals(listener1, jobExecutor.shutdownListener);

        // Replace with second listener
        jobExecutor.addShutdownListener(listener2);