minimum » Developer.Team

TMS Sparkle v3.21 Full Source for Delphi XE2-Delphi 11 Alexandria

TMS Sparkle v3.21 Full Source for Delphi XE2-Delphi 11 Alexandria
TMS Sparkle v3.21 Full Source for Delphi XE2-Delphi 11 Alexandria


TMS Sparkle is a Delphi framework for network, Internet programming. It provides classes for both client and server applications/services, allowing for example performing Http requests to servers, or building Http servers that receive and process client requests. It supports several platforms, including Microsoft Windows, macOS, iOS and Android. TMS Sparkle is also the core framework used by several other TMS products such as TMS RemoteDB and TMS XData.
Read more

TMS Logging v2.4 Full Source for Delphi XE7-Delphi 11 Alexandria

TMS Logging v2.4 Full Source for Delphi XE7-Delphi 11 Alexandria
TMS Logging v2.4 Full Source for Delphi XE7-Delphi 11 Alexandria


Compact cross-platform logging framework offering informative log output to a flexible number of targets with a minimum amount of code.

Feature overview
Log to one or more output handlers such as the Console, HTML, Text file, CSV file, TCP/IP, Browser, Windows Event Log, ...
Heavily RTTI based for comprehensive type and class logging with simple log statements
Cross-platform: supports VCL Win32/Win64 apps and FMX Win32/Win64/macOS/iOS/Android apps
Class & property attribute based log output control & log output validation
Read more

YuPcre2 1.12.0 for Delphi 10.3 Rio Cracked

YuPcre2 1.12.0 for Delphi 10.3 Rio Cracked
YuPcre2 1.12.0 for Delphi 10.3 Rio 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