2015-07-24 00:18:46 +00:00
|
|
|
# NREX: Node RegEx
|
|
|
|
|
2016-04-08 12:29:37 +00:00
|
|
|
[![Build Status](https://travis-ci.org/leezh/nrex.svg?branch=master)](https://travis-ci.org/leezh/nrex)
|
|
|
|
|
|
|
|
** Version 0.2 **
|
2015-12-04 21:18:41 +00:00
|
|
|
|
2015-07-24 00:18:46 +00:00
|
|
|
Small node-based regular expression library. It only does text pattern
|
|
|
|
matchhing, not replacement. To use add the files `nrex.hpp`, `nrex.cpp`
|
|
|
|
and `nrex_config.h` to your project and follow the example:
|
|
|
|
|
|
|
|
nrex regex;
|
|
|
|
regex.compile("^(fo+)bar$");
|
|
|
|
|
|
|
|
nrex_result captures[regex.capture_size()];
|
|
|
|
if (regex.match("foobar", captures))
|
|
|
|
{
|
|
|
|
std::cout << captures[0].start << std::endl;
|
|
|
|
std::cout << captures[0].length << std::endl;
|
|
|
|
}
|
|
|
|
|
|
|
|
More details about its use is documented in `nrex.hpp`
|
|
|
|
|
|
|
|
Currently supported features:
|
|
|
|
* Capturing `()` and non-capturing `(?:)` groups
|
2015-10-20 08:37:49 +00:00
|
|
|
* Any character `.` (includes newlines)
|
2015-07-24 00:18:46 +00:00
|
|
|
* Shorthand caracter classes `\w\W\s\S\d\D`
|
2015-10-20 08:37:49 +00:00
|
|
|
* POSIX character classes such as `[[:alnum:]]`
|
|
|
|
* Bracket expressions such as `[A-Za-z]`
|
2015-07-24 00:18:46 +00:00
|
|
|
* Simple quantifiers `?`, `*` and `+`
|
|
|
|
* Range quantifiers `{0,1}`
|
|
|
|
* Lazy (non-greedy) quantifiers `*?`
|
|
|
|
* Begining `^` and end `$` anchors
|
2015-10-20 08:37:49 +00:00
|
|
|
* Word boundaries `\b`
|
2015-07-24 00:18:46 +00:00
|
|
|
* Alternation `|`
|
2015-10-20 08:37:49 +00:00
|
|
|
* ASCII `\xFF` code points
|
2015-07-24 00:18:46 +00:00
|
|
|
* Unicode `\uFFFF` code points
|
2015-10-20 08:37:49 +00:00
|
|
|
* Positive `(?=)` and negative `(?!)` lookahead
|
|
|
|
* Positive `(?<=)` and negative `(?<!)` lookbehind (fixed length and no alternations)
|
2015-12-04 21:18:41 +00:00
|
|
|
* Backreferences `\1` and `\g{1}` (limited by default to 9 - can be unlimited)
|
2015-07-24 00:18:46 +00:00
|
|
|
|
|
|
|
## License
|
|
|
|
|
2016-04-08 12:29:37 +00:00
|
|
|
Copyright (c) 2015-2016, Zher Huei Lee
|
2015-07-24 00:18:46 +00:00
|
|
|
All rights reserved.
|
|
|
|
|
2015-10-20 08:37:49 +00:00
|
|
|
This software is provided 'as-is', without any express or implied
|
|
|
|
warranty. In no event will the authors be held liable for any damages
|
|
|
|
arising from the use of this software.
|
|
|
|
|
|
|
|
Permission is granted to anyone to use this software for any purpose,
|
|
|
|
including commercial applications, and to alter it and redistribute it
|
|
|
|
freely, subject to the following restrictions:
|
|
|
|
|
|
|
|
1. The origin of this software must not be misrepresented; you must not
|
|
|
|
claim that you wrote the original software. If you use this software
|
|
|
|
in a product, an acknowledgment in the product documentation would
|
|
|
|
be appreciated but is not required.
|
|
|
|
|
|
|
|
2. Altered source versions must be plainly marked as such, and must not
|
|
|
|
be misrepresented as being the original software.
|
|
|
|
|
|
|
|
3. This notice may not be removed or altered from any source
|
|
|
|
distribution.
|
2016-04-08 12:29:37 +00:00
|
|
|
|
|
|
|
|
|
|
|
# Changes
|
|
|
|
|
|
|
|
## Version 0.2 (2016-08-04)
|
|
|
|
* Fixed capturing groups matching to invalid results
|
|
|
|
* Fixed parents of recursive quantifiers not expanding properly
|
|
|
|
* Fixed LookAhead sometimes adding to result
|
|
|
|
* More verbose unit testing
|
|
|
|
|
|
|
|
## Version 0.1 (2015-12-04)
|
|
|
|
* Initial release
|