Database Searcher is like Google for your SQL Server database. It will search all columns for all tables over multiple databases. It will return a summary of matches, the generated SQL and the detailed matches per table. It will also search the schema by the table names or column names. Knowledge of SQL queries is not required.

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.

Instantly find every occurrence of a word, phrase, function, variable, API, error code or anything else in your source code, with a single keystroke. Entrian Source Search is a search engine for your source code. It builds a full-text index of your files, and searches it instantly, giving syntax-colored results. It indexes everything, not just code, and includes powerful Fuzzy and Loose searching.

Easy GIF Animator is the world's most popular animated GIF editor and the top tool for creating animated pictures, banners and buttons. With this awesome application you can produce stunning animation effects, achieve unmatched image quality and compression and prepare your images for the web. No other GIF animation software matches our features and ease of use, that's why Easy GIF Animator is so popular.

Easy GIF Animator is the world's most popular animated GIF editor and the top tool for creating animated pictures, banners and buttons. With this awesome application you can produce stunning animation effects, achieve unmatched image quality and compression and prepare your images for the web. No other GIF animation software matches our features and ease of use, that's why Easy GIF Animator is so popular.

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.

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.

[justify]DIRegEx is a library of components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl for Delphi (Embarcadero / CodeGear / Borland).

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.