pub fn matches(pattern: &Pattern, m: &Moniker) -> bool
Matches pattern against the segments of m. ** is greedy non-deterministic — recursive backtracking, O(2^n) worst case but moniker depth ≤ ~10 in practice.
pattern
m
**