Browse thread
Tries are to sequences as ? is to trees
-
Jon Harrop
- Christophe Raffalli
- Jean-Christophe_Filliâtre
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2008-04-26 (07:36) |
From: | Jean-Christophe_Filliâtre <Jean-Christophe.Filliatre@l...> |
Subject: | Re: [Caml-list] Tries are to sequences as ? is to trees |
Jon Harrop a écrit : > So tries let us associate sequences with values. What data structure lets us > associate trees with values? In Okasaki's book, there is a Section 10.3.2 "Generalized Tries" which addresses exactly this problem. The solution proposed is more efficient than building the list of elements with fold. -- Jean-Christophe Filliâtre http://www.lri.fr/~filliatr/