// Decode and check return value
        int bytesConsumed = fileBothDirectoryInfo.decode(buffer, 0, buffer.length);

        // Verify bytes consumed matches the actual data size
        assertTrue(bytesConsumed < 0); // Return value is negative (start - bufferIndex)
        assertEquals(-94 - filename.length() * 2, bytesConsumed); // Base structure + filename length
    }

    @Test

        // Acquire the shared lock allowing interruption.
        acquireSharedInterruptibly(-1);
        return getValue();
      }

      /**
       * Implementation of the actual value retrieval. Will return the value on success, an
       * exception on failure, a cancellation on cancellation, or an illegal state if the
       * synchronizer is in an invalid state.
       */

	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++
	}

<a href="/pkg/runtime/"><code>runtime</code></a> and
<a href="/pkg/math/big/"><code>math/big</code></a>.
You can also examine what the compiler emits as assembly code
(the actual output may differ from what you see here):
</p>

<pre>
$ cat x.go
package main

func main() {
	println(3)
}
$ GOOS=linux GOARCH=amd64 go tool compile -S x.go        # or: go build -gcflags -S x.go

        // 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);

     */
    @Test
    public void testEncryptionContextPerformance() throws Exception {
        // Create mock encryption context for testing (simplified)
        // Note: This tests the atomic operations without actual encryption

        int threadCount = 8;
        int operationsPerThread = 500;
        ExecutorService executor = Executors.newFixedThreadPool(threadCount);
        CountDownLatch startLatch = new CountDownLatch(1);