Similar to runNFA, but optimized for a short input F[A]
.
Similar to runNFA, but optimized for a short input F[A]
.
This version will always consume the entire F[A]
, even if it reaches a point in which a match
is impossible. However, it makes fewer allocations and has less overhead for each element that
it processes, so if the input F[A]
is short, then it can be faster than runNFA.