byte[] nameBytes = name.getBytes();
        for (int i = 0; i < nameBytes.length; i++) {
            assertEquals(nameBytes[i], dst[12 + i], "Filename byte mismatch at index " + i);
        }
        assertEquals((byte) 0x00, dst[12 + nameBytes.length], "Filename must be null-terminated");
    }

    /**
     * Verifies reset() clears flags2 and updates resumeKey and filename used for parameters.

                    </div>
                </div>
            </div>
        </div>
        <section class="content">
            <div class="row">
                <div class="col-md-12">
                    <c:if test="${!displayCreateLink}">
                        <la:link href="/admin/fileconfig/" styleClass="btn btn-primary ${f:h(editableClass)}">

                    </div>
                </div>
            </div>
        </div>
        <section class="content">
            <div class="row">
                <div class="col-md-12">
                    <div class="card card-outline card-primary">
                        <div class="card-header">
                            <jsp:include page="/WEB-INF/view/common/admin/crud/header.jsp"></jsp:include>

  {{- if .Values.networkPolicy.egress.enabled }}
  egress:
    - ports:
        {{ .Values.networkPolicy.egress.ports | toJson }}
      {{- with .Values.networkPolicy.egress.to }}
      to:
        {{- toYaml . | nindent 12 }}
      {{- end }}
  {{- end }}
---
kind: NetworkPolicy
apiVersion: {{ template "minio.networkPolicy.apiVersion" . }}
metadata:
  name: {{ template "minio.fullname" . }}-post-job
  labels:

    id: int
    name: str = "John Doe"
    signup_ts: datetime | None = None
    friends: list[int] = []


external_data = {
    "id": "123",
    "signup_ts": "2017-06-01 12:22",
    "friends": [1, "2", b"3"],
}
user = User(**external_data)
print(user)
# > User id=123 name='John Doe' signup_ts=datetime.datetime(2017, 6, 1, 12, 22) friends=[1, 2, 3]
print(user.id)

	{dataBlocks: 6, disks: 12, offDisks: 8, badDisks: 3, badStaleDisks: 0, blocksize: int64(blockSizeV2), size: oneMiByte, algorithm: DefaultBitrotAlgorithm, shouldFail: true},   // 12

	{dataBlocks: 6, onDisks: 12, offDisks: 3, blocksize: int64(blockSizeV2), data: oneMiByte, offset: 0, length: oneMiByte, algorithm: SHA256, shouldFail: false, shouldFailQuorum: false},
	// 19

            // Use the nonce directly if it's 12 bytes (generated appropriately)
            final byte[] adjustedNonce;
            if (nonce.length == 12) {
                adjustedNonce = nonce;
            } else {
                // Fallback for compatibility
                adjustedNonce = new byte[12];
                System.arraycopy(nonce, 0, adjustedNonce, 0, Math.min(12, nonce.length));
            }

        setField(cmd, "largeFile", false);

        byte[] buffer = new byte[20];
        int len = cmd.writeParameterWordsWireFormat(buffer, 0);
        assertEquals(-12, len, "writeParameterWordsWireFormat should write 12 Bytes");
        // Validate parameter bytes using reflection since fields are private
        assertEquals(getField(cmd, "fid"), SMBUtil.readInt2(buffer, 0));

## What is Erasure Code?

Erasure code is a mathematical algorithm to reconstruct missing or corrupted data. MinIO uses Reed-Solomon code to shard objects into variable data and parity blocks. For example, in a 12 drive setup, an object can be sharded to a variable number of data and parity blocks across all the drives - ranging from six data and six parity blocks to ten data and two parity blocks.