Method Add

factstore/temporal.go:124–163

Add adds a temporal fact to the store. Returns (true, nil) if added, (false, nil) if duplicate, (false, error) if limit exceeded.

(atom ast.Atom, interval ast.Interval)

// Add adds a temporal fact to the store.
// Returns (true, nil) if added, (false, nil) if duplicate, (false, error) if limit exceeded.
func (s *TemporalStore) Add(atom ast.Atom, interval ast.Interval) (bool, error) {
	// Guard: Ensure interval is valid
	if interval.Start.Type == ast.TimestampBound && interval.End.Type == ast.TimestampBound {
		if interval.Start.Timestamp > interval.End.Timestamp {
			return false, fmt.Errorf("invalid temporal interval: start %v > end %v", interval.Start, interval.End)
		}
	}

	hash := atom.Hash()

	// Store the atom
	s.atoms[hash] = atom

	// Get or create the predicate map
	predMap, ok := s.facts[atom.Predicate]
	if !ok {
		predMap = make(map[uint64]*IntervalTree)
		s.facts[atom.Predicate] = predMap
	}

	// Get or create the interval tree
	tree, ok := predMap[hash]
	if !ok {
		tree = NewIntervalTree()
		predMap[hash] = tree
	}

	// Check interval limit before inserting (negative limit means no limit)
	if s.maxIntervalsPerAtom > 0 && tree.Size() >= s.maxIntervalsPerAtom {
		return false, fmt.Errorf("%w: maximum %d intervals per atom", ErrIntervalLimitExceeded, s.maxIntervalsPerAtom)
	}

	// Insert returns false if duplicate
	if !tree.Insert(interval) {
		return false, nil
	}

	s.count++
	return true, nil
}

// AddEternal adds a fact valid for all time.
func (s *TemporalStore) AddEternal(atom ast.Atom) (bool, error) {