hohn/codeql
1
0
Fork 0
mirror of https://github.com/github/codeql.git synced 2026-04-26 09:15:12 +02:00
Code Issues Packages Projects Releases Wiki Activity

Update docs/language/learn-ql/writing-queries/debugging-queries.rst

Browse Source 
Co-Authored-By: shati-patel <42641846+shati-patel@users.noreply.github.com>
(cherry picked from commit 47f61f3569)
This commit is contained in:
James Fletcher
2020-01-03 15:55:14 +00:00
committed by james
parent f3d2588dae
commit d8f31068d5
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/language/learn-ql/writing-queries/debugging-queries.rst
View File

@@ -81,7 +81,7 @@ That is, you should define a *base case* that allows the predicate to *bottom ou
The query optimizer has special data structures for dealing with `transitive closures <https://help.semmle.com/QL/ql-handbook/recursion.html#transitive-closures>`__.
If possible, use a transitive closure over a simple recursive predicate, as it is likely to be computed faster.
Folding predicates
Fold predicates
~~~~~~~~~~~~~~~~~~
Sometimes you can assist the query optimizer by "folding" parts of large predicates out into smaller predicates.