Tree::Suffix - Perl interface to the libstree library.
use Tree::Suffix; $tree = Tree::Suffix->new; $tree = Tree::Suffix->new(@strings); $bool = $tree->allow_duplicates($bool); $count = $tree->insert(@strings); $count = $tree->remove(@strings); $count = $tree->find($string); $count = $tree->match($string); $count = $tree->search($string); @pos = $tree->find($string); @pos = $tree->match($string); @pos = $tree->search($string); $string = $tree->string($id); $string = $tree->string($id, $start ,$end); @lcs = $tree->lcs; @lcs = $tree->lcs($min_len, $max_len); @lcs = $tree->longest_common_substrings; @lrs = $tree->lrs; @lrs = $tree->lrs($min_len, $max_len); @lrs = $tree->longest_repeated_substrings; $count = $tree->strings; @pos = $tree->strings; $count = $tree->nodes; $tree->clear; $tree->dump;
Tree::Suffix module provides an interface to the C library libstree, which implements generic suffix trees.
NOTICE: as libstree has outstanding bugs and has long been abandoned, this distribution is not being maintained.
Creates a new Tree::Suffix object. The constructor will accept a list of strings to be inserted into the tree.
Determines whether duplicate strings are permitted in the tree. By default, duplicates are allowed. Note, this must be called before strings are inserted for it to have an effect. Returns the value of the flag.
Inserts the list of strings into the tree, excluding duplicates if they are not allowed. Returns the number of successfull insertions.
Remove the list of strings from the tree, including duplicates if they are allowed. Returns the number of successful removals.
In scalar context, returns the number of occurrences of the substring in the tree. In list context, returns the positions of all occurrences of the given string as a list of array references in the form [string_index, start, end].
Returns the string at index_id. The start and end positions may be specified to return a substring.
Returns a list of the longest common substrings. The minimum and maximum length of the considered substrings may be specified.
Returns a list of the longest repeated substrings. The minimum and maximum length of the considered substrings may be specified.
In scalar context, returns the total number of strings in the tree. In list context, returns the list of string indexes.
Returns the total number of nodes in the tree.
Removes all strings from the tree.
Prints a representation of the tree to STDOUT.
To find the longest palindrome of a string:
use Tree::Suffix; $str = 'mississippi'; $tree = Tree::Suffix->new($str, scalar reverse $str); ($pal) = $tree->lcs; print "Longest palindrome: $pal\n";
This would print:
Longest palindrome: ississi
A memory leak will be exhibited if you are using a version of libstree < .4.2.
When reporting a bug, first verify that you can successfully run the tests in the libstree distribution.
Please report any bugs or feature requests to http://rt.cpan.org/Public/Bug/Report.html?Queue=Tree-Suffix. I will be notified, and then you'll automatically be notified of progress on your bug as I make changes.
You can find documentation for this module with the perldoc command.
You can also look for information at:
Copyright (C) 2006-2009 gray <gray at cpan.org>, all rights reserved.
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
gray, <gray at cpan.org>