From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from majordomo@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id SAA18052; Tue, 8 Apr 2003 18:39:11 +0200 (MET DST) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id SAA18060 for ; Tue, 8 Apr 2003 18:39:09 +0200 (MET DST) Received: from bastion.artisan.com ([209.144.161.130]) by nez-perce.inria.fr (8.11.1/8.11.1) with ESMTP id h38Gd8926501 for ; Tue, 8 Apr 2003 18:39:08 +0200 (MET DST) Received: from ypmaster.artisan.com (ypmaster [172.16.2.1]) by bastion.artisan.com (8.9.2/8.9.2) with ESMTP id JAA16193 for ; Tue, 8 Apr 2003 09:38:43 -0700 (PDT) Received: from barrow.artisan.com (barrow.artisan.com [172.16.10.17]) by ypmaster.artisan.com (8.9.2/8.9.2-arti) with ESMTP id JAA03432 for ; Tue, 8 Apr 2003 09:38:43 -0700 (PDT) Received: (from johnm@localhost) by barrow.artisan.com (8.11.6/8.11.6) id h38Gchl32630; Tue, 8 Apr 2003 09:38:43 -0700 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <16018.64275.189977.228851@barrow.artisan.com> Date: Tue, 8 Apr 2003 09:38:43 -0700 To: caml-list@inria.fr Subject: Re: [Caml-list] Re: Wanted - General Purpose "Glue Logic" Data-Structures In-Reply-To: References: <16018.7894.703716.797621@katsura.parc.xerox.com> X-Mailer: VM 7.07 under Emacs 21.2.1 Reply-To: John Gerard Malecki X-Organization: Artisan Components, Inc. From: John Gerard Malecki X-Spam: no; 0.00; caml-list:01 glue:01 light-weight:01 experimented:01 treaps:01 grail:01 re-iterate:01 silver:98 tree:02 gerard:02 necessarily:02 wrote:03 summarize:03 algorithms:03 johnm:03 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk 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