lore-memory 0.5.1 → 0.5.2

package/README.md

@@ -143,6 +143,13 @@ Add the MCP server to your Claude Code config (`~/.claude/settings.json`):
 }
 ```
 
+### 🛡️ Autonomous AI Integration (Zero-Prompt)
+To make Claude autonomously respect your codebase rules without you ever having to ask it, drop a `CLAUDE.md` (or `.cursorrules` / `.clinerules`) file in the root of your project with this exact instruction:
+
+> **"Before you modify, create, or explain any file in this codebase, you must ALWAYS execute the `lore_why` tool on that file path first to check if there are any architectural invariants, gotchas, or decisions you need to respect."**
+
+Once added, the AI will autonomously query Lore in the background before it writes a single line of code, ensuring it never violates your team's architectural constraints.
+
 ---
 
 ## 🔒 Privacy & Data

package/bin/lore.js

@@ -130,6 +130,7 @@ program
   .option('--tradeoffs <tradeoffs>', 'Tradeoffs')
   .option('--tags <tags>', 'Comma-separated tags')
   .option('--files <files>', 'Comma-separated file paths')
+  .option('--file <file>', 'Alias for --files')
   .action(require('../src/commands/log'));
 
 program

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "lore-memory",
-  "version": "0.5.1",
+  "version": "0.5.2",
   "description": "Persistent project memory for developers. Captures decisions, invariants, gotchas, and graveyard entries — automatically and manually — and injects them into AI coding sessions.",
   "main": "bin/lore.js",
   "bin": {

package/src/commands/graph.js

@@ -39,19 +39,25 @@ function graph(filepath, options) {
     const index = readIndex();
     const normalized = path.relative(projectRoot, path.resolve(filepath)).replace(/\\/g, '/');
 
-    const imports = g.imports[normalized] || [];
+    const importsArr = g.imports[normalized];
     const importedBy = g.importedBy[normalized] || [];
 
-    if (imports.length === 0 && importedBy.length === 0) {
-      console.log(chalk.yellow(`No graph data for ${filepath}`));
-      console.log(chalk.dim('  Run: lore graph --build  to build the dependency graph'));
+    if (importsArr === undefined) {
+      console.log(chalk.yellow(`${filepath} is not in the dependency graph.`));
+      console.log(chalk.dim('  Run: lore graph --build  to index project files'));
       return;
     }
 
+    const imports = importsArr;
     const entryCount = (file) => (index.files[file] || []).length;
 
     console.log(chalk.cyan(`\n📖 ${filepath}\n`));
 
+    if (imports.length === 0 && importedBy.length === 0) {
+      console.log(chalk.dim('  No internal project imports or dependents found.'));
+      return;
+    }
+
     if (imports.length > 0) {
       console.log(chalk.bold('Imports:'));
       for (const dep of imports) {

package/src/commands/log.js

@@ -14,6 +14,13 @@ async function log(options) {
 
     let type, title, context, alternatives, tradeoffs, tags, files;
 
+    // If --title or --context is given without the other, error rather than falling through to interactive
+    if ((options.title && !options.context) || (!options.title && options.context)) {
+      const missing = !options.title ? '--title' : '--context';
+      console.error(chalk.red(`${missing} is required when using non-interactive mode`));
+      process.exit(1);
+    }
+
     // Inline mode: all three required fields provided as flags
     if (options.type && options.title && options.context) {
       type = options.type;
@@ -22,7 +29,8 @@ async function log(options) {
       alternatives = options.alternatives ? [options.alternatives] : [];
       tradeoffs = options.tradeoffs || '';
       tags = options.tags ? options.tags.split(',').map(t => t.trim()).filter(Boolean) : [];
-      files = options.files ? options.files.split(',').map(f => f.trim()).filter(Boolean) : [];
+      const rawFiles = options.files || options.file || '';
+      files = rawFiles ? rawFiles.split(',').map(f => f.trim()).filter(Boolean) : [];
     } else {
       // Interactive mode
       const recentFiles = getRecentFiles();

package/src/commands/score.js

@@ -38,13 +38,18 @@ function score() {
     console.log();
 
     // Coverage
-    const cColor = result.coverage >= 70 ? chalk.green : result.coverage >= 40 ? chalk.yellow : chalk.red;
-    console.log(cColor(`Coverage     ${result.coverage}/100`));
-    console.log(chalk.dim(`  ${bar(result.coverage)}  ${result.coveredModules}/${result.activeModules} active modules documented`));
-    if (result.topUnlogged.length > 0) {
-      console.log(chalk.yellow('  Highest risk unlogged modules:'));
-      for (const { module: mod, commits } of result.topUnlogged) {
-        console.log(chalk.yellow(`    ${mod}  — ${commits} commits`));
+    if (result.activeModules === 0) {
+      console.log(chalk.dim(`Coverage     N/A`));
+      console.log(chalk.dim(`  No active modules in recent git history`));
+    } else {
+      const cColor = result.coverage >= 70 ? chalk.green : result.coverage >= 40 ? chalk.yellow : chalk.red;
+      console.log(cColor(`Coverage     ${result.coverage}/100`));
+      console.log(chalk.dim(`  ${bar(result.coverage)}  ${result.coveredModules}/${result.activeModules} active modules documented`));
+      if (result.topUnlogged.length > 0) {
+        console.log(chalk.yellow('  Highest risk unlogged modules:'));
+        for (const { module: mod, commits } of result.topUnlogged) {
+          console.log(chalk.yellow(`    ${mod}  — ${commits} commits`));
+        }
       }
     }
     console.log();

package/src/lib/entries.js

@@ -36,7 +36,8 @@ function generateId(type, title) {
     .split(/\s+/)
     .filter(Boolean)
     .slice(0, 3)
-    .join('-');
+    .join('-')
+    .slice(0, 40);
   const ts = Math.floor(Date.now() / 1000);
   return `${type}-${words}-${ts}`;
 }

package/src/lib/scorer.js

@@ -53,7 +53,7 @@ function getModulesWithEntries(index) {
 }
 
 function calcCoverage(activeModules, modulesWithEntries) {
-  if (activeModules.length === 0) return 100;
+  if (activeModules.length === 0) return 50; // neutral — no data, displayed as N/A
   const covered = activeModules.filter(m => modulesWithEntries.has(m)).length;
   return Math.round((covered / activeModules.length) * 100);
 }