polymorphically comparable Maps?

From: Thorsten Ohl (ohl@hep.tu-darmstadt.de)
Date: Mon Feb 22 1999 - 18:37:01 MET

From: Thorsten Ohl <ohl@hep.tu-darmstadt.de>
Date: Mon, 22 Feb 1999 18:37:01 +0100 (CET)
To: caml-list@inria.fr
Subject: polymorphically comparable Maps?

Does anybody know of a fast data structure for (applicative)
association tables over ordered types (like Map in the standard
library) with the property that identical maps will have an identical
representation? Sorted association lists work, but have linear access
and insertion. Is there something logarithmical (even with an OCaml


[ If anybody wonders: I want/need polymorphic comparison, because the
  Maps are part of a recursive datastructure. ]

Thorsten Ohl, Physics Department, TU Darmstadt -- ohl@hep.tu-darmstadt.de
http://heplix.ikp.physik.tu-darmstadt.de/~ohl/ [<=== PGP public key here]

This archive was generated by hypermail 2b29 : Sun Jan 02 2000 - 11:58:20 MET