YuPcre2 is a library of Delphi components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl, with just a few differences. There are two matching algorithms, the standard Perl and alternative DFA algorithm:

The Perl algorithm is what you are used to from Perl and j@vascript. It is fast and supports the complete pattern syntax. You will likely be using it most of the time.
DFA is a special purpose algorithm. If finds all possible matches and, in particular, it finds the longest. It never backtracks and supports partial matching better, in particular multi-segment matching of very long subject strings.

Delphi and C++ Builder jаvascript Object Notation (JSON) library.

Read and modify JSON files
Create new JSON files
Full JSON supported: literals, numbers, strings, arrays and objects
Date/time encoding and decoding supported
Customizable output
Provides in-memory and streaming JSON parsers and generators
Supports Windows, macOS, iOS and Android
Available for Delphi/C++ Builder 5 - 11 and Lazarus 2.0.12
Source code included in registered version
Royalty free distribution in applications

Eazfuscator.NET is the obfuscator for .NET platform. Sure, you love your code. We all do! Chances are that you want to shelter your precious intellectual property. Eazfuscator.NET helps to protect .NET code and your valuable assets.

Eazfuscator.NET is the obfuscator for .NET platform. Sure, you love your code. We all do! Chances are that you want to shelter your precious intellectual property. Eazfuscator.NET helps to protect .NET code and your valuable assets.

YuPcre2 is a library of Delphi components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl, with just a few differences. There are two matching algorithms, the standard Perl and alternative DFA algorithm:

The Perl algorithm is what you are used to from Perl and j@vascript. It is fast and supports the complete pattern syntax. You will likely be using it most of the time.
DFA is a special purpose algorithm. If finds all possible matches and, in particular, it finds the longest. It never backtracks and supports partial matching better, in particular multi-segment matching of very long subject strings.

Features :
- Little weight
- Beautiful ui design
- Easy to use

Features :
- Little weight
- Beautiful ui design
- Easy to use

YuPcre2 is a library of Delphi components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl, with just a few differences. There are two matching algorithms, the standard Perl and alternative DFA algorithm:

The Perl algorithm is what you are used to from Perl and j@vascript. It is fast and supports the complete pattern syntax. You will likely be using it most of the time.
DFA is a special purpose algorithm. If finds all possible matches and, in particular, it finds the longest. It never backtracks and supports partial matching better, in particular multi-segment matching of very long subject strings.

Best selling POP3/SMTP email .NET component for C#, VB.NET, and ASP.NET. Best selling Zip .NET component for C#, VB.NET, and ASP.NET. HTTP client component for communicating with HTTP servers.

Best selling POP3/SMTP email .NET component for C#, VB.NET, and ASP.NET. Best selling Zip .NET component for C#, VB.NET, and ASP.NET. HTTP client component for communicating with HTTP servers.

.NET encryption component for C#, VB.NET, ASP.NET:

Symmetric Encryption: AES, ChaCha20, Blowfish, Twofish, RC2, ARC4, DES, 3DES, PBES1, PBES2.
Hash Algorithms: SHA-1, SHA256, SHA384, SHA512, MD2, MD4, MD5, HAVAL.
Hash Algorithms: RIPEMD128, RIPEMD160, RIPEMD256, RIPEMD320.
Encoding: Base64, hex, quoted-printable, URL-encoding, modBase64, base32, base58, uu, url_oauth, url_rfc1738, url_rfc2396, url_rfc3986, fingerprint, decimal.