agx-tui 0.2.1

Step-through debugger for your agent — terminal-native session timeline viewer for Claude Code, Codex, Gemini, LangChain, Vercel AI SDK, and OpenTelemetry GenAI traces
Documentation
1
2
3
4
5
6
7
8
9
{"type":"permission-mode","permissionMode":"default","sessionId":"00000000-0000-4000-8000-000000000000"}
{"type":"user","uuid":"00000000-0000-4000-8000-000000000001","parentUuid":null,"timestamp":"2024-01-01T00:00:00Z","message":{"role":"user","content":"Write a Python function that returns the first n Fibonacci numbers."}}
{"type":"assistant","uuid":"00000000-0000-4000-8000-000000000002","parentUuid":"00000000-0000-4000-8000-000000000001","timestamp":"2024-01-01T00:00:01Z","message":{"role":"assistant","model":"claude-opus-4-6","usage":{"input_tokens":500,"output_tokens":120,"cache_creation_input_tokens":1500,"cache_read_input_tokens":0},"content":[{"type":"text","text":"I'll create a fib.py with an iterative implementation — single pass, O(n) time, O(n) space for the result list."},{"type":"tool_use","id":"toolu_synthetic_001","name":"Write","input":{"file_path":"fib.py","content":"def fib(n):\n    \"\"\"Return the first n Fibonacci numbers.\"\"\"\n    a, b = 0, 1\n    result = []\n    for _ in range(n):\n        result.append(a)\n        a, b = b, a + b\n    return result\n"}}]}}
{"type":"user","uuid":"00000000-0000-4000-8000-000000000003","parentUuid":"00000000-0000-4000-8000-000000000002","timestamp":"2024-01-01T00:00:02Z","message":{"role":"user","content":[{"type":"tool_result","tool_use_id":"toolu_synthetic_001","content":"File created successfully at fib.py"}]}}
{"type":"assistant","uuid":"00000000-0000-4000-8000-000000000004","parentUuid":"00000000-0000-4000-8000-000000000003","timestamp":"2024-01-01T00:00:03Z","message":{"role":"assistant","model":"claude-opus-4-6","usage":{"input_tokens":100,"output_tokens":40,"cache_creation_input_tokens":0,"cache_read_input_tokens":2100},"content":[{"type":"text","text":"Let me verify it works for n=10."},{"type":"tool_use","id":"toolu_synthetic_002","name":"Bash","input":{"command":"python3 -c 'from fib import fib; print(fib(10))'"}}]}}
{"type":"user","uuid":"00000000-0000-4000-8000-000000000005","parentUuid":"00000000-0000-4000-8000-000000000004","timestamp":"2024-01-01T00:00:04Z","message":{"role":"user","content":[{"type":"tool_result","tool_use_id":"toolu_synthetic_002","content":"[0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n"}]}}
{"type":"assistant","uuid":"00000000-0000-4000-8000-000000000006","parentUuid":"00000000-0000-4000-8000-000000000005","timestamp":"2024-01-01T00:00:05Z","message":{"role":"assistant","model":"claude-opus-4-6","usage":{"input_tokens":80,"output_tokens":110,"cache_creation_input_tokens":0,"cache_read_input_tokens":2260},"content":[{"type":"text","text":"Now let me add a test to make sure edge cases work."},{"type":"tool_use","id":"toolu_synthetic_003","name":"Edit","input":{"file_path":"fib.py","old_string":"def fib(n):","new_string":"def fib(n):\n    if n < 0:\n        raise ValueError('n must be non-negative')\n    if n == 0:\n        return []"}}]}}
{"type":"user","uuid":"00000000-0000-4000-8000-000000000007","parentUuid":"00000000-0000-4000-8000-000000000006","timestamp":"2024-01-01T00:00:06Z","message":{"role":"user","content":[{"type":"tool_result","tool_use_id":"toolu_synthetic_003","content":"The file fib.py has been updated successfully."}]}}
{"type":"assistant","uuid":"00000000-0000-4000-8000-000000000008","parentUuid":"00000000-0000-4000-8000-000000000007","timestamp":"2024-01-01T00:00:07Z","message":{"role":"assistant","model":"claude-opus-4-6","usage":{"input_tokens":60,"output_tokens":75,"cache_creation_input_tokens":0,"cache_read_input_tokens":2450},"content":[{"type":"text","text":"Done. The function handles n=0 (returns empty list), n>0 (returns iterative sequence), and n<0 (raises ValueError). Verified for n=10 with expected output [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]."}]}}