match » Page 4 » Developer.Team

FastFind for Visual Studio v6.8

FastFind for Visual Studio v6.8
FastFind for Visual Studio v6.8


FastFind is a Visual Studio plugin that allows you to instantly open solution files and find text in files. The FastFind window will auto-update as you type, showing you anything relevant and allowing you to jump instantly to the code. FastFind lets you see the find results update as you type, and jump to the code, all without touching the mouse.
Read more

Kellermansoftware Name Parser v3.14.0.0

Kellermansoftware Name Parser v3.14.0.0
Kellermansoftware Name Parser v3.14.0.0


Name Parser is the most advanced name splitter in the world. Name Parser can be used to split names for storage into separate database fields. It can also match root names when matching names from different systems; Mike will match with Michael, Bob will match with Robert. Name Parser supports all .NET project types including ASP.NET Core, ASP.NET, MVC, WPF, Webforms, Winforms, WCF, Windows Services, and Web Services. It can be used with any .NET language including VB.NET and C#.
Read more

PowerGREP 5.1.6 Retail

PowerGREP 5.1.6 Retail
PowerGREP 5.1.6 Retail


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

YuPcre2 1.9.2 D7-D10.3 Rio

YuPcre2 1.9.2 D7-D10.3 Rio
YuPcre2 1.9.2 D7-D10.3 Rio


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