Files
wehub-resource-sync a06f331eb8
CI / benchmark (push) Has been skipped
install-script / posix-syntax (push) Successful in 6m1s
CI / build-onnx (push) Failing after 6m43s
init-smoke / dry-run (push) Failing after 15m57s
security / govulncheck (push) Has been cancelled
security / trivy-fs (push) Has been cancelled
CI / test (1.26, ubuntu-latest) (push) Has been cancelled
Scorecard supply-chain security / Scorecard analysis (push) Has been cancelled
CI / test (1.26, macos-latest) (push) Has been cancelled
CI / build-windows (push) Has been cancelled
CI / lint (push) Has been cancelled
install-script / powershell-syntax (push) Has been cancelled
install-script / install (macos-14) (push) Has been cancelled
install-script / install (ubuntu-latest) (push) Has been cancelled
chore: import upstream snapshot with attribution
2026-07-13 12:33:42 +08:00

136 lines
4.2 KiB
Go

package search
import (
"slices"
"testing"
"github.com/zzet/gortex/internal/graph"
)
// fixtureGraph builds a small graph whose function names repeatedly
// pair the words "blast" and "radius", so co-occurrence mining should
// surface them as concept siblings.
func fixtureGraph(names []string) *graph.Graph {
g := graph.New()
for i, n := range names {
g.AddNode(&graph.Node{
ID: "pkg/f.go::" + n,
Kind: graph.KindFunction,
Name: n,
FilePath: "pkg/f.go",
StartLine: i + 1,
EndLine: i + 2,
Language: "go",
})
}
return g
}
func TestBuildAutoConcepts_CoOccurrence(t *testing.T) {
// "blast" + "radius" co-occur in 4 distinct symbol names -- well
// over autoConceptMinPairCount.
g := fixtureGraph([]string{
"handleBlastRadius",
"blastRadiusOf",
"BlastRadiusReport",
"computeBlastRadius",
"unrelatedThing",
"otherHelper",
})
ac := BuildAutoConcepts(g)
radiusSibs := ac.Expand("blast")
if !slices.Contains(radiusSibs, "radius") {
t.Errorf("Expand(blast) should yield 'radius'; got %v", radiusSibs)
}
blastSibs := ac.Expand("radius")
if !slices.Contains(blastSibs, "blast") {
t.Errorf("Expand(radius) should yield 'blast' (symmetric); got %v", blastSibs)
}
// A token that never co-occurs with anything has no siblings.
if ac.Expand("zzzneverpaired") != nil {
t.Error("an unmined token should expand to nil")
}
}
func TestBuildAutoConcepts_BelowThreshold(t *testing.T) {
// "alpha" + "beta" co-occur only twice -- below the min-3 gate.
g := fixtureGraph([]string{
"alphaBetaOne",
"alphaBetaTwo",
"gammaDelta",
})
ac := BuildAutoConcepts(g)
if slices.Contains(ac.Expand("alpha"), "beta") {
t.Error("a pair below autoConceptMinPairCount must not become a concept")
}
}
func TestBuildAutoConcepts_NilAndEmpty(t *testing.T) {
if BuildAutoConcepts(nil).TokenCount() != 0 {
t.Error("BuildAutoConcepts(nil) should be empty")
}
if BuildAutoConcepts(graph.New()).TokenCount() != 0 {
t.Error("BuildAutoConcepts(empty graph) should be empty")
}
var ac *AutoConcepts
if ac.Expand("x") != nil {
t.Error("nil AutoConcepts.Expand should return nil")
}
}
func TestBuildAutoConcepts_StopTokensExcluded(t *testing.T) {
// "handle" is a stop-token; even though it appears with "payload"
// in many names, it must not become a concept sibling.
g := fixtureGraph([]string{
"handlePayload", "handlePayloadV2", "handlePayloadAsync", "handlePayloadSync",
})
ac := BuildAutoConcepts(g)
if slices.Contains(ac.Expand("payload"), "handle") {
t.Error("stop-token 'handle' must not surface as a concept sibling")
}
}
// TestAutoConcepts_Vocabulary confirms the mined symbol-name
// vocabulary is exposed via InVocabulary / VocabularySize -- the
// anchor the vocabulary-anchored expansion path filters against.
func TestAutoConcepts_Vocabulary(t *testing.T) {
g := fixtureGraph([]string{
"parsePayload", "decodeToken", "encodeSession",
})
ac := BuildAutoConcepts(g)
// Words that appear in the symbol names are in the vocabulary
// (case-insensitive).
for _, tok := range []string{"parse", "payload", "decode", "token", "PARSE", "Token"} {
if !ac.InVocabulary(tok) {
t.Errorf("InVocabulary(%q) = false, want true (vocab=%d)", tok, ac.VocabularySize())
}
}
// A word that appears in NO symbol name is absent -- this is the
// case the expansion anchor uses to drop a hallucinated synonym.
if ac.InVocabulary("authenticator") {
t.Error("InVocabulary('authenticator') = true, want false (no symbol uses it)")
}
if ac.VocabularySize() == 0 {
t.Error("a non-empty graph should mine a non-empty vocabulary")
}
}
// TestAutoConcepts_VocabularyEmptyDegrades confirms an empty or nil
// vocabulary reports false / size 0 so callers degrade to
// unconstrained expansion instead of filtering every term away.
func TestAutoConcepts_VocabularyEmptyDegrades(t *testing.T) {
if BuildAutoConcepts(graph.New()).VocabularySize() != 0 {
t.Error("an empty graph must mine a zero-size vocabulary")
}
if BuildAutoConcepts(graph.New()).InVocabulary("anything") {
t.Error("an empty-vocabulary InVocabulary must return false")
}
var ac *AutoConcepts
if ac.InVocabulary("x") || ac.VocabularySize() != 0 {
t.Error("nil AutoConcepts must report empty vocabulary")
}
}