Function TestIntervalTree_Rebuild

factstore/interval_tree_test.go:198–237

(t *testing.T)

}

func TestIntervalTree_Rebuild(t *testing.T) {
	tree := NewIntervalTree()

	// Initial intervals
	tree.Insert(makeTestInterval(100, 200))
	tree.Insert(makeTestInterval(50, 75))

	// Rebuild with different intervals
	newIntervals := []ast.Interval{
		makeTestInterval(300, 400),
		makeTestInterval(500, 600),
		makeTestInterval(700, 800),
	}

	tree.Rebuild(newIntervals)

	if tree.Size() != 3 {
		t.Errorf("Expected size 3 after rebuild, got %d", tree.Size())
	}

	// Old intervals should be gone
	count := 0
	tree.QueryPoint(100, func(interval ast.Interval) error {
		count++
		return nil
	})
	if count != 0 {
		t.Error("Old interval should not be found after rebuild")
	}

	// New intervals should be present
	count = 0
	tree.QueryPoint(350, func(interval ast.Interval) error {
		count++
		return nil
	})
	if count != 1 {
		t.Error("New interval should be found after rebuild")
	}
}

func TestIntervalTree_EternalInterval(t *testing.T) {
	tree := NewIntervalTree()