func SplitAfterSeq(s, sep []byte) iter.Seq[[]byte] {
	return splitSeq(s, sep, len(sep))
}

// FieldsSeq returns an iterator over subslices of s split around runs of
// whitespace characters, as defined by [unicode.IsSpace].
// The iterator yields the same subslices that would be returned by [Fields](s),
// but without constructing a new slice containing the subslices.
func FieldsSeq(s []byte) iter.Seq[[]byte] {

}

func getHexSequences(start int, number int, paddinglen int) (seq []string) {
	for i := start; i <= number; i++ {
		if paddinglen == 0 {
			seq = append(seq, fmt.Sprintf("%x", i))
		} else {
			seq = append(seq, fmt.Sprintf(fmt.Sprintf("%%0%dx", paddinglen), i))
		}
	}
	return seq
}

func getSequences(start int, number int, paddinglen int) (seq []string) {
	for i := start; i <= number; i++ {

		}
	}

	ahs.Lock()
	defer ahs.Unlock()

	// Check if new heal sequence to be started overlaps with any
	// existing, running sequence
	hpath := pathJoin(h.bucket, h.object)
	for k, hSeq := range ahs.healSeqMap {
		if !hSeq.hasEnded() && (HasPrefix(k, hpath) || HasPrefix(hpath, k)) {
			errMsg = "The provided heal sequence path overlaps with an existing " +
				fmt.Sprintf("heal path: %s", k)

        if (expectSeq != seq) {
            throw new CIFSException(String.format("Invalid MIC sequence, expect %d have %d", expectSeq, seq));
        }

        final byte[] verify = new byte[8];
        System.arraycopy(mic, 4, verify, 0, 8);
        if (!MessageDigest.isEqual(trunc, verify)) {
            if (log.isDebugEnabled()) {

	for _, ss := range setCounts {
		var symmetry bool
		for _, argPattern := range argPatterns {
			for _, p := range argPattern {
				if uint64(len(p.Seq)) > ss {
					symmetry = uint64(len(p.Seq))%ss == 0
				} else {
					symmetry = ss%uint64(len(p.Seq)) == 0
				}
			}
		}
		// With no arg patterns, it is expected that user knows
		// the right symmetry, so either ellipses patterns are

        MockRegistration registration = registrations.get(registrationId);
        if (registration != null) {
            log.debug("Mock processed heartbeat for: {} seq: {}", registrationId, sequenceNumber);
            return true;
        }
        return false;
    }

		metrics = append(metrics, getHealedItems(bgSeq)...)
		metrics = append(metrics, getFailedItems(bgSeq)...)
		return
	})
	return mg
}

func getFailedItems(seq *healSequence) (m []MetricV2) {
	items := seq.getHealFailedItemsMap()
	m = make([]MetricV2, 0, len(items))
	for k, v := range items {
		m = append(m, MetricV2{
			Description:    getHealObjectsFailTotalMD(),

	XVMOVQ		(R4), X2.W8	// 82002032
	XVMOVQ		8(R4), X2.W8	// 82082032
	XVMOVQ		-20(R4), X2.W8	// 82ec2f32
	XVMOVQ		(R4), X3.V4	// 83001032
	XVMOVQ		24(R4), X3.V4	// 830c1032
	XVMOVQ		-24(R4), X3.V4	// 83f41732

	// VSEQ{B,H,W,V}, XVSEQ{B,H,W,V} instruction
	VSEQB		V1, V2, V3      // 43040070
	VSEQH		V1, V2, V3      // 43840070
	VSEQW		V1, V2, V3      // 43040170
	VSEQV		V1, V2, V3      // 43840170
	XVSEQB		X3, X2, X4      // 440c0074

    *   Update metric name to always reflect what the user has given in compile.
        Affects following cases
    *   When name is given as 'accuracy'/'crossentropy'
    *   When an aliased function name is used eg. 'mse'
    *   Removing the `weighted` prefix from weighted metric names.
    *   Allow non-Tensors through v2 losses.
    *   Add v2 sparse categorical crossentropy metric.