Method eval

engine/seminaivebottomup.go:494–624

()

}

func (e *engine) eval() error {
	predicateAllowList := *e.options.predicateAllowList
	// First round.
	for _, clause := range e.programInfo.Rules {
		if !predicateAllowList(clause.Head.Predicate) {
			continue
		}
		if clause.Transform != nil && !clause.Transform.IsLetTransform() {
			// clauses with do-transforms assume a single subgoal as body.
			continue
		}
		derivedFacts, err := e.oneStepEvalClause(clause)
		if err != nil {
			return err
		}
		for _, tf := range derivedFacts {
			// Add to temporal store if interval is present
			if tf.Interval != nil && e.temporalStore != nil {
				if _, err := e.temporalStore.Add(tf.Atom, *tf.Interval); err != nil {
					return err
				}
				if e.temporalDeltaStore != nil {
					if _, err := e.temporalDeltaStore.Add(tf.Atom, *tf.Interval); err != nil {
						return err
					}
				}
			} else {
				// Add to delta store (for incremental evaluation)
				e.deltaStore.Add(tf.Atom)
			}
		}
	}
	if e.deltaStore.EstimateFactCount() > 0 || (e.temporalDeltaStore != nil && e.temporalDeltaStore.EstimateFactCount() > 0) {
		// Incremental rounds.
		deltaRules := makeDeltaRules(e.programInfo.Decls, e.predToRules)
		if err := e.mergeDelta(); err != nil {
			return err
		}
		for {
			newDeltaStore := factstore.NewMultiIndexedArrayInMemoryStore()
			var newTemporalDeltaStore factstore.TemporalFactStore
			if e.temporalStore != nil {
				newTemporalDeltaStore = factstore.NewTemporalStore()
			}
			var incrementalFactAdded bool
			for _, predDeltaRule := range deltaRules {
				for _, deltaRule := range predDeltaRule {
					if !predicateAllowList(deltaRule.Head.Predicate) {
						continue
					}
					derivedFacts, err := e.oneStepEvalClause(deltaRule)
					if err != nil {
						return err
					}
					for _, tf := range derivedFacts {
						if tf.Interval != nil && e.temporalStore != nil {
							added, err := e.temporalStore.Add(tf.Atom, *tf.Interval)
							if err != nil {