Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Regex #15

Open
archseer opened this issue Jan 25, 2019 · 2 comments
Open

Regex #15

archseer opened this issue Jan 25, 2019 · 2 comments
Labels
L-medium Level: medium

Comments

@archseer
Copy link
Owner

archseer commented Jan 25, 2019

This issue concerns the re module.

We want to use the regex crate, because it's mostly PCRE compatible, but drops lookaheads and some other features to make it execute in linear time. This way we'd be able to estimate the reductions based on the pattern and binary length.

This issue first requires binaries to be implemented (refs #20).

@archseer archseer added L-medium Level: medium K-research This topic is still being researched labels Jan 25, 2019
@archseer
Copy link
Owner Author

Binaries are now stable enough for this to be worked on.

Sidenote, we want to use regex::bytes (https://docs.rs/regex/1.1.0/regex/bytes/index.html), not regex, since the bytes submodule operates on raw &[u8]/Vec bytes — Rust String/&str requires us to always hold a valid utf-8 string, which is not necessarily true in erlang-land, it's also a bit more performant.

@archseer
Copy link
Owner Author

Work has started over on https://github.com/archseer/enigma/tree/regex

@archseer archseer removed the K-research This topic is still being researched label Jun 6, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
L-medium Level: medium
Projects
None yet
Development

No branches or pull requests

1 participant