maybe the files will attach as text files...
- Original Message -
From: "Stephen Colebourne" <[EMAIL PROTECTED]>
To: "Jakarta Commons Developers List" <[EMAIL PROTECTED]>
Sent: Sunday, March 09, 2003 12:12 AM
Subject: Re: [collections] Faster than HashMap
s(object2) )
- Original Message -
From: "Pranas Baliuka" <[EMAIL PROTECTED]>
To: "Jakarta Commons Developers List" <[EMAIL PROTECTED]>
Sent: Monday, March 10, 2003 4:31 PM
Subject: RE: [collections] Faster than HashMap?
> Juozas,
>
> You can gain valua
: [collections] Faster than HashMap?
Map performance depends on hash function implementation, one of ways to
optimize it is to find "the best" hash function at runtime (dependant on
known hash codes at runtime ) and rehash map using this function.
int findIndex(int hashCode){
//some has
nerated at runtime
}
"switch" is one of ways, it must be possible to find more ways.
- Original Message -
From: "Shapira, Yoav" <[EMAIL PROTECTED]>
To: "Jakarta Commons Developers List" <[EMAIL PROTECTED]>
Sent: Monday, March 10, 2003 3:07 PM
Subject: RE:
Howdy,
I must be completely missing something here, but doesn't that require
your do not all the hashcodes of the items in the map at compile time?
Yoav Shapira
Millennium ChemInformatics
>-Original Message-
>From: Stephen Colebourne [mailto:[EMAIL PROTECTED]
>Sent: Saturday, March 08,
No file is attached.
It will be faster on "small" maps, but method code size is limited, 65535
bytes or something like this and it needs some workaround.
- Original Message -
From: "Stephen Colebourne" <[EMAIL PROTECTED]>
To: "Jakarta Commons Developers List" <[EMAIL PROTECTED]>
Sent: Sa
