Method queryPoint

factstore/interval_tree.go:122–154

queryPoint recursively queries for intervals containing a point.

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

// queryPoint recursively queries for intervals containing a point.
func (t *IntervalTree) queryPoint(node *treeNode, timestamp int64, fn func(ast.Interval) error) error {
	if node == nil {
		return nil
	}

	// If max end in this subtree is less than timestamp, no intervals here contain it
	if node.maxEnd < timestamp {
		return nil
	}

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

	// Check current node
	if containsTimestamp(node.interval, timestamp) {
		if err := fn(node.interval); err != nil {
			return err
		}
	}

	// Check right subtree only if its intervals could contain the timestamp
	// (start time <= timestamp is guaranteed by the query, we check end time via maxEnd)
	nodeStart := GetStartTime(node.interval)
	if timestamp >= nodeStart {
		if err := t.queryPoint(node.right, timestamp, fn); err != nil {
			return err
		}
	}

	return nil
}

// QueryRange returns all intervals overlapping with [start, end].
func (t *IntervalTree) QueryRange(start, end int64, fn func(ast.Interval) error) error {