perf: short circuit logic nodes when appropriate

[williballenthin]

closes #824
review and merge #828 first

Adds logic to and, or, and some statements and substring and regex features to detect when the nodes are minimally satisfied (or not) and to complete evaluation early. For example, if one child of an and statement fails, then the and statement will never be satisfied, and the remaining children don't actually have to be evaluated.

However, in some cases "thorough" evaluation may still be desirable, such as with or statements that have multiple children that may be satisfied. In a verbose output mode, users may want to see all the evidence related to a rule match, not just the minimal set of evidence.

Therefore, this PR includes logic to invoke the (fast) short circuiting mode first, and only if there's a match (uncommon), go back and collect the thorough results for display.

label	count(evaluations)	avg(time)	min(time)	max(time)
6c8d246 base	108,121	0.37s	0.31s	0.41s
ad119d7 short circuiting (always)	69,211	0.20s	0.16s	0.28s
3e74da9 short circuiting (hybrid)	69,401	0.25s	0.24s	0.29s

(via: PMA01-01, 30 iterations)

In the above table, we see that the PR here matches about 30% faster in this test case. When always short circuiting (at the expense of non-thorough results) then we can go a bit faster.

As expected, there are more node evaluations in the "hybrid" mode, as the engine goes back and collects thorough results once a match has been found.

Checklist

• No documentation update needed

[github-actions]

Please add bug fixes, new features, breaking changes and anything else you think is worthwhile mentioning to the master (unreleased) section of CHANGELOG.md. If no CHANGELOG update is needed add the following to the PR description: [x] No CHANGELOG update needed

CHANGELOG updated or no update needed, thanks! 😄