From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from weis@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id SAA32612 for caml-red; Mon, 18 Sep 2000 18:45:17 +0200 (MET DST) 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 RAA00089 for ; Mon, 18 Sep 2000 17:19:14 +0200 (MET DST) Received: from air.irisa.fr (air.irisa.fr [131.254.60.130]) by concorde.inria.fr (8.10.0/8.10.0) with ESMTP id e8IFJEv20638 for ; Mon, 18 Sep 2000 17:19:14 +0200 (MET DST) Received: from parate.irisa.fr (parate.irisa.fr [131.254.12.25]) by air.irisa.fr (8.9.3/8.9.3) with ESMTP id RAA29039 for ; Mon, 18 Sep 2000 17:19:13 +0200 (MET DST) To: caml-list@inria.fr Subject: Data structure efficiency questions From: David.Mentre@irisa.fr (David=?iso-8859-1?q?_Mentr=E9?=) Date: 18 Sep 2000 17:19:13 +0200 Message-ID: User-Agent: Gnus/5.0805 (Gnus v5.8.5) Emacs/20.6 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Sender: weis@pauillac.inria.fr Hello all camlists, 1. Is the @ operator costly or is it implemented as a simple pointers manipulation? 2. Somebody on this list told about a set-like data structure that was very efficient to give an answer when an element is NOT in the set. What is the name of this structure? Patricia tree? (I wasn't able to figure it out looking at the ml archives) Thanks a lot, d. -- David.Mentre@irisa.fr -- http://www.irisa.fr/prive/dmentre/ Opinions expressed here are only mine.