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
[Caml-list] intersecting huge integer sets
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2002-08-27 (12:12)
From: Markus Mottl <markus@o...>
Subject: Re: [Caml-list] intersecting huge integer sets
On Tue, 27 Aug 2002, Yaron M. Minsky wrote:
> If the sets are really as dense as you say they are (on the order of 50%
> of all possible elements), then the fastest thing is probably just to
> use a bool array.  Such an approach would require 3 passes:   one to set
> all the elements of the array to false.  One to mark the elements
> corresponding to set 1 to true, and then one pass over set 2 to see
> which of its elements are shared by 1.

If this is what is needed, better take bit vectors ("bitv" - also on
Jean-Christophe's page).

Markus Mottl

Markus Mottl                                   
Austrian Research Institute
for Artificial Intelligence        
To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: