Returns a set of inputs rejected by the given iterator using the given input character set.
If the iterator accepts all words, undefined is guaranteed to be returned.
This algorithm implements an approximation to determine rejecting inputs in order to guarantee non-exponential
worst-case execution time. Consequently, the algorithm can't find rejecting inputs for some iterators and returns
undefined instead.
Returns a set of inputs rejected by the given iterator using the given input character set.
If the iterator accepts all words,
undefined
is guaranteed to be returned.This algorithm implements an approximation to determine rejecting inputs in order to guarantee non-exponential worst-case execution time. Consequently, the algorithm can't find rejecting inputs for some iterators and returns
undefined
instead.