// This appears to be an implementation inconsistency.
            context = new EncryptionNegotiateContext(mockConfig, new int[3]);
            assertEquals(4 + 6, context.size()); // 4 base + 3*2 for ciphers

            context = new EncryptionNegotiateContext(mockConfig, null);
            assertEquals(4, context.size()); // 4 base when null

            samr.SamrSamEntry entry = new samr.SamrSamEntry();
            when(mockNdrBuffer.dec_ndr_long()).thenReturn(1, 100); // idx, _name_bufferp
            when(mockNdrBuffer.dec_ndr_short()).thenReturn(4, 6); // length, maximum_length
            when(mockDeferredBuffer.dec_ndr_long()).thenReturn(3, 0, 2); // _name_buffers, 0, _name_bufferl

	}

	if bytes.Equal(buf[4:8], []byte("1   ")) {
		// Set as 1,0.
		major, minor = 1, 0
	} else {
		major, minor = binary.LittleEndian.Uint16(buf[4:6]), binary.LittleEndian.Uint16(buf[6:8])
	}
	if major > xlVersionMajor {
		return buf[8:], major, minor, fmt.Errorf("xlMeta: unknown major version %d found", major)
	}

	return buf[8:], major, minor, nil
}

            Range.singleton(1),
            Range.lessThan(2),
            Range.greaterThan(10),
            Range.atMost(4),
            Range.atLeast(3),
            Range.closed(4, 6),
            Range.closedOpen(1, 3),
            Range.openClosed(5, 7),
            Range.open(3, 4));
    subsets:
    for (Set<Range<Integer>> subset : Sets.powerSet(ranges)) {

pkg syscall (freebsd-riscv64), type RawSockaddrDatalink struct #53466
pkg syscall (freebsd-riscv64), type RawSockaddrDatalink struct, Alen uint8 #53466
pkg syscall (freebsd-riscv64), type RawSockaddrDatalink struct, Data [46]int8 #53466
pkg syscall (freebsd-riscv64), type RawSockaddrDatalink struct, Family uint8 #53466
pkg syscall (freebsd-riscv64), type RawSockaddrDatalink struct, Index uint16 #53466

    assertThrows(IllegalArgumentException.class, () -> set.subSet(3, 2));
  }

  public void testSubSet_tooLarge() {
    assertThat(ContiguousSet.create(Range.closed(1, 3), integers()).subSet(4, 6)).isEmpty();
  }

  public void testSubSet_tooSmall() {
    assertThat(ContiguousSet.create(Range.closed(1, 3), integers()).subSet(-1, 0)).isEmpty();
  }

  public void testFirst() {

   *
   * <ul>
   *   <li>{@code [2, 4)} and {@code [5, 7)} are not connected
   *   <li>{@code [2, 4)} and {@code [3, 5)} are connected, because both enclose {@code [3, 4)}
   *   <li>{@code [2, 4)} and {@code [4, 6)} are connected, because both enclose the empty range
   *       {@code [4, 4)}
   * </ul>
   *
   * <p>Note that this range and {@code other} have a well-defined {@linkplain #span union} and

   *
   * <ul>
   *   <li>{@code [2, 4)} and {@code [5, 7)} are not connected
   *   <li>{@code [2, 4)} and {@code [3, 5)} are connected, because both enclose {@code [3, 4)}
   *   <li>{@code [2, 4)} and {@code [4, 6)} are connected, because both enclose the empty range
   *       {@code [4, 4)}
   * </ul>
   *
   * <p>Note that this range and {@code other} have a well-defined {@linkplain #span union} and

//			(($11 & 15) << 0) |	/* Crm */
//			(($12 & 7) << 5) |	/* coprocessor information */
//			(1<<4));			/* must be set */
//		outcode(AMRC, Always, &nullgen, 0, &g);
//	}
	MRC.S	4, 6, R1, C2, C3, 7 // MRC $8301712627
	MCR.S	4, 6, R1, C2, C3, 7 // MRC $8300664051

//
// MULL r1,r2,(hi,lo)
//
//	LTYPEM cond reg ',' reg ',' regreg
//	{
//		outcode($1, $2, &$3, int32($5.Reg), &$7);
//	}

Ian Lance Taylor <******@****.***> 1737957178 -0800