void advanceFetchMoreThrows() throws Exception {
        // Arrange
        stubAcquireReturnsSelf();
        // No results in current page, not done, and fetchMore will throw
        FileEntry initial = entry("one");
        TestIterator it =
                TestIterator.create(tree, parent, "*", null, 0, initial, List.of(new FileEntry[][] { new FileEntry[0] })).throwOnFetch();

        @DisplayName("Should handle negative values as unsigned")
        void testReadBytesWireFormatNegativeAsUnsigned() {
            // Given
            byte[] buffer = new byte[10];
            // Write -1 which will be read as 65535 unsigned
            buffer[0] = (byte) 0xFF;
            buffer[1] = (byte) 0xFF;

            // When & Then
            SMBProtocolDecodingException exception =

 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *

// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

    assertThat(e).hasMessageThat().contains(ERROR_SELF_LOOP);
  }

  /**
   * This test checks an implementation dependent feature. It tests that the method {@code addEdge}
   * will silently add the missing nodes to the graph, then add the edge connecting them. We are not
   * using the proxy methods here as we want to test {@code addEdge} when the end-points are not
   * elements of the graph.
   */

    assertThat(e).hasMessageThat().contains(ERROR_SELF_LOOP);
  }

  /**
   * This test checks an implementation dependent feature. It tests that the method {@code addEdge}
   * will silently add the missing nodes to the graph, then add the edge connecting them. We are not
   * using the proxy methods here as we want to test {@code addEdge} when the end-points are not
   * elements of the graph.
   */

	if err != nil {
		t.Errorf("failed to find value, got err: %v", err)
	}
	AssertEqual(t, find1, value1)

	var find2 Value
	// Joins will automatically add Nested queries.
	err = DB.Joins("Nested.Join").Preload("Nested.Preloads").First(&find2, value2.ID).Error
	if err != nil {
		t.Errorf("failed to find value, got err: %v", err)
	}

        return true;
    }

    /**
     * Converts an array to an object array ({@literal Object[]}).
     * <p>
     * The source array can be a primitive array. In that case, the resulting array will contain the corresponding wrapper types.
     * </p>
     *
     * @param array
     *            the array
     * @return the object array
     */

// Negative test cases for errors generated earlier in the assembler's preprocess stage
// should be added to riscv64error.s.  If they are added to this file, they will prevent
// the validate function from being run and TestRISCVValidation will report missing
// errors.

TEXT validation(SB),$0
	SRLI	$1, X5, F1			// ERROR "expected integer register in rd position but got non-integer register F1"

            Object[] args = inv.getArguments();
            String server = (String) args[0];
            CIFSContext c = (CIFSContext) args[1];
            assertNull(server); // We will pass null; method should forward it unchanged
            assertSame(ctx, c);
            SID[] toResolve = (SID[]) args[2];
            for (int i = 0; i < toResolve.length; i++) {