Struct RevRegex 

pub struct RevRegex(/* private fields */);

Implementations

impl RevRegex

pub fn compile(re: impl AsRef<str>) -> Result<Self, Error>

Attempt to compile the given regular expression into its reversed optimised VM opcode form. This is used for searching backwards through an input stream.

This method handles pre-allocation of the memory required for running the VM so that the allocation cost is paid once up front rather than on each use of the Regex.

pub fn find_rev_from<H>(&self, haystack: &H, offset: usize) -> Option<Match>

where H: Haystack,

Search the given Haystack for the leftmost longest match of this Regex starting from the provided from bytes offset rather than the beginning of the haystack, returning the match position along with all submatches.

Trait Implementations

impl Clone for RevRegex

fn clone(&self) -> RevRegex

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RevRegex

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for RevRegex

fn eq(&self, other: &RevRegex) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for RevRegex

impl StructuralPartialEq for RevRegex