ThatAIguyA world of ideas

THE CONSCIOUSNESS ATLAS
Read. Experiment. Follow the evidence.

ConsciousnessLearn · Explore · Joseph Anady

Janady13/missionmatch / internal/modules/staffing/classify_test.go

Source identity, revision, and recovered contents.

GitHub sourceSource text recovered

Source identity

FieldRecorded value
Source typeGitHub source
Original recordJanady13/missionmatch / internal/modules/staffing/classify_test.go
DateNot specified in source
RepositoryJanady13/missionmatch
Revision720d47fae476b0d38477ae4401697d372b1ea2bc
Branchfeature/opportunity-to-outcome
Path or archive memberinternal/modules/staffing/classify_test.go
Original SHA-256bc014b6bbd3f96390cff3ee05c4de5d73bd8ca59686dc399ffbf4e118871256b
Git blob SHA3655d567872e21914d34202d698d4fa73de3d347
Reading-copy SHA-256bc014b6bbd3f96390cff3ee05c4de5d73bd8ca59686dc399ffbf4e118871256b

Original source ↗

Every recorded occurrence

These 24 records contain identical original source bytes. Their paths and revisions remain part of the archive.

Original recordBranch or archiveRevision / identifierOriginal location
Janady13/missionmatch / internal/modules/staffing/classify_test.gofeature/opportunity-to-outcome720d47fae476b0d38477ae4401697d372b1ea2bcOpen original
Janady13/missionmatch / internal/modules/staffing/classify_test.goper-tenant-routing9bde0f9a74b89d01980fa658e5253acda7528d0cOpen original
Janady13/missionmatch / internal/modules/staffing/classify_test.gocollision-deconfliction4ee5a09972608ed89f8377c6665542d5f450f0a6Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gows6-retrieval6c56e29231ec05735927fa265c97d517499dfeafOpen original
Janady13/missionmatch / internal/modules/staffing/classify_test.gom5-price-to-win41000ad30fff4129fdaf5ec84e15ba14c27d4890Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gows1-ontology-syncb596f449a32a1016fbd403c36505cc00a1ac9ee6Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gomaster1e9249840a4302ec82e123b9c9cb6f75badea3e4Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gows8-teaching-loopc823f0fb6bb2aba0f39001eb6de96f4000d9321fOpen original
Janady13/missionmatch / internal/modules/staffing/classify_test.gow3-ai-staffing-recommendations43d56387270ef4da4cabd794d97ca6a49909bc7dOpen original
Janady13/missionmatch / internal/modules/staffing/classify_test.gomag-substrateb82c7100a492dec67dfd1eda6b3f53def859be35Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gows3-clearance4b8e7ce594c068621867f9c9deed0ec64ae6c553Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gophase2-eval-fairnessd361af254701975fe239927656ababb56374655eOpen original
Janady13/missionmatch / internal/modules/staffing/classify_test.gotime-to-fill-survivalb66e1e505863d4f17741a4b9ede73509e45bd6c6Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gographrag-foundationb0ddeb9f633fd138d09309d1a17b7d13bc3a67f7Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.godeploy-and-opsbdacd9d0b4d5998d25fc74bf4007f4c3ec538c7aOpen original
Janady13/missionmatch / internal/modules/staffing/classify_test.gows9-bench-ingestionf585a9ef32fa554663ce1fba9a414a54b6e49cf0Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gows2-alias-relationshipe4dada4601c6eb101830f9d223a9655dfa120616Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gopresentation-readinesseb574acaa29d71ce4d0f852572e87c275c79fdb7Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.govendor-intelligencefe9796a19c261951d3f2565206c0c1b5ac294465Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gows7-federal-signal6a9f6ce9cfb13345ffb47770d4960e7c2d9c17c2Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.goai-brain-liveaac32fc49c878cc5bca099459307611562d0bac1Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gophase2-connectorse038d4c687aec16f8bd9bc4d907eea14d91f8704Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gofeature/aioe-upgrade2178e7298d0e5d9af83afa12402fd587f0ba6ed8Open original
Janady13/missionmatch / internal/modules/staffing/classify_test.gocapture-readinessbae6af7cb2997e819174a9e9cfff5e16067a1975Open original

Recovered source transcript

