// Generic approach that works with any non-left recursive rules.
Generic approach that works with any non-left recursive rules.
Generic approach that works with any non - left recursive rules .
fn is_message_valid_using_list_of_suffixes_wrapper(r: &RulesMap, m: &str) -> bool {
    // An empty message means that the recursive matcher consumed the whole message.
    is_message_valid_using_list_of_suffixes(m, &r, 0)
        .iter()
        .any(|msg| msg.is_empty())
}
fn is_message_valid_using_list_of_suffixes_wrapper ( r : & RulesMap , m : & str ) -> bool { // An empty message means that the recursive matcher consumed the whole message. is_message_valid_using_list_of_suffixes ( m , & r , 0 ) . iter ( ) . any ( | msg | msg . is_empty ( ) ) }
Generic approach that works with any non-left recursive rules.
Generic approach that works with any non - left recursive rules .
r
&RulesMap
m
&str