#pattern-matching #compile-time #interpolation #unformat #format #regex #run-time

no-std unfmt

A compile-time pattern matching library that reverses the interpolation process of format!

5 releases

0.2.2 May 14, 2024
0.2.1 May 4, 2024
0.1.2 Apr 15, 2024
0.1.1 Apr 14, 2024
0.1.0 Feb 11, 2024

#93 in Value formatting

Download history 328/week @ 2024-09-18 170/week @ 2024-09-25 211/week @ 2024-10-02 246/week @ 2024-10-09 233/week @ 2024-10-16 22/week @ 2024-10-23 42/week @ 2024-10-30 18/week @ 2024-11-06 30/week @ 2024-11-13 43/week @ 2024-11-20 188/week @ 2024-11-27 191/week @ 2024-12-04 275/week @ 2024-12-11 202/week @ 2024-12-18 50/week @ 2024-12-25 183/week @ 2025-01-01

734 downloads per month
Used in acknowledgements-rs

MIT/Apache

12KB

unfmt

crates.io license ci docs

unfmt is a compile-time pattern matching library that reverses the interpolation process of format!.

You can think of it as an extremely lightweight regular expression engine without the runtime pattern-compilation cost.

Installation

cargo add -D unfmt

Usage

let value = "My name is Rho.";

// Unnamed captures are returned as tuples.
assert_eq!(
    unformat!("My {} is {}.", value),
    Some(("name", "Rho"))
);

// You can put indices as well; just make sure ALL captures use indices
// otherwise it's not well defined.
assert_eq!(
    unformat!("My {1} is {0}.", value),
    Some(("Rho", "name"))
);

// You can also name captures using variables, but make sure you check the
// return is not None.
let subject;
let object;
assert_eq!(
    unformat!("My {subject} is {object}.", value),
    Some(())
);
assert_eq!((subject, object), (Some("name"), Some("Rho")));

// If a type implements `FromStr`, you can use it as a type argument. This
// is written as `{:Type}`.
assert_eq!(
    unformat!("Listening on {:url::Url}", "Listening on http://localhost:3000"),
    Some((url::Url::from_str("http://localhost:3000").unwrap(),))
);

In general, captures are written as {<index-or-variable>:<type>}. Multiple captures in a row (i.e. {}{}) are not supported as they aren't well-defined.

Limitations

  • There is no backtracking.

Dependencies

~0.7–1.3MB
~25K SLoC