Danil Pristupov Fork v2.3.0

Fork is getting better and better day after day and we are happy to share our results with you. Commit List - Working Directory Changes - Side by Side Diff - Repository Manager Summary and Statistics.

YuPcre2 v1.24.0 for Delphi 11-12 Athens

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.

Merge Conflicts
Resolve your merge-conflicts easily using the merge-conflict helper and built-in merge-conflict resolver.

A useful application for the web developers who need to automate the web applications testing by requesting multiple resources from a specified website It's only natural for professional web developers to need advanced testing tools for their applications, whether we are talking about a website or a web-based application. With a feature-rich feature set, HttpMaster Professional Edition aims to meet the requirements of many as far as application testing is concerned.

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.

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.

Merge Conflicts
Resolve your merge-conflicts easily using the merge-conflict helper and built-in merge-conflict resolver.

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.

Merge Conflicts
Resolve your merge-conflicts easily using the merge-conflict helper and built-in merge-conflict resolver.

Merge Conflicts
Resolve your merge-conflicts easily using the merge-conflict helper and built-in merge-conflict resolver.