c50699d5e6
<!-- CURSOR_SUMMARY --> > [!NOTE] > **Medium Risk** > Touches multiple toolkits’ runtime entrypoints and context/error/auth plumbing, so breakage risk is mainly around invocation/packaging and tool execution wiring rather than business logic. > > **Overview** > Migrates the BrightData, ClickHouse, LinkedIn, Math, MongoDB, Postgres, and Zendesk OSS toolkits from `arcade-tdk` to `arcade-mcp-server` APIs by updating tool decorators, `Context` types, auth classes, and exception imports. > > Adds per-toolkit `__main__.py` files that construct an `MCPApp`, register module tools, and run via configurable transport/host/port; corresponding `pyproject.toml` updates bump versions, drop `arcade-tdk`/`arcade-serve` deps, and add `project.scripts` console entrypoints. > > Updates tests and eval suites to use `arcade_mcp_server.Context` (mocked) and switches eval `ToolCatalog` imports to `arcade_core`. > > <sup>Written by [Cursor Bugbot](https://cursor.com/dashboard?tab=bugbot) for commit 9b3e31acb4b35e1d72efd47e2d279c5b19e3ecb0. This will update automatically on new commits. Configure [here](https://cursor.com/dashboard?tab=bugbot).</sup> <!-- /CURSOR_SUMMARY -->
49 lines
1.3 KiB
Python
49 lines
1.3 KiB
Python
import math
|
|
from typing import Annotated
|
|
|
|
from arcade_mcp_server import tool
|
|
from arcade_mcp_server.metadata import Behavior, ToolMetadata
|
|
|
|
|
|
@tool(
|
|
metadata=ToolMetadata(
|
|
behavior=Behavior(
|
|
read_only=True,
|
|
destructive=False,
|
|
idempotent=True,
|
|
open_world=False,
|
|
),
|
|
),
|
|
)
|
|
def gcd(
|
|
a: Annotated[str, "First integer as a string"],
|
|
b: Annotated[str, "Second integer as a string"],
|
|
) -> Annotated[str, "The greatest common divisor of a and b as a string"]:
|
|
"""
|
|
Calculate the greatest common divisor (GCD) of two integers.
|
|
"""
|
|
return str(math.gcd(int(a), int(b)))
|
|
|
|
|
|
@tool(
|
|
metadata=ToolMetadata(
|
|
behavior=Behavior(
|
|
read_only=True,
|
|
destructive=False,
|
|
idempotent=True,
|
|
open_world=False,
|
|
),
|
|
),
|
|
)
|
|
def lcm(
|
|
a: Annotated[str, "First integer as a string"],
|
|
b: Annotated[str, "Second integer as a string"],
|
|
) -> Annotated[str, "The least common multiple of a and b as a string"]:
|
|
"""
|
|
Calculate the least common multiple (LCM) of two integers.
|
|
Returns "0" if either integer is 0.
|
|
"""
|
|
a_int, b_int = int(a), int(b)
|
|
if a_int == 0 or b_int == 0:
|
|
return "0"
|
|
return str(abs(a_int * b_int) // math.gcd(a_int, b_int))
|