share*it! Secure ordering


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 JavaScript. 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.

YuPcre2 has native interfaces for 8-bit, 16-bit, and 32-bit strings. Component wrappers are available for UnicodeString / WideString and AnsiString / Utf8String / RawBytestring. YuPcre2 RegEx2 classes descend from common ancestors which implement the core functionalities:

  • Match strings and and extract full or substring matches.
  • Search for regular expressions within streams and memory buffers. TDIRegExSearchStream descendants employ a buffered search within streams and files (of virtually unlimited size) and use little memory.
  • Replace full matches or partial substrings.
  • List full matches or partial substrings.
  • Format full matches or partial substrings by adding static or dynamic text.
Platform:   , Delphi 7, 2005, 2006, 2007, 2009, D2010, XE, XE2, XE3, XE4, XE5, XE6, XE7, XE8, 10 Seattle
Version:   1.x

YuPcre2 - Source Code
Unit Price:   USD 129.52 
Total:   USD 129.52
 Info plus 0% sales tax/VAT to USD 129.52: USD 0.00
USD 129.52
Delivery:   Download link by e-mail
  Download Demo  Add to Cart  Buy now!
YuPcre2 - Commercial
Unit Price:   USD 64.75 
Total:   USD 64.75
 Info plus 0% sales tax/VAT to USD 64.75: USD 0.00
USD 64.75
Delivery:   Download link by e-mail
  Download Demo  Add to Cart  Buy now!