Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Design question: functors or functions?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-01-14 (21:49)
From: Brian Hurt <brian.hurt@q...>
Subject: [Caml-list] Design question: functors or functions?

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.


To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: