CleanAbandonedData(ctx context.Context, volume string, path string) error

	// Write all data, syncs the data to disk.
	// Should be used for smaller payloads.
	WriteAll(ctx context.Context, volume string, path string, b []byte) (err error)

	// Read all.
	ReadAll(ctx context.Context, volume string, path string) (buf []byte, err error)

		logger.Info("WARNING: maximum virtual memory limit (%s) is too small for 'go runtime', please consider setting `ulimit -v` to unlimited",
			humanize.IBytes(vssLimit))
	}

	if ctx.MemLimit > 0 {
		debug.SetMemoryLimit(int64(ctx.MemLimit))
	}

	// Do not use RLIMIT_AS as that is not useful and at times on systems < 4Gi
	// this can crash the Go runtime if the value is smaller refer
	// - https://github.com/golang/go/issues/38010

        // Any PACDecodingException is acceptable for this test
        assertNotNull(e.getMessage());
    }

    @Test
    void testTooSmallPac() {
        // Test that PAC smaller than 8 bytes is rejected
        byte[] smallData = new byte[4];

        PACDecodingException e = assertThrows(PACDecodingException.class, () -> new Pac(smallData, keys));

    }

    @Test
    @DisplayName("Test small data handling")
    public void testSmallDataHandling() throws CIFSException {
        byte[] smallData = new byte[100]; // Below minimum compression size

        byte[] compressed = compressionService.compress(smallData, CompressionService.COMPRESSION_LZ77);
        // Should return uncompressed data for small inputs
        assertArrayEquals(smallData, compressed);
    }

  @SuppressWarnings("Immutable")
  private final long[] array;

  /*
   * TODO(kevinb): evaluate the trade-offs of going bimorphic to save these two fields from most
   * instances. Note that the instances that would get smaller are the right set to care about
   * optimizing, because the rest have the option of calling `trimmed`.
   */

  private final transient int start; // it happens that we only serialize instances where this is 0

  @SuppressWarnings("Immutable")
  private final int[] array;

  /*
   * TODO(kevinb): evaluate the trade-offs of going bimorphic to save these two fields from most
   * instances. Note that the instances that would get smaller are the right set to care about
   * optimizing, because the rest have the option of calling `trimmed`.
   */

  private final transient int start; // it happens that we only serialize instances where this is 0

    }

    /**
     * Get the minimum of two dialect versions
     *
     * @param a the first version to compare
     * @param b the second version to compare
     * @return smaller of the two versions
     */
    public static DialectVersion min(final DialectVersion a, final DialectVersion b) {
        if (a.atMost(b)) {
            return a;
        }
        return b;
    }

    //     imagine a line separating the first block from the second, we can proceed by exchanging
    //     the smaller of these blocks with the far end of the other one. That leaves us with a
    //     smaller version of the same problem.
    //     Say we are rotating abcdefgh by 5. We start with abcde|fgh. The smaller block is [fgh]:
    //     [abc]de|[fgh] -> [fgh]de|[abc]. Now [fgh] is in the right place, but we need to swap [de]

- Reload() of MinIO server arguments without fully restarting the process.

- Expanding 1 node at a time by automating the process of creating a new pool
  and decommissioning to provide a functionality that smaller deployments
  care about.

//     inmemory: true # indicates if the archive must be staged locally or in-memory
//     compress: true # S2/Snappy compressed archive
//     smallerThan: 5MiB # create archive for all objects smaller than 5MiB
//     skipErrs: false # skips any source side read() errors

// BatchJobSnowball describes the snowball feature when replicating objects from a local source to a remote target
type BatchJobSnowball struct {