From 57966b59eed37f2fab0fefff35af3ef87e379814 Mon Sep 17 00:00:00 2001 From: Lilleman auf Larv Date: Fri, 25 Sep 2026 08:34:29 +0200 Subject: [PATCH] Say what makes rows alternatives without history, and drop what the whole-draw rule already implies --- docs/decisions.md | 13 ++++++------- 1 file changed, 6 insertions(+), 7 deletions(-) diff --git a/docs/decisions.md b/docs/decisions.md index f7d0996..49baf2e 100644 --- a/docs/decisions.md +++ b/docs/decisions.md @@ -409,13 +409,12 @@ shared. Only one row renders per read, so within one read a cell in one row and a cell in another never meet, and each may select its own row of another table; the cells of one -row, and whatever they reach, do meet, and so does the format beside them. The rule the -fence applies is that two reads meet unless they sit in rows that never render together: -rows falling under different rows of a table a path pinned, two rows of that table -itself included. A table read whole draws its row apart from every pin, so the rows of -one whole read are alternatives only to each other, and a cell of one meets a read -pinning an ancestor row the row is not under. A choice's items get no such treatment yet: two items selecting -different rows are still refused. +row, and whatever they reach, do meet, and so does the format beside them. Two reads +meet unless they sit under different rows of one pinned table; pinning a row pins its +ancestors too, so rows under different parents are alternatives as well. A table read +whole draws its row apart from every pin, so the rows of one whole read are +alternatives only to each other. A choice's items are not alternatives: two items +selecting different rows of one family are refused. ## A table never reaches its own family, by any route