一键导入
pool
Run N tasks under a concurrency cap K via a sliding-window worker pool. Use when many subagent invocations would otherwise hit provider rate limits.
用 Codex 或 Claude 帮你安装 复制这段 Prompt,粘贴到 Codex、Claude 或其他助手里,让它检查 Skill 页面并帮你完成安装。
菜单
Run N tasks under a concurrency cap K via a sliding-window worker pool. Use when many subagent invocations would otherwise hit provider rate limits.
用 Codex 或 Claude 帮你安装 复制这段 Prompt,粘贴到 Codex、Claude 或其他助手里,让它检查 Skill 页面并帮你完成安装。
基于 SOC 职业分类
Technical reference for OpenSage-ADK — a Google ADK-based framework for long-horizon, tool-heavy AI agents. Covers architecture, configuration, customization, extension, and production agent patterns.
Find testcase IDs (TESTCASE nodes) that cover a given function (METHOD node) in Neo4j.
Code coverage analysis tools. These tools help analyze and visualize code coverage for test execution, upload coverage data to Neo4j, and display coverage statistics. Available tools: run-coverage, show-coverage.
Disciplined diagnosis loop for hard bugs and performance regressions. Reproduce → minimise → hypothesise → instrument → fix → regression-test. Use when user says "diagnose this" / "debug this", reports a bug, says something is broken/throwing/failing, or describes a performance regression.
Standalone `mmp` executable for managing multiple MCP servers from a loaded gateway config.
Neo4j database management and query tools. These tools help interact with Neo4j databases for code analysis, graph queries, and data management. Available tools: neo4j-query.
| name | pool |
| description | Run N tasks under a concurrency cap K via a sliding-window worker pool. Use when many subagent invocations would otherwise hit provider rate limits. |
Many tasks (say 20) to run via subagents, but provider RPM/TPM (or memory) caps how many can run at once (say 6). Maintain a sliding window of K active subagents.
tasks = [task_1, task_2, ..., task_N]
K = 6 # concurrency cap
active = {} # sid -> task_id
done = {} # task_id -> final result text
while tasks or active:
# Fill the pool up to K
while tasks and len(active) < K:
t = tasks.pop(0)
r = call_subagent(agent_name="worker", request=t.prompt, mode="async")
active[r.session_id] = t.id
# Short-poll for any one to finish, then drain
for sid in list(active.keys()):
r = wait_for_subagent(sid, timeout=1.0)
if r.success and r.state in ("sleeping", "unloaded"):
done[active[sid]] = read_inbox_for(sid)
del active[sid]
break # restart fill loop
Key points:
wait_for_subagent with a small timeout polls; loop until one finishes.None — pure orchestration.