// unary instructions
//
//	LADDW rreg ',' sreg ',' rreg
//	{
//		outcode(int($1), &$2, int($4), &$6);
//	}
	ADD	R5, R9, R10	// 01255020
	ADDU	R13, R14, R19	// 01cd9821
	ADDV	R5, R9, R10	// 0125502c
	ADDVU	R13, R14, R19	// 01cd982d

//	LADDW imm ',' sreg ',' rreg
//	{
//		outcode(int($1), &$2, int($4), &$6);
//	}
	ADD	$15176, R14, R9	// 21c93b48
	ADD	$-9, R5, R8	// 20a8fff7
	ADDU	$10, R9, R9	// 2529000a

	// logical instructions
	// shift instructions
	// unary instructions
	//
	//	LADDW rreg ',' sreg ',' rreg
	//	{
	//		outcode(int($1), &$2, int($4), &$6);
	//	}
	ADD	R1, R2, R3

	//	LADDW imm ',' sreg ',' rreg
	//	{
	//		outcode(int($1), &$2, int($4), &$6);
	//	}
	ADD	$1, R2, R3

	//	LADDW rreg ',' rreg
	//	{
	//		outcode(int($1), &$2, 0, &$4);
	//	}
	ADD	R1, R2

    assertEquals(Range.closedOpen(4, 4), range.intersection(Range.closedOpen(2, 4)));

    // overlap below
    assertEquals(Range.closed(4, 6), range.intersection(Range.closed(2, 6)));

    // enclosed with same start
    assertEquals(Range.closed(4, 6), range.intersection(Range.closed(4, 6)));

    // enclosed, interior
    assertEquals(Range.closed(5, 7), range.intersection(Range.closed(5, 7)));

    // enclosed with same end

        .inOrder();
  }

  public void testMergesConnectedDisjoint() {
    TreeRangeSet<Integer> rangeSet = TreeRangeSet.create();
    rangeSet.add(Range.closed(1, 4));
    rangeSet.add(Range.open(4, 6));
    testInvariants(rangeSet);
    assertThat(rangeSet.asRanges()).contains(Range.closedOpen(1, 6));
    assertThat(rangeSet.complement().asRanges())
        .containsExactly(Range.lessThan(1), Range.atLeast(6))

	_ = x[HandlerMakeBucket-40]
	_ = x[HandlerHeadBucket-41]
	_ = x[HandlerDeleteBucket-42]
	_ = x[HandlerGetMetrics-43]
	_ = x[HandlerGetResourceMetrics-44]
	_ = x[HandlerGetMemInfo-45]
	_ = x[HandlerGetProcInfo-46]
	_ = x[HandlerGetOSInfo-47]
	_ = x[HandlerGetPartitions-48]
	_ = x[HandlerGetNetInfo-49]
	_ = x[HandlerGetCPUs-50]
	_ = x[HandlerServerInfo-51]
	_ = x[HandlerGetSysConfig-52]
	_ = x[HandlerGetSysServices-53]

    assertEquals(Range.closedOpen(4, 4), range.intersection(Range.closedOpen(2, 4)));

    // overlap below
    assertEquals(Range.closed(4, 6), range.intersection(Range.closed(2, 6)));

    // enclosed with same start
    assertEquals(Range.closed(4, 6), range.intersection(Range.closed(4, 6)));

    // enclosed, interior
    assertEquals(Range.closed(5, 7), range.intersection(Range.closed(5, 7)));

    // enclosed with same end

  - [Downloads for v1.4.7](#downloads-for-v147)
    - [Client Binaries](#client-binaries-3)
    - [Server Binaries](#server-binaries-3)
  - [Changelog since v1.4.6](#changelog-since-v146)
    - [Other notable changes](#other-notable-changes-3)
- [v1.4.6](#v146)
  - [Downloads for v1.4.6](#downloads-for-v146)
    - [Client Binaries](#client-binaries-4)
    - [Server Binaries](#server-binaries-4)
  - [Changelog since v1.4.5](#changelog-since-v145)

        assertTrue(bytesWritten > 0);

        // Verify name length field at offset 46 (after 44 bytes of fixed fields + 2 for name offset)
        byte[] nameBytes = longPath.getBytes(StandardCharsets.UTF_16LE);
        int nameLenInBuffer = (buffer[46] & 0xFF) | ((buffer[47] & 0xFF) << 8);
        assertEquals(nameBytes.length, nameLenInBuffer);
    }

    @Test

 * direct translation of the pseudocode presented there.
 *
 * Partner this class with [UTS #46] to implement IDNA2008 [RFC 5890] like most browsers do.
 *
 * [RFC 3492]: https://datatracker.ietf.org/doc/html/rfc3492
 * [RFC 5890]: https://datatracker.ietf.org/doc/html/rfc5890
 * [UTS #46]: https://www.unicode.org/reports/tr46/
 */
object Punycode {
  val PREFIX_STRING = "xn--"

            (byte) 26, (byte) 18, (byte) 10, (byte) 2, (byte) 59, (byte) 51, (byte) 43, (byte) 35, (byte) 62, (byte) 54, (byte) 46,
            (byte) 38, (byte) 30, (byte) 22, (byte) 14, (byte) 6, (byte) 61, (byte) 53, (byte) 45, (byte) 37, (byte) 29, (byte) 21,