Apply gofmt -s across codebase for Go Report Card A+

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

Author: Grivn

cmd/embed.go

@@ -41,11 +41,11 @@ Modes:
 				return fmt.Errorf("embedding stats: %w", err)
 			}
 			output := map[string]interface{}{
-				"total_insights":    total,
-				"embedded":          embedded,
-				"coverage":          fmt.Sprintf("%.0f%%", float64(embedded)/float64(max(total, 1))*100),
-				"ollama_available":  ec.Available(),
-				"model":             ec.Model(),
+				"total_insights":   total,
+				"embedded":         embedded,
+				"coverage":         fmt.Sprintf("%.0f%%", float64(embedded)/float64(max(total, 1))*100),
+				"ollama_available": ec.Available(),
+				"model":            ec.Model(),
 			}
 			return enc.Encode(output)
 		}

cmd/gc.go

@@ -53,7 +53,7 @@ Keep mode:
 				"content":              ins.Content,
 				"new_access":           ins.AccessCount + 3,
 				"effective_importance": ei,
-				"immune":              store.IsImmune(ins.Importance, ins.AccessCount+3),
+				"immune":               store.IsImmune(ins.Importance, ins.AccessCount+3),
 			}
 			enc := json.NewEncoder(os.Stdout)
 			enc.SetIndent("", "  ")

cmd/remember.go

@@ -7,12 +7,12 @@ import (
 	"strings"
 	"time"
 
+	"github.com/google/uuid"
 	"github.com/mnemon-dev/mnemon/internal/embed"
 	"github.com/mnemon-dev/mnemon/internal/graph"
 	"github.com/mnemon-dev/mnemon/internal/model"
 	"github.com/mnemon-dev/mnemon/internal/search"
 	"github.com/mnemon-dev/mnemon/internal/store"
-	"github.com/google/uuid"
 	"github.com/spf13/cobra"
 )
 
@@ -178,7 +178,7 @@ var rememberCmd = &cobra.Command{
 				"content":         content,
 				"action":          "skipped",
 				"diff_suggestion": string(diffSuggestion),
-				"replaced_id":    replacedID,
+				"replaced_id":     replacedID,
 			}
 			enc := json.NewEncoder(os.Stdout)
 			enc.SetIndent("", "  ")

internal/graph/causal.go

