Questions about Trie

[Simon Peyton-Jones]

Perhaps this monads discussion might move to haskell-cafe@haskell.org?
It's a good discussion, but it's just what haskell-cafe is for.

	http://www.haskell.org/mailinglist.html

Simon

| -----Original Message-----
| From: Arthur H. Gold [mailto:agold@bga.com]=20
| Sent: 17 May 2001 22:21
| To: haskell@haskell.org
| Cc: M. Faisal Fariduddin Attar Nasution
| Subject: Re: Questions about Trie
|=20
|=20
| > "M. Faisal Fariduddin Attar Nasution" wrote:
| >=20
| >     Greeting, I'm a last year student in a computer science=20
| field. I'm=20
| > currently  trying to  code an  implementation for a =20
| compression using=20
| > basic  Lempel-zif  technique.  I  use  a Trie  (retrieval)=20
| as  a  data=20
| > structure for  the dynamic dictionary aplication.  The=20
| problem is Trie=20
| > uses not just an ordinary binary tree, but it uses a=20
| multiple-weighted=20
| > tree, where one node  has at most 256 children. Most=20
| literatures about=20
| > Haskell show only binary tree for the example in tree or=20
| Abstract Data
| > Structures   subject.  So,   does   anyone  know   how  to =20
|  code  the
| > implementation for  trie. Thanks  for paying attention  and=20
| I'm really=20
| > hoping for the answer immediately.
| >=20
|=20
| IIRC, there's a trie implementation in Chris Okasaki's=20
| "Purely Functional Data Structures" -- that might be a start=20
| (there's also his "Edison" library, which contains many of=20
| the components you'd need).
|=20
| HTH (and sorry if it doesn't)
| --ag
|=20
| --=20
| Artie Gold, Austin, TX  (finger the cs.utexas.edu account for=20
| more info) mailto:agold@bga.com or mailto:agold@cs.utexas.edu
| --
| I am looking for work. Contact me.
|=20
| _______________________________________________
| Haskell mailing list
| Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
|=20