Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 33bc313 commit 887b49aCopy full SHA for 887b49a
1 file changed
python/ql/lib/semmle/python/dataflow/new/internal/IterableUnpacking.qll
@@ -52,7 +52,7 @@
52
* Note that an empty access path means that the value we are tracking flows directly to the element.
53
*
54
55
- * The `TIterableSequence(sequence)` is at this point superflous but becomes useful when handling recursive
+ * The `TIterableSequence(sequence)` is at this point superfluous but becomes useful when handling recursive
56
* structures in the LHS, where `sequence` is some internal sequence node. We can have a uniform treatment
57
* by always having these two synthetic nodes. So we transfer to (or, in the recursive case, read into)
58
* `TIterableSequence(sequence)`, from which we take a read step to `TIterableElement(sequence)` and then a
0 commit comments