Tibor Simko schrieb am Dienstag, den 27. August 2002:
> I wonder how to improve OCaml performance in this special case.
> Is there a better suited OCaml data structure to simulate huge hashed
> sets of integers rather than by using OCaml's native Hashtbl?

Yes, you'll probably want Patricia trees. You can get them from
Jean-Christophe Filliatre's page:

  http://www.lri.fr/~filliatr/software.en.html

They support very fast set operations (union, difference, intersection).

Best regards,
Markus Mottl

-- 
Markus Mottl                                             markus@oefai.at
Austrian Research Institute
for Artificial Intelligence                  http://www.oefai.at/~markus
-------------------
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