Version française
Home     About     Download     Resources     Contact us    
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) <erayo@cs.bilkent.edu.tr>
Comp. Sci. Dept., Bilkent University, Ankara  KDE Project: http://www.kde.org
www: http://www.cs.bilkent.edu.tr/~erayo  Malfunction: http://mp3.com/ariza
GPG public key fingerprint: 360C 852F 88B0 A745 F31B  EA0F 7C07 AE16 874D 539C

-------------------
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