/**
 * The `websearch` capability: run a web query and hand the model a ranked list
 * of hits.
 *
 * The query is sent to DuckDuckGo's no-frills HTML endpoint, whose markup is
 * lightweight enough to scrape with a couple of targeted regular expressions —
 * no headless browser, no HTML parser dependency. Each hit is distilled to the
 * three fields a model actually reasons over: a title, the destination URL, and
 * a short snippet. The list is capped (by `maxResults`, with a sane default and
 * a hard ceiling) and the whole payload is byte-bounded through the context's
 * {@link OutputBudget} so a chatty results page can never overflow the window.
 *
 * Network reachability is never guaranteed, so every failure mode — a thrown
 * fetch, a non-OK status, a body that yields nothing parseable — is turned into
 * an `isError` {@link ToolResult} rather than an exception. The caller (and the
 * model) always gets a well-typed result back.
 *
 * Authored against the kernel surface plus the Web-standard `fetch` global.
 * There is no filesystem or shell work here, and DuckDuckGo has no kernel seam,
 * so the only outside primitive used is `fetch` — the platform networking API,
 * not a node-specific module.
 */
export declare const webSearchTool: import("..").DefinedTool;
