English version
Accueil     À propos     Téléchargement     Ressources     Contactez-nous    

Ce site est rarement mis à jour. Pour les informations les plus récentes, rendez-vous sur le nouveau site OCaml à l'adresse ocaml.org.

Browse thread
[Caml-list] Wanted - General Purpose "Glue Logic" Data-Structures
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-04-08 (16:39)
From: John Gerard Malecki <johnm@a...>
Subject: Re: [Caml-list] Re: Wanted - General Purpose "Glue Logic" Data-Structures
Brian Hurt wrote (2003-04-08T10:07:16-0500):
 > It actually sounds like a simple tree is what he needs.  The problem with 
 > a resizeable array is that removing anything except the last element is 

Yes, I'm looking for is a light-weight, auto-balancing data-structure.
It does not necessarily need to be a tree.  It does not necessarily
need to be functional.  So far I have experimented with specialized
code, maps, treaps and splay-trees.  I still haven't found the Silver
Bullet or Holy Grail.  I'll summarize my findings later this month.

To re-iterate, I'm looking for a general purpose data-structure that
can collect large amounts of data, perform and prepare it for input to
specialized algorithms.  This typically means adding lots of elements
and lists of elements and then removing (controlled mapping) of those
elements preferably in random order.

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