marser 0.1.1

Parser combinator toolkit with matcher-level backtracking and rich error reporting.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40

use std::time::Duration;

use criterion::{Criterion, black_box, criterion_group, criterion_main};
use marser::parser::Parser;

#[path = "json_parse_shared.rs"]
mod shared;

use shared::{Fixture, assert_parse_clean, get_json_grammar, load_src};

fn bench_fixture(c: &mut Criterion, fixture: Fixture) {
    let label = fixture.label();
    let src = load_src(fixture);
    let parser = get_json_grammar();

    assert_parse_clean(label, &parser, src.as_str());

    let mut group = c.benchmark_group(label);
    if fixture == Fixture::Canada {
        // Default is ~100 samples in ~5s; full-file parse is hundreds of ms per iter.
        group
            .measurement_time(Duration::from_secs(20))
            .sample_size(50);
    }
    group.bench_function("parse", |b| {
        b.iter(|| {
            let out = parser.parse_str(black_box(src.as_str()));
            let _ = black_box(out);
        });
    });
    group.finish();
}

fn parse_fixtures(c: &mut Criterion) {
    bench_fixture(c, Fixture::Json0);
    bench_fixture(c, Fixture::Canada);
}

criterion_group!(benches, parse_fixtures);
criterion_main!(benches);