The cross-harness, self-improving memory layer for AI agents. Join our community: https://discord.com/invite/zdNChS2fBu
Go agent-ai-cliagent-harnessesagent-securitybrowser-extensionciclaude-codecloudcodexcursordetection-engineeringjevknowledge-basememorymobile-device-managementobservabilitysecuritysecurity-information-and-event-managementsecurity-toolstelemetrytraces
package learning
import (
"path/filepath"
"slices"
"testing"
"time"
"github.com/asymptote-labs/agent-beacon/pkg/asymptoteobserve"
)
func TestLearningSearchPaginatesMatchingRows(t *testing.T) {
store := Open(filepath.Join(t.TempDir(), "memory.db"))
rows := []struct {
id, title, project, candidateState, evaluationState, kind string
}{
{"foreign", "Needle recovery", "other-project", "candidate", "completed", "workflow"},
{"wrong-state", "Needle recovery", "project", "rejected", "failed", "workflow"},
{"wrong-kind", "Needle recovery", "project", "candidate", "failed", "convention"},
{"nonmatch-a", "Ordinary task", "project", "candidate", "completed", "workflow"},
{"match-a", "Needle recovery", "project", "candidate", "completed", "workflow"},
{"nonmatch-b", "Needle without the other term", "project", "candidate", "completed", "workflow"},
{"match-b", "Older needle recovery", "project", "candidate", "completed", "workflow"},
}
for i, row := range rows {
putLearningSearchRow(t, store, row.id, row.title, row.project, row.candidateState, row.evaluationState, row.kind, len(rows)-i)
}
for _, collection := range learningSearchCollections(store) {
t.Run(collection.name, func(t *testing.T) {
for _, tc := range []struct {
name, query string
limit, page int
want []string
}{
{"first match page", "NEEDLE recovery", 1, 1, []string{"match-a"}},
{"second match page", "NEEDLE recovery", 1, 2, []string{"match-b"}},
{"beyond last match page", "needle recovery", 1, 3, nil},
{"default limit", "needle recovery", 0, 1, []string{"match-a", "match-b"}},
{"zero page", "needle recovery", 1, 0, []string{"match-a"}},
{"no matches", "absent", 1, 1, nil},
{"whitespace query", " \t\n ", 1, 2, []string{"match-a"}},
} {
t.Run(tc.name, func(t *testing.T) {
query := collection.query
query.Q, query.Limit, query.Page = tc.query, tc.limit, tc.page
got, err := collection.list(query)
if err != nil {
t.Fatal(err)
}
if !slices.Equal(got, tc.want) {
t.Fatalf("IDs = %v, want %v", got, tc.want)
}
})
}
})
}
}
func putLearningSearchRow(t *testing.T, store *Store, id, title, project, candidateState, evaluationState, kind string, order int) {
t.Helper()
if err := store.PutCandidate(asymptoteobserve.LearningCandidateV1{
ID: id, Title: title, Project: asymptoteobserve.LearningProjectV1{ID: project}, State: candidateState, Kind: kind,
}); err != nil {
t.Fatal(err)
}
if err := store.PutEvaluation(asymptoteobserve.LearningEvaluationV1{
ID: id, Project: asymptoteobserve.LearningProjectV1{ID: project}, Status: evaluationState,
Trace: asymptoteobserve.LearningTraceRefV1{ID: id, Title: title}, RubricHash: "rubric",
}); err != nil {
t.Fatal(err)
}
db, err := store.db()
if err != nil {
t.Fatal(err)
}
defer db.Close()
at := time.Date(2026, 1, 1, 0, 0, 0, 0, time.UTC).Add(time.Duration(order) * time.Second).Format(time.RFC3339)
for _, stmt := range []string{`UPDATE candidates SET updated_at = ? WHERE id = ?`, `UPDATE evaluations SET updated_at = ? WHERE id = ?`} {
if _, err := db.Exec(stmt, at, id); err != nil {
t.Fatal(err)
}
}
}
func learningSearchCollections(store *Store) []struct {
name string
query Query
list func(Query) ([]string, error)
} {
return []struct {
name string
query Query
list func(Query) ([]string, error)
}{
{"candidates", Query{ProjectID: "project", State: "candidate", Kind: "workflow"}, func(query Query) ([]string, error) {
values, err := store.ListCandidates(query)
var ids []string
for _, value := range values {
ids = append(ids, value.ID)
}
return ids, err
}},
{"evaluations", Query{ProjectID: "project", State: "completed"}, func(query Query) ([]string, error) {
values, err := store.ListEvaluations(query)
var ids []string
for _, value := range values {
ids = append(ids, value.ID)
}
return ids, err
}},
}
}