wantIdx bool
	}{
		{name: "empty", data: nil},
		{name: "small", data: []byte("hello, world!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!")},
		{name: "large", data: bytes.Repeat([]byte("hello, world"), 1000000), wantIdx: true},
	}

	for _, tt := range tests {
		t.Run(tt.name, func(t *testing.T) {
			buf := make([]byte, 100) // make small buffer to ensure multiple reads are required for large case

                                localFailures = 0; // Reset on success
                            }

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

import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A collection that associates an ordered pair of keys, called a row key and a column key, with a
 * single value. A table may be sparse, with only a small fraction of row key / column key pairs
 * possessing a corresponding value.
 *
 * <p>The mappings corresponding to a given row key may be viewed as a {@link Map} whose keys are

            return entity;
        });
    }

    // ===================================================================================
    //                                                                        Small Helper
    //                                                                        ============
    //                                                                              JSP

                if (buffer == null || buffer.length < bufferIndex + 4) {
                    throw new SMBProtocolDecodingException("Buffer too small");
                }
                return 4;
            }

            @Override
            public int encode(byte[] dst, int dstIndex) {
                return 4;
            }

   *
   * <p>Note that this function is necessarily well-defined for any discrete type.
   *
   * @return the distance as described above, or {@link Long#MIN_VALUE} or {@link Long#MAX_VALUE} if
   *     the distance is too small or too large, respectively.
   */
  public abstract long distance(C start, C end);

  /**
   * Returns the minimum value of type {@code C}, if it has one. The minimum value is the unique

        return map;
    }

    // ===================================================================================
    //                                                                        Small Helper
    //                                                                        ============
    //                                                                              JSP

        @DisplayName("Should handle insufficient buffer length")
        void testInsufficientBufferLength() {
            FileFsSizeInformation info = new FileFsSizeInformation();
            byte[] buffer = new byte[10]; // Too small

            // Should throw ArrayIndexOutOfBoundsException for insufficient buffer
            assertThrows(ArrayIndexOutOfBoundsException.class, () -> {
                info.decode(buffer, 0, buffer.length);

        return map;
    }

    // ===================================================================================
    //                                                                        Small Helper
    //                                                                        ============
    //                                                                              JSP

            byte[] smallBuffer = new byte[10];
            assertThrows(ArrayIndexOutOfBoundsException.class, () -> testRequest.encode(smallBuffer, 5),
                    "Should throw exception when buffer is too small");
        }

        @Test
        @DisplayName("Should handle zero-length name")
        void testZeroLengthName() {