// Verify supported bdnz/bdz encodings.
	BC 16,0,0(PC)                   // BC $16, CR0LT, 0(PC) // 42000000
	BDNZ 0(PC)                      // 42000000
	BDZ 0(PC)                       // 42400000
	BC 18,0,0(PC)                   // BC $18, CR0LT, 0(PC) // 42400000

	// Verify the supported forms of bcclr[l]
	BC $20,CR0LT,$1,LR              // 4e800820

    assertEquals(5, computeArrayListCapacity(0));
    assertEquals(13, computeArrayListCapacity(8));
    assertEquals(89, computeArrayListCapacity(77));
    assertEquals(22000005, computeArrayListCapacity(20000000));
    assertEquals(Integer.MAX_VALUE, computeArrayListCapacity(Integer.MAX_VALUE - 1000));
  }

  public void testNewArrayListFromCollection() {

    assertEquals(5, computeArrayListCapacity(0));
    assertEquals(13, computeArrayListCapacity(8));
    assertEquals(89, computeArrayListCapacity(77));
    assertEquals(22000005, computeArrayListCapacity(20000000));
    assertEquals(Integer.MAX_VALUE, computeArrayListCapacity(Integer.MAX_VALUE - 1000));
  }

  public void testNewArrayListFromCollection() {

	CMPGTF	F4, F5, FCC1 		// a190110c
	CMPGTD	F4, F5, FCC2 		// a290210c
	CMPGEF	F4, F5, FCC3		// a390130c
	CMPGED	F4, F5, FCC4		// a490230c
	CMPEQD	F4, F5, FCC5		// a510220c

	RDTIMELW R4, R0			// 80600000
	RDTIMEHW R4, R0			// 80640000
	RDTIMED  R4, R5			// 85680000

	MOVV	R4, FCSR3		// 83c01401
	MOVV	FCSR3, R4		// 64c81401
	MOVV	F4, FCC0		// 80d01401
	MOVV	FCC0, F4		// 04d41401

  public void testBuildKeepingLast_bigTable() {
    Builder<Integer, String> builder = ImmutableMap.builder();
    Map<Integer, String> expected = new LinkedHashMap<>();
    for (int i = 0; i < 200_000; i++) {
      // Truncate to even key, so we have put(0, "0") then put(0, "1"). Half the entries are
      // duplicates.
      Integer key = i & ~1;
      String value = String.valueOf(i);
      builder.put(key, value);

  public void testBuildKeepingLast_bigTable() {
    Builder<Integer, String> builder = ImmutableMap.builder();
    Map<Integer, String> expected = new LinkedHashMap<>();
    for (int i = 0; i < 200_000; i++) {
      // Truncate to even key, so we have put(0, "0") then put(0, "1"). Half the entries are
      // duplicates.
      Integer key = i & ~1;
      String value = String.valueOf(i);
      builder.put(key, value);