check_linked.go

package law

type checkNode struct {
	next  *checkNode
	check checker
}

func linkCheck(checkers ...checker) *checkNode {
	// 将检测链串起来
	if len(checkers) == 0 {
		return nil
	}
	cur := &checkNode{check: checkers[0]}
	head := &checkNode{next: cur}
	for i := 1; i < len(checkers); i++ {
		cur.next = &checkNode{check: checkers[i]}
		cur = cur.next
	}
	return head.next
}

func check(cur *checkNode, list []int) (bool, int) {
	// 根据检查链进行检查
	for cur != nil {
		ok, val := cur.check(list)
		if ok {
			return ok, val
		}
		cur = cur.next
	}
	return false, 0
}

func inverseOperation(diff *changeNode, lastVal int) (ok bool, val int) {
	// 根据路径节点的类型执行对应逆操作
	val, ok = lastVal, true
	for diff != nil && diff.pre != nil {
		ok, val = invOperationFactor(diff.change_type)(val, (*diff.pre.list)[len(*diff.list)])
		if !ok {
			return
		}
		diff = diff.pre
	}
	return
}