README for Tree::Ternary

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:

       http://www.cs.princeton.edu/~rs/strings/

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).


PREREQUISITES

Tree::Ternary doesn't use any nonstandard modules.


INSTALLATION

You install Tree::Ternary, as you would install any perl module
library, by running these commands:

  perl Makefile.PL
  make
  make test     # Only if Test.pm is installed
  make install

If you want to install a private copy of Tree::Ternary in your home
directory, then you should try to produce the initial Makefile with
something like this command:

 perl Makefile.PL LIB=~/perl


DOCUMENTATION

POD-format documentation is included in Ternary.pm.  POD is readable
with the 'perldoc' utility.


SUPPORT

Questions, comments, bugfixes, flames, and other administrivia pertaining
to Tree::Ternary should be sent to me at [email protected].


AVAILABILITY

The latest version of Tree::Ternary is available on CPAN or at:

       https://github.com/mrogaski/Tree-Ternary


AUTHOR

Mark Rogaski <[email protected]>


COPYRIGHT

Copyright (C) 1999, Mark Rogaski; all rights reserved.

This module is free software.  You can redistribute it and/or
modify it under the terms of the Artistic License 2.0.

This program is distributed in the hope that it will be useful,
but without any warranty; without even the implied warranty of
merchantability or fitness for a particular purpose.


SEE ALSO

Bentley, Jon and Sedgewick, Robert.  "Ternary Search Trees".  Dr. Dobb's
Journal, April 1998.
http://www.drdobbs.com/database/ternary-search-trees/184410528

Bentley, Jon and Sedgewick, Robert.  "Fast Algorithms for Sorting and
Searching Strings".  Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
New Orleans, January, 1997.
http://www.cs.princeton.edu/~rs/strings/

You are viewing proxied material from ftp.icm.edu.pl. The copyright of proxied material belongs to its original authors. Any comments or complaints in relation to proxied material should be directed to the original authors of the content concerned. Please see the disclaimer for more details.