Browse thread
[Caml-list] int hash
[
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: | -- (:) |
| From: | skaller <skaller@u...> |
| Subject: | Re: [Caml-list] Re: int hash |
On Wed, 2004-07-14 at 22:16, Julian Brown wrote: > On 2004-07-14, skaller <skaller@users.sourceforge.net> wrote: > > I'm currently using a lot of hashtables with > > sequentially allocated integers as keys. > > Could you not use DynArray from ExtLib instead? For some things .. not necessarily this one .. DynArray would be great .. but it creates a dependence on an unstable third party LGPL'd library. I can neither lift the relevant code (due to the licence), nor lightly require my clients install that library just to build my product. [I have seriously considered requiring ExtLib] BTW: I should explain the hashtables map "arbitrary" subsets of the first n integers, where n grows as time goes on (fresh variable' generator), and there are a quite a few of these tables built (its a compiler, there is a table for every symbol representing its children). -- John Skaller, mailto:skaller@users.sf.net voice: 061-2-9660-0850, snail: PO BOX 401 Glebe NSW 2037 Australia Checkout the Felix programming language http://felix.sf.net ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners