Index of /~rahn/patricia

	Name	Last modified	Size	Description
	Parent Directory		-
	Makefile	10-Jun-2002 13:51	358
	Patricia.hs	10-Jun-2002 13:51	5.6K
	Patricia_Bit.hs	10-Jun-2002 13:51	2.0K
	Patricia_H.hs	24-Oct-2005 15:17	7.0K
	Patricia_Hash.hs	10-Jun-2002 13:51	332
	Patricia_N.hs	10-Jun-2002 13:51	5.8K
	Patricia_NU.hs	10-Jun-2002 13:51	7.2K
	Patricia_Speed_vs_FM.hs	24-Oct-2005 15:21	2.6K
	Patricia_U.hs	10-Jun-2002 13:51	7.2K
	Speed_vs_FM	24-Oct-2005 15:22	595K
	patricia.tgz	10-Jun-2002 13:51	6.5K

Some versions of PATRICIA-Tries in Haskell. 

-- the implementation follows that in
--  @book{Sedgewick1992,
--   author    = {Robert Sedgewick},
--   title     = {Algorithmen in C},
--   year      = 1992,
--   publisher = {Addison--Wesley}
--  }


Implemented to replace FiniteMap but the basic versions are limited in
use and the unlimited version is'nt faster than a FiniteMap...

Nevertheless the code takes advance from lazy evaluation and pattern
matching and shows how to deal with infinite structures. We even use
recursive tree-like structures without leaves.


Recommended read-order:

Patricia_Bit      - bit-access is needed to create PATRICIA-Tries
Patricia          - basic trie with some limitations
Patricia_N        - basic trie with nullkey usable
Patricia_U        - basic trie with updateable nodes
Patricia_NU       - N+U

Patricia_Hash     - a special version wich acts like an hashtable
Patricia_H        - very fast, no restrictions


Try 'make' and enjoy.