{"ast_node_type":"other","tokens":[{"end":98,"kind":"keyword","start":0,"text":"///"}]}
/// algorithm in [`crate::usefulness`], this does a different traversal. Notably this is linear in
/// This is used to traverse patterns column-by-column for lints. Despite similarities with the
/// the depth of patterns, whereas `compute_exhaustiveness_and_usefulness` is worst-case exponential