Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
Data structure efficiency questions
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: David.Mentre@i...
Subject: Data structure efficiency questions
Hello all camlists,

1. Is the @ operator costly or is it implemented as a simple pointers

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,
-- --
 Opinions expressed here are only mine.