LINQPad is not just for LINQ queries, but any C#/F#/VB expression, statement block or program. Put an end to those hundreds of Visual Studio Console projects cluttering your source folder and join the revolution of LINQPad scripters and incremental developers. Reference your own assemblies and NuGet packages. Prototype your ideas in LINQPad and then paste working code into Visual Studio. Or call your scripts directly from the command-line. Experience LINQPads rich output formatting, optional debugger and autocompletion, and the magic of dynamic development and instant feedback!

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.

Debugging complex expressions is never easy. How do you see what was returned by inline and nested method calls? What did each predicate in the if statement evaluate to? Without simplifying the code or adding variables to store individual results, answering these questions is difficult. With OzCode's powerful Simplify feature, you can answer those questions with ease! When stepping over an expression, OzCode provides a visual representation of what each predicate evaluated to and the return value of any inline and nested method calls.

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.

Stimulsoft Ultimate is a universal set of tools for creating reports and dashboards. The product includes a complete set of tools for WinForms, ASP.NET, .NET Core, jаvascript, WPF, PHP, Java, and other environments. We provide easy-to-use and, at the same time, fully functional designer. You may create reports and dashboards for any of the supported platforms. Special wizards and editors will help you to cope with any task easily.

RegexBuddy is your perfect companion for working with regular expressions. Easily create regular expressions that match exactly what you want. Clearly understand complex regexes written by others. Quickly test any regex on sample strings and files, preventing mistakes on actual data. Debug without guesswork by stepping through the actual matching process. Use the regex with source code snippets automatically adjusted to the particulars of your programming language. Collect and document libraries of regular expressions for future reuse. GREP (search-and-replace) through files and folders. Integrate RegexBuddy with your favorite searching and editing tools for instant access.

Debugging complex expressions is never easy. How do you see what was returned by inline and nested method calls? What did each predicate in the if statement evaluate to? Without simplifying the code or adding variables to store individual results, answering these questions is difficult. With OzCode's powerful Simplify feature, you can answer those questions with ease! When stepping over an expression, OzCode provides a visual representation of what each predicate evaluated to and the return value of any inline and nested method calls.

LINQPad is not just for LINQ queries, but any C#/F#/VB expression, statement block or program. Put an end to those hundreds of Visual Studio Console projects cluttering your source folder and join the revolution of LINQPad scripters and incremental developers. Reference your own assemblies and NuGet packages. Prototype your ideas in LINQPad and then paste working code into Visual Studio. Or call your scripts directly from the command-line. Experience LINQPads rich output formatting, optional debugger and autocompletion, and the magic of dynamic development and instant feedback!

RegexMagic makes creating regular expressions easier than ever. While other regex tools such as RegexBuddy merely make it easier to work with regular expressions, with RegexMagic you don't have to deal with the regular expression syntax at all. RegexMagic generates complete regular expressions to your specifications.

Debugging complex expressions is never easy. How do you see what was returned by inline and nested method calls? What did each predicate in the if statement evaluate to? Without simplifying the code or adding variables to store individual results, answering these questions is difficult. With OzCode's powerful Simplify feature, you can answer those questions with ease! When stepping over an expression, OzCode provides a visual representation of what each predicate evaluated to and the return value of any inline and nested method calls.