regXwild 1.3.0

Small and super Fast Advanced wildcards! `*,|,?,^,$,+,#,>,++??,##??` in addition to slow regex engines and more.

       Unique algorithms that was implemented on native unmanaged C++ but easily accessible in .NET
       through Conari (recommended due to caching of 0x29 opcodes + related optimizations) etc.

       Samples [⏯](run)    | regXwild filter      | n
       ----------------------|----------------------|---------
       number = '1271';      | number = '????';     |  0 - 4
       year = '2020';        | '##'|'####'          |  2;  4
       year = '20';          | = '##??'             |  2;  4
       number = 888;         | number = +??;        |  1 - 3
       ...
       ----------------------|----------------------
       everything is ok      | ^everything*ok$
       systems               | system?
       systems               | sys###s
       A new 'X1' project    | ^A*'+' pro?ect
       professional system   | pro*system
       regXwild in action    | pro?ect$|open*source+act|^regXwild


       This package contains x64 + x32 Unicode + MultiByte modules
       and provides both support of the unmanaged and managed projects:
       
       * For native: .\lib\native\{Platform}-(Unicode or MultiByte)\ ~ regXwild.dll, regXwild.lib, regXwild.exp, include\*.h
       * For .NET it will put x32 & x64 regXwild into (TargetDir). Use it with your .net modules through Conari ( https://github.com/3F/Conari ) and so on.

       ## Why regXwild ?

       It was designed to be faster than just fast for features that usually go beyond the typical wildcards.
       Seriously, We love regex, I love, You love; 2013 far behind but regXwild still relevant for speed and powerful wildcards-like features,
       such as `##??` (which means 2 or 4) ...

       🔍 Easy to start

       Unmanaged native C++ or managed .NET project. It doesn't matter, just use it:

       C++
       ```cpp
       #include "regXwildAPI.h"
       using namespace net::r_eg::regXwild;
       ...
       if(searchEssC(_T("regXwild"), _T("reg?wild"), true)) {
           // ...
       }
       ```

       C# if you're using [ [Conari](https://github.com/3F/Conari) ]
       ```csharp
       using(var l = new ConariL("regXwild.dll"))
       {
           if(l.DLR.searchEssC<bool>("regXwild", "reg?wild", true)) {
               // ...
           }
       }
       ```

       🧮 Quantifiers

       regex           | regXwild   | n
       ----------------|------------|---------
       .*              | *          | 0+
       .+              | +          | 1+
       .?              | ?          | 0;  1
       .{1}            | #          | 1
       .{2}            | ##         | 2
       .{2, }          | ++         | 2+
       .{0, 2}         | ??         | 0 - 2
       .{2, 4}         | ++??       | 2 - 4
       (?:.{2}|.{4})   | ##??       | 2;  4
       .{3, 4}         | +++?       | 3 - 4
       (?:.{1}|.{3})   | #???       | 1;  3

       and similar ...

       Play with our actual **Unit-Tests**.

       🚀 Awesome speed

       * [~2000 times faster when C++](https://github.com/3F/regXwild#speed).
       * For .NET (including modern .NET Core), [Conari](https://github.com/3F/Conari) provides optional caching of 0x29 opcodes (Calli) and more to get a similar result as possible.

       
       =======================================
       gnt /p:ngpackages="regXwild/1.3.0"
       ================== https://github.com/3F/GetNuTool


   regXwild 1.3.0.3411+f3bd722    
   
   Configuration: PublicRelease    
   Build version: 3411    
   Branch Sha1:   f3bd722    
   
   :: generated by a vsSolutionBuildEvent 1.14.1.34071