maxmustermann/godot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity
godot/drivers/nrex
History
Rémi Verschelde d8223ffa75 Welcome in 2017, dear changelog reader! 
That year should bring the long-awaited OpenGL ES 3.0 compatible renderer
with state-of-the-art rendering techniques tuned to work as low as middle
end handheld devices - without compromising with the possibilities given
for higher end desktop games of course. Great times ahead for the Godot
community and the gamers that will play our games!

(cherry picked from commit c7bc44d5ad)
2017-01-12 19:15:30 +01:00
..
nrex.cpp Fixed zero-length arrays in nrex. Fixes #4346 2016-04-18 10:06:47 +01:00
nrex.hpp Updated nrex to v0.2 2016-04-08 13:29:37 +01:00
nrex_config.h Regex library Nrex initial port 2015-07-24 01:18:46 +01:00
README.md Updated nrex to v0.2 2016-04-08 13:29:37 +01:00
regex.cpp Add missing license headers in our source files (#5255) 2016-06-18 14:46:12 +02:00
regex.h Welcome in 2017, dear changelog reader! 2017-01-12 19:15:30 +01:00
SCsub SCsub: Add python shebang as a hint for syntax highlighting 2016-10-30 14:51:34 +01:00

README.md

NREX: Node RegEx

Build Status

** Version 0.2 **

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
  • Any character . (includes newlines)
  • Shorthand caracter classes \w\W\s\S\d\D
  • POSIX character classes such as [[:alnum:]]
  • Bracket expressions such as [A-Za-z]
  • Simple quantifiers ?, * and +
  • Range quantifiers {0,1}
  • Lazy (non-greedy) quantifiers *?
  • Begining ^ and end $ anchors
  • Word boundaries \b
  • Alternation |
  • ASCII \xFF code points
  • Unicode \uFFFF code points
  • Positive (?=) and negative (?!) lookahead
  • Positive (?<=) and negative (?<!) lookbehind (fixed length and no alternations)
  • Backreferences \1 and \g{1} (limited by default to 9 - can be unlimited)

License

Copyright (c) 2015-2016, Zher Huei Lee All rights reserved.

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.

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