Function TestLineageGraph_GetDerivedMemories

pkg/memory/lineage_test.go:30–107

(t *testing.T)

}

func TestLineageGraph_GetDerivedMemories(t *testing.T) {
	lg := NewLineageGraph()

	// Create a lineage tree:
	// mem-1
	//  ├─ mem-2
	//  └─ mem-3
	//      └─ mem-4

	lg.TrackMemory("mem-1", &LineageMetadata{
		ID:             "mem-1",
		SourceIDs:      []string{"session-1"},
		DerivedFromIDs: []string{},
		CreatedAt:      time.Now().Unix(),
	})

	lg.TrackMemory("mem-2", &LineageMetadata{
		ID:             "mem-2",
		SourceIDs:      []string{"session-1"},
		DerivedFromIDs: []string{"mem-1"},
		CreatedAt:      time.Now().Unix(),
	})

	lg.TrackMemory("mem-3", &LineageMetadata{
		ID:             "mem-3",
		SourceIDs:      []string{"session-1"},
		DerivedFromIDs: []string{"mem-1"},
		CreatedAt:      time.Now().Unix(),
	})

	lg.TrackMemory("mem-4", &LineageMetadata{
		ID:             "mem-4",
		SourceIDs:      []string{"session-1"},
		DerivedFromIDs: []string{"mem-3"},
		CreatedAt:      time.Now().Unix(),
	})

	// Get all derived from mem-1
	derived := lg.GetDerivedMemories("mem-1")

	// Should include mem-2, mem-3, mem-4
	if len(derived) != 3 {
		t.Fatalf("GetDerivedMemories() returned %d memories, want 3", len(derived))
	}

	// Check all expected IDs are present
	expectedIDs := map[string]bool{
		"mem-2": false,
		"mem-3": false,
		"mem-4": false,
	}

	for _, id := range derived {
		if _, exists := expectedIDs[id]; exists {
			expectedIDs[id] = true
		} else {
			t.Errorf("Unexpected derived memory: %v", id)
		}