regex 0.1.75

An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Documentation
// These tests don't really make sense with the bytes API, so we only test them
// on the Unicode API.

#[test]
fn empty_match_unicode_find_iter() {
    // Tests that we still yield byte ranges at valid UTF-8 sequence boundaries
    // even when we're susceptible to empty width matches.
    let re = regex!(u!(r".*?"));
    assert_eq!(vec![(0, 0), (3, 3), (4, 4), (7, 7), (8, 8)],
               findall!(re, "Ⅰ1Ⅱ2"));
}

#[test]
fn empty_match_unicode_captures_iter() {
    // Same as empty_match_unicode_find_iter, but tests capture iteration.
    let re = regex!(u!(r".*?"));
    let ms: Vec<_> = re.captures_iter(text!("Ⅰ1Ⅱ2"))
                       .map(|c| c.pos(0).unwrap())
                       .collect();
    assert_eq!(vec![(0, 0), (3, 3), (4, 4), (7, 7), (8, 8)], ms);
}

#[test]
fn eq() {
    use regex::Regex;
    assert_eq!(regex!(r"[a-z]+"), Regex::new("[a-z]+").unwrap());
}