Ordering<Number> unusedF = numbers.compound(objects).compound(objects); // bad IDEA
    Ordering<Number> unusedG = objects.compound(numbers).compound(objects);
    Ordering<Number> unusedH = objects.compound(objects).compound(numbers);

    Ordering<Number> unusedI = numbers.compound(objects.compound(objects));
    Ordering<Number> unusedJ = objects.compound(numbers.compound(objects)); // bad IDEA

    Ordering<Number> unusedF = numbers.compound(objects).compound(objects); // bad IDEA
    Ordering<Number> unusedG = objects.compound(numbers).compound(objects);
    Ordering<Number> unusedH = objects.compound(objects).compound(numbers);

    Ordering<Number> unusedI = numbers.compound(objects.compound(objects));
    Ordering<Number> unusedJ = objects.compound(numbers.compound(objects)); // bad IDEA

					}
					prevPrefix = currPrefix
					objects = append(objects, ObjectInfo{
						IsDir:  true,
						Bucket: bucket,
						Name:   currPrefix,
					})
					continue
				}
			}

			fi, err := entry.fileInfo(bucket)
			if err == nil && fi.VersionPurgeStatus().Empty() {
				versioned := vcfg != nil && vcfg.Versioned(entry.name)
				objects = append(objects, fi.ToObjectInfo(bucket, entry.name, versioned))
			}

		m.KeyRotate = &madmin.KeyRotationInfo{
			Bucket:        ri.Bucket,
			Object:        ri.Object,
			Objects:       ri.Objects,
			ObjectsFailed: ri.ObjectsFailed,
		}
	case string(madmin.BatchJobExpire):
		m.Expired = &madmin.ExpirationInfo{
			Bucket:              ri.Bucket,
			Object:              ri.Object,
			Objects:             ri.Objects,
			DeleteMarkers:       ri.DeleteMarkers,

minio server /data
```

### Storage Class

By default, parity for objects with standard storage class is set to `N/2`, and parity for objects with reduced redundancy storage class objects is set to `2`. Read more about storage class support in MinIO server [here](https://github.com/minio/minio/blob/master/docs/erasure/storage-class/README.md).

```
KEY:
storage_class  define object level redundancy

ARGS:

		rand.Shuffle(len(disks), func(i, j int) {
			disks[i], disks[j] = disks[j], disks[i]
		})

		filterLifecycle := func(bucket, object string, fi FileInfo) bool {
			if lc == nil {
				return false
			}
			versioned := vc != nil && vc.Versioned(object)
			objInfo := fi.ToObjectInfo(bucket, object, versioned)

			evt := evalActionFromLifecycle(ctx, *lc, lr, rcfg, objInfo)
			switch {

   */
  void moveLastEntry(int dstIndex, int mask) {
    Object table = requireTable();
    int[] entries = requireEntries();
    @Nullable Object[] elements = requireElements();
    int srcIndex = size() - 1;
    if (dstIndex < srcIndex) {
      // move last entry to deleted spot
      Object object = elements[srcIndex];
      elements[dstIndex] = object;
      elements[srcIndex] = null;

        && Objects.equals(keyStrength, that.keyStrength)
        && Objects.equals(valueStrength, that.valueStrength)
        && Objects.equals(recordStats, that.recordStats)
        && Objects.equals(
            durationInNanos(writeExpirationDuration, writeExpirationTimeUnit),
            durationInNanos(that.writeExpirationDuration, that.writeExpirationTimeUnit))
        && Objects.equals(

        && Objects.equals(keyStrength, that.keyStrength)
        && Objects.equals(valueStrength, that.valueStrength)
        && Objects.equals(recordStats, that.recordStats)
        && Objects.equals(
            durationInNanos(writeExpirationDuration, writeExpirationTimeUnit),
            durationInNanos(that.writeExpirationDuration, that.writeExpirationTimeUnit))
        && Objects.equals(

import java.io.File

@CacheableTask
abstract class GeneratePackageInfoDataTask : DefaultTask() {

    companion object {
        val packageLineRegex = Regex("""package\s*([^;\s]+)\s*;""")

        fun findPackageInfoFiles(objects: ObjectFactory, projectBaseDirs: Provider<List<File>>): FileCollection {
            return objects.fileCollection().from(projectBaseDirs.map {