| Name : perl-Tree-Ternary
| |
| Version : 0.04
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : lp155.5.1
| Date : 2023-07-20 20:20:10
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Tree-Ternary-0.04-lp155.5.1.src.rpm
|
| Size : 0.02 MB
| |
| Packager : https://www_suse_com/
| |
| Summary : Perl implementation of ternary search trees.
|
Description :
Tree::Ternary is a pure Perl implementation of ternary search trees as
described by Jon Bentley and Robert Sedgewick.
Ternary search trees are interesting data structures that provide a means
of storing and accessing strings. They combine the time efficiency of
digital tries with the space efficiency of binary search trees. Unlike a
hash, they also maintain information about relative order.
For more information on ternary search trees, visit:
the http://www.cs.princeton.edu/~rs/strings/ manpage
This module is a translation (albeit not a direct one) from the C
implementation published in Bentley and Sedgewick\'s article in the April
1998 issue of Dr. Dobb\'s Journal (see SEE ALSO).
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-T/15.5/noarch |
