or Derivative Works thereof, You may choose to offer, and charge a fee for, 
acceptance of support, warranty, indemnity, or other liability obligations 
and/or rights consistent with this License. However, in accepting such 
obligations, You may act only on Your own behalf and on Your sole 
responsibility, not on behalf of any other Contributor, and only if You 

      the Work or Derivative Works thereof, You may choose to offer,
      and charge a fee for, acceptance of support, warranty, indemnity,
      or other liability obligations and/or rights consistent with this
      License. However, in accepting such obligations, You may act only
      on Your own behalf and on Your sole responsibility, not on behalf
      of any other Contributor, and only if You agree to indemnify,

      the Work or Derivative Works thereof, You may choose to offer,
      and charge a fee for, acceptance of support, warranty, indemnity,
      or other liability obligations and/or rights consistent with this
      License. However, in accepting such obligations, You may act only
      on Your own behalf and on Your sole responsibility, not on behalf
      of any other Contributor, and only if You agree to indemnify,

        assertEquals(2, comp2.getId());

        // Components should be different instances
        assertNotSame(comp1, comp2);
    }

    /**
     * Test listener state consistency
     */
    public void test_listenerStateConsistency() throws Exception {
        final List<String> events = new ArrayList<>();

                // fid based equality (null fileId, same fid and tree id)
                Arguments.of(null, null, 200L, true));
    }

    @ParameterizedTest(name = "equals/hashCode consistent for treeId={2}")
    @MethodSource("equalsHashParams")
    void equalsAndHashCode_consistency(byte[] id1, byte[] id2, long treeId, boolean expectEqual) {
        lenient().when(cfg.isTraceResourceUsage()).thenReturn(false);

   * example, {@code [] < [1L] < [1L, 2L] < [2L] < [1L << 63]}.
   *
   * <p>The returned comparator is inconsistent with {@link Object#equals(Object)} (since arrays
   * support only identity equality), but it is consistent with {@link Arrays#equals(long[],
   * long[])}.
   *
   * <p><b>Java 9+ users:</b> Use {@link Arrays#compareUnsigned(long[], long[])
   * Arrays::compareUnsigned}.
   */

        assertEquals("file with spaces.txt", result.get(1).getFileName());
        assertEquals("file@#$%.txt", result.get(2).getFileName());
    }

    @Test
    @DisplayName("Test NotifyResponse consistency across multiple calls")
    void testNotifyResponseConsistency() {
        List<FileNotifyInformation> notifications = Arrays.asList(mockNotifyInfo1, mockNotifyInfo2);

      the Work or Derivative Works thereof, You may choose to offer,
      and charge a fee for, acceptance of support, warranty, indemnity,
      or other liability obligations and/or rights consistent with this
      License. However, in accepting such obligations, You may act only
      on Your own behalf and on Your sole responsibility, not on behalf
      of any other Contributor, and only if You agree to indemnify,

      the Work or Derivative Works thereof, You may choose to offer,
      and charge a fee for, acceptance of support, warranty, indemnity,
      or other liability obligations and/or rights consistent with this
      License. However, in accepting such obligations, You may act only
      on Your own behalf and on Your sole responsibility, not on behalf
      of any other Contributor, and only if You agree to indemnify,

		xl.versions = xl.versions[:2]
		xl.addVersion(ventry)

		data, err = xl.AppendTo(nil)
		if err != nil {
			t.Fatal(err)
		}
		// t.Logf("data := %#v\n", data)
	})
	// Test compressed index consistency fix
	t.Run("comp-index", func(t *testing.T) {
		// This file has a compressed index, due to https://github.com/minio/minio/pull/20575
		// We ensure it is rewritten without an index.