matches » Developer.Team

YuPcre2 1.21.0 for Delphi 11-12.0 Cracked

YuPcre2 1.21.0 for Delphi 11-12.0 Cracked
YuPcre2 v1.21.0 for Delphi 11-12.0 Cracked


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.
Read more

YuPcre2 v1.20.1 Cracked for Delphi 6 - Delphi 11

YuPcre2 v1.20.1 Cracked for Delphi 6 - Delphi 11
YuPcre2 v1.20.1 Cracked for Delphi 6 - Delphi 11


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.
Read more

YuPcre2 1.20.0 for Delphi 11 Alexandria

YuPcre2 1.20.0 for Delphi 11 Alexandria
YuPcre2 1.20.0 for Delphi 11 Alexandria Cracked


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.
Read more

Entrian Source Search v1.8.3

Entrian Source Search v1.8.3
Entrian Source Search v1.8.3


Instantly find every occurrence of a word, phrase, function, variable, API, error code or anything else in your source code, with a single keystroke. Entrian Source Search is a search engine for your source code. It builds a full-text index of your files, and searches it instantly, giving syntax-colored results. It indexes everything, not just code, and includes powerful Fuzzy and Loose searching.
Read more

YuPcre2 1.19.0 for Delphi 11 Alexandria

YuPcre2 1.19.0 for Delphi 11 Alexandria
YuPcre2 1.19.0 for Delphi 11 Alexandria


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.
Read more

YuPcre2 1.17.0 for Delphi 11.0 Alexandria Cracked

YuPcre2 1.17.0 for Delphi 11.0 Alexandria Cracked
YuPcre2 1.17.0 for Delphi 11.0 Alexandria Cracked


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.
Read more