정보
이 스킬은 심볼이나 파일에 대한 탐색 가능한 의존성 맵을 구축하여 포괄적인 코드 탐색 기능을 제공합니다. 구현체, 호출 계층, 참조 관계, 소스 코드를 종합적으로 분석하여 개발자가 익숙하지 않은 코드베이스를 이해할 수 있도록 돕습니다. 단순한 심볼 검색을 넘어 완전한 구조적 개요가 필요할 때 사용하세요.
빠른 설치
Claude Code
추천npx skills add blackwell-systems/agent-lsp -a claude-code/plugin add https://github.com/blackwell-systems/agent-lspgit clone https://github.com/blackwell-systems/agent-lsp.git ~/.claude/skills/lsp-understandClaude Code에서 이 명령을 복사하여 붙여넣어 스킬을 설치하세요
문서
Requires the agent-lsp MCP server.
lsp-understand
Deep-dive exploration of unfamiliar code — given a symbol or file, synthesizes hover info, implementations, call hierarchy (bounded to 2 levels), all references, and source into a structured Code Map.
Read-only — does not modify any files.
Differentiation from lsp-explore
/lsp-explore is a single-symbol pass: given one symbol name, it runs hover +
implementations + call hierarchy + references and produces a per-symbol report.
Use lsp-explore for quick "what is this one thing" questions.
/lsp-understand is broader in three ways:
- Accepts a file path as input — explores all exported symbols in that file as a group (Mode B), rather than requiring a single symbol name.
- Synthesizes cross-symbol relationships — produces a dependency map showing how entry points call each other, share callers, or implement the same interface, rather than isolated per-symbol reports.
- Enforces a 2-level call hierarchy depth limit — prevents infinite recursion in deeply connected code.
Use lsp-understand for "how does this module work as a whole."
Input — Two Modes
Mode A (symbol): User provides a symbol name in dot notation
(e.g., "codec.Encode", "Handler.ServeHTTP").
Mode B (file): User provides an absolute file path. All exported symbols in the file become the entry points.
Prerequisites
Call mcp__lsp__get_server_capabilities before Step 2 to determine which
capabilities are available. Skip steps that require missing capabilities:
go_to_implementation: skip Step 2b ifimplementationProvider: falsefind_callers: skip Steps 2c and 2d ifcallHierarchyProvider: false; note in the Code Map output that call hierarchy was unavailable
Step 1 — Entry Point Resolution
Mode A: Single Symbol
Call mcp__lsp__go_to_symbol to locate the symbol definition:
mcp__lsp__go_to_symbol({
"symbol_path": "<dot-notation name>", // e.g. "codec.Encode"
"workspace_root": "<root>" // optional
})
→ returns: file_path, line, column (1-indexed)
Record file_path, line, and column. If go_to_symbol returns nothing,
report:
Symbol not found:
<name>Check the dot-notation path (e.g. "Package.Symbol") and ensure the workspace root covers the file.
Stop immediately — do not proceed to Step 2.
The single symbol becomes the sole entry point.
Mode B: File Path
Call mcp__lsp__open_document then mcp__lsp__list_symbols:
mcp__lsp__open_document({ "file_path": "<absolute path>" })
mcp__lsp__list_symbols({ "file_path": "<absolute path>" })
→ returns: list of symbols with kind, line, column
Filter to exported symbols:
- Go: uppercase first letter
- TypeScript/JavaScript:
exportkeyword - Rust:
pubvisibility
Cap at 10 exported symbols maximum. If more than 10 are found, prioritize top-level functions and types; skip constants and variables.
Each filtered symbol becomes an entry point with its file_path, line, and
column.
Step 2 — Per-Symbol Analysis
For each entry point, run the following sub-steps. Where possible, parallelize calls within each step.
2a — Type Info and Docs
Call mcp__lsp__inspect_symbol using position_pattern with the @@
marker (see references/patterns.md):
mcp__lsp__inspect_symbol({
"file_path": "<file>",
"position_pattern": "<symbol@@name>",
"line_scope_start": <line - 5>,
"line_scope_end": <line + 5>
})
→ returns: hover text with type signature and doc comment
Store result as hover_text. If the call fails or returns nothing, set
hover_text to an empty string. Do not stop.
2b — Implementations (capability-gated)
If implementationProvider is available in server capabilities:
mcp__lsp__go_to_implementation({
"file_path": "<file>",
"line": <line>,
"column": <column>
})
→ returns: list of concrete implementation locations
Skip if capability is absent. Record "not supported by this server" rather
than stopping.
2c — Incoming Call Hierarchy (bounded to 2 levels)
If callHierarchyProvider is available:
Level 1 — Direct callers:
mcp__lsp__find_callers({
"file_path": "<file>",
"line": <line>,
"column": <column>,
"direction": "incoming"
})
→ returns: list of direct caller functions with file and line
Level 2 — Callers of callers:
For each Level 1 caller, call mcp__lsp__find_callers once more:
mcp__lsp__find_callers({
"file_path": "<caller file>",
"line": <caller line>,
"column": <caller column>,
"direction": "incoming"
})
→ returns: Level 2 callers
STOP at Level 2 — do not recurse further under any circumstances.
If Level 2 callers > 10: summarize by count and file, do not list individually.
2d — Outgoing Calls (Level 1 only)
If callHierarchyProvider is available:
mcp__lsp__find_callers({
"file_path": "<file>",
"line": <line>,
"column": <column>,
"direction": "outgoing"
})
→ returns: list of functions this symbol calls
Level 1 only — no recursion.
2e — All References
mcp__lsp__find_references({
"file_path": "<file>",
"line": <line>,
"column": <column>,
"include_declaration": false
})
→ returns: every usage site across the workspace
Group by file and count distinct files.
2f — Source
mcp__lsp__get_symbol_source({
"file_path": "<file>",
"line": <line>,
"column": <column>
})
→ returns: implementation body
Step 3 — Synthesize Relationships
After analyzing all entry points, identify cross-symbol relationships:
- Internal calls: Which entry points call each other? (from outgoing calls in Step 2d)
- Shared callers: Which entry points are called by the same Level 1 callers?
- Shared interface: Which entry points implement the same interface? (from Step 2b)
This synthesis step is what distinguishes /lsp-understand from running
multiple /lsp-explore calls. The output is a dependency map, not isolated
per-symbol reports.
Step 4 — Output: Code Map
Produce a structured Code Map with these sections:
## Code Map: <target>
### Summary
<2-3 sentence description of what this code does, synthesized from
hover docs and source reading>
### Symbols (<N> analyzed)
#### <SymbolName>
- **Type:** <type signature from hover>
- **Source:** <file:line>
- **Incoming callers (L1):** <list; count only if > 5>
- **Incoming callers (L2):** <summarized; e.g., "called by 3 HTTP handlers">
- **Outgoing calls:** <what this symbol calls>
- **Implements:** <interface name, if applicable>
- **References:** N sites across M files
### Dependency Relationships
<symbols that call each other, as a simple text diagram or list>
e.g.:
HandlerA → Parse → Validate
HandlerB → Parse
### Entry Points to This Code
<top-level callers that are NOT in this file — where does outside code
call in?>
### Depth-limit Note
Call hierarchy stopped at 2 levels. <N> additional callers exist beyond
Level 2 — use /lsp-explore on specific symbols to drill deeper.
Depth Control Rules
These limits are hard constraints — never exceed them:
- Incoming call hierarchy recursion stops at Level 2
- Outgoing calls: Level 1 only, no recursion
- If Level 2 callers > 10: summarize by count and file, do not list individually
- Do NOT follow call chains beyond these limits under any circumstances
Example
Goal: understand how the file pkg/codec/encoder.go works as a whole
Step 1 — Mode B (file path)
open_document: pkg/codec/encoder.go
list_symbols: pkg/codec/encoder.go
→ exported symbols: Encoder (type), Encode (func), Reset (func), NewEncoder (func)
→ 4 exported symbols (under 10 cap)
get_server_capabilities
→ go_to_implementation: supported
→ find_callers: supported
Step 2 — Per-symbol analysis (run in parallel across symbols)
Symbol: NewEncoder (pkg/codec/encoder.go:12)
inspect_symbol → "func NewEncoder(w io.Writer) *Encoder"
go_to_implementation → 0 (concrete function)
find_callers incoming L1 → 5 callers
find_callers incoming L2 → 3 callers of those callers
find_callers outgoing → calls: bufio.NewWriter
find_references → 5 sites in 3 files
get_symbol_source → implementation body
Symbol: Encode (pkg/codec/encoder.go:28)
inspect_symbol → "func (e *Encoder) Encode(v any) error"
go_to_implementation → implements codec.Encoder interface
find_callers incoming L1 → 8 callers (listed)
find_callers incoming L2 → > 10: "12 additional callers across 5 files"
find_callers outgoing → calls: NewEncoder, e.w.Flush
find_references → 8 sites in 5 files
get_symbol_source → implementation body
(similar for Encoder type and Reset func...)
Step 3 — Synthesize relationships
- Encode calls NewEncoder (internal dependency)
- NewEncoder and Encode share callers in cmd/main.go
- Encode implements codec.Encoder interface
## Code Map: pkg/codec/encoder.go
### Summary
This file implements a streaming JSON encoder backed by a buffered writer.
NewEncoder constructs an Encoder wrapping any io.Writer; Encode serializes
values and flushes. Reset allows reuse without allocation.
### Symbols (4 analyzed)
#### NewEncoder
- **Type:** func NewEncoder(w io.Writer) *Encoder
- **Source:** pkg/codec/encoder.go:12
- **Incoming callers (L1):** cmd.main, app.Start, loader.Load, test.Setup, bench.Run
- **Incoming callers (L2):** 3 callers across 2 files
- **Outgoing calls:** bufio.NewWriter
- **Implements:** n/a
- **References:** 5 sites across 3 files
#### Encode
- **Type:** func (e *Encoder) Encode(v any) error
- **Source:** pkg/codec/encoder.go:28
- **Incoming callers (L1):** 8 callers (cmd/main.go, internal/app.go, ...)
- **Incoming callers (L2):** 12 additional callers across 5 files (depth limit reached)
- **Outgoing calls:** NewEncoder, e.w.Flush
- **Implements:** codec.Encoder
- **References:** 8 sites across 5 files
...
### Dependency Relationships
cmd.main → NewEncoder → bufio.NewWriter
cmd.main → Encode → NewEncoder
Encode → Reset
### Entry Points to This Code
- cmd.main (cmd/main.go:14)
- app.Start (internal/app.go:31)
- loader.Load (internal/loader.go:55)
### Depth-limit Note
Call hierarchy stopped at 2 levels. 12 additional callers exist beyond
Level 2 for Encode — use /lsp-explore on specific symbols to drill deeper.
GitHub 저장소
자주 묻는 질문
lsp-understand Skill이란 무엇인가요?
lsp-understand은(는) blackwell-systems이(가) 만든 Claude Skill입니다. Skill은 Claude가 필요할 때 불러오는 지침과 리소스를 묶어 추가 프롬프트 없이 lsp-understand 관련 작업을 수행할 수 있게 합니다.
lsp-understand은(는) 어떻게 설치하나요?
이 페이지의 설치 명령을 사용하세요. lsp-understand을(를) Claude Code 플러그인으로 추가하거나 저장소를 skills 디렉터리에 복제한 다음 Claude를 다시 시작해 Skill을 불러옵니다.
lsp-understand은(는) 어떤 카테고리에 속하나요?
lsp-understand은(는) 메타 카테고리에 속합니다.
lsp-understand은(는) 무료로 사용할 수 있나요?
네. lsp-understand은(는) AIMCP에 등록되어 있으며 무료로 설치할 수 있습니다.
연관 스킬
이 스킬은 콘텐츠 콜렉션(Content Collections)을 위한 프로덕션 검증된 설정을 제공합니다. 콘텐츠 콜렉션은 Markdown/MDX 파일을 Zod 검증이 포함된 타입 안전한 데이터 콜렉션으로 변환해주는 TypeScript 최우선 도구입니다. 블로그, 문서 사이트 또는 콘텐츠 중심의 Vite + React 애플리케이션을 구축할 때 타입 안전성과 자동 콘텐츠 검증을 보장하기 위해 사용하세요. Vite 플러그인 구성과 MDX 컴파일부터 배포 최적화 및 스키마 검증에 이르기까지 모든 것을 다룹니다.
이 스킬은 개발자들이 Polymarket 예측 시장 플랫폼을 활용한 애플리케이션을 구축할 수 있도록 지원하며, 거래 및 시장 데이터를 위한 API 통합 기능을 포함합니다. 또한 WebSocket을 통한 실시간 데이터 스트리밍을 제공하여 실시간 거래와 시장 활동을 모니터링할 수 있습니다. 이를 통해 거래 전략을 구현하거나 실시간 시장 업데이트를 처리하는 도구를 생성하는 데 활용할 수 있습니다.
이 스킬은 개발자들이 명령어, 파일, LSP 작업 등 25개 이상의 이벤트 유형에 연결되는 OpenCode 플러그인을 만들 수 있도록 돕습니다. JavaScript/TypeScript 모듈을 위한 플러그인 구조, 이벤트 API 명세, 구현 패턴을 제공합니다. OpenCode AI 어시스턴트의 라이프사이클을 사용자 정의 이벤트 기반 로직으로 가로채거나, 모니터링하거나, 확장해야 할 때 사용하세요.
SGLang은 RadixAttention 프리픽스 캐싱을 활용하여 JSON, 정규식, 에이전트 워크플로우를 위한 고속 구조화 생성에 특화된 고성능 LLM 서빙 프레임워크입니다. 특히 반복되는 프리픽스가 있는 작업에서 상당히 빠른 추론 속도를 제공하여 복잡한 구조화 출력 및 다중 턴 대화에 이상적입니다. 제약 디코딩이 필요하거나 광범위한 프리픽스 공유가 있는 애플리케이션을 구축할 때는 vLLM과 같은 대안보다 SGLang을 선택하십시오.
