Method queryRange

factstore/interval_tree.go:163–197

queryRange recursively queries for overlapping intervals. Two intervals [s1, e1] and [s2, e2] overlap if s1 <= e2 AND s2 <= e1.

(node *treeNode, start, end int64, fn func(ast.Interval) error)

// queryRange recursively queries for overlapping intervals.
// Two intervals [s1, e1] and [s2, e2] overlap if s1 <= e2 AND s2 <= e1.
func (t *IntervalTree) queryRange(node *treeNode, start, end int64, fn func(ast.Interval) error) error {
	if node == nil {
		return nil
	}

	// If max end in this subtree is less than query start, no overlap possible
	if node.maxEnd < start {
		return nil
	}

	// Check left subtree
	if err := t.queryRange(node.left, start, end, fn); err != nil {
		return err
	}

	// Check current node for overlap
	nodeStart := GetStartTime(node.interval)
	nodeEnd := GetEndTime(node.interval)

	// Overlap condition: nodeStart <= end AND start <= nodeEnd
	if nodeStart <= end && start <= nodeEnd {
		if err := fn(node.interval); err != nil {
			return err
		}
	}

	// Check right subtree only if possible overlap exists
	if nodeStart <= end {
		if err := t.queryRange(node.right, start, end, fn); err != nil {
			return err
		}
	}

	return nil
}

// All calls fn for every interval in the tree (in-order traversal).
func (t *IntervalTree) All(fn func(ast.Interval) error) error {