We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c7bf105 commit 0263a18Copy full SHA for 0263a18
src/backtrack.rs
@@ -13,7 +13,7 @@
13
// regexes on small inputs because of its memory requirements.
14
//
15
// In particular, this is a *bounded* backtracking engine. It retains worst
16
-// case linear time by keeping track of the states that is has visited (using a
+// case linear time by keeping track of the states that it has visited (using a
17
// bitmap). Namely, once a state is visited, it is never visited again. Since a
18
// state is keyed by `(instruction index, input index)`, we have that its time
19
// complexity is `O(mn)` (i.e., linear in the size of the search text).
0 commit comments