pom

• Remove extra type parameter of utf8::end(), skip() and list()
• Add 'trace' feature to be used in 'name'd parsers. (#63)
• Amend RangeArgument such that repeat accepts RangeToInclusive and RangeInclusive (#64)
• Add any() combinator

Expose the method field in Parser to allow custom combinators

Input symbol's trait bounds change Copy to Clone.

• 3.0 is based on 1.0 and changed:

pub struct Parser<'a, I, O> {
    method: Box<Fn(&mut Input<I>) -> Result<O> + 'a>,
}

to

pub struct Parser<'a, I, O> {
    method: Box<Fn(&'a [I], usize) -> Result<(O, usize)> + 'a>,
}

This is like 2.0 version, but avoids potential issue such as #23.

• Toolchain switched to Rust 2018 stable channel.

• Add p.expect(_), mark parser as expected, abort early when failed in ordered choice.

• Add p.many(range), like p.repeat(range) but return slice instead of vector.
• Add p.cache(), can be used to remember parser output result in case of potential backtracking.

• Greatly improved performance.
• Parser as trait, Combinator as wrapper struct.
• Apply zero-copy strategy.

• Add p.expect(_), mark parser as expected, abort early when failed in ordered choice.

• Remove range() function, one_of() and none_of() can accept range literal as well.
• Performance improvement.

• Can build on Rust stable 1.15.0.
• p.repeat(n) repeat p exactly n times.
• Implement Display and Error for pom::Error.

Thanks for Jeremy Fitzhardinge's contribution.