]> I have a design question for the list at large. I have a library I'm in the process of cleaning up and finalizing, written in Ocaml. This is a library implementing priority search queues- effectively balanced trees, except I need both a way to compare keys and a way to compare the priorities of the data items. Currently, the mli file reads in part: type ('key, 'data) psq_t val init: keycmp:('key -> 'key -> int) -> pricmp:('data -> 'data -> int) -> ('key, 'data) psq_t and the implementation stashes the functions keycmp and pricmp in the datastructure itself. The question I have is wether I should instead be using a functor. The reason I haven't is that I find the functor interface to be somewhat unwieldy, although maybe I just haven't gotten used to it yet. Suggestions are welcome, indeed sought. Brian ------------------- 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