mod dthen;
mod dynamic;
mod literal;
mod not;
pub use self::dthen::DynamicCreateRegexThen;
pub use self::dthen::DynamicCreateRegexThenHelper;
pub use self::dynamic::into_dyn_regex;
pub use self::dynamic::DynamicRegex;
pub use self::dynamic::DynamicRegexHandler;
pub use self::dynamic::DynamicRegexHelper;
pub use self::literal::LitSlice;
pub use self::literal::LitString;
pub use self::not::RegexNot;
use crate::ctx::Context;
use crate::ctx::Match;
use crate::ctx::Ret;
use crate::ctx::Span;
use crate::err::Error;
use crate::re::def_not;
use crate::re::trace;
use crate::re::Ctor;
use crate::re::Extract;
use crate::re::Handler;
use crate::re::Regex;
#[derive(Debug, Clone, Default, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct AnchorStart;
def_not!(AnchorStart);
impl AnchorStart {
pub fn new() -> Self {
Self {}
}
}
impl<'a, C, O> Ctor<'a, C, O, O> for AnchorStart
where
C: Context<'a> + Match<C>,
{
#[inline(always)]
fn constrct<H, A>(&self, ctx: &mut C, func: &mut H) -> Result<O, Error>
where
H: Handler<A, Out = O, Error = Error>,
A: Extract<'a, C, Span, Out<'a> = A, Error = Error>,
{
let ret = ctx.try_mat(self)?;
func.invoke(A::extract(ctx, &ret)?)
}
}
impl<'a, C> Regex<C> for AnchorStart
where
C: Context<'a>,
{
type Ret = Span;
#[inline(always)]
fn try_parse(&self, ctx: &mut C) -> Result<Self::Ret, crate::err::Error> {
let mut ret = Err(Error::Start);
let beg = ctx.offset();
if ctx.offset() == 0 {
ret = Ok(<Span as Ret>::from_ctx(ctx, (0, 0)))
}
trace!("start", beg => ctx.offset(), ret)
}
}
#[derive(Debug, Clone, Default, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct AnchorEnd;
def_not!(AnchorEnd);
impl AnchorEnd {
pub fn new() -> Self {
Self {}
}
}
impl<'a, C, O> Ctor<'a, C, O, O> for AnchorEnd
where
C: Context<'a> + Match<C>,
{
#[inline(always)]
fn constrct<H, A>(&self, ctx: &mut C, func: &mut H) -> Result<O, Error>
where
H: Handler<A, Out = O, Error = Error>,
A: Extract<'a, C, Span, Out<'a> = A, Error = Error>,
{
let ret = ctx.try_mat(self)?;
func.invoke(A::extract(ctx, &ret)?)
}
}
impl<'a, C> Regex<C> for AnchorEnd
where
C: Context<'a>,
{
type Ret = Span;
#[inline(always)]
fn try_parse(&self, ctx: &mut C) -> Result<Self::Ret, crate::err::Error> {
let mut ret = Err(Error::End);
let beg = ctx.offset();
if ctx.len() == ctx.offset() {
ret = Ok(<Span as Ret>::from_ctx(ctx, (0, 0)));
}
trace!("start", beg => ctx.offset(), ret)
}
}
#[derive(Debug, Clone, Default, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct Consume(usize);
def_not!(Consume);
impl Consume {
pub fn new(size: usize) -> Self {
Self(size)
}
}
impl<'a, C, O> Ctor<'a, C, O, O> for Consume
where
C: Context<'a> + Match<C>,
{
#[inline(always)]
fn constrct<H, A>(&self, ctx: &mut C, func: &mut H) -> Result<O, Error>
where
H: Handler<A, Out = O, Error = Error>,
A: Extract<'a, C, Span, Out<'a> = A, Error = Error>,
{
let ret = ctx.try_mat(self)?;
func.invoke(A::extract(ctx, &ret)?)
}
}
impl<'a, C> Regex<C> for Consume
where
C: Context<'a>,
{
type Ret = Span;
#[inline(always)]
fn try_parse(&self, ctx: &mut C) -> Result<Self::Ret, crate::err::Error> {
let mut ret = Err(Error::Consume);
let beg = ctx.offset();
if ctx.len() - beg >= self.0 {
ctx.inc(self.0);
ret = Ok(Span::new(beg, self.0));
}
trace!("consume", beg => ctx.offset(), ret)
}
}
#[derive(Debug, Clone, Default, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct ConsumeAll;
def_not!(ConsumeAll);
impl ConsumeAll {
pub fn new() -> Self {
Self {}
}
}
impl<'a, C, O> Ctor<'a, C, O, O> for ConsumeAll
where
C: Context<'a> + Match<C>,
{
#[inline(always)]
fn constrct<H, A>(&self, ctx: &mut C, func: &mut H) -> Result<O, Error>
where
H: Handler<A, Out = O, Error = Error>,
A: Extract<'a, C, Span, Out<'a> = A, Error = Error>,
{
let ret = ctx.try_mat(self)?;
func.invoke(A::extract(ctx, &ret)?)
}
}
impl<'a, C> Regex<C> for ConsumeAll
where
C: Context<'a>,
{
type Ret = Span;
#[inline(always)]
fn try_parse(&self, ctx: &mut C) -> Result<Self::Ret, crate::err::Error> {
let beg = ctx.offset();
let len = ctx.len().saturating_sub(ctx.offset());
ctx.inc(len);
trace!("consume_all", beg => ctx.offset(), Ok(Span::new(beg, len)))
}
}