I think this is a very difficult thing to do. I once wrote a HashSet data structure in F# that used tries. You could tune the relative performance of construction and searching by altering the branching factor. Even in the OCaml Set you can alter it to some degree by adjusting the rebalancing criterion. However, even with one relatively-simple knob it is very difficult to benchmark thoroughly enough to draw any strong conclusions. The performance of my HashSet varies tremendously from one element type to the next.
Cheers,
Jon.
--
You received this message because you are subscribed to the Google Groups "Pragmatic functional programming research" group.
To unsubscribe from this group and stop receiving emails from it, send an email to pragmatic-functional-progr...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.