This might be too simplistic, but how about creating a union type the
includes all of the different things you might want to index on, and then
use that as the key to a hashtable.  The efficiency of that would hinge on
the efficiency of the hash function, I would think.   I would expect it to
be simple to implement and pretty quick.

Yaron


-------------------
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