arbtest 0.3.1

A minimalist property-based testing library based on arbitrary
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
41
42
43
44
45
46
47
48
49
50
51

//! This example uses `arbtest` to find a minimal regex which matches `abba` but
//! not `baab`.
//!
//! With the given seed, we get the following sequence of minimizations:
//!
//! ```
//! (a)|(((a)|(b))|((a(a)|((b)|(((b)*)|(((a)|(b))|((ab)|(((b)*)|(((((a)|(a))|(a))*)|(a))))))))*))a
//! ((b)|(ab)((b)|((a)|(a)))*)|(a)
//! ((((((b)*)|(a))|(a))*)*a)|(a)
//! ((b)|(a))*a
//! ((b)|(a))*a
//! ((b)*a)*
//! ```

use arbtest::{arbitrary, arbtest};
use regex::Regex;

fn arb_regex(u: &mut arbitrary::Unstructured<'_>) -> arbitrary::Result<String> {
    let choices: &[fn(&mut arbitrary::Unstructured<'_>) -> arbitrary::Result<String>] = &[
        |_u| Ok("a".to_string()),
        |_u| Ok("b".to_string()),
        |u| arb_regex(u).map(|r| format!("({r})*")),
        |u| {
            let l = arb_regex(u)?;
            let r = arb_regex(u)?;
            Ok(format!("{l}{r}"))
        },
        |u| {
            let l = arb_regex(u)?;
            let r = arb_regex(u)?;
            Ok(format!("({l})|({r})"))
        },
    ];
    u.choose(choices)?(u)
}

fn main() {
    arbtest(|u| {
        let r = arb_regex(u)?;
        if let Ok(regex) = Regex::new(&format!("^({r})$")) {
            if regex.is_match("abba") && !regex.is_match("baab") {
                eprintln!("{r}");
                panic!()
            }
        }
        Ok(())
    })
    .budget_ms(10_000)
    .seed(0x7abcb62800000020)
    .minimize();
}