Expert guide for automated and manual Web Accessibility (a11y) testing — axe-core, Pa11y, Playwright a11y, screen reader testing, and WCAG 2.2 Level AA/AAA compliance / Panduan ahli pengujian aksesibilitas web.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Expert guide for in-memory Abstract Syntax Tree (AST) code knowledge graphs, real-time symbol dependency mapping, refactoring blast radius calculation, and dead code eradication / Panduan ahli graf pengetahuan AST kode in-memory, pemetaan dependensi simbol real-time, kalkulasi radius dampak refaktor, dan pembersihan kode mati.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
설치 방법 보기설치하기 전에 에이전트에게 전달되는 지시 내용을 확인할 수 있습니다.
<a name="english"></a>
Connects and orchestrates with brainstorming, zero-to-prod-orchestrator, typescript-expert, scalability-clean-code, zero-tech-debt-auditor, and autonomous-api-drift-healer to provide real-time AST dependency graphs, blast-radius calculation, and structural intelligence for multi-agent code transformations.
Production guide for constructing and querying in-memory Abstract Syntax Tree (AST) knowledge graphs across multi-file and monorepo codebases. Enables autonomous agents to navigate complex symbol relationships, calculate refactoring blast radii, eliminate circular dependencies, determine optimal topological generation sequences, and prune unreachable code without relying on fuzzy string matching.
Activate this skill when:
import ts from 'typescript';
import fs from 'fs';
import path from 'path';
export interface SymbolNode {
filePath: string;
name: string;
kind: 'function' | 'class' | 'interface' | 'variable' | 'type';
dependencies: string[];
}
export interface CodebaseGraph {
nodes: Map<string, SymbolNode>;
edges: Map<string, Set<string>>;
}
export class LivingCodebaseASTGraph {
private program: ts.Program;
private checker: ts.TypeChecker;
private graph: CodebaseGraph;
constructor(rootFiles: string[], options: ts.CompilerOptions = {}) {
this.program = ts.createProgram(rootFiles, {
target: ts.ScriptTarget.ES2022,
module: ts.ModuleKind.NodeNext,
...options
});
this.checker = this.program.getTypeChecker();
this.graph = {
nodes: new Map(),
edges: new Map()
};
this.buildGraph();
}
private buildGraph(): void {
for (const sourceFile of this.program.getSourceFiles()) {
if (sourceFile.isDeclarationFile || sourceFile.fileName.includes('node_modules')) {
continue;
}
this.analyzeSourceFile(sourceFile);
}
}
private analyzeSourceFile(sourceFile: ts.SourceFile): void {
const filePath = path.resolve(sourceFile.fileName);
ts.forEachChild(sourceFile, (node) => {
if (ts.isFunctionDeclaration(node) && node.name) {
this.registerSymbol(filePath, node.name.text, 'function', node);
} else if (ts.isClassDeclaration(node) && node.name) {
this.registerSymbol(filePath, node.name.text, 'class', node);
} else if (ts.isInterfaceDeclaration(node) && node.name) {
this.registerSymbol(filePath, node.name.text, 'interface', node);
}
});
}
private registerSymbol(
filePath: string,
name: string,
kind: SymbolNode['kind'],
node: ts.Node
): void {
const symbolKey = `${filePath}#${name}`;
const dependencies: string[] = [];
const visit = (child: ts.Node) => {
if (ts.isIdentifier(child)) {
const symbol = this.checker.getSymbolAtLocation(child);
if (symbol && symbol.declarations && symbol.declarations.length > 0) {
const declFile = symbol.declarations[0].getSourceFile().fileName;
if (!declFile.includes('node_modules') && !declFile.endsWith('.d.ts')) {
const targetKey = `${path.resolve(declFile)}#${symbol.getName()}`;
if (targetKey !== symbolKey) {
dependencies.push(targetKey);
}
}
}
}
ts.forEachChild(child, visit);
};
visit(node);
this.graph.nodes.set(symbolKey, { filePath, name, kind, dependencies });
if (!this.graph.edges.has(symbolKey)) {
this.graph.edges.set(symbolKey, new Set(dependencies));
}
}
public calculateBlastRadius(symbolKey: string): string[] {
const affected = new Set<string>();
const queue = [symbolKey];
while (queue.length > 0) {
const current = queue.shift()!;
for (const [nodeKey, deps] of this.graph.edges.entries()) {
if (deps.has(current) && !affected.has(nodeKey)) {
affected.add(nodeKey);
queue.push(nodeKey);
}
}
}
return Array.from(affected);
}
}
Autonomous swarms must construct files in strict topological order to avoid compiling against non-existent types:
[Core Domain Types / Schemas]
│
▼
[Persistence Layer & ORM Repositories]
│
▼
[Business Services & Interactors]
│
▼
[API Handlers / Controllers]
│
▼
[Client SDKs & Frontend Hooks]
| Anti-Pattern | Blast Consequence | Correct AST Engineering |
|---|---|---|
| Global find-and-replace for variable renaming | Corrupts unrelated variables sharing identical names | Use AST symbol binding via ts.TypeChecker |
| Parallel multi-file generation without topological sort | Subagent attempts to import interfaces that do not exist | Sequence subagents using Directed Acyclic Graph (DAG) levels |
| Ignoring circular module references | Silent runtime initialization undefined bugs | Traverse graph using Tarjan's SCC algorithm |
typescript-expert — Provide low-level TypeScript AST manipulation and type checking APIs.zero-tech-debt-auditor — Feed dead symbol lists to the automated dead code elimination pipeline.autonomous-api-drift-healer — Calculate client-side impact when backend API contracts drift.scalability-clean-code — Enforce Clean Architecture boundary rules between modules.brainstorming — Added to "Arsitektur & Skala" and "Penemuan & Audit" matrix rows.zero-to-prod-orchestrator — Integrated in Phase 2 (Foundation) and Phase 6 (Testing & QA).<a name="bahasa-indonesia"></a>
Terhubung dan mengorkestrasi dengan brainstorming, zero-to-prod-orchestrator, typescript-expert, scalability-clean-code, zero-tech-debt-auditor, dan autonomous-api-drift-healer untuk menyediakan graf dependensi AST real-time, kalkulasi radius dampak refaktor, dan inteligensi struktural untuk transformasi kode multi-agen.
Panduan produksi untuk membangun dan menavigasi graf pengetahuan Abstract Syntax Tree (AST) in-memory pada proyek perangkat lunak berskala besar dan monorepo. Memungkinkan agen otonom untuk memahami relasi simbolik, menghitung radius dampak (blast radius) sebelum refaktor, mendeteksi dependensi melingkar (circular dependency), menentukan urutan pembuatan kode secara topologis, dan membersihkan kode mati tanpa mengandalkan pencarian teks biasa.
Aktifkan skill ini ketika:
Saat mengubah suatu fungsi inti atau tipe data:
ts.TypeChecker.Pastikan sub-agen AI membangun file berdasarkan tingkatan hierarki DAG:
undefined saat runtime.zero-tech-debt-auditor untuk membersihkan fungsi dan tipe yang tidak memiliki referensi masuk (inbound edges).| Praktik Buruk | Dampak Buruk | Solusi Rekayasa |
|---|---|---|
| Mengganti nama fungsi dengan string replace biasa | Merusak properti objek atau komentar yang kebetulan memiliki nama yang sama | Gunakan binding simbol AST dari TypeScript Compiler API |
| Memerintahkan sub-agen membuat UI sebelum tipe data siap | Muncul error tipe hilang dan kompilasi gagal | Susun urutan pembuatan secara topologis (Topological Sort) |
| Membiarkan import melingkar (circular imports) | Bug runtime sulit dilacak saat aplikasi diinisialisasi | Lakukan pengecekan siklus AST pada CI pipeline |
typescript-expert — Manipulasi AST tingkat lanjut dan pemeriksaan tipe TypeScript.zero-tech-debt-auditor — Menyuplai daftar ekspor mati ke pipeline pembersihan kode.autonomous-api-drift-healer — Menghitung dampak pada sisi klien saat kontrak API backend berubah.scalability-clean-code — Menegakkan batas arsitektur bersih antar modul.brainstorming — Tambahkan ke baris "Arsitektur & Skala" dan "Penemuan & Audit" pada Matriks Orkestrasi.zero-to-prod-orchestrator — Tambahkan ke Fase 2 (Pondasi Proyek) dan Fase 6 (Pengujian Otomatis & Keamanan).아직 리뷰가 없습니다. 사용해 본 소감을 남겨 주세요.
로그인 없이 쓸 수 있습니다. 사용 후기, 질문, 작동하지 않은 환경 등을 편하게 남겨 주세요.
아직 댓글이 없습니다. 첫 댓글을 남겨 보세요.
Expert guide for automated and manual Web Accessibility (a11y) testing — axe-core, Pa11y, Playwright a11y, screen reader testing, and WCAG 2.2 Level AA/AAA compliance / Panduan ahli pengujian aksesibilitas web.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Expert guide for intelligent model cascading and routing — complexity-scored task routing from Flash/Haiku to Sonnet/Opus/Astra, dynamic escalation with quality gates, 40-60% token cost reduction while maintaining output quality / Panduan ahli untuk kaskade dan routing model cerdas — routing tugas berbasis skor kompleksitas dari Flash/Haiku ke Sonnet/Opus/Astra, eskalasi dinamis dengan gerbang kualitas, pengurangan biaya token 40-60% dengan kualitas output terjaga.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Expert guide for Affective Computing, emotional AI, and real-time sentiment analysis through native multimodal tokens (voice intonation and facial micro-expressions) / Panduan ahli komputasi afektif, AI emosional, dan analisis sentimen real-time melalui token multimodal native.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Expert guide for AI-assisted coding workflows — agentic code generation, multi-agent code swarms, self-healing CI/CD, automated PR review, spec-to-code pipelines, codebase knowledge graphs, and human-in-the-loop approval gates / Panduan ahli untuk workflow pengkodean berbasis AI — generasi kode agentic, code swarm multi-agen, CI/CD self-healing, review PR otomatis, pipeline spec-to-code, knowledge graph codebase, dan gate persetujuan human-in-the-loop.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Expert guide for autonomous Machine-to-Machine (M2M) agent settlement, dual-rail fiat & stablecoin micro-clearing, dynamic budget envelopes, and cryptographic agent invoicing / Panduan ahli settlement otonom antar-agen (M2M), kliring mikro dual-rail fiat & stablecoin, pagu anggaran dinamis, dan penagihan agen kriptografis.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Expert guide for long-term episodic memory integration (Mem0 v2, Letta/MemGPT, Zep v2), memory tier architecture, pgvector HNSW storage, and unified context management for autonomous AI agents / Panduan ahli untuk integrasi memori episodik jangka panjang (Mem0 v2, Letta/MemGPT, Zep v2), arsitektur tier memori, penyimpanan pgvector HNSW, dan manajemen konteks terpadu untuk agen AI otonom.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.