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,

        // But should throw when trying to use the null path
        assertThrows(NullPointerException.class, () -> {
            reqWithNull.size();
        });
    }

    @Test
    @DisplayName("Should write consistent structure at different offsets")
    void testWriteBytesAtDifferentOffsets() throws Exception {
        // Test at different offsets
        int[] offsets = { 0, 10, 50, 100, 200 };

			res.After.Drives = append(res.After.Drives, healBucketResults[i].After.Drives...)
		}
	}

	return res, nil
}

// ListBuckets lists buckets across all nodes and returns a consistent view:
//   - Return an error when a pool cannot return N/2+1 valid bucket information
//   - For each pool, check if the bucket exists in N/2+1 nodes before including it in the final result

   * at all are provided (an empty list), the resulting Cartesian product has one element, an empty
   * list (counter-intuitive, but mathematically consistent).
   *
   * <p><i>Performance notes:</i> while the cartesian product of lists of size {@code m, n, p} is a
   * list of size {@code m x n x p}, its actual memory consumption is much smaller. When the

   * 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}.

   * example, {@code [] < [1] < [1, 2] < [2] < [1 << 31]}.
   *
   * <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(int[], int[])}.
   *
   * <p><b>Java 9+ users:</b> Use {@link Arrays#compareUnsigned(int[], int[])
   * Arrays::compareUnsigned}.
   */

   * not even implement {@link Comparable} at all).
   *
   * <p><b>Warning:</b> by definition, this comparator is not <i>consistent with equals</i> (as
   * defined {@linkplain Comparator here}). Avoid its use in APIs, such as {@link
   * TreeSet#TreeSet(Comparator)}, where such consistency is expected.
   *
   * <p>The returned comparator is serializable.
   *

   * across different segments.
   *
   * The page replacement algorithm's data structures are kept casually consistent with the map. The
   * ordering of writes to a segment is sequentially consistent. An update to the map and recording
   * of reads may not be immediately reflected on the algorithm's data structures. These structures

        tag2.setId("test");
        tag2.setCss("highlight");

        // Equal objects must have equal hash codes
        assertEquals(tag1.hashCode(), tag2.hashCode());

        // Hash code should be consistent
        int hash1 = tag1.hashCode();
        int hash2 = tag1.hashCode();
        assertEquals(hash1, hash2);
    }

    @Test
    public void test_setters() {

            int size = request.size();
            assertEquals(0, size % 8, "Size should be aligned to 8-byte boundary");
        }

        @Test
        @DisplayName("Should have consistent size regardless of parameters")
        void testSizeConsistency() {
            int originalSize = request.size();

            request.setReadLength(65536);
            assertEquals(originalSize, request.size());