Telerik UI for Silverlight R1 2017 SP1 2017.1.222 with Source Code/Help/Demos

Telerik UI for Silverlight R1 2017 SP1 2017.1.222 with Source Code/Help/Demos
Telerik UI for Silverlight R1 2017 SP1 2017.1.222 with Source Code/Help/Demos | 430 Mb


Telerik UI for Silverlight includes a wide range of controls from small UI components such as Rating to powerful data-driven controls like GridView. The suite provides a variety of data visualization tools which allow you to display and edit your data in many different ways. Manipulate your row data in a GridView or Spreadsheet and then visualize it through PivotGrid, or any of the other charting and diagramming tools. Choose from a number of components for daily or business planning such as ScheduleView where users can easily plan their day and GanttView which allows users to visualize and manage any project planning data. Telerik UI for Silverlight comes complete with customizable UI controls for a variety of needs and options, which makes it the ideal choice for any Line of Business Application.

DOWNLOAD

DIZipWriter 6.2.2 D7-XE10.1

DIZipWriter 6.2.2 D7-XE10.1
DIZipWriter 6.2.2 D7-XE10.1 | 3 Mb


DIZipWriter is a Delphi component to create PKZip-compatible ZIP archives. Archive output is completely stream-based and works with any TStream descendant. DIZipWriter therefore direclty writes to files (TFileStream), memory (TMemoryStream), or even database BLOBs (TBlobStream). Convenience functions to work files and file based archives are available.

DOWNLOAD

YuPcre2 v1.5.0 D7-XE10.1

YuPcre2 v1.5.0 D7-XE10.1
YuPcre2 v1.5.0 D7-XE10.1 | 6 Mb


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.

DOWNLOAD