pkg syscall (openbsd-386), const SIOCBRDGDADDR = 2150132039
pkg syscall (openbsd-386), const SIOCBRDGGPARAM = 3224922456
pkg syscall (openbsd-386), const SIOCBRDGSADDR = 3223873860
pkg syscall (openbsd-386), const SYS_CLOCK_GETRES = 234
pkg syscall (openbsd-386), const SYS_CLOCK_GETTIME = 232
pkg syscall (openbsd-386), const SYS_CLOCK_SETTIME = 233
pkg syscall (openbsd-386), const SYS_FHSTATFS = 309
pkg syscall (openbsd-386), const SYS_FSTAT = 292

            byte[] payload = response.getRawPayload();
            assertNotNull(payload);
            assertEquals(3, payload.length);
            assertArrayEquals(new byte[] { 2, 3, 4 }, payload);
            assertTrue(response.isReceived());
            assertFalse(response.isAsyncHandled());
        }

        @Test
        @DisplayName("Should handle response without retained payload")

	_ = x[ErrIncorrectContinuationToken-229]
	_ = x[ErrEmptyRequestBody-230]
	_ = x[ErrUnsupportedFunction-231]
	_ = x[ErrInvalidExpressionType-232]
	_ = x[ErrBusy-233]
	_ = x[ErrUnauthorizedAccess-234]
	_ = x[ErrExpressionTooLong-235]
	_ = x[ErrIllegalSQLFunctionArgument-236]
	_ = x[ErrInvalidKeyPath-237]
	_ = x[ErrInvalidCompressionFormat-238]
	_ = x[ErrInvalidFileHeaderInfo-239]
	_ = x[ErrInvalidJSONType-240]

    try {
      list.add("5");
      fail("transformed list is addable");
    } catch (UnsupportedOperationException expected) {
    }
    list.remove(0);
    assertEquals(asList("2", "3", "4"), list);
    list.remove("3");
    assertEquals(asList("2", "4"), list);
    try {
      list.set(0, "5");
      fail("transformed list is setable");
    } catch (UnsupportedOperationException expected) {

   * field name.
   *
   * @since 23.4
   */
  public static final String REFERRER_POLICY = "Referrer-Policy";

  /**
   * Values for the <a href="https://www.w3.org/TR/referrer-policy/">{@code Referrer-Policy}</a>
   * header.
   *
   * @since 23.4
   */
  public static final class ReferrerPolicyValues {
    private ReferrerPolicyValues() {}

    checkNonNegative("n", n);
    return (n < factorials.length) ? factorials[n] : Long.MAX_VALUE;
  }

  static final long[] factorials = {
    1L,
    1L,
    1L * 2,
    1L * 2 * 3,
    1L * 2 * 3 * 4,
    1L * 2 * 3 * 4 * 5,
    1L * 2 * 3 * 4 * 5 * 6,
    1L * 2 * 3 * 4 * 5 * 6 * 7,
    1L * 2 * 3 * 4 * 5 * 6 * 7 * 8,
    1L * 2 * 3 * 4 * 5 * 6 * 7 * 8 * 9,
    1L * 2 * 3 * 4 * 5 * 6 * 7 * 8 * 9 * 10,