You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
- Implemented `code-structure.ts` to extract imports, exports, dependencies, and call graphs from source files using tree-sitter.
- Added functions for extracting imports, exports, and function calls for TypeScript, JavaScript, Python, Go, and Rust.
- Created a `getCodeStructure` function to return a structured overview of the code file.
feat(tools): create project initializer for Context+ setup
- Introduced `init.ts` to initialize Context+ projects with necessary directories and default files.
- Added functionality to generate initial embeddings and context tree snapshots.
feat(tools): unify research capabilities across code, memory, and ACP
- Developed `research.ts` to aggregate search results from codebase, memory, and ACP sources.
- Implemented `discoverRelated` function to find related files and memories based on a given file path.
feat(tools): enhance search functionality with hybrid capabilities
- Created `search.ts` to combine semantic and keyword search modes for identifiers and files.
- Added support for customizable search options including weights and score thresholds.
test: add memory graph fixtures for testing
- Created a sample `graph.json` file to serve as a fixture for memory graph tests.
-`static-analysis.ts` - `lint` runner with project/file skill scoring output.
26
+
-`propose-commit.ts` - `checkpoint` tool for validated writes with local restore points.
27
+
-`feature-hub.ts` - `find_hub` ranking and full-project hub context fallback.
28
+
-`memory-tools.ts` - Memory graph wrappers for create/search/explore/bulk/update/delete flows.
29
+
-`init.ts` - Project bootstrap tool for `.contextplus` directories and context snapshot.
30
30
31
-
The memory graph is a **Retrieval-Augmented Generation (RAG)** system. Agents MUST use `search_memory_graph` at the start of every task to retrieve prior context, and persist learnings with `upsert_memory_node` and `create_relation` after completing work. This prevents redundant exploration and builds cumulative knowledge across sessions.
31
+
The memory graph is a **Retrieval-Augmented Generation (RAG)** system. Agents SHOULD use `search_memory` early in each task to retrieve prior context, and persist learnings with `create_memory` and `create_relation` after completing work. Stale links are pruned automatically before graph access.
-`shadow.ts` - Shadow restore point system for undo without touching git history.
41
41
42
-
**Entry Point**: `src/index.ts` registers 17 MCP tools and starts the stdio transport. Accepts an optional CLI argument for the target project root directory (defaults to `process.cwd()`).
42
+
**Entry Point**: `src/index.ts` registers 18 MCP tools and starts the stdio transport. Accepts an optional CLI argument for the target project root directory (defaults to `process.cwd()`).
43
43
44
44
## Environment Variables
45
45
@@ -53,18 +53,18 @@ The memory graph is a **Retrieval-Augmented Generation (RAG)** system. Agents MU
53
53
|`CONTEXTPLUS_EMBED_TRACKER_MAX_FILES`|`8`| Max changed files per tracker tick (hard-capped to 5-10) |
54
54
|`CONTEXTPLUS_EMBED_TRACKER_DEBOUNCE_MS`|`700`| Debounce before applying tracker refresh |
55
55
56
-
Runtime cache: `.mcp_data/` is created at MCP startup and stores reusable embedding vectors for files, identifiers, and call sites. A realtime tracker watches file updates and refreshes changed function/file embeddings incrementally.
56
+
Runtime storage: `.contextplus/` is created by `init`and stores hubs, memory graph data, and vector DB embeddings. A realtime tracker can refresh changed function/file embeddings incrementally.
57
57
58
58
## Fast Execute Mode (Mandatory)
59
59
60
60
Default to execution-first behavior. Use minimal tokens, minimal narration, and maximum tool leverage.
61
61
62
-
1. Skip long planning prose. Start with lightweight scoping: `get_context_tree` and `get_file_skeleton`.
62
+
1. Skip long planning prose. Start with lightweight scoping: `tree` and `skeleton`.
63
63
2. Run independent discovery operations in parallel whenever possible (for example, multiple searches/reads).
64
64
3. Prefer structural tools over full-file reads to conserve context.
65
-
4. Before modifying or deleting symbols, run `get_blast_radius`.
66
-
5. Write changes through `propose_commit` only.
67
-
6. Run `run_static_analysis` once after edits, or once per changed module for larger refactors.
65
+
4. Before modifying or deleting symbols, run `blast_radius`.
66
+
5. Write changes through `checkpoint`.
67
+
6. Run `lint` once after edits, or once per changed module for larger refactors.
68
68
69
69
### Execution Rules
70
70
@@ -77,7 +77,7 @@ Default to execution-first behavior. Use minimal tokens, minimal narration, and
77
77
### Token-Efficiency Rules
78
78
79
79
1. Treat 100 effective tokens as better than 1000 vague tokens.
80
-
2. Use high-signal tool calls first (`get_file_skeleton`, `get_context_tree`, `get_blast_radius`).
80
+
2. Use high-signal tool calls first (`skeleton`, `tree`, `blast_radius`).
81
81
3. Read full file bodies only when signatures/structure are insufficient.
82
82
4. Avoid repeated scans of unchanged areas.
83
83
5. Prefer direct edits + deterministic validation over extended speculative analysis.
@@ -127,25 +127,26 @@ Strict order within every file:
0 commit comments