Algorithm-AhoCorasick
view release on metacpan or search on metacpan
lib/Algorithm/AhoCorasick/SearchMachine.pm view on Meta::CPAN
return keys %{$self->{results}};
}
# Adds pattern ending in this node.
sub add_result {
my ($self, $res) = @_;
$self->{results}->{$res} = 1;
}
# Adds transition node.
sub add_transition {
my ($self, $node) = @_;
$self->{transitions}->{$node->char} = $node;
}
1;
__END__
=head1 NAME
Algorithm::AhoCorasick::SearchMachine - implementation and low-level interface of Algorithm::AhoCorasick
=head1 VERSION
Version 0.03
=head1 SYNOPSIS
use Algorithm::AhoCorasick::SearchMachine;
sub callback {
my ($pos, $keyword) = @_;
...
return undef;
}
$machine = Algorithm::AhoCorasick::SearchMachine->new(@keywords);
while (<STDIN>) {
$machine->feed($_, \&callback);
}
=head1 METHODS
=head2 new
The constructor. Takes the list of keywords as parameters (there must
be at least one, and the constructor dies if they contain an empty
string).
=head2 feed
Feeds input to the state machine. First (after the instance) argument
of this method is the input text (which can be empty, in which case
the method doesn't do anything), second argument is the callback
invoked on each match. C<feed> calls the callback with 2 arguments:
the position and the matched keyword. The callback can stop further
search by returning a true value, which C<feed> returns. If the search
wasn't stopped, C<feed> returns undef, and can then be called with
another chunk of input text to continue the search (matching all
keywords, even those spanning multiple chunks). Note that when the
callback stops the search, this scenario doesn't work (because the
state machine gets out of sync); C<feed> should not be called again on
the same instance after the callback returned true. Also note that the
position passed to the callback is relative to the current input text
chunk; it is negative for keywords spanning multiple chunks.
=head1 AUTHOR
Vaclav Barta, C<< <vbar@comp.cz> >>
=head1 COPYRIGHT & LICENSE
Copyright 2010 Vaclav Barta, all rights reserved.
This program is free software; you can redistribute it and/or modify it
under the same terms as Perl itself.
=cut
( run in 1.032 second using v1.01-cache-2.11-cpan-39bf76dae61 )