regex 0.2.7

An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

use syntax::hir::literal::Literals;

pub fn is_teddy_128_available() -> bool {
    false
}

#[derive(Debug, Clone)]
pub struct Teddy(());

#[derive(Debug, Clone)]
pub struct Match {
    pub pat: usize,
    pub start: usize,
    pub end: usize,
}

impl Teddy {
    pub fn new(_pats: &Literals) -> Option<Teddy> { None }
    pub fn patterns(&self) -> &[Vec<u8>] { &[] }
    pub fn len(&self) -> usize { 0 }
    pub fn approximate_size(&self) -> usize { 0 }
    pub fn find(&self, _haystack: &[u8]) -> Option<Match> { None }
}