Method evalStrata

engine/naivebottomup.go:59–88

()

}

func (e naiveEngine) evalStrata() {
	for _, fact := range e.programInfo.InitialFacts {
		f, _ := functional.EvalAtom(fact, nil)
		e.store.Add(f)
	}
	for i := 0; i < len(e.strata); i++ {
		stratumEdbPredicates := make(map[ast.PredicateSym]struct{})
		stratumIdbPredicates := make(map[ast.PredicateSym]struct{})
		for sym, stratum := range e.predToStratum {
			if stratum < i {
				stratumEdbPredicates[sym] = struct{}{}
			} else if stratum == i {
				stratumIdbPredicates[sym] = struct{}{}
			}
		}
		var stratumRules []ast.Clause
		stratumDecls := make(map[ast.PredicateSym]*ast.Decl)
		for _, clause := range e.programInfo.Rules {
			sym := clause.Head.Predicate
			if _, ok := stratumIdbPredicates[sym]; ok {
				stratumRules = append(stratumRules, clause)
				stratumDecls[sym] = e.programInfo.Decls[sym]
			}
		}
		naiveEngine{
			store:       e.store,
			programInfo: analysis.ProgramInfo{stratumEdbPredicates, stratumIdbPredicates, nil, nil, stratumRules, stratumDecls, nil},
		}.eval()
	}
}

// This is very inefficient because it generates the same facts over and over again.
func (e naiveEngine) eval() {