Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion index.bs
Original file line number Diff line number Diff line change
Expand Up @@ -1367,7 +1367,7 @@ Build a composed graph up to a given output operand into a computational graph a
1. Let |operators| be a new empty [=/set=].
1. Let |inputs| be a new empty [=/set=].
1. Let |queue| be a new [=queue=] containing |outputs|'s [=map/values=].
1. While |queue| is not [=queue/empty=]:
1. While |queue| [=queue/is not empty=]:
1. [=queue/Dequeue=] |operand| from |queue|.
1. [=set/Append=] |operand| to |operands|.
1. [=set/Append=] |operand|.{{MLOperand/[[operator]]}} to |operators|.
Expand Down
5 changes: 5 additions & 0 deletions tools/lint.mjs
Original file line number Diff line number Diff line change
Expand Up @@ -273,4 +273,9 @@ for (const match of source.matchAll(/^ *\d+\. .*$/mg)) {
}
}

// Avoid incorrect links to list/empty.
for (const match of source.matchAll(/is( not)? \[=(list\/|stack\/|queue\/|)empty=\]/g)) {
error(`Link to 'is empty' (adjective) not 'empty' (verb): ${format(match)}`);
}

globalThis.process.exit(exitCode);