You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@commons.apache.org by Juozas Baliuka <ba...@centras.lt> on 2002/06/21 22:59:46 UTC

[Collections] HashSet was algorythms

Hi,

May be somebody wants to help me implement "fast" set ?
I added some incomplete implementation and want to see something like this
in Collections project. It is not synchronized and optimized at this time.



----- Original Message -----
From: "Berin Loritsch" <bl...@apache.org>
To: "'Jakarta Commons Developers List'" <co...@jakarta.apache.org>
Sent: Thursday, June 20, 2002 8:25 PM
Subject: RE: [Collection] algorythms was [Commons-Avalon:collections] code
integration


> > From: Juozas Baliuka [mailto:baliuka@centras.lt]
> >
> > I will implement Set interface based on this algorythm, It
> > besause need "fast" implementation for "large" sets, I will
> > try to implement Set based on your Map too. I will submit
> > this implementation if it will be "faster".
>
> Ok.  The real test is this:
>
> 100 simultaneous threads, all requesting random values (actually
> a random value from a known set of values).
>
> How long does it take to process 10,000,000 accesses?
>
> For 100 simultaneous threads, that translates into 10,000
> iterations per thread.
>
>
> --
> To unsubscribe, e-mail:
<ma...@jakarta.apache.org>
> For additional commands, e-mail:
<ma...@jakarta.apache.org>
>