.testEquals();
  }

  /**
   * The maximum allowed probability of falsely detecting a hash flooding attack if the input is
   * randomly generated.
   */
  private static final double HASH_FLOODING_FPP = 0.001;

  public void testReuseBuilderReducingHashTableSizeWithPowerOfTwoTotalElements() {
    ImmutableSet.Builder<Object> builder = ImmutableSet.builderWithExpectedSize(6);
    builder.add(0);

            double percentUsed = ((fileFsSizeInfo.getCapacity() - fileFsSizeInfo.getFree()) * 100.0) / fileFsSizeInfo.getCapacity();

            // Then
            assertEquals(25.0, percentFree, 0.001);
            assertEquals(75.0, percentUsed, 0.001);
        }
    }

	return nil
}

func findSignatureInBlock(b []byte) int {
	for i := len(b) - directoryEndLen; i >= 0; i-- {
		// defined from directoryEndSignature in struct.go
		if b[i] == 'P' && b[i+1] == 'K' && b[i+2] == 0x05 && b[i+3] == 0x06 {
			// n is length of comment
			n := int(b[i+directoryEndLen-2]) | int(b[i+directoryEndLen-1])<<8
			if n+directoryEndLen+i > len(b) {
				// Truncated comment.

            assertEquals((byte) 0xCC, uuid.node[2]);
            assertEquals((byte) 0xDD, uuid.node[3]);
            assertEquals((byte) 0xEE, uuid.node[4]);
            assertEquals((byte) 0x00, uuid.node[5]); // Missing data defaults to 0
        }

        @Test
        @DisplayName("Constructor with empty node array in rpc.uuid_t should handle gracefully")
        void testConstructorWithEmptyNode() {

    static Stream<Arguments> hexCases() {
        return Stream.of(Arguments.of(new byte[] {}, ""), Arguments.of(new byte[] { (byte) 0x00 }, "00"),
                Arguments.of(new byte[] { (byte) 0x0F }, "0f"), Arguments.of(new byte[] { (byte) 0x10 }, "10"),
                Arguments.of(new byte[] { (byte) 0xAB }, "ab"),
                Arguments.of(new byte[] { (byte) 0x7F, (byte) 0x80, (byte) 0xFF }, "7f80ff"));
    }

                    return null;
                }
                return (long) Encdec.dec_uint64le(this.sbuf, 28);
            }

            if (this.sbuf[0] == (byte) 0x00 && this.sbuf[1] == (byte) 0x00 && this.sbuf[4] == (byte) 0xFF && this.sbuf[5] == (byte) 'S'
                    && this.sbuf[6] == (byte) 'M' && this.sbuf[7] == (byte) 'B') {
                break; /* all good (SMB) */
            }

 *
 * @author Alex Matevossian
 * @author David Beaumont
 * @since 15.0
 */
@GwtCompatible
public class XmlEscapers {
  private XmlEscapers() {}

  private static final char MIN_ASCII_CONTROL_CHAR = 0x00;
  private static final char MAX_ASCII_CONTROL_CHAR = 0x1F;

  // For each xxxEscaper() method, please add links to external reference pages
  // that are considered authoritative for the behavior of that escaper.

  /**

            // When - calculate percentage free
            double percentFree = (allocInfo.getFree() * 100.0) / allocInfo.getCapacity();

            // Then
            assertEquals(25.0, percentFree, 0.001);
        }

        @Test
        @DisplayName("Should support available space check pattern")
        void shouldSupportAvailableSpaceCheckPattern() {
            // Given

    }

    @Test
    @DisplayName("Test setCommand with various SMB command codes")
    void testSetCommandWithVariousCodes() {
        // Test common SMB command codes
        int[] commandCodes = { 0x00, 0x72, 0x73, 0x74, 0x75, 0xFF };

        for (int command : commandCodes) {
            doNothing().when(messageBlock).setCommand(command);
            when(messageBlock.getCommand()).thenReturn(command);

  /**
   * Maximum allowed false positive probability of detecting a hash flooding attack given random
   * input.
   */
  @VisibleForTesting static final double HASH_FLOODING_FPP = 0.001;

  /**
   * Maximum allowed length of a hash table bucket before falling back to a j.u.HashMap based
   * implementation. Experimentally determined.
   */
  static final int MAX_HASH_BUCKET_LENGTH = 8;