mirror of
https://github.com/honeymoose/OpenSearch.git
synced 2025-03-09 14:34:43 +00:00
There are two edge cases that can be ran into when example input is matched in a weird way. 1. Recursion depth could continue many many times, resulting in a HUGE runtime cost. I put a limit of 10 recursions (could be adjusted I suppose). 2. If there are no "fixed regex bits", exploring the grok space would result in a fence-post error during runtime (with assertions turned off)