mirror of
https://github.com/Twigpine/zero.git
synced 2026-11-12 08:41:32 -10:00
07ee16030c
Module 2 of the runtime-core split (off main, after #105). Scope: internal/modelregistry only — fully additive (the whole tree builds unchanged against it). - Regex MatchPatterns aliases + pattern-based Resolve. - DeprecationRule with FallbackID; ResolveWithFallback returns the active fallback model + a user notice for deprecated ids; NewRegistry validates every Deprecation.FallbackID resolves (fail-fast on misconfig). - ReasoningEffort support: per-model ReasoningEfforts + DefaultReasoningEffort (validated to be a member of the model's set) + EffectiveReasoningEffort(). - Mode presets (modes.go: smart/deep/fast/large/precise -> model id + reasoning effort). These are the registry-capability layer; the CLI/agent adoption (--model deprecation-fallback, --mode, -r/--reasoning-effort, enhanced 'zero models') lands in a later module to keep PRs reviewable. Build/vet/full-suite/-race green; no new deps. Co-authored-by: KRATOS <[email protected]> Co-authored-by: Claude Opus 4.8 (1M context) <[email protected]>
90 lines
2.6 KiB
Go
90 lines
2.6 KiB
Go
package modelregistry
|
|
|
|
import "testing"
|
|
|
|
func TestLookupModeKnown(t *testing.T) {
|
|
for _, name := range []string{"smart", "deep", "fast", "large", "precise"} {
|
|
mode, ok := LookupMode(name)
|
|
if !ok {
|
|
t.Fatalf("LookupMode(%q) = _, false; want a registered mode", name)
|
|
}
|
|
if mode.Name != name {
|
|
t.Fatalf("LookupMode(%q).Name = %q; want %q", name, mode.Name, name)
|
|
}
|
|
if mode.Description == "" {
|
|
t.Fatalf("LookupMode(%q).Description is empty", name)
|
|
}
|
|
if mode.Model == "" {
|
|
t.Fatalf("LookupMode(%q).Model is empty", name)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestLookupModeIsCaseInsensitiveAndTrimmed(t *testing.T) {
|
|
mode, ok := LookupMode(" DEEP ")
|
|
if !ok {
|
|
t.Fatal("LookupMode(\" DEEP \") = _, false; want match")
|
|
}
|
|
if mode.Name != "deep" {
|
|
t.Fatalf("LookupMode normalized name = %q; want deep", mode.Name)
|
|
}
|
|
}
|
|
|
|
func TestLookupModeUnknown(t *testing.T) {
|
|
for _, name := range []string{"", " ", "turbo", "genius"} {
|
|
if _, ok := LookupMode(name); ok {
|
|
t.Fatalf("LookupMode(%q) = _, true; want false", name)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestModesReturnsIndependentCopies(t *testing.T) {
|
|
modes := Modes()
|
|
if len(modes) == 0 {
|
|
t.Fatal("Modes() returned no presets")
|
|
}
|
|
modes[0].Name = "mutated"
|
|
if again := Modes(); again[0].Name == "mutated" {
|
|
t.Fatal("Modes() should return defensive copies, not shared state")
|
|
}
|
|
}
|
|
|
|
func TestModeNamesMatchCatalogOrder(t *testing.T) {
|
|
names := ModeNames()
|
|
modes := Modes()
|
|
if len(names) != len(modes) {
|
|
t.Fatalf("ModeNames length %d != Modes length %d", len(names), len(modes))
|
|
}
|
|
for index := range names {
|
|
if names[index] != modes[index].Name {
|
|
t.Fatalf("ModeNames[%d] = %q; want %q", index, names[index], modes[index].Name)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestEveryModeResolvesToRealRegistryModel(t *testing.T) {
|
|
registry, err := DefaultRegistry()
|
|
if err != nil {
|
|
t.Fatalf("DefaultRegistry: %v", err)
|
|
}
|
|
for _, mode := range Modes() {
|
|
entry, ok := registry.Resolve(mode.Model)
|
|
if !ok {
|
|
t.Fatalf("mode %q references model %q that does not resolve in the registry", mode.Name, mode.Model)
|
|
}
|
|
if mode.Effort != "" {
|
|
if !ValidReasoningEffort(mode.Effort) {
|
|
t.Fatalf("mode %q has invalid effort %q", mode.Name, mode.Effort)
|
|
}
|
|
// The effort the mode requests should be honored by the resolved
|
|
// model (so the preset never silently downgrades on apply).
|
|
if effective := EffectiveReasoningEffort(entry, mode.Effort); effective != mode.Effort {
|
|
t.Fatalf("mode %q effort %q is not supported by %s (effective %q)", mode.Name, mode.Effort, entry.ID, effective)
|
|
}
|
|
}
|
|
if mode.MaxTurns < 0 {
|
|
t.Fatalf("mode %q has negative MaxTurns %d", mode.Name, mode.MaxTurns)
|
|
}
|
|
}
|
|
}
|