/**
 * Represents the FILE_FS_SIZE_INFORMATION structure used to query file system size information.
 * This structure provides details about the total allocation units, free allocation units,
 * sectors per allocation unit, and bytes per sector for a file system volume.
 */
public class FileFsSizeInformation implements AllocInfo {

    private long alloc; // Also handles SmbQueryFSSizeInfo
    private long free;
    private int sectPerAlloc;

        writeInt8(2000, buffer, 0); // total allocation units
        writeInt8(1000, buffer, 8); // free allocation units
        writeInt4(8, buffer, 16); // sectors per allocation unit
        writeInt4(4096, buffer, 20); // bytes per sector

        int bytesRead = response.readDataWireFormat(buffer, 0, buffer.length);

        assertEquals(24, bytesRead, "Should read 24 bytes");

/**
 * Represents the SMB_INFO_ALLOCATION information level used in SMB transaction requests.
 * This structure provides allocation information for a file system including total units,
 * free units, sectors per allocation unit, and bytes per sector.
 */
public class SmbInfoAllocation implements AllocInfo {

    /**
     * Default constructor for SMB allocation information.
     */
    public SmbInfoAllocation() {

    @DisplayName("Test decode with large bytes per sector")
    void testDecodeWithLargeBytesPerSector() throws SMBProtocolDecodingException {
        // Prepare test data with large bytesPerSect
        byte[] buffer = new byte[22];
        int idFileSystem = 0x22222222;
        int sectPerAlloc = 8;
        long alloc = 10000L;
        long free = 5000L;
        int bytesPerSect = 32768; // 32KB sectors

        // Encode test data

    void testAs_Enumeration_Success() throws PACDecodingException {
        // Test successful casting from enumeration
        Vector<ASN1Integer> vector = new Vector<>();
        ASN1Integer expected = new ASN1Integer(123);
        vector.add(expected);
        ASN1Integer result = ASN1Util.as(ASN1Integer.class, vector.elements());
        assertSame(expected, result);
    }

    @Test
    void testAs_Enumeration_Failure() {

        SMBUtil.writeInt8(500000, buffer, 28); // Available allocation units
        SMBUtil.writeInt4(512, buffer, 36); // Sectors per unit
        SMBUtil.writeInt4(4096, buffer, 40); // Bytes per sector

        int result = response.readBytesWireFormat(buffer, bufferIndex);

        assertNotNull(response.getInfo());

    @SuppressWarnings("unused")
    @Test
    public void testIterable() throws Exception {
        final Vector<String> vector = new Vector<String>();
        vector.add("a");
        vector.add("b");
        int count = 0;
        for (final String s : iterable(vector.elements())) {
            ++count;
        }
        assertThat(count, is(2));
    }

    /**
     * Test method for

     * @param c the collection of elements to be placed in the vector
     * @return a new instance of {@link Vector}
     * @see Vector#Vector(Collection)
     */
    public static <E> Vector<E> newVector(final Collection<? extends E> c) {
        return new Vector<>(c);
    }

    /**
     * Creates and returns a new instance of {@link Vector}.
     *
     * @param <E> the element type of {@link Vector}

     */
    @Test
    void testConstructorUnknownField() throws IOException {
        ASN1EncodableVector vector = new ASN1EncodableVector();
        vector.add(new DERTaggedObject(99, new DERGeneralString("unknown")));
        DERSequence sequence = new DERSequence(vector);
        byte[] encoded = new DERTaggedObject(false, BERTags.APPLICATION, 1, sequence).getEncoded();

- *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*.  In the example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total of 64 possible sets, with 8 drives we get a total of 128 possible sets, with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total.