reladraw 0.7.1 → 0.8.1

package/README.md

@@ -1,28 +1,26 @@
 # reladraw
 
-A text language for diagrams where **you say where things go**.
+reladraw is a text language for diagrams where you say where things go.
 
-**[Try it in your browser →](https://reladraw.github.io/reladraw/)** — edit the source on the left, watch the layout re-solve on the right. Nothing to install.
+**[Try it in your browser →](https://reladraw.github.io/reladraw/)**
 
-A diagram drawn by hand in draw.io:
+I wanted to be able to create custom, expressive diagrams where I decided how to arrange the diagram, but without the inefficiency of manually drawing in draw.io. For example, this is a diagram drawn in draw.io:
 
-![The reference diagram, drawn by hand](https://raw.githubusercontent.com/reladraw/reladraw/main/examples/reference/arch.png)
+![Hand-drawn reference diagram](https://raw.githubusercontent.com/reladraw/reladraw/main/examples/reference/arch.png)
 
-And the same diagram written down in reladraw and rendered from the text — [`examples/arch.reladraw`](examples/arch.reladraw), 44 statements, no coordinates anywhere in it:
+This is the same diagram, but written in reladraw ([`examples/arch.reladraw`](examples/arch.reladraw)).
 
-![The same diagram, rendered from reladraw source](https://raw.githubusercontent.com/reladraw/reladraw/main/docs/arch-render.png)
+![reference diagram via reladraw](https://raw.githubusercontent.com/reladraw/reladraw/main/docs/arch-render.png)
 
-Every distance in the second picture was worked out from statements like `above-left of cluster.hub` and `between cluster.desktop1 and cluster.laptop1`. Nothing chose the arrangement; the file states it.
+## Why not Mermaid or draw.io?
 
-## The gap
+Mermaid, Graphviz and D2 let you declare boxes and connections, then determine positions for you. If you have a particular picture in mind, these aren't the right tool.
 
-Mermaid, Graphviz and D2 have you declare entities and connections, and then place everything for you. That is a superpower, and for most diagrams it is the right one. It stops being the right one as soon as you have a particular picture in mind and care where things go. Say you are actively building your understanding of a system by diagramming it, and you want some module over to the right with its connections placed just so: the auto-layout languages have no way to say it.
-
-On the other end of the spectrum are the absolute-positioning tools — draw.io, Excalidraw, Figma. They give you total control of placement, at the cost of making every edit to a complex diagram slow hand-work. And it is slow for a human but expensive for an agent, which has to work the picture out from the coordinates before it can decide which ones to change.
+On the other hand, tools like draw.io or Excalidraw allow absolute placement, but that means much more effort, whether for humans clicking and dragging nodes around or agents recalculating coordinates and editing verbose XML source code files.
 
 ![The two ends of the spectrum, with reladraw between them](https://raw.githubusercontent.com/reladraw/reladraw/main/docs/gap.png)
 
-reladraw aims at the middle. Every position is stated relative to something else, and nothing in the file is a coordinate:
+reladraw sits between those two extremes, aiming to have the benefits of a diagram language, like Mermaid, but also having the expressiveness and custom placement that you can get with draw.io. Positions are relative, so you don't have to manually pick coordinates. For example:
 
 ```
 node app "Web app"
@@ -34,41 +32,9 @@ node store "Database"  right of app  level with app
 edge app.api -> store  "queries"  from: right  to: left
 ```
 
-Nothing is nested, so no line depends on another line's position or indentation.
-
-The draft is in [SYNTAX.md](SYNTAX.md), with a worked example in [examples/](examples/).
-
-## Why an agent needs this
-
-The common case is not drawing a diagram, it is changing one. Ask for the auth service to move left and a queue to go behind it. With pixel coordinates, an agent has to rebuild the picture from the numbers before it can work out which numbers to change. With auto-layout there is nothing to read at all, because the arrangement was never written down — it can only reword the source and re-render. With stated placement the arrangement is in the file as sentences, and changing the picture is changing the sentence that says where the thing goes.
-
-Writing has the same shape. An agent emitting Mermaid is guessing at a layout that an algorithm settles later, and its only way to find out is to render and look — a round trip that comes back as a picture rather than as a list of what is wrong.
-
-Intent is confirmable, outcomes are not, and the difference is worth being precise about. An agent can re-read its own file and see that the database is under the API and all four machines hang off the sync hub. It cannot see that two clusters anchored to different things now overlap, that a text overflowed its node, or that an edge crosses four others — those are resolved from the statements rather than stated, so they need the diagnostics in the scope section below.
-
-### Using it with an agent
-
-reladraw is too new to be in any model's training data, so an agent has to be told the language before it can write it. This repository ships an [agent skill](https://agentskills.io) that does exactly that — the syntax, when to reach for the language, and what re-reading its own source can and cannot confirm.
-
-```
-npx skills add reladraw/reladraw -g
-```
-
-That installs it for whichever agent you use — Claude Code, Codex, Cursor, Copilot and others — each into its own skills directory. Drop the `-g` to install it into the current project instead.
-
-To install it for one agent rather than all of them, name it with `-a`:
-
-```
-npx skills add reladraw/reladraw -g -a claude-code
-```
-
-Re-run whichever command you used after a release that changes the syntax. The skill is a copy taken at install time, not a live link, so nothing refreshes it on its own.
-
-It is [plain Markdown](.claude/skills/reladraw/SKILL.md) with the syntax reference beside it, so it is worth reading whatever you use, and copying the directory by hand works just as well.
-
-## Status
+See also [SYNTAX.md](SYNTAX.md) and [examples/](examples/).
 
-Version 0.7.1. Early, but it runs: a parser, resolver and SVG renderer in TypeScript with no runtime dependencies, and a command-line tool that takes a text file and writes a standalone SVG. The comparison at the top of this page is that pipeline run on [`examples/arch.reladraw`](examples/arch.reladraw). What is still visibly off there is typography, not placement.
+## Install
 
 ```
 npm install -g reladraw
@@ -82,65 +48,32 @@ npm install && npm run build
 node dist/cli.js examples/arch.reladraw -o out.svg
 ```
 
-Not built yet, roughly in the order they are missed:
+## Using it with an agent
 
-- **The diagnostics report.** The scope section below says what it is for. Today the tool either renders or fails; it will not tell you what is wrong with a picture it drew successfully.
-- **Edge routing around nodes.** An edge can be told which side of a node to leave and arrive on, and which gap to run down on the way. An edge that says none of that is a straight line between two centers, and it will cut through whatever stands in the way.
-- **More pictures.** Icons and shapes are closed sets drawn from path data inside the tool, so a diagram wanting one that is not there has nowhere to go.
+To install a skill to let your agent know how to use reladraw:
 
-The language is not stable. Expect the syntax to change.
-
-## How it works
-
-A gap is a *minimum* distance, never an exact one. Say two things sit side by side, then say a third goes between them, and the first two are pushed apart by exactly what the third needs; delete the third and they close back up. That is the step an author otherwise does by hand — shove things apart to make room, then drag everything back so the diagram is not full of holes — and no number goes stale when a text grows.
-
-So the resolver solves a system rather than walking a chain. Each axis is a set of minimum distances, and the tightest arrangement satisfying all of them is found by longest paths: one answer, no search, no arrangement ever tried and rejected. The engine works out distances; which side of what a thing sits on came from the file.
-
-That is also what makes non-overlap affordable, so it holds for every pair of nodes without anyone writing it down. On its own "these two must not overlap" is a choice among four directions, which is the search this design refuses — but the file has usually settled it already: if your arrangement lets one node travel away from another and offers no way back, that is the only separation it permits. Where the file orders a pair on neither axis, the tool names them rather than guessing; where it orders them on both, the tie breaks toward the axis of least overlap, which is the smallest movement and the one place the tool decides something nobody wrote.
-
-Nothing is nudged. Each round derives the separations the file already implied, adds them as ordinary minimum distances, and solves the whole thing again from scratch — repairing a solved layout in place is the thing being avoided.
-
-## Scope for a first version
-
-- Parser *(done)*
-- Deterministic resolver: minimum distances in, tightest arrangement out *(done)*
-- Static SVG renderer *(done)*
-- A command-line tool: text file in, SVG out *(done)*
-- A placement grammar that can say what a real diagram needs: several placements on one node, one thing between two others, exact side-to-side alignment *(done)*
-- Nodes that do not overlap by default, with the separation direction derived from the stated arrangement *(done)*
-- Minimal node-avoiding edge routing
-- Machine-readable diagnostics from the solved geometry
-
-Diagnostics are a real output rather than a debugging aid. What they cannot do is stand in for the grammar: a check catches only what the language genuinely leaves open, and "these must not overlap" rules arrangements out without naming one, so it can never place anything. Everything the source cannot tell you is computable once the geometry is solved, with no image involved: overlapping nodes, crossed edges, text exceeding its container, anything off-canvas, large dead regions. So the tool reports `hub overlaps laptop1` and `edge auth->db crosses 4 edges`, and the fix is written in the same vocabulary as the source. An agent working this way reads a report about a text file it wrote and edits that text file — no rendering, no vision model, no pixel arithmetic.
-
-A diagnostic never repairs a solved layout in place. That is the line the design holds: a checker allowed to nudge nodes is a layout algorithm with a bad search strategy, fixing one overlap into the next with no view of the whole. Deriving a constraint the file already implied and solving the whole system again is a different thing, and is how non-overlap works. What is left over — anything the source genuinely does not settle — is reported, naming the statement that was broken, and the author edits the source. Open, and it decides how far this goes: may a diagnostic describe a fix in words, or only name the symptom? Describing one means the tool has an opinion about layout, which is the auto-layout instinct coming back in through the side door.
-
-Three design problems decide how much machinery this needs, and the first outranks the other two:
-
-**Saying enough.** The benchmark contains arrangements the grammar cannot express at all, which is why some nodes land in the wrong place no matter how the file is written. So the work is adding statements, not restricting them. Expressiveness is not the danger; the engine *choosing* an arrangement is.
-
-**What the engine is allowed to decide.** Auto-layout is refused, because a picture chosen by an algorithm is not predictable from its source, and that predictability is the entire point. Working out coordinates from an arrangement the author stated is a different thing and is simply the job. The test between them: the engine's freedom may affect distances and never relationships. If a default can change which side of something a node sits on, the language was short a statement and the tool should say so rather than guess.
-
-**Overlap and edge routing.** Relative placement with default spacing collides as soon as two clusters grow toward each other, and nodes are kept apart for exactly that reason. Edges are different: which side of a node a line passes is a relationship, so the tool does not pick a route around an obstacle by itself. You say where a line goes instead — the side it leaves and arrives on, the gap it runs through, the nodes it passes above or below — and the line is drawn curved, square or straight through those points. A line that crosses something it should not is one you have not said enough about yet. Whether the tool should at least point that out, naming the clause that would fix it, is an open question.
+```
+npx skills add reladraw/reladraw -g
+```
 
-## Prior art
+That installs it for every agent you use (Claude Code, Codex, Cursor, Copilot and others), each in its own skills directory. Leave off `-g` to install it into the current project only. To install it for just one agent, name it with `-a`:
 
-Four things sit near this, and each answers a different part of the problem.
+```
+npx skills add reladraw/reladraw -g -a claude-code
+```
 
-**[Archify](https://github.com/tt-a1i/archify).** Built for agents to write: an agent emits typed JSON, a validator checks it against a schema and lints the layout, and it compiles deterministically to a good-looking, self-contained HTML file, with stepped playback and nodes pinned to git-verified source lines. Its positioning is grid or free coordinates, though — auto-arrangement on one side, absolute pixels on the other — and a JSON template says nothing about where the picture will end up, so the loop is still emit, render, look, tweak.
+That gets you a copy of the skill at the time you run it, so you'll need to re-run that command to get the latest skill when there is a new release.
 
-**PIC and [pikchr](https://pikchr.org).** A text diagram format with no layout engine, where placement is stated and deterministic. But it is turtle graphics — a movable cursor that drops shapes and steps along — so a diagram is a sequence of pen movements rather than a set of stated relationships between named things. There is no group that reflows when a member is added.
+## Status
 
-**Graphviz `rank` and `cluster`.** Constraints on an auto-layout engine rather than a replacement for one, so output stays emergent and unpredictable from the source.
+Version 0.8.1. Early stage, but works. The parser, layout engine, and SVG renderer are written in TypeScript, with zero runtime dependencies. There is a command-line tool that turns a .reladraw text file into an SVG.
 
-**Structurizr.** Has real manual layout, but is bound to the C4 model, which makes it a modeling notation with a renderer attached rather than a general placement language.
+The language isn't stable yet, so expect the syntax to change.
 
 ## License
 
-Apache-2.0. This is a reusable primitive where adoption is the value, so restricting commercial use would defeat the purpose. See [LICENSE](LICENSE).
-
-The license covers the code, not the name: it grants no rights to use "reladraw", the project logo, or the project's other marks. Forks are welcome and should carry a different name. See [NOTICE](NOTICE).
+Apache-2.0. See [LICENSE](LICENSE). The license covers the code, not the name. It grants no rights to "reladraw", the project logo or the project's other marks. See [NOTICE](NOTICE).
 
 ## Contributing
 
-Issues are wanted — especially a diagram you tried to write and could not. While the language is changing quickly, an issue is more useful than a pull request; [CONTRIBUTING.md](CONTRIBUTING.md) says why.
+Issues are welcome. Particularly helpful is a diagram you could not represent in reladraw. While the language is still changing quickly, an issue helps more than a pull request. See [CONTRIBUTING.md](CONTRIBUTING.md).

package/SYNTAX.md

@@ -1,4 +1,4 @@
-# Syntax reference — 0.7.1
+# Syntax reference — 0.8.1
 
 What the language accepts. The parser, resolver and SVG renderer implement all of it; the sections at the end record what is defective, unchecked or undecided.
 
@@ -171,6 +171,7 @@ Every node has a *body*: the thing that is drawn where the node is. Two keys nam
 | --- | --- |
 | `rectangle` | The plain rounded box. The default, so nothing has to say it. |
 | `document` | The same box with its top-right corner folded — the flowchart symbol saying *this is an artifact, not a process*. |
+| `circle` | A circle just big enough to hold the text, and always round — a longer text makes a bigger circle, never an oval. |
 | `none` | No outline, no fill, no padding. The node is its text and nothing else. |
 
 `icon: <name>` is a picture the node is drawn **as**, with no box at all.
@@ -193,7 +194,11 @@ node svc  icon: cube
 
 A node has one body, so writing both keys is an error naming both.
 
-The `document` fold is worth having because a shape is a second channel alongside color, and a stronger one. A fill means whatever you assigned it and a reader has to learn it from the diagram; a folded corner has meant "a document" for as long as there have been flowcharts, and reads with no legend. Most diagrams lose the difference between a thing that runs and a thing that is produced, because every node is a rectangle. `circle` and `diamond` will join these when a diagram asks for them.
+The `document` fold is worth having because a shape is a second channel alongside color, and a stronger one. A fill means whatever you assigned it and a reader has to learn it from the diagram; a folded corner has meant "a document" for as long as there have been flowcharts, and reads with no legend. Most diagrams lose the difference between a thing that runs and a thing that is produced, because every node is a rectangle. `diamond` will join these when a diagram asks for one.
+
+A circle is an ordinary node in every other way, and the file means the same thing whichever shape its nodes are. `from: right` on a circle leaves from its rightmost point, and several edges on one side spread round the quarter of the circle about that point, each meeting it square on. A corner such as `top-right` is the point on the circle halfway between those two sides, not the corner of the square around it. A circle can hold other nodes; they sit in the middle of it. A circle cannot yet take a `badge:`, a `deck:`, or a node placed against its own edge or text, and each is refused with an error saying so.
+
+`circle` is the one name that describes the picture rather than the meaning, because a circle has no single meaning to name it after: it is a state in one diagram, a step in another, a person in a third.
 
 A name says what the thing *is*, never what the picture looks like: naming the meaning is what lets the drawing be improved later without every diagram that uses it changing sense. `document`, not `folded-corner`. The one place that rule stops is a picture with no single meaning — the cube stands for a container in one diagram, a VM in another, a service in a third — which is why it is called `cube` and not `instance`. An unrecognized name is an error listing the whole set, rather than a node that quietly draws nothing.
 
@@ -437,6 +442,10 @@ Several such lines over the same row take a lane each, the shorter inside the lo
 
 Sides at right angles can face away too. `from: left  to: top` with the far node to the right leaves heading away from it, so the line steps out of the left, goes up past both nodes, runs along above them and comes straight down into the top. The side named at the far end says which way round: `to: bottom` takes it underneath instead.
 
+When the two nodes are stacked instead — `from: bottom  to: left` into a node directly below — going out past both and coming straight in would pass through the lower node. There the line is one curve, bending round the corner into the side named. If even the curve would cross a node, the line goes round the node on the side it names, as `left of` that node would send it.
+
+Both ends can name the same side. `from: left  to: left` with the far node to the right leaves heading away from it, and has to get round the node behind to reach the far side. It goes over the top, as the lines above do, and down into the gap; in a column, `from: bottom  to: bottom` goes round the right.
+
 Over the top is the rule, not a guess the tool makes each time — it does not look for the shorter way round. To send the line underneath or round the left, say which side of a node it passes: `below resolver`. See "Passing on one side of a node".
 
 #### Several edges between the same two sides
@@ -1012,6 +1021,16 @@ That one was found by testing the lexer, not by rendering — and it could not h
 
 Pre-1.0, so the minor number is where a breaking change goes. Every removal below is refused by name with the replacement quoted, rather than dropped in silence — an older file stops with an error saying what to write instead.
 
+**0.8.1**
+
+- A fix, no syntax change. An edge naming a side at both ends could be drawn through one of its own nodes in two cases. With the nodes stacked and the sides at right angles, such as `from: bottom  to: left`, the line went down past the lower node and came back up through it; it is now one curve round the corner. With both ends naming the same side, such as `from: left  to: left`, the line ran straight through the node behind; it now goes over the top of that node, or round the right in a column. Existing diagrams with such an edge will look different, and correct.
+
+- A fix, no syntax change. Children of a container stack close together, and an edge with no text between two of them used to get only that step, so it drew as an arrowhead with no line behind it. The gap now widens to show a short run of line behind each head, as an edge with text already did for its text. Existing diagrams with such an edge will look different, and correct.
+
+**0.8.0**
+
+- `shape: circle`. A circle is sized to hold its text and is always round. Edges on one of its sides spread round that quarter of the circle, and a corner of it is the point on the circle halfway round. It does not yet take a badge, a deck or a node placed against its own edge. Nothing that already renders changes.
+
 **0.7.1**
 
 - A fix, no syntax change. An edge with `line: (path: straight)` and a clause such as `below m` could draw its text on top of `m`. The line now bends through the room left for the text, so the text sits clear of the node. Existing diagrams with such an edge will look different, and correct.

package/dist/constants.d.ts

@@ -59,6 +59,14 @@ export declare const THICKNESS: Record<string, number>;
  * thickness is a size, like a text's, and a size is allowed to take room.
  */
 export declare function arrowLength(thickness: number): number;
+/**
+ * Line left showing behind the head of an edge with no text, so a gap an arrow
+ * crosses is at least this plus its heads. Stacked children sit `CHILD_GAP`
+ * apart, which is less than one head, and an arrow between them drew as a head
+ * with no line. This is what the tightest named gap already leaves behind a
+ * normal head, so any gap an author could have asked for holds it unchanged.
+ */
+export declare const BARE_EDGE_RUN: number;
 /**
  * Line left showing between an edge's text and the box at that end of the
  * corridor it crosses.

package/dist/constants.js

@@ -71,6 +71,14 @@ export const THICKNESS = {
 export function arrowLength(thickness) {
     return ARROW_MARKER_WIDTH * thickness;
 }
+/**
+ * Line left showing behind the head of an edge with no text, so a gap an arrow
+ * crosses is at least this plus its heads. Stacked children sit `CHILD_GAP`
+ * apart, which is less than one head, and an arrow between them drew as a head
+ * with no line. This is what the tightest named gap already leaves behind a
+ * normal head, so any gap an author could have asked for holds it unchanged.
+ */
+export const BARE_EDGE_RUN = GAPS['tight'] - ARROW_LENGTH;
 /**
  * Line left showing between an edge's text and the box at that end of the
  * corridor it crosses.

package/dist/icons.d.ts

@@ -50,13 +50,16 @@ export declare const ICON_NAMES: string[];
  * diagram, while a folded corner has meant "an artifact, not a process" in
  * flowcharts for decades and reads with no legend at all.
  *
- * `circle` and `diamond` join these when a diagram asks. The set being short is
- * a fact about what has been drawn, not about the key.
+ * `circle` is the one geometric name, because a circle carries no single
+ * meaning to name it after — it is a state, a step, a person, whatever the
+ * diagram's own convention makes it. `diamond` joins these when a diagram
+ * asks. The set being short is a fact about what has been drawn, not about the
+ * key.
  */
-export declare const OUTLINES: readonly ["rectangle", "document"];
+export declare const OUTLINES: readonly ["rectangle", "document", "circle"];
 export type Outline = (typeof OUTLINES)[number];
 /** Every value `shape:` accepts, `none` included. */
-export declare const SHAPE_WORDS: readonly ["rectangle", "document", "none"];
+export declare const SHAPE_WORDS: readonly ["rectangle", "document", "circle", "none"];
 /**
  * What a node is drawn as: an outline, a picture, or nothing at all.
  *

package/dist/icons.js

@@ -126,10 +126,13 @@ export const ICON_NAMES = Object.keys(ICONS);
  * diagram, while a folded corner has meant "an artifact, not a process" in
  * flowcharts for decades and reads with no legend at all.
  *
- * `circle` and `diamond` join these when a diagram asks. The set being short is
- * a fact about what has been drawn, not about the key.
+ * `circle` is the one geometric name, because a circle carries no single
+ * meaning to name it after — it is a state, a step, a person, whatever the
+ * diagram's own convention makes it. `diamond` joins these when a diagram
+ * asks. The set being short is a fact about what has been drawn, not about the
+ * key.
  */
-export const OUTLINES = ['rectangle', 'document'];
+export const OUTLINES = ['rectangle', 'document', 'circle'];
 /** Every value `shape:` accepts, `none` included. */
 export const SHAPE_WORDS = [...OUTLINES, 'none'];
 const PLAIN = { kind: 'shape', outline: 'rectangle' };

package/dist/render.js

@@ -230,6 +230,16 @@ const FOLD = CORNER * 2;
 /** The node's outline, as path data. */
 function outlinePath(shape, x, y, w, h) {
     const r = CORNER;
+    if (shape === 'circle') {
+        // Two half-turns from the leftmost point, since one arc cannot close.
+        const radius = w / 2;
+        return [
+            `M${round(x)} ${round(y + h / 2)}`,
+            `a${round(radius)} ${round(radius)} 0 1 0 ${round(w)} 0`,
+            `a${round(radius)} ${round(radius)} 0 1 0 ${round(-w)} 0`,
+            'Z',
+        ].join(' ');
+    }
     if (shape === 'document') {
         // Every corner rounded but the top-right one, which is cut away and folded.
         return [
@@ -897,6 +907,10 @@ function sidePoint(box, toward) {
     const dy = toward.y - center.y;
     if (dx === 0 && dy === 0)
         return center;
+    if (box.round) {
+        const scale = box.width / 2 / Math.hypot(dx, dy);
+        return { x: center.x + dx * scale, y: center.y + dy * scale };
+    }
     const scaleX = dx === 0 ? Infinity : box.width / 2 / Math.abs(dx);
     const scaleY = dy === 0 ? Infinity : box.height / 2 / Math.abs(dy);
     const scale = Math.min(scaleX, scaleY);
@@ -1291,6 +1305,8 @@ function claim(claims, node, side, entry) {
 }
 /** The point `at` along one side of a box, with the outward normal for that side. */
 function anchorOn(face, side, at) {
+    if (face.round)
+        return anchorOnCircle(face, side, at);
     switch (side) {
         case 'top':
             return { x: at, y: face.y, tx: 0, ty: -1, side };
@@ -1302,6 +1318,28 @@ function anchorOn(face, side, at) {
             return { x: face.x + face.width, y: at, tx: 1, ty: 0, side };
     }
 }
+/**
+ * The same, on a circle: a side is the quarter of the circle around its
+ * compass point, and `at` is walked round the arc rather than along a
+ * straight edge, so points spaced a step apart on a side are a step apart on
+ * the circle too. The line meets the circle square on, heading from its center.
+ */
+function anchorOnCircle(face, side, at) {
+    const radius = face.width / 2;
+    const center = centerOf(face);
+    const across = side === 'top' || side === 'bottom' ? at - center.x : at - center.y;
+    const turn = Math.max(-Math.PI / 4, Math.min(Math.PI / 4, across / radius));
+    // SVG's y runs down, so the bottom is a quarter-turn clockwise from the right.
+    const angle = {
+        right: turn,
+        bottom: Math.PI / 2 - turn,
+        left: Math.PI - turn,
+        top: -Math.PI / 2 + turn,
+    }[side];
+    const tx = Math.cos(angle);
+    const ty = Math.sin(angle);
+    return { x: center.x + radius * tx, y: center.y + radius * ty, tx, ty, side };
+}
 /** An end with no side named: leave from the border, pointing at the far end. */
 function free(face, toward) {
     const point = sidePoint(face, toward);
@@ -1324,6 +1362,20 @@ function exitAlong(box, from, dir) {
     // is the graceful answer, and the crowding it signals is a diagnostic.
     const x = Math.min(Math.max(from.x, box.x), box.x + box.width);
     const y = Math.min(Math.max(from.y, box.y), box.y + box.height);
+    if (box.round) {
+        // Where the ray leaves the circle: the larger root of |p + t·dir − c| = r.
+        const center = centerOf(box);
+        const px = x - center.x;
+        const py = y - center.y;
+        const a = dir.x * dir.x + dir.y * dir.y;
+        const b = px * dir.x + py * dir.y;
+        const c = px * px + py * py - (box.width / 2) ** 2;
+        const reach = b * b - a * c;
+        if (a === 0 || reach < 0)
+            return { x, y };
+        const t = Math.max(0, (-b + Math.sqrt(reach)) / a);
+        return { x: x + dir.x * t, y: y + dir.y * t };
+    }
     const tx = dir.x === 0 ? Infinity : ((dir.x > 0 ? box.x + box.width : box.x) - x) / dir.x;
     const ty = dir.y === 0 ? Infinity : ((dir.y > 0 ? box.y + box.height : box.y) - y) / dir.y;
     const t = Math.min(tx, ty);
@@ -1508,14 +1560,37 @@ function planLoops(edges, nodes, ends, corridors, routes, measurer, fontSize) {
         const { start, end } = ends.get(edge);
         if (start.side === undefined || end.side === undefined)
             continue;
-        // Sides at right angles, one facing away from the other end.
+        // Sides at right angles, one facing away from the other end. Going out
+        // past both boxes and coming straight in is right when the boxes are side
+        // by side. When the other end lies within the span of the box facing away
+        // — stacked boxes — coming straight in would pass through that box, so
+        // the curve is kept, which has room to bend round the corner; and if even
+        // the curve hits a box, the line goes round the facing-away box on the
+        // side it names.
         if (start.tx * end.tx + start.ty * end.ty === 0) {
+            const away = awayEnd(edge, start, end);
+            if (away && within(faceOf(away.node), away.anchor, away.other)) {
+                if (curveHits(edge, ends.get(edge), nodes)) {
+                    implyRoute(edge, away.node, sidePass(away.anchor.side), nodes, ends, routes, measurer, fontSize);
+                }
+                continue;
+            }
             const inWay = nodes.filter((node) => !(contains(node, edge.from) && contains(node, edge.to)));
             const plan = turnBack(edge, start, end, inWay, routes, measurer, fontSize);
             if (plan)
                 tops.push(plan);
             continue;
         }
+        // Both sides facing the same way, one box behind the other: the line has
+        // to get round that box to reach the far side, which a curve cannot. It
+        // goes over the top, or round the right for a column, as a loop does.
+        if (start.tx === end.tx && start.ty === end.ty) {
+            const away = awayEnd(edge, start, end);
+            if (away && curveHits(edge, ends.get(edge), nodes)) {
+                implyRoute(edge, away.node, start.tx !== 0 ? 'above' : 'right', nodes, ends, routes, measurer, fontSize);
+            }
+            continue;
+        }
         // The two ends point opposite ways along one axis, each away from the other.
         if (start.tx !== -end.tx || start.ty !== -end.ty)
             continue;
@@ -1703,6 +1778,90 @@ function turnBack(edge, start, end, inWay, routes, measurer, fontSize) {
         },
     };
 }
+/**
+ * Whether the single curve an edge would otherwise be drawn as passes through
+ * a box: either of its own, or any other that holds neither end. Measured on
+ * the curve itself, so the answer is the picture's and not a rule about which
+ * sides were named.
+ *
+ * Only passing through counts. Also counting a curve that merely comes close,
+ * or whose text touches a node, was tried (2026-09-27) and sent nearly every
+ * such edge the long way round with square corners, which the user rejected
+ * outright.
+ */
+function curveHits(edge, { start, end, bow }, nodes) {
+    const reach = controlReach(start, end);
+    const lift = 4 / 3;
+    const bx = (bow?.x ?? 0) * lift;
+    const by = (bow?.y ?? 0) * lift;
+    const c1 = { x: start.x + start.tx * reach + bx, y: start.y + start.ty * reach + by };
+    const c2 = { x: end.x + end.tx * reach + bx, y: end.y + end.ty * reach + by };
+    const at = (t) => {
+        const u = 1 - t;
+        return {
+            x: u * u * u * start.x + 3 * u * u * t * c1.x + 3 * u * t * t * c2.x + t * t * t * end.x,
+            y: u * u * u * start.y + 3 * u * u * t * c1.y + 3 * u * t * t * c2.y + t * t * t * end.y,
+        };
+    };
+    // The line starts and ends on its own boxes' sides, so those are shrunk a
+    // pixel to let it touch them there.
+    const boxes = [
+        ...[edge.from, edge.to].map((node) => grow(extentOfBox(faceOf(node)), -1)),
+        ...nodes
+            .filter((node) => !contains(node, edge.from) && !contains(node, edge.to))
+            .map((node) => extentOfBox(faceOf(node))),
+    ];
+    const steps = 32;
+    let previous = start;
+    for (let step = 1; step <= steps; step += 1) {
+        const point = at(step / steps);
+        if (boxes.some((box) => segmentHits(previous, point, box)))
+            return true;
+        previous = point;
+    }
+    return false;
+}
+/**
+ * The end of an edge whose side faces away from the other end, with its node
+ * and the other end's anchor; the start if both do.
+ */
+function awayEnd(edge, start, end) {
+    const facesAway = (from, to) => from.tx * (to.x - from.x) + from.ty * (to.y - from.y) < 0;
+    if (facesAway(start, end))
+        return { node: edge.from, anchor: start, other: end };
+    if (facesAway(end, start))
+        return { node: edge.to, anchor: end, other: start };
+    return undefined;
+}
+/**
+ * Whether a line coming straight in to `other`, across the way `anchor`'s side
+ * faces, would pass through `box` — that is, `other` lies within the box's
+ * span along that way.
+ */
+function within(box, anchor, other) {
+    const run = anchor.tx !== 0 ? 'x' : 'y';
+    return lo(box, run) < other[run] && other[run] < hi(box, run);
+}
+/** The clause that passes a node on the side named. */
+function sidePass(side) {
+    return side === 'top' ? 'above' : side === 'bottom' ? 'below' : side;
+}
+/**
+ * Route an edge as if it carried one clause the author did not write, passing
+ * `node` on that side. If that cannot be drawn, the edge keeps its curve: a
+ * refusal would name a clause that is not in the file, and would refuse a file
+ * earlier versions drew.
+ */
+function implyRoute(edge, node, direction, nodes, ends, routes, measurer, fontSize) {
+    const written = `${direction === 'left' || direction === 'right' ? `${direction} of` : direction} ${node.name}`;
+    try {
+        routes.set(edge, planRoute(edge, [{ direction, nodes: [node], written }], nodes, ends.get(edge), measurer, fontSize));
+    }
+    catch (error) {
+        if (!(error instanceof SourceError))
+            throw error;
+    }
+}
 /** The most a route's corner is rounded by. */
 const ROUTE_RADIUS = 20;
 /**
@@ -2421,6 +2580,7 @@ function faceOf(node) {
         y: node.y + node.inset,
         width: node.width - node.inset,
         height: node.height - node.inset,
+        round: node.body.kind === 'shape' && node.body.outline === 'circle',
     };
 }
 function centerOf(box) {

package/dist/resolve.js

@@ -1,5 +1,5 @@
 import { ALL_ATTR_KEYS, ATTR_KEYS, PART_SIDES, COLOR_KEYS, COLOR_PARTS, CONTENT_ALIGNMENTS, CONTENT_WIDTHS, LINE_VALUES, describePlacement, nameTarget, } from './ast.js';
-import { CHILD_GAP, DECK_STEP, DEFAULT_FONT_SIZE, DEFAULT_MARGIN, GAPS, HEADER_GAP, ICON_GAP, ICON_LINES, TEXT_CLEARANCE, PAD, SEPARATION_GAP, THICKNESS, arrowLength, fontSizeFor, leafTop, textExtent, textStyleFor, widestLine, } from './constants.js';
+import { BARE_EDGE_RUN, CHILD_GAP, DECK_STEP, DEFAULT_FONT_SIZE, DEFAULT_MARGIN, GAPS, HEADER_GAP, ICON_GAP, ICON_LINES, TEXT_CLEARANCE, PAD, SEPARATION_GAP, THICKNESS, arrowLength, fontSizeFor, leafTop, textExtent, textStyleFor, widestLine, } from './constants.js';
 import { fix, reachability, tightest } from './constrain.js';
 import { SourceError } from './errors.js';
 import { bodyFor } from './icons.js';
@@ -598,6 +598,9 @@ function sizeNode(node, edges, measurer, fontSize, local) {
     // too. The *absence* of children makes the setting inert, which stays silent;
     // a value the language does not have is wrong wherever it is written.
     const contents = contentsStyleFor(node);
+    const circle = isCircle(node);
+    if (circle)
+        refuseOnCircle(node);
     if (node.children.length === 0) {
         // `at` is read on a leaf too, and is inert wherever the box is exactly the
         // size of what it holds — which is every leaf, since a leaf is sized from
@@ -629,7 +632,7 @@ function sizeNode(node, edges, measurer, fontSize, local) {
     }
     else {
         if (contents.widths === 'match')
-            matchWidths(node.children);
+            matchWidths(node.children, local);
         let content = layoutChildren(node.children, edges, measurer, fontSize, local);
         if (contents.widths === 'fill') {
             // The band is the wider of the title and the contents, so filling it
@@ -638,7 +641,7 @@ function sizeNode(node, edges, measurer, fontSize, local) {
             // could not give.
             const band = Math.max(textWidth, content.width);
             for (const child of node.children)
-                widenTo(child, band);
+                widenTo(child, band, local);
             content = layoutChildren(node.children, edges, measurer, fontSize, local);
             checkOneColumn(node, node.children, local);
         }
@@ -671,8 +674,62 @@ function sizeNode(node, edges, measurer, fontSize, local) {
         }
         node.banded = true;
     }
+    if (circle)
+        circumscribe(node, local);
     applyDeck(node, local);
 }
+function isCircle(node) {
+    return node.body.kind === 'shape' && node.body.outline === 'circle';
+}
+/**
+ * Grow a node sized as a rectangle into the circle around what it holds.
+ *
+ * The circle passes a padding outside the corners of the padded-in block —
+ * the text of a leaf, or the band and contents of a container — so whatever
+ * fits in the rectangle fits in the circle, clear of its edge by the same
+ * padding at the corners where it comes closest. Everything inside moves to
+ * keep the block centered.
+ */
+function circumscribe(node, local) {
+    const side = Math.hypot(node.width - PAD * 2, node.height - PAD * 2) + PAD * 2;
+    moveInside(node, (side - node.width) / 2, (side - node.height) / 2, local);
+    node.width = side;
+    node.height = side;
+}
+function moveInside(node, dx, dy, local) {
+    node.textBox.x += dx;
+    node.textBox.y += dy;
+    for (const child of node.children) {
+        const offset = local.get(child);
+        offset.x += dx;
+        offset.y += dy;
+    }
+}
+/**
+ * What a circle does not take yet, refused by name rather than drawn as an
+ * ellipse or with a copy's text outside the outline.
+ *
+ * Something placed against the circle's own edge or text — a badge included —
+ * sizes the frame in the same solve as the thing placed, and a circle's corner
+ * points are a fraction of a radius that solve does not know yet. A deck's
+ * copies write their text at the top-left of the face, which on a circle is
+ * outside it.
+ */
+function refuseOnCircle(node) {
+    const [framed] = framedChildren(node);
+    if (node.attrs['badge'] !== undefined || node.appearance['badge'] !== undefined) {
+        throw new SourceError(`"${node.name}" is a circle with a badge:, and a badge is not built for circles yet — ` +
+            'make it a rectangle, or place the badge as a node of its own against the circle', node.line);
+    }
+    if (framed !== undefined) {
+        throw new SourceError(`"${framed.name}" is placed against "${node.name}" itself, and "${node.name}" is a circle. ` +
+            'Something placed against a circle\'s own edge or text is not built yet — place it against ' +
+            `another node, or make "${node.name}" a rectangle`, framed.line);
+    }
+    if (node.deckTexts.length > 0) {
+        throw new SourceError(`"${node.name}" is a circle with a deck:, and a deck is not built for circles yet`, node.line);
+    }
+}
 /**
  * Make room for a deck's copies, once the node's own face has been sized.
  *
@@ -726,10 +783,10 @@ function contentsStyleFor(node) {
  * before layoutChildren sizes and positions anything from those widths. A
  * container's own children are already sized by this point.
  */
-function matchWidths(children) {
+function matchWidths(children, local) {
     const maxWidth = Math.max(...children.map((child) => child.width));
     for (const child of children)
-        widenTo(child, maxWidth);
+        widenTo(child, maxWidth, local);
 }
 /**
  * `widths: fill` makes every child as wide as the band, which only holds for
@@ -757,8 +814,18 @@ function checkOneColumn(node, children, local) {
  * was sized from its own contents, and the text's box was worked out against
  * the old one. A left-ranged text stays where it is; a centered or right-ranged
  * one moves by its share of the difference.
+ *
+ * A circle grows both ways, since a wider circle is a bigger one, and what is
+ * inside it stays centered.
  */
-function widenTo(node, width) {
+function widenTo(node, width, local) {
+    if (isCircle(node)) {
+        const grew = width - node.width;
+        moveInside(node, grew / 2, grew / 2, local);
+        node.width = width;
+        node.height = width;
+        return;
+    }
     // A node with something placed against its own frame is laid out by a
     // solve, and a wider frame is one more thing that solve has to hold: the
     // things against its right edge move, and a centered text re-centers.
@@ -1013,7 +1080,7 @@ function layoutFramed(node, own, edges, measurer, fontSize, local, minWidth) {
     let block = { width: 0, height: 0 };
     if (banded) {
         if (contents.widths === 'match')
-            matchWidths(stacked);
+            matchWidths(stacked, local);
         block = layoutChildren(stacked, edges, measurer, fontSize, local);
         if (contents.widths === 'fill') {
             // The row is the text and whatever stands beside it, each at its gap.
@@ -1025,7 +1092,7 @@ function layoutFramed(node, own, edges, measurer, fontSize, local, minWidth) {
             }
             const across = Math.max(row, block.width);
             for (const child of stacked)
-                widenTo(child, across);
+                widenTo(child, across, local);
             block = layoutChildren(stacked, edges, measurer, fontSize, local);
             checkOneColumn(node, stacked, local);
         }
@@ -1337,6 +1404,9 @@ function memberOn(target, axis) {
  * away together or not at all (`left right` with `from` first); sides at right
  * angles each may, and either is enough (`left top` with `from` first, where
  * the edge turns back over the top, or with `to` below, where it goes round).
+ * The same side on both is left out on purpose: that edge goes round the box
+ * behind, and its text rides on the stretch over that box and the gap, so the
+ * room made in the gap is what keeps a long text clear of the line's turns.
  */
 function facingAway(fromSide, toSide) {
     // The axis a side is on, and whether it faces away when its own end is first.
@@ -1383,22 +1453,34 @@ function liftTo(node, indexOf, local) {
         height: node.height,
     };
 }
-/** The edges with text whose two ends are different members of this group. */
+/** The edges whose two ends are different members of this group. */
 function corridorsIn(edges, locate, measurer, fontSize) {
     const corridors = [];
     for (const edge of edges) {
-        // An edge with no text asks for nothing: every gap holds an arrowhead. And a
-        // edge told to pass between two named things carries its text in *that*
+        // An edge told to pass between two named things carries its text in *that*
         // corridor rather than in the gap between its own ends, so widening this one
         // would make room where the text never goes.
         // An edge that says which side of something it passes is routed round it,
         // and its text rides on that route for the same reason.
-        if (edge.text === undefined || edge.between || edge.passes)
+        if (edge.between || edge.passes)
             continue;
         const from = locate(edge.from);
         const to = locate(edge.to);
         if (!from || !to || from.index === to.index)
             continue;
+        // With no text, the gap still has to show a run of line behind each head,
+        // or two stacked children with an arrow between them draw as a head alone.
+        if (edge.text === undefined) {
+            const bare = BARE_EDGE_RUN + arrowLength(edge.look.thickness) * (edge.both ? 2 : 1);
+            corridors.push({
+                edge,
+                from,
+                to,
+                need: { x: bare, y: bare },
+                away: facingAway(edge.attrs['from'], edge.attrs['to']),
+            });
+            continue;
+        }
         // The clearance is doubled because the text is drawn at the *midpoint* of
         // the line, so the room it needs is symmetric about that point whatever sits
         // at either end. The arrowhead is charged on both sides for the same reason:
@@ -1720,6 +1802,15 @@ function partOf(target, part, owner, line) {
     };
     narrow('x', 'left', 'right');
     narrow('y', 'top', 'bottom');
+    // A circle has no corners, so a corner of one is the point on it halfway
+    // between the two sides named: on the outline, as a rectangle's corner is.
+    const across = words.includes('left') || words.includes('right');
+    const down = words.includes('top') || words.includes('bottom');
+    if (isCircle(target.node) && across && down) {
+        const pull = (target.width / 2) * (1 - Math.SQRT1_2);
+        box.offset.x += words.includes('left') ? pull : -pull;
+        box.offset.y += words.includes('top') ? pull : -pull;
+    }
     return box;
 }
 /** Where a node of this size sits so that the named side of it meets the span's. */

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "reladraw",
-  "version": "0.7.1",
+  "version": "0.8.1",
   "description": "A diagram language where you say where things go.",
   "type": "module",
   "bin": {
@@ -34,6 +34,7 @@
   "scripts": {
     "build": "tsc",
     "prepublishOnly": "npm run build",
+    "preversion": "./dev.sh check-version \"$npm_new_version\"",
     "dev": "tsc --watch",
     "example": "npm run build && node dist/cli.js examples/arch.reladraw -o examples/out/arch.svg"
   },