package staffing import ( "testing" "github.com/shopspring/decimal" "github.com/missionworkforce/missionmatch/internal/modules/matching/engine" ) func bandFor(total decimal.Decimal) engine.Band { switch { case total.GreaterThanOrEqual(decimal.NewFromInt(90)): return engine.BandGreen case total.GreaterThanOrEqual(decimal.NewFromInt(75)): return engine.BandYellow default: return engine.BandRed } } func cand(id, total string, available, clearanceOK bool) ScoredCandidate { return ScoredCandidate{ CandidateID: id, Total: dec(total), Band: bandFor(dec(total)), Available: available, ClearanceSatisfied: clearanceOK, Provenance: "sponsor_verified", Completeness: dec("1"), } } func gapCtx(openSlots int, priority string) GapContext { return GapContext{RequirementID: "req-gap", OpenSlots: openSlots, Priority: dec(priority)} } func countAction(recs []Recommendation, a Action) int { n := 0 for _, r := range recs { if r.Action == a { n++ } } return n } func TestClassifyAssignBasic(t *testing.T) { cfg := DefaultConfig() recs := ClassifyForGap(cfg, gapCtx(2, "1"), []ScoredCandidate{cand("c1", "92", true, true)}) if len(recs) != 2 { // one assign, one source (2 slots, 1 assignable) t.Fatalf("want 2 recs (assign + source), got %d", len(recs)) } if recs[0].Action != ActionAssign || recs[0].CandidateID != "c1" || recs[0].Rank != 1 { t.Fatalf("first rec must be the assign for c1 at rank 1: %+v", recs[0]) } if recs[0].RequirementID != "req-gap" { t.Fatalf("recommendation must carry the gap requirement id, got %q", recs[0].RequirementID) } } func TestClassifyBandFloorBoundary(t *testing.T) { cfg := DefaultConfig() // floor 75 // Exactly at the floor is qualified (>=). atFloor := ClassifyForGap(cfg, gapCtx(1, "1"), []ScoredCandidate{cand("c1", "75", true, true)}) if countAction(atFloor, ActionAssign) != 1 { t.Fatalf("a candidate exactly at the floor must be assignable") } // Just below the floor with a reskill path is a reskill, not an assign. below := cand("c2", "74.9999", true, true) below.Reskill = &ReskillFact{HeldSkill: "SIGINT Tooling", MissingSkill: "Intelligence Analysis", Distance: dec("0.20")} belowRecs := ClassifyForGap(cfg, gapCtx(1, "1"), []ScoredCandidate{below}) if countAction(belowRecs, ActionAssign) != 0 { t.Fatalf("a candidate below the floor must never be an assign") } if countAction(belowRecs, ActionReskill) != 1 { t.Fatalf("a below floor candidate with an adjacency path must be a reskill") } // Just below the floor with NO reskill path produces no row for that candidate (never auto rejected). bare := cand("c3", "74.9999", true, true) bareRecs := ClassifyForGap(cfg, gapCtx(1, "1"), []ScoredCandidate{bare}) for _, r := range bareRecs { if r.CandidateID == "c3" { t.Fatalf("a below floor candidate with no reskill path must not appear as any recommendation, got %+v", r) } } } func TestClassifyReassign(t *testing.T) { cfg := DefaultConfig() // Committed to a lower priority requirement -> reassign with the delta. c := cand("c1", "95", true, true) c.CommittedRequirementID = "req-other" c.CommittedPriority = dec("1") recs := ClassifyForGap(cfg, gapCtx(1, "2.5"), []ScoredCandidate{c}) if countAction(recs, ActionReassign) != 1 { t.Fatalf("a qualified candidate committed to a lower priority requirement must be a reassign") } var rr *Recommendation for i := range recs { if recs[i].Action == ActionReassign { rr = &recs[i] } } if rr.Evidence.Reassign == nil || rr.Evidence.Reassign.FromRequirementID != "req-other" { t.Fatalf("reassign evidence must name the source requirement: %+v", rr.Evidence) } if !rr.Evidence.Reassign.PriorityDelta.Equal(dec("1.5")) { t.Fatalf("priority delta must be 2.5 - 1 = 1.5, got %s", rr.Evidence.Reassign.PriorityDelta) } // Committed to an equal or higher priority requirement -> not recommended (leave them where they are). c.CommittedPriority = dec("2.5") none := ClassifyForGap(cfg, gapCtx(1, "2.5"), []ScoredCandidate{c}) if countAction(none, ActionReassign) != 0 { t.Fatalf("a candidate committed at equal priority must not be reassigned") } } func TestClassifyCommittedToSameGapIsAssign(t *testing.T) { cfg := DefaultConfig() c := cand("c1", "95", true, true) c.CommittedRequirementID = "req-gap" // already committed to this very gap c.CommittedPriority = dec("1") recs := ClassifyForGap(cfg, gapCtx(1, "2"), []ScoredCandidate{c}) if countAction(recs, ActionAssign) != 1 || countAction(recs, ActionReassign) != 0 { t.Fatalf("a candidate committed to the gap itself is an assign, not a reassign: %+v", recs) } } func TestClassifyReskillGating(t *testing.T) { cfg := DefaultConfig() base := cand("c1", "60", true, true) base.Reskill = &ReskillFact{HeldSkill: "Python", MissingSkill: "Go", Distance: dec("0.30")} if countAction(ClassifyForGap(cfg, gapCtx(1, "1"), []ScoredCandidate{base}), ActionReskill) != 1 { t.Fatalf("a below floor, clearance satisfied, available candidate with an adjacency path must reskill") } // No adjacency path -> no reskill. noAdj := cand("c2", "60", true, true) if len(ClassifyForGap(cfg, gapCtx(0, "1"), []ScoredCandidate{noAdj})) != 0 { t.Fatalf("no adjacency path means no reskill and no row") } // Clearance not satisfied -> no reskill even with an adjacency path (clearance is a hard gate). noClear := cand("c3", "60", true, false) noClear.Reskill = &ReskillFact{HeldSkill: "Python", MissingSkill: "Go", Distance: dec("0.30")} if countAction(ClassifyForGap(cfg, gapCtx(0, "1"), []ScoredCandidate{noClear}), ActionReskill) != 0 { t.Fatalf("a reskill must require the clearance gate to be satisfied") } } func TestClassifySource(t *testing.T) { cfg := DefaultConfig() // Three open slots, one assignable -> one source note for the remaining two. recs := ClassifyForGap(cfg, gapCtx(3, "1"), []ScoredCandidate{cand("c1", "92", true, true)}) if countAction(recs, ActionSource) != 1 { t.Fatalf("an under filled gap must emit exactly one source note") } var src *Recommendation for i := range recs { if recs[i].Action == ActionSource { src = &recs[i] } } if src.CandidateID != "" { t.Fatalf("a source recommendation must name no candidate, got %q", src.CandidateID) } if src.Evidence.OpenSlots == nil || *src.Evidence.OpenSlots != 2 { t.Fatalf("source must record the remaining open slots (2), got %+v", src.Evidence.OpenSlots) } if !src.Confidence.Equal(decimal.NewFromInt(1)) { t.Fatalf("a source note is a deterministic fact, confidence 1, got %s", src.Confidence) } // Enough assignable for the slots -> no source. full := ClassifyForGap(cfg, gapCtx(1, "1"), []ScoredCandidate{cand("c1", "92", true, true), cand("c2", "88", true, true)}) if countAction(full, ActionSource) != 0 { t.Fatalf("a fully coverable gap must not emit a source note") } } func TestClassifyRankingDeterministic(t *testing.T) { cfg := DefaultConfig() in := []ScoredCandidate{ cand("c-low", "80", true, true), cand("c-hi", "95", true, true), cand("c-mid-b", "85", true, true), cand("c-mid-a", "85", true, true), // tie with c-mid-b, breaks by candidate id asc } recs := ClassifyForGap(cfg, gapCtx(4, "1"), in) wantOrder := []string{"c-hi", "c-mid-a", "c-mid-b", "c-low"} got := make([]string, 0, len(wantOrder)) for _, r := range recs { if r.Action == ActionAssign { got = append(got, r.CandidateID) } } for i, w := range wantOrder { if got[i] != w { t.Fatalf("ranking not deterministic: got %v want %v", got, wantOrder) } if recs[i].Rank != i+1 { t.Fatalf("ranks must be 1 based sequential, got %d at index %d", recs[i].Rank, i) } } } func TestClassifyUnavailableQualifiedIsNotAssigned(t *testing.T) { cfg := DefaultConfig() recs := ClassifyForGap(cfg, gapCtx(1, "1"), []ScoredCandidate{cand("c1", "95", false, true)}) if countAction(recs, ActionAssign) != 0 { t.Fatalf("an unavailable candidate must not be assigned") } // The slot stays open, so a source note is emitted. if countAction(recs, ActionSource) != 1 { t.Fatalf("the unfilled slot must surface as a source note") } }

Search equations, builds, manuscript text, and recovered sources.