README for Tree::Ternary

			    Tree::Ternary

Tree::Ternary is a Perl implementation of ternary search trees as
described by Jon Bentley and Robert Sedgewick.  For more information
on ternary search trees, visit: 

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

Tree::Ternary is a 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.

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

This suite requires Perl 5; I've only used it under Perl 5.005, so for
anything lower, you're on your own.  I highly recommend the use of 
Test.pm, although, it is not required.

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 wendigo@pobox.com


AVAILABILITY

The latest version of Tree::Ternary is available at:

	http://www.perl.com/CPAN/modules/by-authors/id/MROGASKI/

or also at:

	ftp://deathstar.jabberwock.org/pub/lang/perl/modules/


AUTHOR

Mark Rogaski, wendigo@pobox.com


COPYRIGHT

Copyright 1999, Mark Rogaski, wendigo@pobox.com, all rights reserved.

This package is free software and is provided "as is" without express or
implied warranty.  It may be used, redistributed and/or modified under the
same terms as Perl itself.


SEE ALSO

Bentley, Jon and Sedgewick, Robert.  "Ternary Search Trees".  Dr. Dobb's
Journal, April 1998.
http://www.ddj.com/articles/1998/9804/9804a/9804a.htm

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/


--
$Id: README,v 1.5 1999/09/23 04:09:36 wendigo Exp $

