Nobody's vibed yet. Be the first 👇

`;\n }\n const cards = notes.map((n) => html`\n

\n @${n.author}\n

${n.body}

\n `).join(\"\\n\");\n return raw(cards);\n}\n\nfunction page(opts: { visitor: string; visits: number; vibe: string; notes: Note[] }) {\n const { visitor, visits, vibe, notes } = opts;\n return html`\n\n \n \n \n The Vibe Board\n \n \n \n

✨ The Vibe Board

Welcome, ${visitor}. Leave a mark.

\n Vibe of the day: ${vibe}\n

\n ${visits} visits\n ${notes.length} notes\n

\n \n

Guestbook

\n ${noteCards(notes)}\n

\n \n \n \n`;\n}\n\n// ---- routes ----\napp.get(\"/\", async (c) => {\n await sqlite.execute(\"INSERT INTO visits DEFAULT VALUES\");\n const [{ count }] = (await sqlite.execute(\"SELECT COUNT(*) AS count FROM visits\")).rows;\n const visits = Number(count ?? 0);\n\n const viewer = await getViewer(c.req.raw);\n const visitor = viewer?.username ?? \"mysterious stranger\";\n\n const notes = (await sqlite.execute(\"SELECT * FROM notes ORDER BY id DESC LIMIT 50\")).rows as Note[];\n\n const dateStr = new Date().toISOString().slice(0, 10);\n const vibe = (await blob.getJSON(\"vibe:\" + dateStr)) ?? vibeFor(dateStr);\n\n return c.html(page({ visitor, visits, vibe, notes }));\n});\n\n// Accept the form POST (browser) and also tolerate JSON or raw text bodies\napp.post(\"/\", async (c) => {\n let body = \"\";\n const ct = c.req.header(\"content-type\") ?? \"\";\n if (ct.includes(\"application/json\")) {\n const j = await c.req.json().catch(() => ({}));\n body = String(j?.body ?? \"\");\n } else if (ct.includes(\"x-www-form-urlencoded\")) {\n const form = await c.req.formData();\n body = String(form.get(\"body\") ?? \"\");\n } else {\n const text = await c.req.text();\n body = String(new URLSearchParams(text).get(\"body\") ?? \"\");\n }\n body = body.trim().slice(0, 200);\n const viewer = await getViewer(c.req.raw);\n const author = viewer?.username ?? \"anonymous\";\n if (body) {\n await sqlite.execute({\n sql: \"INSERT INTO notes (author, body, created_at) VALUES (?, ?, ?)\",\n args: [author, body, new Date().toISOString()],\n });\n }\n return c.redirect(\"/\");\n});\n\napp.get(\"/api/notes\", async (c) => {\n const notes = await sqlite.execute(\"SELECT * FROM notes ORDER BY id DESC LIMIT 50\");\n return c.json(notes.rows);\n});\n\nexport default app.fetch;\n","vibe-board",[],[208],"88251558-9580-43e2-9fde-53fab452a1d2","daily-vibe.ts","f6b70862-a3aa-11f1-9ea1-1607ee4eb77e",3,["D",1788009010407],"interval","/**\n * Daily cron: stores today's \"vibe of the day\" in the val's blob storage.\n * The HTTP app reads it back so the vibe rolls over once per day.\n */\nimport { blob } from \"https://esm.town/v/std/blob/main.ts\";\nimport { vibeFor } from \"./vibes.ts\";\n\nexport default async function (_interval: Interval) {\n const dateStr = new Date().toISOString().slice(0, 10);\n await blob.setJSON(\"vibe:\" + dateStr, vibeFor(dateStr));\n console.log(`Set vibe of the day (${dateStr}): ${vibeFor(dateStr)}`);\n}\n",[],[218],"e04868cf-2699-4ab8-9492-7928c4301833","README.md","573fd4a2-a3ab-11f1-9ea1-1607ee4eb77e",11,["D",1788009169895],"# ✨ The Vibe Board\n\nA tiny public guestbook that showcases a handful of **Val Town basics** in one little app. Anyone with the link can drop a one-liner on the board, and a fresh \"vibe of the day\" rolls over every morning.\n\n## 🌐 Live\n\n[Try the app](url:main.ts) · lives at \n\n## What it demonstrates\n\n| Capability | Where |\n| --- | --- |\n| 🚀 HTTP endpoint | [`main.ts`](main.ts) — Hono server, served at a custom subdomain |\n| 🗄️ SQLite | [`main.ts`](main.ts) — visitor counter + guestbook notes via `std/sqlite` |\n| ☁️ Blob storage | [`daily-vibe.ts`](daily-vibe.ts) — the daily vibe persisted via `std/blob` |\n| 🕐 Interval cron | [`daily-vibe.ts`](daily-vibe.ts) — runs at `10 0 * * *` (UTC) |\n| 👤 Viewer identity | [`main.ts`](main.ts) — greets logged-in visitors via `X-Val-Town-User` |\n\n## Files\n\n- **`main.ts`** — the HTTP app: renders the page, accepts POSTs, and exposes a JSON API at `/api/notes`.\n- **`vibes.ts`** — a shared list of vibes + the deterministic `vibeFor(date)` picker.\n- **`daily-vibe.ts`** — a nightly cron that stores today's vibe in blob storage.\n\n## Try it\n\n- Visit for the raw guestbook as JSON.\n- Post a vibe in the box on the homepage — it's stored in SQLite and shown to everyone.\n\n## Notes\n\n- Code runs on Val Town's Deno runtime — no filesystem, so state lives in `std/sqlite` and `std/blob`.\n- The cron sets a blob key per date; if it hasn't run yet, the app falls back to computing the same vibe deterministically.\n",[],[227],"7b271cb4-d5ba-4407-9a0b-f42715b3d51c","todo_list.py","fb3b1188-a546-11f1-980b-1607ee4eb77e","eae93186-1417-4d16-a731-f2fc5bf3a7bd",19,["D",1788185970634],"#!/usr/bin/env python3\n\"\"\"A simple command-line todo list.\n\nTasks are saved to a JSON file so they persist between runs.\n\nUsage:\n python todo_list.py add \"Buy milk\"\n python todo_list.py list\n python todo_list.py done 1\n python todo_list.py remove 1\n\"\"\"\n\nimport json\nimport os\nimport sys\n\nDATA_FILE = os.path.join(os.path.dirname(os.path.abspath(__file__)), \"todos.json\")\n\n\ndef load_todos():\n if os.path.exists(DATA_FILE):\n with open(DATA_FILE, \"r\", encoding=\"utf-8\") as f:\n return json.load(f)\n return []\n\n\ndef save_todos(todos):\n with open(DATA_FILE, \"w\", encoding=\"utf-8\") as f:\n json.dump(todos, f, indent=2)\n\n\ndef show(todos):\n if not todos:\n print(\"No tasks yet. Add one with: python todo_list.py add \\\"task\\\"\")\n return\n for i, task in enumerate(todos, 1):\n status = \"[x]\" if task.get(\"done\") else \"[ ]\"\n print(f\"{status} {i}. {task['text']}\")\n\n\ndef main():\n if len(sys.argv) < 2:\n print(__doc__)\n sys.exit(1)\n\n command = sys.argv[1]\n todos = load_todos()\n\n if command == \"add\":\n if len(sys.argv) < 3:\n print(\"Usage: python todo_list.py add \\\"task\\\"\")\n sys.exit(1)\n todos.append({\"text\": sys.argv[2], \"done\": False})\n save_todos(todos)\n print(f\"Added: {sys.argv[2]}\")\n elif command == \"list\":\n show(todos)\n elif command == \"done\":\n idx = int(sys.argv[2]) - 1\n if 0 <= idx < len(todos):\n todos[idx][\"done\"] = True\n save_todos(todos)\n print(f\"Marked done: {todos[idx]['text']}\")\n else:\n print(\"Invalid task number.\")\n elif command == \"remove\":\n idx = int(sys.argv[2]) - 1\n if 0 <= idx < len(todos):\n removed = todos.pop(idx)\n save_todos(todos)\n print(f\"Removed: {removed['text']}\")\n else:\n print(\"Invalid task number.\")\n else:\n print(f\"Unknown command: {command}\",\n file=sys.stderr)\n sys.exit(1)\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,235],"python","ac3c264e-d544-4278-8943-885f52a608ff","todo.py","f762c7d6-a546-11f1-99f5-1607ee4eb77e",16,["D",1788185964186],"#!/usr/bin/env python3\n\"\"\"A simple command-line todo list manager.\n\nData is persisted in a JSON file (default: todos.json).\n\nUsage:\n python todo.py add \"Buy milk\" # add a task\n python todo.py list # list all tasks\n python todo.py list --done # list only done tasks\n python todo.py done # mark a task done\n python todo.py remove # remove a task\n python todo.py clear # remove all tasks\n\"\"\"\n\nimport json\nimport os\nimport sys\n\nDB_FILE = os.path.join(os.path.dirname(os.path.abspath(__file__)), \"todos.json\")\n\n\ndef load_todos():\n \"\"\"Load the task list from disk.\"\"\"\n if not os.path.exists(DB_FILE):\n return []\n with open(DB_FILE, \"r\", encoding=\"utf-8\") as f:\n return json.load(f)\n\n\ndef save_todos(todos):\n \"\"\"Persist the task list to disk.\"\"\"\n with open(DB_FILE, \"w\", encoding=\"utf-8\") as f:\n json.dump(todos, f, indent=2)\n\n\ndef next_id(todos):\n \"\"\"Return the next available task id.\"\"\"\n return max((t[\"id\"] for t in todos), default=0) + 1\n\n\ndef add_task(todos, title):\n todos.append({\"id\": next_id(todos), \"title\": title, \"done\": False})\n save_todos(todos)\n print(f\"Added task: {title}\")\n\n\ndef list_tasks(todos, only_done=False):\n if not todos:\n print(\"No tasks yet. Add one with: python todo.py add \")\n return\n\n shown = [t for t in todos if t[\"done\"] == only_done] if only_done else todos\n if only_done and not shown:\n print(\"No completed tasks yet.\")\n return\n\n print(f\"{'ID':<4}{'Status':<8}Task\")\n print(\"-\" * 40)\n for t in shown:\n status = \"✓ done\" if t[\"done\"] else \"☐ todo\"\n print(f\"{t['id']:<4}{status:<8}{t['title']}\")\n\n\ndef mark_done(todos, task_id):\n for t in todos:\n if t[\"id\"] == task_id:\n t[\"done\"] = True\n save_todos(todos)\n print(f\"Marked task {task_id} as done.\")\n return\n print(f\"No task with id {task_id} found.\")\n\n\ndef remove_task(todos, task_id):\n for i, t in enumerate(todos):\n if t[\"id\"] == task_id:\n removed = todos.pop(i)\n save_todos(todos)\n print(f\"Removed task: {removed['title']}\")\n return\n print(f\"No task with id {task_id} found.\")\n\n\ndef clear_todos(todos):\n save_todos([])\n print(\"Cleared all tasks.\")\n\n\ndef main():\n if len(sys.argv) < 2:\n print(__doc__)\n sys.exit(1)\n\n command = sys.argv[1]\n todos = load_todos()\n\n if command == \"add\":\n if len(sys.argv) < 3 or not sys.argv[2].strip():\n print(\"Usage: python todo.py add \")\n sys.exit(1)\n add_task(todos, \" \".join(sys.argv[2:]))\n\n elif command == \"list\":\n only_done = \"--done\" in sys.argv[2:]\n list_tasks(todos, only_done=only_done)\n\n elif command == \"done\":\n if len(sys.argv) < 3:\n print(\"Usage: python todo.py done \")\n sys.exit(1)\n mark_done(todos, int(sys.argv[2]))\n\n elif command == \"remove\":\n if len(sys.argv) < 3:\n print(\"Usage: python todo.py remove \")\n sys.exit(1)\n remove_task(todos, int(sys.argv[2]))\n\n elif command == \"clear\":\n clear_todos(todos)\n\n else:\n print(f\"Unknown command: {command}\")\n print(__doc__)\n sys.exit(1)\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,245],"0285dadf-8c0a-40f5-a6e9-9b4a24ba3945","simple_clock.py","055e5274-a547-11f1-8f32-1607ee4eb77e",26,["D",1788185987641],"#!/usr/bin/env python3\n\"\"\"A simple live digital clock and a ticking analog-style clock face.\n\nPrints a real-time clock that updates in the terminal.\nRequires Tkinter for the windowed clock (bundled with most Python installs).\n\"\"\"\n\nimport sys\nimport time\n\n\ndef terminal_clock():\n \"\"\"Print a live HH:MM:SS clock in the terminal (Ctrl+C to exit).\"\"\"\n print(\"Press Ctrl+C to stop.\\n\")\n try:\n while True:\n sys.stdout.write(\"\\r\")\n sys.stdout.write(time.strftime(\"%H:%M:%S \"))\n sys.stdout.flush()\n time.sleep(1)\n except KeyboardInterrupt:\n sys.stdout.write(\"\\nStopped.\\n\")\n\n\nclock_view = None # populated if tkinter demo is used\n\n\ndef window_clock():\n \"\"\"Show a digital clock in a Tkinter window.\"\"\"\n import tkinter as tk\n\n root = tk.Tk()\n root.title(\"Simple Clock\")\n\n label = tk.Label(root, font=(\"Helvetica\", 48), fg=\"white\", bg=\"black\",\n width=10)\n label.pack(padx=20, pady=20)\n\n def tick():\n label.config(text=time.strftime(\"%H:%M:%S\"))\n root.after(1000, tick)\n\n tick()\n root.mainloop()\n\n\ndef main():\n if len(sys.argv) >= 2 and sys.argv[1] == \"--window\":\n window_clock()\n else:\n terminal_clock()\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,253],"34bbe586-683b-4460-a5ee-b52c31773755","simple_calculator.py","0566d782-a547-11f1-8f32-1607ee4eb77e",27,["D",1788185987693],"#!/usr/bin/env python3\n\"\"\"A simple calculator.\n\nUsage:\n python simple_calculator.py # interactive REPL\n python simple_calculator.py 5 + 3 # one-shot\n python simple_calculator.py 10 / 4 # supports + - * / ** %\n\n Type one of these to exit: exit, quit, q\n\"\"\"\n\nimport operator\nimport sys\n\nOPS = {\n \"+\": operator.add,\n \"-\": operator.sub,\n \"*\": operator.mul,\n \"/\": operator.truediv,\n \"**\": operator.pow,\n \"%\": operator.mod,\n}\n\n\ndef calculate(a, op, b):\n if op not in OPS:\n raise ValueError(f\"Unsupported operator '{op}'\")\n if op == \"/\" and b == 0:\n raise ZeroDivisionError(\"division by zero\")\n if op == \"%\" and b == 0:\n raise ZeroDivisionError(\"modulo by zero\")\n return OPS[op](a, b)\n\n\ndef main():\n if len(sys.argv) >= 4:\n a, op, b = float(sys.argv[1]), sys.argv[2], float(sys.argv[3])\n try:\n print(f\"{a:g} {op} {b:g} = {calculate(a, op, b):g}\")\n except (ValueError, ZeroDivisionError) as err:\n print(f\"Error: {err}\", file=sys.stderr)\n sys.exit(1)\n return\n\n print(\"Simple Calculator — enter like: 5 + 3 (operators: + - * / ** %)\")\n while True:\n try:\n line = input(\"> \").strip().lower()\n except (EOFError, KeyboardInterrupt):\n print()\n break\n if line in {\"exit\", \"quit\", \"q\"}:\n break\n if not line:\n continue\n parts = line.split()\n if len(parts) != 3:\n print(\"Format: \")\n continue\n try:\n _, a, op, b = line.split() if False else (None, *parts)\n a, b = float(parts[0]), float(parts[2])\n result = calculate(a, parts[1], b)\n print(f\"= {result:g}\")\n except (ValueError, ZeroDivisionError) as err:\n print(f\"Error: {err}\")\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,261],"9221c1a8-1753-485f-8182-7704d93da4d2","quadratic.py","141a83a8-a53f-11f1-890b-1607ee4eb77e",13,["D",1788182576388],"#!/usr/bin/env python3\n\"\"\"Solve a quadratic equation: ax^2 + bx + c = 0.\n\nUsage:\n python quadratic.py # interactive prompts\n python quadratic.py 1 -3 2 # from command-line args\n\"\"\"\n\nimport cmath\nimport math\nimport sys\n\n\ndef solve_quadratic(a, b, c):\n \"\"\"Return the roots of ax^2 + bx + c = 0 as a tuple (x1, x2).\n\n Uses the quadratic formula: x = (-b ± sqrt(b^2 - 4ac)) / (2a)\n Supports real and complex roots.\n \"\"\"\n discriminant = b ** 2 - 4 * a * c\n\n # Compute sqrt of the discriminant (complex-safe).\n sqrt_disc = cmath.sqrt(discriminant)\n\n x1 = (-b + sqrt_disc) / (2 * a)\n x2 = (-b - sqrt_disc) / (2 * a)\n return x1, x2\n\n\ndef describe(discriminant):\n \"\"\"Return a human-readable description of the nature of the roots.\"\"\"\n if discriminant > 0:\n return \"two distinct real roots\"\n if discriminant == 0:\n return \"one repeated real root\"\n return \"two complex (conjugate) roots\"\n\n\ndef main():\n if len(sys.argv) == 4:\n try:\n a, b, c = (float(v) for v in sys.argv[1:4])\n except ValueError:\n print(\"Error: coefficients must be numbers.\", file=sys.stderr)\n sys.exit(1)\n else:\n try:\n a = float(input(\"Enter a: \"))\n b = float(input(\"Enter b: \"))\n c = float(input(\"Enter c: \"))\n except ValueError:\n print(\"Error: coefficients must be numbers.\", file=sys.stderr)\n sys.exit(1)\n\n if a == 0:\n print(\"Error: 'a' cannot be zero (that would be a linear equation).\",\n file=sys.stderr)\n sys.exit(1)\n\n discriminant = b ** 2 - 4 * a * c\n print(f\"\\nEquation: {a:g}x^2 + {b:g}x + {c:g} = 0\")\n print(f\"Discriminant (b^2 - 4ac) = {discriminant:g}\")\n print(f\"Roots: {describe(discriminant)}\")\n\n x1, x2 = solve_quadratic(a, b, c)\n print(f\"x1 = {x1}\")\n print(f\"x2 = {x2}\")\n\n # If roots are real, show their approximate decimal values too.\n if discriminant >= 0 and not isinstance(x1, complex):\n print(f\"Approximate: x1 = {x1:.6f}, x2 = {x2:.6f}\")\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,269],"e8d648f1-c7ff-470c-8779-ad92c844aa0e","python_keywords.py","1a631fec-a547-11f1-9cb6-1607ee4eb77e",["D",1788186022904],"#!/usr/bin/env python3\n\"\"\"A reference file demonstrating most Python keywords.\n\nThis file is meant as a reference/cheatsheet. It is NOT executed end-to-end;\nit defines examples for each keyword so you can read them together.\n\nUsage: read this file, or run `python python_keywords.py` to demo a few.\n\"\"\"\n\nimport sys\n\n\ndef keywords_ref():\n # and / or / not — boolean logic\n a = True\n b = False\n assert (a and not b) or b is False\n\n # if / elif / else — conditionals\n x = 5\n if x < 0:\n kind = \"negative\"\n elif x == 0:\n kind = \"zero\"\n else:\n kind = \"positive\"\n\n # True / False / None — literals\n flag = True\n other = False\n nothing = None\n\n # def / return — functions\n def add(p, q):\n return p + q\n\n # lambda — anonymous function\n double = lambda n: n * 2\n\n # class / pass — classes and no-op\n class Animal:\n pass # no body, just a placeholder\n\n class Dog(Animal):\n def __init__(self, name):\n self.name = name\n\n # global / nonlocal — scope control\n counter = 0\n\n def bump():\n global counter\n counter += 1\n\n def outer():\n value = 1\n\n def inner():\n nonlocal value\n value += 1\n inner()\n\n # for / in / range / break / continue / else (loop-else)\n total = 0\n for n in range(6):\n if n == 0:\n continue # skip 0\n if n == 5:\n break # stop early\n total += n\n else:\n # runs only if loop was NOT broken\n pass\n\n # while — loop\n i = 0\n while i < 3:\n i += 1\n\n # try / except / else / finally / raise — exceptions\n def risky():\n raise ValueError(\"boom\")\n\n try:\n risky()\n except ValueError as e:\n message = str(e)\n else:\n message = \"no error\"\n finally:\n cleanup = True\n\n # import / from / as — modules\n import math\n from math import sqrt as square_root\n\n # is / is not — identity\n if nothing is None:\n pass\n if flag is not None:\n pass\n\n # yield — generators\n def countdown():\n yield 3\n yield 2\n yield 1\n\n # with / as — context managers\n with open(\"example.txt\", \"w\") as f:\n f.write(\"hello\")\n\n # del — delete a name\n temp = 42\n del temp\n\n # await / async — asyncio\n async def fetch():\n return \"data\"\n\n return {\n \"and or not\": True,\n \"if elif else\": kind,\n \"True False None\": (flag, other, nothing),\n \"def return lambda\": (add(1, 2), double(4)),\n \"class pass global nonlocal\": True,\n \"for in range break continue else\": total,\n \"while\": i,\n \"try except else finally raise\": message,\n \"import from as\": square_root(16),\n \"is is not\": True,\n \"yield\": list(countdown()),\n \"with as\": True,\n \"del\": True,\n \"async await\": \"data\",\n }\n\n\ndef main():\n if len(sys.argv) > 1 and sys.argv[1] == \"--demo\":\n result = keywords_ref()\n print(\"All keywords referenced. Sample values:\")\n print(f\" kind = {result['if elif else']}\")\n print(f\" total = {result['for in range break continue else']}\")\n print(f\" sqrt(16) = {result['import from as']}\")\n print(f\" countdown = {result['yield']}\")\n else:\n # Print the full set of Python keywords.\n import keyword\n print(\"Python keywords (current interpreter):\")\n print(sorted(keyword.kwlist))\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,277],"cbed1a0b-c366-4789-8733-f6da709fae63","plot_graph.py","f7ca35e2-a546-11f1-a63f-1607ee4eb77e",17,["D",1788185964861],"#!/usr/bin/env python3\n\"\"\"Plot the graph of a mathematical equation using matplotlib.\n\nUsage:\n python plot_graph.py # interactive: enter 3 points\n python plot_graph.py \"x**2 - 3*x + 2\" # plot a single function by name\n python plot_graph.py \"sin(x)\" \"cos(x)\" # plot multiple functions\n\nThe equation is evaluated using Python's math module, so you can use\nfunctions like sin, cos, tan, exp, log, sqrt, pi, e, abs, etc.\n\"\"\"\n\nimport math\nimport sys\n\nimport matplotlib.pyplot as plt\nimport numpy as np\n\n\n# Expose functions from the math module so equation strings can call them.\nNS = {name: getattr(math, name) for name in dir(math) if not name.startswith(\"_\")}\nNS.update({\"abs\": abs, \"pi\": math.pi, \"e\": math.e})\n\n\ndef eval_function(expr, x):\n \"\"\"Evaluate a single-variable expression against a numpy x value.\"\"\"\n # numpy arrays work with math functions via np.vectorize; apply per-element.\n return np.vectorize(lambda v: eval(expr, {\"__builtins__\": {}}, {**NS, \"x\": v}))(x)\n\n\ndef parse_range():\n \"\"\"Read xmin, xmax, step from user input; defaults to -10..10.\"\"\"\n try:\n raw = input(\"Enter x-min, x-max, step (default: -10 10 0.1): \").strip()\n if not raw:\n return -10.0, 10.0, 0.1\n parts = [float(p) for p in raw.replace(\",\", \" \").split()]\n if len(parts) == 2:\n return parts[0], parts[1], 0.1\n if len(parts) == 3:\n return parts[0], parts[1], parts[2]\n raise ValueError\n except ValueError:\n print(\"Invalid input, using defaults -10 10 0.1.\")\n return -10.0, 10.0, 0.1\n\n\ndef plot_equations(exprs, variants, x_min, x_max, step):\n x = np.arange(x_min, x_max + step, step)\n\n for expr, variant in zip(exprs, variants):\n try:\n with np.errstate(all=\"ignore\"):\n y = eval_function(expr, x)\n except Exception as exc: # noqa: BLE001\n print(f\"Could not evaluate '{expr}': {exc}\")\n continue\n plt.plot(x, y, label=expr, **variant)\n\n # Axes/decoration.\n plt.axhline(0, color=\"black\", linewidth=1)\n plt.axvline(0, color=\"black\", linewidth=1)\n plt.xlabel(\"x\")\n plt.ylabel(\"y\")\n plt.title(\"Graph of equation(s)\")\n plt.legend()\n plt.grid(True)\n plt.tight_layout()\n\n plt.show() # interactive window (only works with a GUI backend installed)\n\n\ndef main():\n if len(sys.argv) >= 2:\n # Plot functions given as command-line arguments.\n exprs = sys.argv[1:]\n x_min, x_max, step = -10.0, 10.0, 0.1\n plot_equations(exprs, [{} for _ in exprs], x_min, x_max, step)\n return\n\n # Interactive mode.\n print(\n \"Enter one or more equations in terms of x, \"\n \"e.g. 'x**2 - 3*x + 2' or 'sin(x)'.\\n\"\n \"Type a blank line when done.\"\n )\n exprs = []\n while True:\n line = input(\"Equation (blank to plot): \").strip()\n if not line:\n break\n exprs.append(line)\n\n if not exprs:\n exprs = [\"x**2 - 3*x + 2\"]\n\n x_min, x_max, step = parse_range()\n plot_equations(exprs, [{} for _ in exprs], x_min, x_max, step)\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,284],"035d123b-ffc8-4de1-9d37-adf26a0dd197","pattern_generator.py","07abb832-a547-11f1-a22e-1607ee4eb77e",33,["D",1788185991502],"#!/usr/bin/env python3\n\"\"\"Generate repeating text/ASCII patterns.\n\nIncludes a few ready-made pattern generators plus a generic repeat tool.\n\nUsage:\n python pattern_generator.py star [triangle|diamond|square|repeat]\n python pattern_generator.py diamond 7\n\"\"\"\n\nimport sys\n\n\ndef triangle(n):\n \"\"\"Right-angle triangle of stars.\"\"\"\n return \"\\n\".join(\"* \" * (i + 1) for i in range(n))\n\n\ndef square(n):\n \"\"\"Solid n x n square.\"\"\"\n return \"\\n\".join(\"* \" * n for _ in range(n))\n\n\ndef diamond(n):\n \"\"\"Diamond outline of stars; n is the half-width (rows above midline).\"\"\"\n lines = []\n for i in range(1, n + 1):\n lines.append(\" \" * (n - i) + \"* \" * i)\n for i in range(n - 1, 0, -1):\n lines.append(\" \" * (n - i) + \"* \" * i)\n return \"\\n\".join(lines)\n\n\ndef repeat_text(text, times):\n \"\"\"Repeat a string n times, joined by spaces.\"\"\"\n return \" \".join([text] * times)\n\n\nPATTERNS = {\"star\": star, \"triangle\": triangle, \"diamond\": diamond,\n \"square\": square}\n\n\ndef main():\n if len(sys.argv) > 1:\n pattern = sys.argv[1].lower()\n else:\n pattern = input(\"Pattern (star/triangle/diamond/square/repeat): \").lower()\n\n n = 5\n if len(sys.argv) > 2:\n try:\n n = int(sys.argv[2])\n except ValueError:\n n = 5\n\n if pattern == \"repeat\":\n text = input(\"Text to repeat: \")\n print(repeat_text(text, n))\n elif pattern in PATTERNS:\n print(PATTERNS[pattern](n))\n else:\n print(\"Unknown pattern. Choose from:\", \", \".join(PATTERNS),\n \"or 'repeat'.\", file=sys.stderr)\n sys.exit(1)\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,292],"0490ac7f-c3d8-4c19-881f-8ae45db85911","pattern_generation.py","030aff9a-a547-11f1-94b6-1607ee4eb77e",25,["D",1788185983742],"#!/usr/bin/env python3\n\"\"\"Pattern generation — print various text patterns.\n\nSelect a pattern by name:\n pyramid, right_triangle, number_triangle, diamond, staircase\n\nUsage:\n python pattern_generation.py pyramid 5\n python pattern_generation.py # interactive\n\"\"\"\n\nimport sys\n\nPATTERNS = (\"pyramid\", \"right_triangle\", \"number_triangle\", \"diamond\",\n \"staircase\")\n\n\ndef pyramid(n):\n lines = []\n for i in range(1, n + 1):\n spaces = \" \" * (n - i)\n stars = \"*\" * (2 * i - 1)\n lines.append(spaces + stars)\n return lines\n\n\ndef right_triangle(n):\n return [\"*\" * i for i in range(1, n + 1)]\n\n\ndef number_triangle(n):\n lines = []\n for i in range(1, n + 1):\n lines.append(\" \".join(str(x) for x in range(1, i + 1)))\n return lines\n\n\ndef diamond(n):\n top = pyramid(n)\n bottom = [\" \" * i + \"*\" * (2 * (n - i) - 1) for i in range(1, n)]\n return top + bottom\n\n\ndef staircase(n):\n return [(\" \" * (n - i)) + (\"#\" * i) for i in range(1, n + 1)]\n\n\nGENERATORS = {\n \"pyramid\": pyramid,\n \"right_triangle\": right_triangle,\n \"number_triangle\": number_triangle,\n \"diamond\": diamond,\n \"staircase\": staircase,\n}\n\n\ndef main():\n name = sys.argv[1] if len(sys.argv) >= 2 else \"\"\n n = int(sys.argv[2]) if len(sys.argv) >= 3 else 5\n\n if not name:\n print(\"Available patterns:\", \", \".join(PATTERNS))\n name = input(\"Enter pattern name: \").strip()\n\n if name not in GENERATORS:\n print(f\"Unknown pattern '{name}'. Available: {', '.join(PATTERNS)}\",\n file=sys.stderr)\n sys.exit(1)\n\n for line in GENERATORS[name](n):\n print(line)\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,300],"edfbf8a9-9cae-403c-b442-332c46ed9984","multiplication_tables.py","076347b4-a547-11f1-a9e3-1607ee4eb77e",28,["D",1788185991029],"#!/usr/bin/env python3\n\"\"\"Multiplication tables generator.\n\nUsage:\n python multiplication_tables.py # prints a single table\n python multiplication_tables.py 12 # table up to 12\n python multiplication_tables.py --all 12 # all tables from 1..12\n\nExample:\n python multiplication_tables.py 5 12\n prints the 5 times table from 1 x 5 through 12 x 5.\n\"\"\"\n\nimport sys\n\n\ndef multiplication_table(base, upto=12):\n \"\"\"Return a list of (multiplier, result) pairs for a single base.\"\"\"\n return [(i, base * i) for i in range(1, upto + 1)]\n\n\ndef print_table(base, upto=12):\n print(f\"\\n--- {base} times table ---\")\n for i, result in multiplication_table(base, upto):\n print(f\"{base:>3} x {i:>2} = {result:>6}\")\n\n\ndef print_all_tables(upto=12):\n for base in range(1, upto + 1):\n print_table(base, upto)\n\n\ndef main():\n args = sys.argv[1:]\n\n if \"--all\" in args:\n args.remove(\"--all\")\n upto = int(args[0]) if args else 12\n print_all_tables(upto)\n return\n\n if not args:\n try:\n base = int(input(\"Enter a number: \"))\n except ValueError:\n print(\"Error: please enter a number.\", file=sys.stderr)\n sys.exit(1)\n upto = 12\n elif len(args) == 1:\n base = int(args[0])\n upto = 12\n else:\n base = int(args[0])\n upto = int(args[1])\n\n print_table(base, upto)\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,308],"ccd052e9-5025-49bd-b748-62057e252204","multiplication_table.py","f555e522-a546-11f1-b171-1607ee4eb77e",15,["D",1788185960735],"#!/usr/bin/env python3\n\"\"\"Print a multiplication table up to a given size.\n\nUsage:\n python multiplication_table.py # 12x12 table\n python multiplication_table.py 10 # 10x10 table\n python multiplication_table.py 5 5 # 5x5 table\n\"\"\"\n\nimport sys\n\n\ndef multiplication_table(rows, cols):\n \"\"\"Return a list of rows, each row a list of ints (the table grid).\"\"\"\n return [[i * j for j in range(1, cols + 1)] for i in range(1, rows + 1)]\n\n\ndef render_table(rows, cols):\n \"\"\"Build and return a nicely aligned table as a string.\"\"\"\n table = multiplication_table(rows, cols)\n\n # The largest number is rows * cols, so we know how wide each column is.\n cell_width = len(str(rows * cols))\n lines = []\n\n for i, row in enumerate(table, start=1):\n line = f\"{i:>{cell_width}} | \" + \" \".join(\n f\"{value:>{cell_width}}\" for value in row\n )\n lines.append(line)\n\n return \"\\n\".join(lines)\n\n\ndef main():\n args = [int(v) for v in sys.argv[1:3]] if len(sys.argv) > 1 else []\n\n if len(args) == 1:\n rows = cols = args[0]\n elif len(args) == 2:\n rows, cols = args\n else:\n try:\n rows = int(input(\"Rows (default 12): \") or 12)\n cols = int(input(\"Columns (default 12): \") or 12)\n except ValueError:\n print(\"Error: please enter whole numbers.\", file=sys.stderr)\n sys.exit(1)\n\n print(f\"\\nMultiplication table {rows}x{cols}:\\n\")\n print(render_table(rows, cols))\n print()\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,316],"871d33de-f1d7-478a-bae7-62d3a0cf643a","graph_plotter.py","078fc406-a547-11f1-a22e-1607ee4eb77e",31,["D",1788185991316],"#!/usr/bin/env python3\n\"\"\"Plot a graph from a mathematical equation.\n\nRequires: pip install matplotlib numpy (interactive, not runnable on Val Town)\n\nUsage:\n python graph_plotter.py # lets you type an equation\n python graph_plotter.py \"x**3 - 2*x + 1\"\n\"\"\"\n\nimport sys\n\ntry:\n import matplotlib.pyplot as plt\n import numpy as np\nexcept ImportError:\n print(\"matplotlib / numpy are required: pip install matplotlib numpy\",\n file=sys.stderr)\n sys.exit(1)\n\nX_MIN, X_MAX = -10, 10\nSAMPLES = 400\n\n\ndef safe_eval(expr, x):\n \"\"\"Evaluate expr using numpy so numpy ufuncs (np.sin, etc.) work.\"\"\"\n try:\n import numpy as np\n return eval(expr, {\"__builtins__\": {}}, {\"np\": np, \"x\": x})\n except Exception:\n return None\n\n\ndef main():\n expr = \" \".join(sys.argv[1:]) if len(sys.argv) > 1 else \"\"\n if not expr:\n expr = input(\n \"Enter equation in terms of x (e.g. x**2 - 3*x + 2, np.sin(x)): \"\n )\n\n x = np.linspace(X_MIN, X_MAX, SAMPLES)\n with np.errstate(all=\"ignore\"):\n y = safe_eval(expr, x)\n if y is None:\n print(\"Could not evaluate that equation.\", file=sys.stderr)\n sys.exit(1)\n\n fig, ax = plt.subplots(figsize=(8, 6))\n ax.plot(x, y, label=f\"y = {expr}\")\n ax.axhline(0, color=\"black\", linewidth=0.8)\n ax.axvline(0, color=\"black\", linewidth=0.8)\n ax.set_title(\"Equation Plot\")\n ax.set_xlabel(\"x\")\n ax.set_ylabel(\"y\")\n ax.legend()\n ax.grid(True, linestyle=\"--\", alpha=0.5)\n plt.show()\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,324],"ce9e2d0f-60f7-4cce-b4b6-44c6e5bc8263","graph.py","0771bf24-a547-11f1-a9e3-1607ee4eb77e",29,["D",1788185991120],"#!/usr/bin/env python3\n\"\"\"Plot a graph from a user-supplied equation using matplotlib.\n\nUsage:\n python graph.py # prompts for an equation like \"x**2 - 4\"\n python graph.py \"x**2 - 4\" # from the command line\n python graph.py \"sin(x)\" -5 5 # optional x-range\n\nDependencies:\n pip install numpy matplotlib\n\"\"\"\n\nimport sys\n\nimport numpy as np\nimport matplotlib.pyplot as plt\n\n\ndef main():\n args = sys.argv[1:]\n if args:\n expr = args[0]\n others = args[1:]\n xmin, xmax = (float(others[0]), float(others[1])) if len(others) >= 2 else (-10.0, 10.0)\n else:\n expr = input(\"Enter equation in terms of x (e.g. x**2 - 4, sin(x)): \")\n xmin, xmax = -10.0, 10.0\n\n # Make numpy names (sin, cos, sqrt, ...) directly available to the expression.\n ns = {\"x\": None, \"np\": np}\n for name in (\"sin\", \"cos\", \"tan\", \"sqrt\", \"exp\", \"log\", \"abs\", \"pi\", \"e\"):\n ns[name] = getattr(np, name) if hasattr(np, name) else None\n\n # Fill in ns[\"x\"] (and keep 'sin' etc. defined).\n ns[\"pi\"] = np.pi\n ns[\"e\"] = np.e\n\n x = np.linspace(xmin, xmax, 400)\n\n try:\n y = eval(expr, {\"__builtins__\": {}}, ns)\n except Exception as exc:\n print(f\"Error evaluating equation: {exc}\", file=sys.stderr)\n sys.exit(1)\n\n fig, ax = plt.subplots()\n ax.plot(x, y, label=f\"y = {expr}\", linewidth=2)\n ax.axhline(0, color=\"black\", linewidth=0.8)\n ax.axvline(0, color=\"black\", linewidth=0.8)\n ax.grid(True, linestyle=\"--\", alpha=0.5)\n ax.legend()\n ax.set_title(f\"Plot of y = {expr}\")\n ax.set_xlabel(\"x\")\n ax.set_ylabel(\"y\")\n plt.show()\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,332],"30b8b3ae-8737-4d00-b04c-9852cae597a8","fibonacci.py","f4b7bb54-a546-11f1-830a-1607ee4eb77e",14,["D",1788185959696],"#!/usr/bin/env python3\n\"\"\"Generate a Fibonacci series.\n\nUsage:\n python fibonacci.py # first 10 terms\n python fibonacci.py 15 # first 15 terms\n python fibonacci.py 20 1 1 # n terms starting with (p1, p2)\n\"\"\"\n\nimport sys\n\n\ndef fibonacci(n, first=0, second=1):\n \"\"\"Return a list of the first `n` Fibonacci terms starting with the\n given seed values.\"\"\"\n if n <= 0:\n return []\n\n series = [first, second]\n for _ in range(n - 2):\n series.append(series[-1] + series[-2])\n return series[:n]\n\n\ndef fibonacci_gen(first=0, second=1):\n \"\"\"Yield Fibonacci numbers one at a time (lazy generator).\"\"\"\n a, b = first, second\n while True:\n yield a\n a, b = b, a + b\n\n\ndef main():\n # Parse arguments: optional n and optional seed values.\n n = 10 # default number of terms\n p1, p2 = 0, 1 # default seed values\n\n try:\n if len(sys.argv) >= 2:\n n = int(sys.argv[1])\n if len(sys.argv) == 4:\n p1, p2 = int(sys.argv[2]), int(sys.argv[3])\n except ValueError:\n print(\"Error: arguments must be integers.\", file=sys.stderr)\n sys.exit(1)\n\n if n <= 0:\n print(\"Error: n must be greater than 0.\", file=sys.stderr)\n sys.exit(1)\n\n print(f\"First {n} terms of the Fibonacci series ({p1}, {p2}):\")\n print(\", \".join(str(x) for x in fibonacci(n, p1, p2)))\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,340],"2220c847-6018-46dc-9ae4-c0184134e169","drawing_canvas.py","f92c071c-a546-11f1-99f5-1607ee4eb77e",18,["D",1788185967184],"#!/usr/bin/env python3\n\"\"\"Interactive drawing canvas using Tkinter.\n\nFeatures:\n - Left-drag to freehand draw\n - Color palette + brush size selector\n - Eraser mode (right-drag or toggle button)\n - Clear canvas\n - Save artwork as a PNG file\n\nUsage:\n python canvas.py\n\"\"\"\n\nimport tkinter as tk\nfrom tkinter import colorchooser, filedialog, messagebox\n\n# ------------------------------------------------------------------\n# Configuration\n# ------------------------------------------------------------------\nCANVAS_W, CANVAS_H = 800, 600\nBG_COLOR = \"white\"\nDEFAULT_PEN = \"black\"\n\nPALETTE = [\n \"#000000\", \"#ffffff\", \"#e74c3c\", \"#e67e22\", \"#f1c40f\",\n \"#2ecc71\", \"#3498db\", \"#9b59b6\", \"#ecf0f1\", \"#95a5a6\",\n]\n\n\nclass DrawingApp:\n def __init__(self, root):\n self.root = root\n self.root.title(\"Drawing Canvas\")\n\n self.color = DEFAULT_PEN\n self.brush_size = 4\n self.eraser = False\n\n self._build_toolbar()\n self._build_canvas()\n\n # Bind mouse events for drawing.\n self.canvas.bind(\"\", self.start_stroke)\n self.canvas.bind(\"\", self.draw)\n self.canvas.bind(\"\", self.end_stroke)\n\n # ------------------------------------------------------------------\n # UI construction\n # ------------------------------------------------------------------\n def _build_toolbar(self):\n toolbar = tk.Frame(self.root)\n toolbar.pack(side=tk.TOP, fill=tk.X, padx=4, pady=4)\n\n # Color swatches.\n for hex_color in PALETTE:\n swatch = tk.Button(\n toolbar,\n bg=hex_color,\n width=2,\n height=1,\n command=lambda c=hex_color: self.pick_color(c),\n )\n swatch.pack(side=tk.LEFT, padx=1)\n\n # Custom color picker.\n tk.Button(toolbar, text=\"…\", command=self.pick_custom_color).pack(\n side=tk.LEFT, padx=3\n )\n\n # Brush size scale.\n tk.Label(toolbar, text=\"Size:\").pack(side=tk.LEFT, padx=(12, 2))\n self.size_scale = tk.Scale(\n toolbar, from_=1, to=30, orient=tk.HORIZONTAL,\n command=self.set_size, length=120,\n )\n self.size_scale.set(self.brush_size)\n self.size_scale.pack(side=tk.LEFT)\n\n # Tool buttons.\n self.eraser_btn = tk.Button(\n toolbar, text=\"Eraser\", command=self.toggle_eraser\n )\n self.eraser_btn.pack(side=tk.LEFT, padx=8)\n\n tk.Button(toolbar, text=\"Clear\", command=self.clear_canvas).pack(\n side=tk.LEFT, padx=2\n )\n tk.Button(toolbar, text=\"Save PNG\", command=self.save_png).pack(\n side=tk.LEFT, padx=2\n )\n\n def _build_canvas(self):\n canvas_frame = tk.Frame(self.root)\n canvas_frame.pack(fill=tk.BOTH, expand=True, padx=4, pady=(0, 4))\n\n self.canvas = tk.Canvas(\n canvas_frame,\n width=CANVAS_W,\n height=CANVAS_H,\n bg=BG_COLOR,\n cursor=\"crosshair\",\n highlightthickness=1,\n highlightbackground=\"#b0b0b0\",\n )\n self.canvas.pack(fill=tk.BOTH, expand=True)\n\n # ------------------------------------------------------------------\n # Behavior\n # ------------------------------------------------------------------\n def pick_color(self, hex_color):\n self.color = hex_color\n self.eraser = False\n self.eraser_btn.config(relief=tk.RAISED)\n\n def pick_custom_color(self):\n chosen = colorchooser.askcolor(color=self.color)[1]\n if chosen:\n self.pick_color(chosen)\n\n def set_size(self, value):\n self.brush_size = int(value)\n\n def toggle_eraser(self):\n self.eraser = not self.eraser\n relief = tk.SUNKEN if self.eraser else tk.RAISED\n self.eraser_btn.config(relief=relief)\n\n def clear_canvas(self):\n if messagebox.askyesno(\"Clear\", \"Clear the whole canvas?\"):\n self.canvas.delete(\"all\")\n\n # ------------------------------------------------------------------\n # Drawing logic\n # ------------------------------------------------------------------\n def start_stroke(self, event):\n self.last_x, self.last_y = event.x, event.y\n\n def draw(self, event):\n color = BG_COLOR if self.eraser else self.color\n x, y = event.x, event.y\n # Line segments between the previous and current mouse position,\n # so fast strokes produce continuous smooth lines instead of dots.\n self.canvas.create_line(\n self.last_x, self.last_y, x, y,\n fill=color,\n width=self.brush_size,\n capstyle=tk.ROUND,\n smooth=True,\n )\n self.last_x, self.last_y = x, y\n\n def end_stroke(self, event):\n self.last_x, self.last_y = None, None\n\n # ------------------------------------------------------------------\n # Saving\n # ------------------------------------------------------------------\n def save_png(self):\n path = filedialog.asksaveasfilename(\n defaultextension=\".png\",\n filetypes=[(\"PNG image\", \"*.png\")],\n )\n if not path:\n return\n try:\n self.canvas.postscript(file=\"/tmp/canvas.ps\", colormode=\"color\")\n # Tkinter cannot export PNG directly, so we hand the PostScript\n # off to Ghostscript. If you do not have Ghostscript installed,\n # the drawing is still saved as the .ps file.\n self._convert_ps_to_png(\"/tmp/canvas.ps\", path)\n except Exception as exc: # noqa: BLE001\n messagebox.showerror(\"Save\", f\"Could not save:\\n{exc}\")\n else:\n messagebox.showinfo(\n \"Save\", \"Saved! (falls back to .ps if Ghostscript is absent)\"\n )\n\n @staticmethod\n def _convert_ps_to_png(ps_path, png_path):\n import subprocess\n subprocess.run(\n [\"gs\", \"-dNOPAUSE\", \"-dBATCH\", \"-sDEVICE=png16m\",\n f\"-sOutputFile={png_path}\", ps_path],\n check=True,\n )\n\n\nif __name__ == \"__main__\":\n root = tk.Tk()\n DrawingApp(root)\n root.mainloop()\n",[],[243,348],"388efb0b-248c-43ce-8362-41cba36f9b7b","draw_canvas.py","ff8371ea-a546-11f1-9817-1607ee4eb77e",21,["D",1788185977809],"#!/usr/bin/env python3\n\"\"\"Interactive drawing canvas using Pygame.\n\nMove the mouse with the LEFT button held to draw freehand lines.\nRight-click (or press C) to clear the canvas.\nPress ESC or close the window to quit.\n\nRequires: pip install pygame\nUsage: python canvas.py [width] [height]\n\"\"\"\n\nimport sys\n\nimport pygame\n\nDEFAULT_WIDTH = 800\nDEFAULT_HEIGHT = 600\nBG_COLOR = (255, 255, 255)\nINK_COLOR = (20, 20, 20)\nLINE_WIDTH = 4\n\n\ndef main():\n width = int(sys.argv[1]) if len(sys.argv) > 1 else DEFAULT_WIDTH\n height = int(sys.argv[2]) if len(sys.argv) > 2 else DEFAULT_HEIGHT\n\n pygame.init()\n screen = pygame.display.set_mode((width, height))\n pygame.display.set_caption(\"Drawing Canvas — hold left mouse to draw\")\n screen.fill(BG_COLOR)\n pygame.display.flip()\n\n drawing = False\n last_pos = None\n clock = pygame.time.Clock()\n\n running = True\n while running:\n for event in pygame.event.get():\n if event.type == pygame.QUIT:\n running = False\n elif event.type == pygame.KEYDOWN:\n if event.key == pygame.K_ESCAPE:\n running = False\n elif event.key == pygame.K_c:\n screen.fill(BG_COLOR)\n pygame.display.flip()\n elif event.type == pygame.MOUSEBUTTONDOWN:\n if event.button == 1: # left button\n drawing = True\n last_pos = event.pos\n elif event.button == 3: # right button: clear\n screen.fill(BG_COLOR)\n pygame.display.flip()\n elif event.type == pygame.MOUSEBUTTONUP:\n if event.button == 1:\n drawing = False\n last_pos = None\n elif event.type == pygame.MOUSEMOTION and drawing:\n if last_pos is not None:\n pygame.draw.line(screen, INK_COLOR, last_pos, event.pos,\n LINE_WIDTH)\n last_pos = event.pos\n pygame.display.update()\n\n clock.tick(60)\n\n pygame.quit()\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,356],"2639526a-150d-41b6-894e-03a8e437bdd6","dfs.py","ff91fb52-a546-11f1-9817-1607ee4eb77e",22,["D",1788185977911],"#!/usr/bin/env python3\n\"\"\"Perform a Depth-First Search (DFS) on a graph.\n\nThe graph is defined as an adjacency list passed in from the command line:\n python3 dfs.py 0:1,2 1:0,3 2:0 3:1\n\nEach entry is node:comma-separated-neighbors.\nThe example above defines:\n 0 -> 1, 2\n 1 -> 0, 3\n 2 -> 0\n 3 -> 1\n\nOutput: the DFS traversal order starting from the first node,\nplus a re-usable dfs function you can import.\n\"\"\"\n\nimport sys\nfrom collections import defaultdict\n\n\ndef dfs_iterative(graph, start):\n \"\"\"Return nodes reachable from `start` in DFS pre-order (iterative).\"\"\"\n visited = []\n seen = set()\n stack = [start]\n\n while stack:\n node = stack.pop()\n if node in seen:\n continue\n seen.add(node)\n visited.append(node)\n # Push neighbors reversed so they pop in the original order.\n for neighbor in reversed(graph.get(node, [])):\n if neighbor not in seen:\n stack.append(neighbor)\n\n return visited\n\n\ndef dfs_recursive(graph, node, visited=None):\n \"\"\"Return nodes reachable from `node` in DFS pre-order (recursive).\"\"\"\n if visited is None:\n visited = []\n visited.append(node)\n for neighbor in graph.get(node, []):\n if neighbor not in visited:\n dfs_recursive(graph, neighbor, visited)\n return visited\n\n\ndef parse_graph(raw_entries):\n \"\"\"Convert 'node:a,b node:c,d' into an adjacency dict {node: [neighbors]}.\"\"\"\n graph = defaultdict(list)\n for entry in raw_entries:\n if \":\" not in entry:\n print(f\"Error: '{entry}' should look like 'node:neighbor1,neighbor2'\",\n file=sys.stderr)\n sys.exit(1)\n node, neighbors = entry.split(\":\", 1)\n graph[node] = [n for n in neighbors.split(\",\") if n]\n return dict(graph)\n\n\ndef main():\n if len(sys.argv) < 2:\n print(__doc__, file=sys.stderr)\n sys.exit(1)\n\n graph = parse_graph(sys.argv[1:])\n start = sys.argv[1].split(\":\")[0] # first node\n\n print(f\"Graph: {graph}\")\n print(f\"DFS from node {start!r} (iterative): \" +\n \" -> \".join(dfs_iterative(graph, start)))\n print(f\"DFS from node {start!r} (recursive): \" +\n \" -> \".join(dfs_recursive(graph, start)))\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,364],"e30204aa-9c1a-449b-b00f-1b7318e580cf","depth_first_search.py","03014d1a-a547-11f1-94b6-1607ee4eb77e",24,["D",1788185983678],"#!/usr/bin/env python3\n\"\"\"Perform Depth-First Search (DFS) on a graph.\n\nThe graph is represented as an adjacency dict:\n graph = { \"A\": [\"B\", \"C\"], \"B\": [\"D\"], \"C\": [\"E\"], \"D\": [], \"E\": [] }\n\nDFS is provided in both recursive and iterative forms.\n\nUsage:\n python depth_first_search.py A E # search from A for E\n\"\"\"\n\nimport sys\n\n# Example graph (a directed graph).\nGRAPH = {\n \"A\": [\"B\", \"C\"],\n \"B\": [\"D\", \"E\"],\n \"C\": [\"F\"],\n \"D\": [],\n \"E\": [\"F\"],\n \"F\": [],\n}\n\n\ndef dfs_recursive(graph, node, target, visited=None, path=None):\n \"\"\"Return the DFS path from `node` searching for `target` (recursive).\"\"\"\n visited = visited if visited is not None else set()\n path = path if path is not None else []\n visited.add(node)\n path.append(node)\n if node == target:\n return path\n for neighbor in graph.get(node, []):\n if neighbor not in visited:\n result = dfs_recursive(graph, neighbor, target, visited, path)\n if result:\n return result\n return None\n\n\ndef dfs_iterative(graph, start, target):\n \"\"\"Return the DFS path from `start` searching for `target` (iterative).\"\"\"\n stack = [start]\n visited = set()\n parent = {start: None}\n while stack:\n node = stack.pop()\n if node in visited:\n continue\n visited.add(node)\n if node == target:\n # Reconstruct path back from target via parents.\n path = []\n cur = node\n while cur is not None:\n path.append(cur)\n cur = parent.get(cur)\n return path[::-1]\n for neighbor in reversed(graph.get(node, [])):\n if neighbor not in visited:\n parent[neighbor] = node\n stack.append(neighbor)\n return None\n\n\ndef main():\n start = sys.argv[1] if len(sys.argv) >= 2 else \"A\"\n target = sys.argv[2] if len(sys.argv) >= 2 else \"F\"\n\n print(f\"DFS from {start} searching for {target}\")\n print(\"Graph:\", GRAPH)\n print(\"Recursive path:\", dfs_recursive(GRAPH, start, target))\n print(\"Iterative path:\", dfs_iterative(GRAPH, start, target))\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,372],"4975e58b-dac3-45f4-b165-5f42b8d1e33d","clock.py","0784509e-a547-11f1-a9e3-1607ee4eb77e",30,["D",1788185991247],"#!/usr/bin/env python3\n\"\"\"A simple analog clock drawn with tkinter.\n\nShows a live analog clock with hour, minute, and second hands.\n\nUsage:\n python clock.py\n\"\"\"\n\nimport math\nimport time\nimport tkinter as tk\nfrom datetime import datetime\n\nWIDTH, HEIGHT = 400, 400\nCENTER = (WIDTH // 2, HEIGHT // 2)\nCLOCK_RADIUS = 170\n\n\ndef polar(angle_deg, radius):\n \"\"\"Convert a clock angle (0 = 12 o'clock, clockwise) to canvas coords.\"\"\"\n rad = math.radians(90 - angle_deg)\n return (CENTER[0] + radius * math.cos(rad),\n CENTER[1] - radius * math.sin(rad))\n\n\nclass AnalogClock:\n def __init__(self, root):\n self.root = root\n root.title(\"Simple Clock\")\n self.canvas = tk.Canvas(root, width=WIDTH, height=HEIGHT, bg=\"white\")\n self.canvas.pack()\n self.tick()\n\n def draw_face(self):\n c = self.canvas\n c.delete(\"all\")\n # Clock face border.\n c.create_oval(CENTER[0] - CLOCK_RADIUS, CENTER[1] - CLOCK_RADIUS,\n CENTER[0] + CLOCK_RADIUS, CENTER[1] + CLOCK_RADIUS,\n outline=\"black\", width=3)\n\n # Hour marks and numerals.\n for hour in range(1, 13):\n angle = hour * 30 # 30 degrees per hour.\n outer = polar(angle, CLOCK_RADIUS - 10)\n inner = polar(angle, CLOCK_RADIUS - 25)\n c.create_line(inner[0], inner[1], outer[0], outer[1], width=3)\n label_pos = polar(angle, CLOCK_RADIUS - 45)\n c.create_text(label_pos[0], label_pos[1], text=str(hour),\n font=(\"Helvetica\", 16, \"bold\"))\n\n def draw_hand(self, angle_deg, length, width, color):\n x, y = polar(angle_deg, length)\n self.canvas.create_line(CENTER[0], CENTER[1], x, y,\n width=width, fill=color,\n capstyle=tk.ROUND)\n\n def tick(self):\n now = datetime.now()\n second = now.second + now.microsecond / 1e6\n minute = now.minute + second / 60\n hour = (now.hour % 12) + minute / 60\n\n self.draw_face()\n self.draw_hand(hour * 30, CLOCK_RADIUS - 55, 6, \"black\")\n self.draw_hand(minute * 6, CLOCK_RADIUS - 25, 4, \"black\")\n self.draw_hand(second * 6, CLOCK_RADIUS - 15, 2, \"red\")\n self.canvas.create_oval(CENTER[0] - 4, CENTER[1] - 4,\n CENTER[0] + 4, CENTER[1] + 4,\n fill=\"black\")\n\n # Digital readout below the clock.\n self.canvas.create_text(CENTER[0], HEIGHT - 30,\n text=now.strftime(\"%Y-%m-%d %H:%M:%S\"),\n font=(\"Helvetica\", 12))\n\n self.root.after(50, self.tick) # Refresh ~20x/sec for a smooth sweep.\n\n\ndef main():\n root = tk.Tk()\n AnalogClock(root)\n root.mainloop()\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,380],"5d018d01-74a8-4571-bc16-17fa2e7b859d","canvas_drawing.py","fb437cc4-a546-11f1-980b-1607ee4eb77e",20,["D",1788185970686],"#!/usr/bin/env python3\n\"\"\"Draw on a canvas — create PNG images with simple drawing primitives.\n\nRequires: pip install pillow\n\nCreates a canvas and draws a few example shapes, saving the result to a PNG.\n\nUsage:\n python canvas_drawing.py\n\"\"\"\n\nfrom PIL import Image, ImageDraw\n\nWIDTH, HEIGHT = 800, 600\n\n\ndef draw_example():\n # Create an RGB canvas (white background).\n canvas = Image.new(\"RGB\", (WIDTH, HEIGHT), \"white\")\n draw = ImageDraw.Draw(canvas)\n\n # Draw shapes.\n draw.rectangle([50, 50, 250, 200], outline=\"blue\", width=4)\n draw.ellipse([300, 50, 500, 200], fill=\"yellow\", outline=\"orange\", width=3)\n draw.line([50, 300, 750, 500], fill=\"red\", width=5)\n draw.polygon([(400, 300), (300, 470), (500, 470)], fill=\"purple\")\n\n return canvas\n\n\ndef main():\n canvas = draw_example()\n output = \"canvas_output.png\"\n canvas.save(output)\n print(f\"Saved drawing to {output} ({WIDTH}x{HEIGHT}px)\")\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,388],"b9e37287-03b7-4b38-9f90-ba2dd81711aa","breadth_first_search.py","00ae4202-a547-11f1-90d4-1607ee4eb77e",23,["D",1788185979778],"#!/usr/bin/env python3\n\"\"\"Breadth-first search (BFS) on a graph.\n\nExplores a graph level-by-level from a start node, finding the shortest path\n(in terms of number of edges) to a target. Works for both directed and\nundirected graphs (only relies on adjacency lists).\n\nGraph format: adjacency dict mapping node -> list of neighbor nodes.\n\nExample graph (undirected):\n A -- B -- C\n | |\n D -- E -- F\n\"\"\"\n\nfrom collections import deque\n\nGRAPH = {\n \"A\": [\"B\", \"D\"],\n \"B\": [\"A\", \"C\"],\n \"C\": [\"B\", \"F\"],\n \"D\": [\"A\", \"E\"],\n \"E\": [\"D\", \"F\"],\n \"F\": [\"C\", \"E\"],\n}\n\n\ndef bfs(graph, start, target):\n \"\"\"Return the shortest path from start to target, or None if unreachable.\"\"\"\n visited = {start}\n queue = deque([(start, [start])]) # each entry: (node, path_so_far)\n\n while queue:\n node, path = queue.popleft()\n if node == target:\n return path\n for neighbor in graph.get(node, []):\n if neighbor not in visited:\n visited.add(neighbor)\n queue.append((neighbor, path + [neighbor]))\n return None\n\n\ndef bfs_level_order(graph, start):\n \"\"\"Return nodes visited in BFS order (levels), for traversal purposes.\"\"\"\n visited = {start}\n queue = deque([start])\n order = []\n while queue:\n node = queue.popleft()\n order.append(node)\n for neighbor in graph.get(node, []):\n if neighbor not in visited:\n visited.add(neighbor)\n queue.append(neighbor)\n return order\n\n\ndef main():\n print(\"Graph adjacency:\", GRAPH)\n print(\"\\nBFS traversal from A:\", bfs_level_order(GRAPH, \"A\"))\n print(\"\\nShortest paths from A:\")\n for node in [\"B\", \"C\", \"D\", \"E\", \"F\"]:\n path = bfs(GRAPH, \"A\", node)\n print(f\" A -> {node}: {' -> '.join(path) if path else 'UNREACHABLE'}\")\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,396],"1ef2bed2-7a51-4c08-8bc2-011ebe74f767","bfs.py","07a27aba-a547-11f1-a22e-1607ee4eb77e",32,["D",1788185991442],"#!/usr/bin/env python3\n\"\"\"Breadth-First Search (BFS) on a graph.\n\nGraph is represented as an adjacency dict: {node: [neighbors]}.\n\nUsage:\n python bfs.py # runs a built-in demo graph\n\"\"\"\n\nfrom collections import deque\n\n# A demo graph.\nGRAPH = {\n \"A\": [\"B\", \"C\"],\n \"B\": [\"A\", \"D\", \"E\"],\n \"C\": [\"A\", \"F\"],\n \"D\": [\"B\"],\n \"E\": [\"B\", \"F\"],\n \"F\": [\"C\", \"E\"],\n}\n\n\ndef bfs(graph, start):\n \"\"\"Return nodes visited in BFS order.\"\"\"\n if start not in graph:\n return []\n visited = set()\n order = []\n queue = deque([start])\n visited.add(start)\n while queue:\n node = queue.popleft()\n order.append(node)\n for neighbor in graph.get(node, []):\n if neighbor not in visited:\n visited.add(neighbor)\n queue.append(neighbor)\n return order\n\n\ndef bfs_shortest_path(graph, start, target):\n \"\"\"Return the shortest path (fewest edges) from start to target via BFS.\"\"\"\n if start not in graph or target not in graph:\n return None\n visited = {start}\n queue = deque([(start, [start])])\n while queue:\n node, path = queue.popleft()\n if node == target:\n return path\n for neighbor in graph.get(node, []):\n if neighbor not in visited:\n visited.add(neighbor)\n queue.append((neighbor, path + [neighbor]))\n return None\n\n\ndef bfs_levels(graph, start):\n \"\"\"Return nodes grouped by distance (level) from start.\"\"\"\n levels = []\n level = [start]\n visited = {start}\n while level:\n levels.append(level)\n next_level = []\n for node in level:\n for neighbor in graph.get(node, []):\n if neighbor not in visited:\n visited.add(neighbor)\n next_level.append(neighbor)\n level = next_level\n return levels\n\n\ndef main():\n print(\"BFS order: \", \" -> \".join(bfs(GRAPH, \"A\")))\n print(\"Shortest path A -> F: \", bfs_shortest_path(GRAPH, \"A\", \"F\"))\n print(\"BFS by level: \", bfs_levels(GRAPH, \"A\"))\n\n\nif __name__ == \"__main__\":\n main()\n",[],[243,404],"7d1cd943-2505-40a3-8c71-d82cdb423c40",["D",1788182576388],"directory",[168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189],[243],["D",1788008896829],["D",1789484509295],{"_11":12,"_128":124},{"_11":12,"_122":123,"_69":124,"_30":-5,"_125":126,"_127":24},{"_38":113,"_13":16,"_32":35,"_114":72,"_115":-5,"_116":-5,"_117":-5,"_118":-5,"_119":-5,"_120":14,"_121":12},"ctx",{"_52":-5,"_147":454,"_455":456,"_457":458,"_459":24,"_460":24,"_461":24,"_462":85,"_463":-5,"_464":-7,"_465":-7,"_466":26,"_467":24,"_468":24,"_469":-5,"_470":24,"_471":24,"_472":24,"_473":-5},"ENV",{"_425":426,"_427":428,"_429":16,"_430":431,"_432":433,"_434":435,"_436":437,"_438":439,"_440":441,"_442":443,"_444":445,"_446":447,"_448":449,"_450":451,"_452":453},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","RENDER_GIT_COMMIT","e87eb04e707cf64e7e532c8e8ec395f209e17f15","RENDER_GIT_BRANCH","POSTHOG_API_TOKEN","phc_nmoyuAkStEZuUp69rYlg1DZgrIt19Gx0Y4Hwf8tGgJP","POSTHOG_API_HOST","https://wart.val.town","WEB_API_TEMPLATE","https://{val}.web.val.run","APP_URL","https://www.val.town","MODULE_URL","https://esm.town","VANITY_WEB_API_TEMPLATE","https://{label}.val.run/","DENOLS_URL","https://lsp.val.town","NODE_ENV","production","CLOUDFLARE_TURNSTILE_SITE_KEY","0x4AAAAAACtaIZJH7s9rBMZ6","GOOGLE_CLIENT_ID","875989696899-jtsqkhlbdv5jrlsk8631p7ipjg3c6o62.apps.googleusercontent.com","STRIPE_PUBLISHABLE_KEY","pk_live_51N2zvWEpZTTLipIkVEwXrUG9AT0yeOOEYxszarZT1jpsZV58Ly6wlg3SltZpHN26CUalOBmUSY7adQRQiSkCZz2500qSXNkf8Y","API_URL","https://api.val.town",[],"preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","preferencesCloseBrackets","preferencesChatPanelState","preferencesDprint","preferencesDenofmt","notificationCount","flagDenols","isBusinessOrgMember","businessOrgHandle","isBusinessOrgAdmin","isHigherTownieTier","navCollapsed","currentOrgId"]

History · vibes.ts