9 releases

new 0.6.3 Nov 30, 2024
0.6.2 Mar 31, 2024
0.5.3 Mar 7, 2024
0.4.0 Dec 31, 2023
0.0.1 Jul 30, 2023

#302 in Parser implementations

Download history 2/week @ 2024-08-22 3/week @ 2024-08-29 4/week @ 2024-09-05 6/week @ 2024-09-12 30/week @ 2024-09-19 24/week @ 2024-09-26 3/week @ 2024-10-03 1/week @ 2024-10-10 3/week @ 2024-10-31 1/week @ 2024-11-07 4/week @ 2024-11-14 6/week @ 2024-11-21 122/week @ 2024-11-28

134 downloads per month
Used in 5 crates (via aopt)

MPL-2.0 license

395KB
10K SLoC

neure

A fast little combinational parsing library

Why neure

  • Better performance

  • Fewer dependencies

  • Faster compilation

Example

For more, reference examples

Example 1

use neure::prelude::*;

pub fn main() -> Result<(), Box<dyn std::error::Error>> {
    let year = re!(['0' - '9']+); // match digit from 0 to 9 more than once
    let year = year.map(map::from_str::<i32>()); // map it to i32
    let name = neu::ascii_alphabetic().repeat_one_more(); // match ascii alphabetic
    let mut ctx = CharsCtx::new("2024rust");

    // .then construct a tuple
    assert_eq!(ctx.ctor(&year.then(name))?, (2024, "rust"));
    Ok(())
}

Code comparation between crate regex

mod neure_ {
    use neure::prelude::*;

    fn parser(str: &str) -> Result<(), neure::err::Error> {
        let mut ctx = RegexCtx::new(str);
        let alpha = neu::range('a'..='z');
        let num = neu::digit(10);
        let name = neu!((alpha, num, '_', '.', '+', '-')).repeat_one_more();
        let domain = alpha.or(num).or('.').or('-').repeat_to::<256>().set_cond(
            |ctx: &CharsCtx, item: &(usize, char)| {
                // stop at last '.'
                Ok(!(item.1 == '.' && ctx.orig_at(ctx.offset() + item.0 + 1)?.find('.').is_none()))
            },
        );
        let email = re::start()
            .then(name)
            .then("@")
            .then(domain)
            .then(".")
            .then(neu!((alpha, '.')).repeat::<2, 6>())
            .then(re::end());

        ctx.try_mat(&email)?;
        Ok(())
    }

    pub fn parse(tests: &[&str], results: &[bool]) {
        for (test, result) in tests.iter().zip(results.iter()) {
            assert_eq!(parser(test).is_ok(), *result, "test = {}", test);
        }
    }
}

mod regex_ {
    use regex::Regex;

    pub fn parse(re: &Regex, tests: &[&str], results: &[bool]) {
        for (test, result) in tests.iter().zip(results.iter()) {
            assert_eq!(re.is_match(test), *result);
        }
    }
}

fn main() -> color_eyre::Result<()> {
    color_eyre::install()?;

    let test_cases = [
        "plainaddress",
        "#@%^%#$@#$@#.com",
        "@example.com",
        "joe smith <email@example.com>",
        "”(),:;<>[ ]@example.com",
        "much.”more unusual”@example.com",
        "very.unusual.”@”.unusual.com@example.com",
        "email@example.com",
        "firstname.lastname@example.com",
        "email@subdomain.example.com",
    ];
    let results = [
        false, false, false, false, false, false, false, true, true, true,
    ];
    let re: regex::Regex =
        regex::Regex::new(r"^([a-z0-9_\.\+-]+)@([\da-z\.-]+)\.([a-z\.]{2,6})$").unwrap();

    regex_::parse(&re, &test_cases, &results);
    neure_::parse(&test_cases, &results);

    Ok(())
}

LICENSE

MPL-2.0

Dependencies