return
	}

	bucketMeta := madmin.SRBucketMeta{
		Type:      madmin.SRBucketMetaTypeQuotaConfig,
		Bucket:    bucket,
		Quota:     data,
		UpdatedAt: updatedAt,
	}
	if quotaConfig.Size == 0 && quotaConfig.Quota == 0 {
		bucketMeta.Quota = nil
	}

	// Call site replication hook.
	replLogIf(ctx, globalSiteReplicationSys.BucketMetaHook(ctx, bucketMeta))

	// Write success response.

        // Prepare test data
        String shareName = "SHARE1";
        int shareType = 0x00000000; // Disk share
        String remark = "Test share";

        // Calculate buffer size
        int shareNameSize = 14; // 13 bytes + null terminator (fixed field)
        int typeSize = 2;
        int offsetSize = 4;
        int remarkSize = remark.length() + 1;

        // Verify
        assertEquals(expectedLastAccessTime, fileBothDirectoryInfo.lastAccess());
    }

    @Test
    @DisplayName("Test length returns correct end of file size")
    void testLength() throws SMBProtocolDecodingException {
        // Prepare test data
        byte[] buffer = createValidBuffer("file.txt", "FILE~1.TXT", true);
        long expectedEndOfFile = 1024L * 1024L; // 1MB

 * limitations under the License.
 */

package com.google.common.math;

import static com.google.common.collect.Iterables.get;
import static com.google.common.collect.Iterables.size;
import static com.google.common.math.MathTesting.ALL_DOUBLE_CANDIDATES;
import static com.google.common.math.MathTesting.ALL_ROUNDING_MODES;
import static com.google.common.math.MathTesting.ALL_SAFE_ROUNDING_MODES;

        // Test with minimal buffer size
        byte[] minBuffer = new byte[2];
        int written = trans2QueryFSInfo.writeSetupWireFormat(minBuffer, 0);
        assertEquals(2, written);

        // Test with exact parameter size
        byte[] paramBuffer = new byte[2];
        written = trans2QueryFSInfo.writeParametersWireFormat(paramBuffer, 0);

 *       in the hash code should be as evenly "spread out" through the hash code's bits as possible.
 *       The result is that, for example, when choosing a bucket in a hash table of size 2^8,
 *       <i>any</i> eight bits could be consistently used.
 *   <li><b>cryptographic:</b> certain hash functions such as {@link Hashing#sha512} are designed to

 *       in the hash code should be as evenly "spread out" through the hash code's bits as possible.
 *       The result is that, for example, when choosing a bucket in a hash table of size 2^8,
 *       <i>any</i> eight bits could be consistently used.
 *   <li><b>cryptographic:</b> certain hash functions such as {@link Hashing#sha512} are designed to

        return new VersionRange(version, restrictions);
    }

    private List<Restriction> intersection(List<Restriction> r1, List<Restriction> r2) {
        List<Restriction> restrictions = new ArrayList<>(r1.size() + r2.size());
        Iterator<Restriction> i1 = r1.iterator();
        Iterator<Restriction> i2 = r2.iterator();
        Restriction res1 = i1.next();
        Restriction res2 = i2.next();

        boolean done = false;

        });
    }

    @Test
    public void testValidArrayAllocation() throws Exception {
        validator.validateArrayAllocation(100, 10, 1000);
        validator.validateArrayAllocation(0, 10, 1000); // Zero size should be allowed
    }

    @Test
    public void testArrayAllocationNegativeSize() throws Exception {
        assertThrows(SmbException.class, () -> {
            validator.validateArrayAllocation(-1, 10, 1000);

    }

    // Validates equals() returns true for same-sized, equal-content blobs
    @Test
    @DisplayName("equals: identical content and size -> true")
    void equals_identicalContent_true() {
        // Arrange
        byte[] a = new byte[] { 1, 2, 3 };
        byte[] b = new byte[] { 1, 2, 3 };
        SecurityBlob left = new SecurityBlob(a);