"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",

    }

    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++;

   * of reads may not be immediately reflected on the algorithm's data structures. These structures
   * are guarded by a lock and operations are applied in batches to avoid lock contention. The
   * penalty of applying the batches is spread across threads so that the amortized cost is slightly
   * higher than performing just the operation without enforcing the capacity constraint.
   *

* Copy and display source location prominently on Kubernetes instances ([#27840](https://github.com/kubernetes/kubernetes/pull/27840), [@zmerlynn](https://github.com/zmerlynn))
* AWS/GCE: Spread PetSet volume creation across zones, create GCE volumes in non-master zones ([#27553](https://github.com/kubernetes/kubernetes/pull/27553), [@justinsb](https://github.com/justinsb))