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 MAA04109; Sun, 25 May 2003 12:50:49 +0200 (MET DST) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id MAA04292 for ; Sun, 25 May 2003 12:50:48 +0200 (MET DST) Received: from eposta.kablonet.com.tr ([62.248.102.66]) by concorde.inria.fr (8.11.1/8.11.1) with SMTP id h4PAnpH16352 for ; Sun, 25 May 2003 12:49:53 +0200 (MET DST) Received: (qmail 24210 invoked by uid 0); 25 May 2003 10:51:34 -0000 Received: from unknown (HELO 195.174.169.185) (exa@kablonet.com.tr@195.174.169.185) by 0 with SMTP; 25 May 2003 10:51:34 -0000 From: Eray Ozkural Reply-To: erayo@cs.bilkent.edu.tr Organization: Bilkent University CS Dept. To: Yamagata Yoriyuki , caml-list@inria.fr Subject: Re: [Caml-list] Set/Map with intervals and/or order-related operations Date: Sun, 25 May 2003 13:48:20 +0300 User-Agent: KMail/1.5.9 References: <20030525.192604.07647392.yoriyuki@mbg.sphere.ne.jp> In-Reply-To: <20030525.192604.07647392.yoriyuki@mbg.sphere.ne.jp> MIME-Version: 1.0 Content-Disposition: inline Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit Message-Id: <200305251348.20949.exa@kablonet.com.tr> X-Spam: no; 0.00; eray:01 ozkural:01 caml-list:01 yamagata:01 yoriyuki:01 unions:01 compliments:99 baire:01 misses:01 bug:01 faq:01 beginner's:01 beginners:01 erayo:01 bilkent:01 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk Yamagata must read a computational geometry text, he shall find that structures like interval trees provide for such operations. But according to which operations you need fast you may have to design your data structure.... Structure monster just got out of a computational geometry project disaster so he can't really help in a substantial way (^_^) All I can say is don't try to make it very functional. Of course a computational geometry library would be nice :) But it's so hard to write decent code in that area. Cheers, On Sunday 25 May 2003 13:26, Yamagata Yoriyuki wrote: > Hi, folks, > > I'm looking for the Set/Map like data-structures which can efficiently > add and remove large intervals over integers, and support > intersections, unions and compliments. Does anybody make such > libraries? Baire contains interval.ml[i] but misses these > functionalities. Is it easy to add them to Baire, or are Baire's > intervals something different than I thought? > > Failing that, is there Set/Map with order-related operations? > Actually I have one but if there is one actively developed, I would > like to use it. > > By the way, I have a library for arbitrary orders on (finite sets of) > integers. I think comparison of two integer is O(log n ^ 2) > time. (n for the size of the finite set.) Do you think it is worth to > make public? > > Cheers, > -- > Yamagata Yoriyuki > > ------------------- > 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 -- Eray Ozkural (exa) 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