|
About:
monq.jfa is a class library for fast and flexible
text filtering with regular expressions. In
contrast to java.util.regex, monq.jfa allows a
regular expression to be bound to an action that
is automatically called whenever a match is
spotted in an input stream. In addition, it can
combine several ten thousand regex/action pairs
into one machinery (called a "deterministic finite
automaton" or DFA) for fast parallel text
filtering. A general purpose TCP server and
associated classes in monq.net allow the
bigger DFAs to be run as servers.
Author:
Harald Kirsch [contact developer]
Homepage:
http://monqjfa.berlios.de/
Jar:
http://prdownload.berlios.de/monqjfa/monq-1.1.1.jar
CVS tree (cvsweb):
http://svn.berlios.de/wsvn/monqjfa/
Demo site:
http://monqjfa.berlios.de/monqApiDoc/index.html
Trove categories:
[change]
Dependencies:
[change]
Jython (recommended)
[download links]
|
|
» Rating:
(not rated)
» Vitality: 0.01% (Rank 4485)
» Popularity: 0.73% (Rank 8041)

(click to enlarge graphs)
Record hits: 8,934
URL hits: 1,275
Subscribers: 19
|
|