Skip to content

Spelling frontend #10897

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
aibaars merged 3 commits into from
Oct 20, 2022
Merged

Spelling frontend #10897

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
cd0e69a
spelling: meaningful
jsoref Oct 20, 2022
7cc61ec
spelling: monotonic
jsoref Oct 20, 2022
8fa524c
spelling: substitution
jsoref Oct 20, 2022
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
4 changes: 2 additions & 2 deletions docs/codeql/ql-language-reference/expressions.rst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -571,7 +571,7 @@ If there had been two different prices for apples too, the monotonic

Charles wants to buy a banana, which is not for sale at all. In the
default case, the sum produced for Charles includes the cost of the
apple he *can* buy, but there's no line for Charles in the monontonic
apple he *can* buy, but there's no line for Charles in the monotonic
``sum`` output, because there *is no way* for Charles to buy one apple
plus one banana.

Expand All @@ -586,7 +586,7 @@ case: As long as there's no price for bananas, no output is produced
for him. This means that if we later do learn of a banana price, we
don't need to *remove* any output tuple already produced. The
importance of this is that the monotonic aggregate behavior works well
with a fixpoint-based semantics for recursion, so it will be meaningul
with a fixpoint-based semantics for recursion, so it will be meaningful
to let the ``getPrice`` predicate be mutually recursive with the count
aggregate itself. (On the other hand, ``getFruit`` still cannot be
allowed to be recursive, because adding another fruit to someone's
Expand Down
4 changes: 2 additions & 2 deletions docs/codeql/ql-language-reference/signatures.rst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,8 +22,8 @@ Predicate signatures are defined much like predicates themselves, but they do no
In detail, a predicate signature definition consists of:

#. The keyword ``signature``.
#. The keyword ``predicate`` (allows subsitution with a :ref:`predicate without result <predicates-without-result>`),
or the type of the result (allows subsitution with a :ref:`predicate with result <predicates-with-result>`).
#. The keyword ``predicate`` (allows substitution with a :ref:`predicate without result <predicates-without-result>`),
or the type of the result (allows substitution with a :ref:`predicate with result <predicates-with-result>`).
#. The name of the predicate signature. This is an `identifier <https://codeql.github.com/docs/ql-language-reference/ql-language-specification/#identifiers>`_
starting with a lowercase letter.
#. The arguments to the predicate signature, if any, separated by commas.
Expand Down