"application/vnd.kde.kchart",
				"application/vnd.kde.kformula",
				"application/vnd.kde.kivio",
				"application/vnd.kde.kontour",
				"application/vnd.kde.kpresenter",
				"application/vnd.kde.kspread",
				"application/vnd.kde.kword",
				"application/vnd.kenameaapp",
				"application/vnd.kidspiration",
				"application/vnd.kinar",
				"application/vnd.koan",
				"application/vnd.kodak-descriptor",

    <_comment>KPresenter File</_comment>
    <glob pattern="*.kpr"/>
    <glob pattern="*.kpt"/>
  </mime-type>

  <mime-type type="application/vnd.kde.kspread">
    <alias type="application/x-kspread"/>
    <_comment>KSpread File</_comment>
    <glob pattern="*.ksp"/>
  </mime-type>

  <mime-type type="application/vnd.kde.kword">
    <alias type="application/x-kword"/>

Decommissiong is a mechanism in MinIO to drain older pools (usually with old hardware) and migrate the content from such pools to a newer pools (usually better hardware). Decommissioning spreads the data across all pools - for example, if you decommission `pool1`, all the data from `pool1` spreads across `pool2` and `pool3`.

## Features

type readOp int8

// Don't use iota for these, as the values need to correspond with the
// names and comments, which is easier to see when being explicit.
const (
	opRead      readOp = -1 // Any other read operation.
	opInvalid   readOp = 0  // Non-read operation.
	opReadRune1 readOp = 1  // Read rune of size 1.
	opReadRune2 readOp = 2  // Read rune of size 2.

- **Each object is written to a single EC set, and therefore is spread over no more than 16 drives.**
- **All the nodes running distributed MinIO setup are recommended to be homogeneous, i.e. same operating system, same number of drives and same network interconnects.**

	// Otherwise same set of buckets get scanned across erasure sets always.
	// at any given point in time. This allows different buckets to be scanned
	// in different order per erasure set, this wider spread is needed when
	// there are lots of buckets with different order of objects in them.
	r := rand.New(rand.NewSource(time.Now().UnixNano()))
	permutes := r.Perm(len(buckets))
	// Add new buckets first

    }

    char[] chars = string.toCharArray();
    int spread = 1;

    // This unusual loop comes from extensive benchmarking
    OUT:
    while (true) {
      pos++;
      while (true) {
        if (pos == chars.length) {
          break OUT;
        }
        if (matches(chars[pos])) {
          break;
        }
        chars[pos - spread] = chars[pos];
        pos++;
      }
      spread++;

                    | (inBytes[inOff + i * 4 + 2] & 0xff) << 8 | inBytes[inOff + i * 4 + 3] & 0xff;
        }
    }

    /// Spread ints into bytes.
    /**
     * Converts integers to bytes after internal DES processing
     * @param inInts the input integer array
     * @param inOff the offset into the input array

- In this algorithm, we also make sure that we spread the drives out evenly. MinIO server expands ellipses passed as arguments. Here is a sample expansion to demonstrate the process.

```
minio server http://host{1...2}/export{1...8}
```

Expected expansion

```

                                localFailures = 0; // Reset on success
                            }

                            Thread.sleep(5); // Small delay to spread out requests
                        }
                        successfulThreads.incrementAndGet();
                    } catch (Exception e) {
                        exceptionCount.incrementAndGet();