Currently the matching process generates quite a lot of internal state for its bookkeeping (4 vectors, 1 the size of the number of regexes in the set, and 3 the size of the number of entries (~atoms and a bit).
regex-filtered should probably provide a variant of matching which allows passing in a matchstate object that can be reused, with the existing methods generating that state internally for convenience. However it would have to validate the matchstate on input to ensure all the relevant vectors have the correct base state (some of them are prefilled not just preallocated).
Then uap-rust should also have a way to reuse matchstate as well.
Currently the matching process generates quite a lot of internal state for its bookkeeping (4 vectors, 1 the size of the number of regexes in the set, and 3 the size of the number of entries (~atoms and a bit).
regex-filteredshould probably provide a variant ofmatchingwhich allows passing in a matchstate object that can be reused, with the existing methods generating that state internally for convenience. However it would have to validate the matchstate on input to ensure all the relevant vectors have the correct base state (some of them are prefilled not just preallocated).Then uap-rust should also have a way to reuse matchstate as well.