Free Download Regular Expression Component Library for VC6 3.1 - Search and / or replace by habitue expression

C  Views:1008(+0) Freeware

The Regular Expression Component Library is an promiscuous to role library for searching and / or replacing strings or data in files using steady expressions. It supports both MFC programming using the MFC programming mould and non-MFC programming. Both methods of programming support a properties, methods, and events mould with VC++. Member function case handling is supported using the packaged Boost function and bind facilities which comes with the download.

It has compromising reflexion options to lucifer any type of steady reflexion syntax. There is wide documentation to explain its role and the library is fully supported. The library is also fast and promiscuous to role and the header files automatically join in the correct supporting libraries.

Regular expressions are a means of doing searching based on patterns adopted from the UNIX mind of steady expressions in various Unix tools.

The properties / methods / events mould uses:

a) Properties for specifying a steady reflexion, chain to lucifer, file specification ( with wildcards ) to lucifer, compromising options for steady reflexion syntax, compromising options for matching considerations, and other properties to enhance matching capabilities.

b) Methods to lucifer a chain in numerous ways; the entire chain, the beginning of the chain, anywhere in the chain, multiple exclusive matches in a chain. Methods to lucifer file data; either a single lucifer in a file or multiple matches in a file. A method to variety data in a chain or file based on format-like transposition syntax which can role the genuine data establish or one of its sub-expressions. A method for splitting strings based on steady expressions.

c) Events to hold the gathering of specific data for each of the matching methods. Most of the case handlers gain access to what the reflexion matches as easily as to what each sub-expression of the reflexion matches.