verify(mockFilter).accept(mockResource1);
        verify(mockFilter).accept(mockResource2);
        verify(mockFilter).accept(mockResource3);
    }

    /**
     * Test that adapt method is actually used by the iterator.
     */
    @Test
    void testAdaptMethodIsUsed() {
        // Given
        when(mockDelegate.hasNext()).thenReturn(true, false);

    finalizerStarter =
        finalizer != null
            ? new ReflectiveStarter(getStartFinalizer(finalizer))
            : new DirectStarter();
  }

  /** The actual reference queue that our background thread will poll. */
  final ReferenceQueue<Object> queue;

  final PhantomReference<Object> frqRef;

  /** Whether or not the background thread started successfully. */

	return reduceQuorumErrs(ctx, errs, ignoredErrs, writeQuorum, errErasureWriteQuorum)
}

// Similar to 'len(slice)' but returns the actual elements count
// skipping the unallocated elements.
func diskCount(disks []StorageAPI) int {
	diskCount := 0
	for _, disk := range disks {
		if disk == nil {
			continue
		}
		diskCount++
	}

Then, when it's your turn, you do actual "productive" work, you process the menu, decide what you want, get your crush's choice, pay, check that you give the correct bill or card, check that you are charged correctly, check that the order has the correct items, etc.

        // Execute and ensure no exceptions are thrown
        QueryBuilder result = matchAllQueryCommand.execute(context, query, boost);

        assertNotNull(result);

        // Note: Actual log output verification would require a log appender mock
        // but we can at least ensure the method executes without errors
        logger.info("Execute method called with query: {} and boost: {}", query, boost);
    }

   *
   * <p>This fit minimizes the root-mean-square error in {@code y} as a function of {@code x}. This
   * error is defined as the square root of the mean of the squares of the differences between the
   * actual {@code y} values of the data and the values predicted by the fit for the {@code x}
   * values (i.e. it is the square root of the mean of the squares of the vertical distances between

        void testGetHandleNcacnNpProtocol() {
            // When/Then: Should attempt to create DcerpcPipeHandle (may fail due to SMB URL creation)
            // This tests the protocol recognition logic, actual creation may fail due to missing SMB support
            assertThrows(Exception.class, () -> DcerpcHandle.getHandle("ncacn_np:\\\\server[endpoint=\\pipe\\srvsvc]", mockContext));
        }

        @Test

        assertEquals(expectedLength, ndrBuffer.getLength());

        // Verify content (simplified check, full verification would involve decoding)
        assertEquals(testString.length() + 1, Encdec.dec_uint32le(buffer, 0)); // Actual count
        assertEquals(0, Encdec.dec_uint32le(buffer, 4)); // Offset
        assertEquals(testString.length() + 1, Encdec.dec_uint32le(buffer, 8)); // Max count

        ndrBuffer.setIndex(0);

                .thenThrow(new SmbException("transport error", new jcifs.util.transport.TransportException()))
                .thenReturn(resp);

        setTree(c, tree);

        // Override connectHost to avoid actual network connection on retry
        doAnswer(invocation -> {
            SmbTreeHandleImpl handle = mock(SmbTreeHandleImpl.class);
            // Re-set the same tree to continue using our mock
            setTree(c, tree);

     */
    @Nonnull
    Optional<Path> getArtifactPath(@Nonnull Artifact artifact);

    /**
     * Gets the relative path for a locally installed artifact. Note that the artifact need not actually exist yet at
     * the returned location, the path merely indicates where the artifact would eventually be stored.
     * <p>
     * Shortcut for {@code getService(LocalArtifactManager.class).getPathForLocalArtitact(...)}.