Browse thread
Canonical Set/Map datastructure?
[
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-03-05 (20:04) |
From: | Jon Harrop <jon@f...> |
Subject: | Re: [Caml-list] Canonical Set/Map datastructure? |
On Wednesday 05 March 2008 17:27:38 Alain Frisch wrote: > Patricia trees work fine when the set elements can easily be represented > as strings of bits. > ... > structural equality = physical equality = set equality This is very interesting. What are the disadvantages? I'm guessing: slow value creation for small values and heavy memory consumption. -- Dr Jon D Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/products/?e