ValidationRuleParser

Create a new validation rule parser.

Parse the human-friendly rules into a full rules array for the validator.

Explode the rules into an array of explicit rules.

Explode the explicit rule into an array if necessary.

Prepare the given rule for the Validator.

Determine if the parser reduces a rule object to its string form.

Define a set of rules that apply to each element in an array attribute.

Uses a direct tree walk instead of flattening the entire data array with Arr::dot() and regex matching. This is O(n) in the number of matching keys instead of O(n*m) where m is the total flattened key count.

Explode wildcard rules that contain compilable rules.

Compiled rules receive the flattened data, which the tree walk does not build.

Determine if a rules array contains any CompilableRules at any nesting level.

Checks both top-level elements and elements inside nested arrays, so mixed rule arrays like ['nullable', Rule::forEach(...)] are detected.

Merge additional rules into a given attribute(s).

Merge additional rules into a given attribute.

Extract the rule name and parameters from a rule.

Parse an array based rule.

Parse a string based rule.

Parse a parameter list.

Determine if the rule is a regular expression.

Normalizes a rule so that we can accept short types.

Determine if a rule argument names a field rather than stating a date literal.

Behavioral callers must attempt literal parsing first. Compiler callers may conservatively delegate because false positives only select the full path.

Expand the conditional rules in the given array of rules.

Flush all static state.