Struct regex_automata::meta::regex::RegexInfo

source ·
pub(crate) struct RegexInfo(Arc<RegexInfoI>);

Tuple Fields§

§0: Arc<RegexInfoI>

Implementations§

source§

impl RegexInfo

source

fn new(config: Config, hirs: &[&Hir]) -> RegexInfo

source

pub(crate) fn config(&self) -> &Config

source

pub(crate) fn props(&self) -> &[Properties]

source

pub(crate) fn props_union(&self) -> &Properties

source

pub(crate) fn pattern_len(&self) -> usize

source

pub(crate) fn memory_usage(&self) -> usize

source

pub(crate) fn is_anchored_start(&self, input: &Input<'_>) -> bool

Returns true when the search is guaranteed to be anchored. That is, when a match is reported, its offset is guaranteed to correspond to the start of the search.

This includes returning true when input isn’t anchored but the underlying regex is.

source

pub(crate) fn is_always_anchored_start(&self) -> bool

Returns true when this regex is always anchored to the start of a search. And in particular, that regardless of an Input configuration, if any match is reported it must start at 0.

source

pub(crate) fn is_always_anchored_end(&self) -> bool

Returns true when this regex is always anchored to the end of a search. And in particular, that regardless of an Input configuration, if any match is reported it must end at the end of the haystack.

source

fn is_impossible(&self, input: &Input<'_>) -> bool

Returns true if and only if it is known that a match is impossible for the given input. This is useful for short-circuiting and avoiding running the regex engine if it’s known no match can be reported.

Note that this doesn’t necessarily detect every possible case. For example, when pattern_len() == 0, a match is impossible, but that case is so rare that it’s fine to be handled by the regex engine itself. That is, it’s not worth the cost of adding it here in order to make it a little faster. The reason is that this is called for every search. so there is some cost to adding checks here. Arguably, some of the checks that are here already probably shouldn’t be here…

Trait Implementations§

source§

impl Clone for RegexInfo

source§

fn clone(&self) -> RegexInfo

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl Debug for RegexInfo

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.