assertNotEquals(a, c);

        // Same subject instance -> equal
        Subject shared = new Subject();
        Kerb5Authenticator d1 = new Kerb5Authenticator(shared);
        Kerb5Authenticator d2 = new Kerb5Authenticator(shared);
        assertEquals(d1, d2);

        // Different type -> false
        assertFalse(a.equals("not-an-auth"));
    }

    @Test

                kind = annotation.getMemberValue("k")?.intValue ?: 1,
                metadataVersion = annotation.getMemberValue("mv")?.intArrayValue ?: IntArray(0),
                data1 = annotation.getMemberValue("d1")?.stringArrayValue ?: arrayOf(),
                data2 = annotation.getMemberValue("d2")?.stringArrayValue ?: arrayOf(),
                extraString = annotation.getMemberValue("xs")?.stringValue ?: "",

        ArtifactSpec d1 = c.addDependency("d", "1.0");
        ArtifactSpec b2 = c.addDependency("b", "2.0");
        ArtifactSpec e = b2.addDependency("e", "1.0");
        ArtifactSpec g = d1.addDependency("g", "1.0");

        ArtifactResolutionResult res = collect(createSet(new Object[] {a.artifact}));
        Object[] artifacts = new Object[] {a.artifact, c.artifact, d1.artifact, b2.artifact, e.artifact, g.artifact};

		curQ = 1
	case "H4":
		curSize = 1
		curQ = 0
	case "H8":
		curSize = 1
		curQ = 1
	case "S2":
		curSize = 2
		curQ = 0
	case "S4":
		curSize = 2
		curQ = 1
	case "D1":
		curSize = 3
		curQ = 0
	case "D2":
		curSize = 3
		curQ = 1
	default:
		return 0, errors.New("invalid arrangement in ARM64 register list")
	}

$round_consts<>(SB), R1 MOVD $24, R2 // counter for loop VLD1.P 16(R0), [V0.D1, V1.D1] VLD1.P 16(R0), [V2.D1, V3.D1] VLD1.P 16(R0), [V4.D1, V5.D1] VLD1.P 16(R0), [V6.D1, V7.D1] VLD1.P 16(R0), [V8.D1, V9.D1] VLD1.P 16(R0), [V10.D1, V11.D1] VLD1.P 16(R0), [V12.D1, V13.D1] VLD1.P 16(R0), [V14.D1, V15.D1] VLD1.P 16(R0), [V16.D1, V17.D1] VLD1.P 16(R0), [V18.D1, V19.D1] VLD1.P 16(R0), [V20.D1, V21.D1] VLD1.P 16(R0), [V22.D1, V23.D1] VLD1 (R0), [V24.D1] SUB $192, R0, R0 loop: // theta VEOR3 V20.B16, V15.B16, V10.B16,...

p256<>+0x18(SB)/8, $0xffffffffffffffff // P256 DATA p256<>+0x20(SB)/8, $0x0c0d0e0f1c1d1e1f // SEL d1 d0 d1 d0 DATA p256<>+0x28(SB)/8, $0x0c0d0e0f1c1d1e1f // SEL d1 d0 d1 d0 DATA p256<>+0x30(SB)/8, $0x0000000010111213 // SEL 0 d1 d0 0 DATA p256<>+0x38(SB)/8, $0x1415161700000000 // SEL 0 d1 d0 0 DATA p256<>+0x40(SB)/8, $0x18191a1b1c1d1e1f // SEL d1 d0 d1 d0 DATA p256<>+0x48(SB)/8, $0x18191a1b1c1d1e1f // SEL d1 d0 d1 d0 DATA p256mul<>+0x00(SB)/8, $0x00000000ffffffff // P256 original DATA p256mul<>+0x08(SB)/8,...

00000d0 3d f8 a7 60 24 61 c5 ef ae 9e c8 6c 6d 4e 69 c8
00000e0 67 65 34 f8 37 76 2d 76 5c 54 f3 95 65 49 c7 0f
00000f0 18 71 4b 7e 5b 6a d1 79 47 61 41 b0 4e 2a 74 45
0000100 43 58 12 b2 5a a5 c6 7d 68 55 88 d4 98 75 18 6d
0000110 08 d1 1f 8f 5a 9e 96 ee 45 cf a4 84 4e 4b e8 50
0000120 a7 13 d9 06 de 52 81 97 36 b2 d7 b8 fc 2b 5f 55
0000130 23 1f 32 59 cf 30 27 fb e2 8a b9 de 45 dd 63 9c

				Algorithm:  HighwayHash256S,
				Hash:       nil,
			}},
		},
		MarkDeleted:      false,
		Data:             data,
		NumVersions:      1,
		SuccessorModTime: time.Time{},
	}

	d0, d1, d2 := mustGetUUID(), mustGetUUID(), mustGetUUID()
	testCases := []struct {
		versionID        string
		dataDir          string
		data             []byte
		shares           int
		transitionStatus string

	SHA512SU0	V9.D2, V8.D2            // 2881c0ce
	SHA512SU1	V7.D2, V6.D2, V5.D2     // c58867ce
	VRAX1	V26.D2, V29.D2, V30.D2          // be8f7ace
	VXAR	$63, V27.D2, V21.D2, V26.D2     // bafe9bce
	VPMULL	V2.D1, V1.D1, V3.Q1             // 23e0e20e
	VPMULL2	V2.D2, V1.D2, V4.Q1             // 24e0e24e
	VPMULL	V2.B8, V1.B8, V3.H8             // 23e0220e
	VPMULL2	V2.B16, V1.B16, V4.H8           // 24e0224e

	c.RLock()
	defer c.RUnlock()
	if !c.enabled {
		return nil
	}
	numSites := len(c.state.Peers)
	mostRecent := func(d1, d2 time.Time) time.Time {
		if d1.IsZero() {
			return d2
		}
		if d2.IsZero() {
			return d1
		}
		if d1.After(d2) {
			return d1
		}
		return d2
	}

	var (
		latestID   string
		lastUpdate time.Time
		withB      []string