expressions » 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

TMS Analytics & Physics Pack v3.6.1.0 Full Source DXE7-Delphi 12 Athens

TMS Analytics & Physics Pack v3.6.1.0 Full Source DXE7-Delphi 12 Athens
TMS Analytics & Physics Pack v3.6.1.0 Full Source DXE7-Delphi 12 Athens


TMS Analytics & Physics Pack is a Delphi library for developers that contains special classes to work with analytical expressions in Delphi programs - parse expressions, calculate expression values with multiple parameters, expression based derivatives & integration calculation and so on. In addition, it offers approximation function calculation, solving differential and non-linear equations. TMS Analytics & Physics Pack allows using various physics concepts (such as physical quantities, units of measurement, ...) in Delphi programs.
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

Grapecity ActiveReportsJS Designer v3.1.1

Grapecity ActiveReportsJS Designer v3.1.1
Grapecity ActiveReportsJS Designer v3.1.1


The ActiveReportsJS Designer is an intuitive designer that extracts the data and prepares it for visualization in the form of reports. A jаvascript reporting tool is a set of web components used for data consolidation and visualization. ActiveReportsJS is a solution used by front-end developers to embed reporting within web applications. Major features such as the report designer and viewer components, powerful data visualizers, and the rich API make ActiveReportsJS an industry leader.
Read more

Wing Pro 9.0.2.1

Wing Pro 9.0.2.1
Wing Pro 9.0.2.1


Wing IDE Professional is a full-featured Python IDE designed for professional programmers. It includes powerful editor, code intelligence, refactoring, debugging, search, unit testing, project management, and revision control features. The Wing IDE layout is straightforward, with the editor window being its central fixture. Supporting panes, source browser, runtime output and debug panes and so on, are arranged on the periphery.
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

YuPcre2 1.16.0 for Delphi 10.4 Sydney Cracked

YuPcre2 1.16.0 for Delphi 10.4 Sydney Cracked
YuPcre2 1.16.0 for Delphi 10.4 Sydney 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

PowerGREP 5.3.0 Retail Portable (x64)

PowerGREP 5.3.0 Retail Portable (x64)
PowerGREP 5.3.0 Retail Portable (x64)


PowerGREP is a powerful Windows grep tool. Quickly search through large numbers of files on your PC or network, including text and binary files, compressed archives, MS Word documents, Excel spreadsheets, PDF files, OpenOffice files, etc. Find the information you want with powerful text patterns (regular expressions) specifying the form of what you want, instead of literal text. Search and replace with one or many regular expressions to comprehensively maintain web sites, source code, reports, etc. Extract statistics and knowledge from logs files and large data sets.
Read more