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] Efficiency of 'a list
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Eray Ozkural <exa@k...>
Subject: Re: [Caml-list] Efficiency of 'a list
On Saturday 03 May 2003 21:43, Mattias Waldau wrote:
> The result of this is that you get all these questions in this forum
> complaining about performance. Most of the questions would never have
> been asked if the author would have used the correct datastructure,
> mostly Hash/Map or Set.

Mind you, I am not a novice of any sort and nobody really answered my 
questions in sufficient detail. I can design and implement a large number of 
advanced data structures and the implementations you refer to will not 
satisfy my needs. In particular I don't think I would ever use a 
straightforward hash table unless the problem presented opportunity for an 
admissable hash function.

Eray Ozkural (exa) <>
Comp. Sci. Dept., Bilkent University, Ankara  KDE Project:
www:  Malfunction:
GPG public key fingerprint: 360C 852F 88B0 A745 F31B  EA0F 7C07 AE16 874D 539C

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