import org.jspecify.annotations.Nullable;

/**
 * Fixed-size {@link Table} implementation backed by a two-dimensional array.
 *
 * <p><b>Warning:</b> {@code ArrayTable} is rarely the {@link Table} implementation you want. First,
 * it requires that the complete universe of rows and columns be specified at construction time.
 * Second, it is always backed by an array large enough to hold a value for every possible

For asking questions, see:

* [The golang-nuts mailing list](https://groups.google.com/d/forum/golang-nuts)

* [The Go Forum](https://forum.golangbridge.org/), a web-based forum

* [Gophers Slack](https://gophers.slack.com), use the [invite app](https://invite.slack.golangbridge.org/) for access

* [Stack Overflow](https://stackoverflow.com/questions/tagged/go) with questions tagged "go"

    }
    return new String(dest, 0, destIndex);
  }

  /**
   * Helper method to grow the character buffer as needed, this only happens once in a while so it's
   * ok if it's in a method call. If the index passed in is 0 then no copying will be done.
   */
  private static char[] growBuffer(char[] dest, int index, int size) {
    if (size < 0) { // overflow - should be OutOfMemoryError but GWT/j2cl don't support it

    this.testsEquals = true;
    return this;
  }

  /**
   * Tests that the forwarding wrapper returned by {@code wrapperFunction} properly forwards method
   * calls with parameters passed as is, return value returned as is, and exceptions propagated as
   * is.
   */
  public <T> void testForwarding(
      Class<T> interfaceType, Function<? super T, ? extends T> wrapperFunction) {

// to the default size.
// Calling b.Reset(b) (that is, resetting a [Reader] to itself) does nothing.
func (b *Reader) Reset(r io.Reader) {
	// If a Reader r is passed to NewReader, NewReader will return r.
	// Different layers of code may do that, and then later pass r
	// to Reset. Avoid infinite recursion in that case.
	if b == r {
		return
	}
	if b.buf == nil {

   * behave identically except when passed {@code Long.MIN_VALUE}. Those methods are:
   *
   * <ul>
   *   <li>{@link Math#abs(long)}, which returns {@code Long.MIN_VALUE} when passed {@code
   *       Long.MIN_VALUE}
   *   <li>{@link Math#absExact(long)}, which throws {@link ArithmeticException} when passed {@code
   *       Long.MIN_VALUE}

		closeBitrotReaders(bitrotReaders)
		if err != nil && !test.shouldFail {
			t.Errorf("Test %d: should pass but failed with: %v", i, err)
		}
		if err == nil && test.shouldFail {
			t.Errorf("Test %d: should fail but it passed", i)
		}
		if err == nil {
			if content := writer.Bytes(); !bytes.Equal(content, data[test.offset:test.offset+test.length]) {
				t.Errorf("Test %d: read returns wrong file content.", i)
			}
		}

    /** More processing is required to complete this request */
    int NT_STATUS_MORE_PROCESSING_REQUIRED = 0xC0000016;
    /** Access is denied */
    int NT_STATUS_ACCESS_DENIED = 0xC0000022;
    /** The data area passed to a system call is too small */
    int NT_STATUS_BUFFER_TOO_SMALL = 0xC0000023;
    /** The object name is invalid */
    int NT_STATUS_OBJECT_NAME_INVALID = 0xC0000033;
    /** The object was not found */

            verify(mockReferralData, times(1)).getDomain();

            // Test with concrete implementation
            String concreteDomain = concreteImplementation.getDomain();
            // Should be DOMAIN based on our initialization
            assertEquals("DOMAIN", concreteDomain);
        }

        @Test
        @DisplayName("Should get link")
        void testGetLink() {

        protected long count;

        /**
         * Maximum number of files to purge in a single operation.
         */
        protected final int maxPurgeSize;

        /**
         * List of files marked for deletion.
         */
        protected final List<Path> deletedFileList = new ArrayList<>();

        /**
         * Base path for thumbnail storage.
         */
        protected final Path basePath;