assertThat(allowedByCompactTable).isEqualTo(allowedByTable)
      assertThat(compactTableMappedTo).isEqualTo(tableMappedTo)
    }
  }

  /** Confirm we didn't corrupt any data in code generation. */
  @Test fun compareConstructedAndGeneratedCompactTables() {
    assertThat(IDNA_MAPPING_TABLE.sections).isEqualTo(compactTable.sections)

* Addon manager supports HA masters. ([#55782](https://github.com/kubernetes/kubernetes/pull/55782), [@x13n](https://github.com/x13n))
* Fixed 'Schedulercache is corrupted' error in kube-scheduler ([#55262](https://github.com/kubernetes/kubernetes/pull/55262), [@liggitt](https://github.com/liggitt))

## Changelog since v1.8.2

### Other notable changes

* Fixed 'Schedulercache is corrupted' error in kube-scheduler ([#55262](https://github.com/kubernetes/kubernetes/pull/55262), [@liggitt](https://github.com/liggitt))

                    DomUtils.updateOrCreateChildElement(parentElement, RELATIVE_PATH, correctRelativePathStr);
                    context.detail("Fixed: " + "relativePath corrected from '" + currentRelativePath + "' to '"
                            + correctRelativePathStr + "'");
                    return true;
                }
            } catch (Exception e) {

            // Read with UTF-8 encoding
            final String content = new String(is.readAllBytes(), StandardCharsets.UTF_8);

            // Verify encoding doesn't corrupt content
            assertTrue("Content should be valid", content.length() > 0);
            assertTrue("Should not contain encoding errors", !content.contains("\uFFFD"));

            // Verify JSON structure is intact

 * prevention and <i>no</i> expectation of bit dispersion. This leaves them perfectly suitable for
 * use in hash tables, because extra collisions cause only a slight performance hit, while poor bit
 * dispersion is easily corrected using a secondary hash function (which all reasonable hash table
 * implementations in Java use). For the many uses of hash functions beyond data structures,

 * prevention and <i>no</i> expectation of bit dispersion. This leaves them perfectly suitable for
 * use in hash tables, because extra collisions cause only a slight performance hit, while poor bit
 * dispersion is easily corrected using a secondary hash function (which all reasonable hash table
 * implementations in Java use). For the many uses of hash functions beyond data structures,

- Mount-utils: treat syscall.ENODEV as corrupted mount ([#126174](https://github.com/kubernetes/kubernetes/pull/126174), [@dobsonj](https://github.com/dobsonj)) [SIG Storage]

					}
					break
				}
			case corruptPart:
				for index, err := range test.errs {
					if err != nil {
						continue
					}
					// Corrupt a part from a disk
					// which has a valid xl.meta,
					// and check if that disk
					// appears in outDatedDisks.
					tamperedIndex = index

        |100
        |2
        |
        |CLEAN k1 1 1
        """.trimMargin(),
      )
    }
    createNewCache()
    assertThat(cache["k1"]).isNull()

    // The journal is not corrupt when editing after a truncated line.
    set("k1", "C", "D")
    cache.close()
    createNewCache()
    assertValue("k1", "C", "D")
  }

  @Test
  fun openWithTooManyFileSizesClearsDirectory() {