@@ -66,7 +66,7 @@ func CreateCausalEdges(db *store.DB, insight *model.Insight) int {
 		//   → new has keyword → new is effect → prev is cause → prev→new
 		// e.g. prev="chose X because of Y", new="Y has low latency"
 		//   → prev has keyword → prev is effect → new is cause → new→prev
-		sourceID := prev.ID  // default: new has signal → new is effect, prev is cause
+		sourceID := prev.ID // default: new has signal → new is effect, prev is cause
 		targetID := insight.ID
 		if !newHasSignal && prevHasSignal {
 			// Only prev has signal → prev is effect, new is cause
@@ -77,10 +77,10 @@ func CreateCausalEdges(db *store.DB, insight *model.Insight) int {
 		subType := suggestSubType(insight.Content + " " + prev.Content)
 
 		err = db.InsertEdge(&model.Edge{
-			SourceID:  sourceID,
-			TargetID:  targetID,
-			EdgeType:  model.EdgeCausal,
-			Weight:    overlap,
+			SourceID: sourceID,
+			TargetID: targetID,
+			EdgeType: model.EdgeCausal,
+			Weight:   overlap,
 			Metadata: map[string]string{
 				"overlap":  formatFloat(overlap),
 				"sub_type": subType,
@@ -129,7 +129,7 @@ type CausalCandidate struct {
 	ID               string `json:"id"`
 	Content          string `json:"content"`
 	Category         string `json:"category"`
-	Hop              int    `json:"hop"`               // graph distance (1 or 2)
+	Hop              int    `json:"hop"`                // graph distance (1 or 2)
 	ViaEdge          string `json:"via_edge"`           // edge type that connected
 	CausalSignal     string `json:"causal_signal"`      // keyword if found, else ""
 	SuggestedSubType string `json:"suggested_sub_type"` // heuristic suggestion

internal/graph/entity.go

@@ -74,7 +74,7 @@ var acronymStopwords = map[string]bool{
 	"OR": true, "AN": true, "IF": true, "IS": true, "IT": true,
 	"OF": true, "AS": true, "DO": true, "NO": true, "SO": true,
 	"UP": true, "WE": true, "HE": true, "MY": true, "BE": true,
-	"GO": true, // "Go" (capitalized) is in techDictionary, but "GO" all-caps is ambiguous
+	"GO":  true, // "Go" (capitalized) is in techDictionary, but "GO" all-caps is ambiguous
 	"THE": true, "AND": true, "FOR": true, "ARE": true, "BUT": true,
 	"NOT": true, "YOU": true, "ALL": true, "CAN": true, "HER": true,
 	"WAS": true, "ONE": true, "OUR": true, "OUT": true, "HAS": true,

internal/graph/semantic.go

@@ -233,9 +233,9 @@ func findCandidatesByTokenOverlap(db *store.DB, insight *model.Insight) []Semant
 	result := make([]SemanticCandidate, len(candidates))
 	for i, c := range candidates {
 		result[i] = SemanticCandidate{
-			ID:              c.insight.ID,
-			Content:         c.insight.Content,
-			Category:        string(c.insight.Category),
+			ID:         c.insight.ID,
+			Content:    c.insight.Content,
+			Category:   string(c.insight.Category),
 			Similarity: c.similarity,
 		}
 	}

internal/model/node.go

@@ -28,16 +28,16 @@ var ValidCategories = map[Category]bool{
 
 // Insight represents a memory node in the knowledge graph.
 type Insight struct {
-	ID          string    `json:"id"`
-	Content     string    `json:"content"`
-	Category    Category  `json:"category"`
-	Importance  int       `json:"importance"`
-	Tags        []string  `json:"tags"`
-	Entities    []string  `json:"entities"`
-	Source      string    `json:"source"`
-	AccessCount int       `json:"access_count"`
-	CreatedAt   time.Time `json:"created_at"`
-	UpdatedAt   time.Time `json:"updated_at"`
+	ID          string     `json:"id"`
+	Content     string     `json:"content"`
+	Category    Category   `json:"category"`
+	Importance  int        `json:"importance"`
+	Tags        []string   `json:"tags"`
+	Entities    []string   `json:"entities"`
+	Source      string     `json:"source"`
+	AccessCount int        `json:"access_count"`
+	CreatedAt   time.Time  `json:"created_at"`
+	UpdatedAt   time.Time  `json:"updated_at"`
 	DeletedAt   *time.Time `json:"deleted_at,omitempty"`
 }
 

internal/search/diff.go

@@ -20,12 +20,12 @@ const (
 
 // DiffMatch represents one existing insight compared against the new content.
 type DiffMatch struct {
-	ID              string         `json:"id"`
-	Content         string         `json:"content"`
-	TokenSimilarity float64        `json:"token_similarity"`
-	CosineSimilarity float64       `json:"cosine_similarity,omitempty"`
-	Similarity      float64        `json:"similarity"`
-	Suggestion      DiffSuggestion `json:"suggestion"`
+	ID               string         `json:"id"`
+	Content          string         `json:"content"`
+	TokenSimilarity  float64        `json:"token_similarity"`
+	CosineSimilarity float64        `json:"cosine_similarity,omitempty"`
+	Similarity       float64        `json:"similarity"`
+	Suggestion       DiffSuggestion `json:"suggestion"`
 }
 
 // DiffResult is the output of a diff check.
@@ -36,8 +36,8 @@ type DiffResult struct {
 
 // DiffOptions controls diff behavior.
 type DiffOptions struct {
-	Limit         int       // max candidates to compare (default 5)
-	NewEmbedding  []float64 // pre-computed embedding for new content (optional)
+	Limit         int            // max candidates to compare (default 5)
+	NewEmbedding  []float64      // pre-computed embedding for new content (optional)
 	ExistingEmbed []EmbeddedItem // pre-loaded embeddings (optional, avoids DB call)
 }
 

internal/search/integration_test.go

@@ -186,8 +186,8 @@ func TestVectorSearch_Basic(t *testing.T) {
 
 	// Store embeddings
 	query := []float64{1.0, 0.0, 0.0}
-	db.UpdateEmbedding("vs-1", embed.SerializeVector([]float64{0.9, 0.1, 0.0}))  // similar
-	db.UpdateEmbedding("vs-2", embed.SerializeVector([]float64{0.0, 0.0, 1.0}))  // different
+	db.UpdateEmbedding("vs-1", embed.SerializeVector([]float64{0.9, 0.1, 0.0}))   // similar
+	db.UpdateEmbedding("vs-2", embed.SerializeVector([]float64{0.0, 0.0, 1.0}))   // different
 	db.UpdateEmbedding("vs-3", embed.SerializeVector([]float64{0.85, 0.15, 0.0})) // similar
 
 	hits := vectorSearch(db, query, 10)

internal/search/recall.go

@@ -418,8 +418,8 @@ func causalTopologicalSort(db *store.DB, results []RecallResult) []RecallResult
 	}
 
 	// Build DAG from causal edges: source → target means source causes target
-	adj := make(map[string][]string)    // source → targets
-	inDegree := make(map[string]int)    // target → incoming edge count
+	adj := make(map[string][]string) // source → targets
+	inDegree := make(map[string]int) // target → incoming edge count
 
 	for _, r := range results {
 		inDegree[r.Insight.ID] = 0