// H T T P / 1 . 1   2 0 0   T e m p o r a r y   R e d i r e c t
      // 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0

      // Parse protocol like "HTTP/1.1" followed by a space.
      val codeStart: Int
      val protocol: Protocol
      if (statusLine.startsWith("HTTP/1.")) {
        if (statusLine.length < 9 || statusLine[8] != ' ') {

		return l, true
	}
	return 0, false
}

// grow grows the buffer to guarantee space for n more bytes.
// It returns the index where bytes should be written.
// If the buffer can't grow it will panic with ErrTooLarge.
func (b *Buffer) grow(n int) int {
	m := b.Len()
	// If buffer is empty, reset to recover space.
	if m == 0 && b.off != 0 {
		b.Reset()
	}
	// Try to grow by means of a reslice.

                "1000, 500, 8, 4096", // 4K sectors
                "1000, 500, 16, 4096", // Large sectors and allocation
                "1000, 0, 8, 512", // No free space
                "1000, 1000, 8, 512" // All space free
        })
        void shouldDecodeVariousSectorConfigurations(long alloc, long free, int sectPerAlloc, int bytesPerSect)
                throws SMBProtocolDecodingException {

        assertEquals(512, info.bytesPerSect);
        assertEquals(1000L * 100 * 512, info.getCapacity(), "Capacity calculation should be correct");
        assertEquals(500L * 100 * 512, info.getFree(), "Free space calculation should be correct");
    }

    /**
     * Tests the readDataWireFormat method with the SMB_QUERY_FS_SIZE_INFO information level.
     */
    @Test
    void testReadDataWireFormat_SmbQueryFSSizeInfo() {

	// Check for overflows.
	// https://github.com/minio/minio/issues/8035
	// XFS can show wrong values at times error out
	// in such scenarios.
	if info.Free > info.Total {
		return info, fmt.Errorf("detected free space (%d) > total drive space (%d), fs corruption at (%s). please run 'fsck'", info.Free, info.Total, path)
	}
	info.Used = info.Total - info.Free
	return info, nil
}

// GetDriveStats returns IO stats of the drive by its major:minor

  private void readMoreChars() throws IOException {
    // Possibilities:
    // 1) array has space available on right-hand side (between limit and capacity)
    // 2) array has space available on left-hand side (before position)
    // 3) array has no space available
    //
    // In case 2 we shift the existing chars to the left, and in case 3 we create a bigger

		)

		// Total available space in the disk
		ch <- prometheus.MustNewConstMetric(
			prometheus.NewDesc(
				prometheus.BuildFQName(diskNamespace, "storage", "available"),
				"Total available space left on the drive",
				[]string{"disk"}, nil),
			prometheus.GaugeValue,
			float64(disk.AvailableSpace),
			disk.DrivePath,
		)

		// Total storage space of the disk
		ch <- prometheus.MustNewConstMetric(

    void encodeCopiesAndReportsSize(byte[] src, int off, int len, int dstIndex) {
        Encodable enc = new ByteEncodable(src, off, len);

        // Destination has guard space to verify non-overwritten regions.
        byte[] dst = new byte[dstIndex + len + 5];
        Arrays.fill(dst, (byte) 0x55);

        // Act
        int written = enc.encode(dst, dstIndex);

                "1000, 500, 600, 8, 4096", // 4K sectors
                "1000, 500, 600, 16, 4096", // Large sectors and allocation
                "1000, 0, 0, 8, 512", // No free space
                "1000, 1000, 1000, 8, 512" // All space free
        })
        void shouldDecodeVariousSectorConfigurations(long alloc, long callerFree, long actualFree, int sectPerAlloc, int bytesPerSect)

    background-color: #f4f5f7;
}

.filter-check-item .filter-check {
    margin: 0;
    flex-shrink: 0;
}

.filter-check-label {
    overflow: hidden;
    text-overflow: ellipsis;
    white-space: nowrap;
}

.filter-dropdown-footer {
    padding: 0.25rem 0.5rem;
    border-top: 1px solid #ebecf0;
    text-align: right;
}

.filter-clear-group {
    font-size: 0.75rem;