Function nom::combinator::map

pub fn map<I, O1, O2, E, F, G>(
    first: F, 
    second: G
) -> impl FnMut(I) -> IResult<I, O2, E> where
    F: Parser<I, O1, E>,
    G: FnMut(O1) -> O2, 

Maps a function on the result of a parser.

use nom::character::complete::digit1;
use nom::combinator::map;

let mut parser = map(digit1, |s: &str| s.len());

// the parser will count how many characters were returned by digit1
assert_eq!(parser.parse("123456"), Ok(("", 6)));

// this will fail if digit1 fails
assert_eq!(parser.parse("abc"), Err(Err::Error(("abc", ErrorKind::Digit))));