Solved

hasCode for 3 int.

Posted on 2004-04-19
15
263 Views
Last Modified: 2008-03-10
Hi,
I need your advise.
I have 3 integer  a,b,c in myClass
and I want to insert this Class has key in HashMap, then I need to Implment HashCode for this case

What is the  best why to do this ?
I thought about
String s = a + "#" + b + "#" + c;

Ami
Thanks.


 
0
Comment
Question by:krelman
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
  • 9
  • 2
  • 2
  • +2
15 Comments
 
LVL 37

Expert Comment

by:zzynx
ID: 10859225
Typically xor is used:  a ^ b ^ c
0
 
LVL 86

Expert Comment

by:CEHJ
ID: 10859229
hashCode() you could implement as

return a * b * c;
0
 
LVL 37

Expert Comment

by:zzynx
ID: 10859247
So,

public int hashCode() {
   return a ^ b ^ c;
}
0
Get 15 Days FREE Full-Featured Trial

Benefit from a mission critical IT monitoring with Monitis Premium or get it FREE for your entry level monitoring needs.
-Over 200,000 users
-More than 300,000 websites monitored
-Used in 197 countries
-Recommended by 98% of users

 
LVL 1

Expert Comment

by:derkec
ID: 10860517
Keep in mind that if you're overriding hashcode like this, you might also want to override .equals(). Two objects that .equals() eachother should have the same hashcode.
0
 
LVL 37

Expert Comment

by:zzynx
ID: 10860588
Definitely true.
(I supposed that as known by the author)
0
 
LVL 92

Expert Comment

by:objects
ID: 10864592
public int hashCode()
{
   return a + b + c;
}

public boolean equals(Object o)
{
   myClass mc = (myClass) o;
   return a==mc.a && b==mc.b && c==mc.b;
}
0
 
LVL 37

Accepted Solution

by:
zzynx earned 125 total points
ID: 10869540
This one is even better:

public int hashCode() {
   return a + (b<<1) + (c<<2);
}

Why?
The goal of the hashCode is to construct a key for the HashMap.
The more unique the key is, the better. (=the faster the lookup will be)

All previous (valid) solutions (^, * or +) give the same result for the following
three different objects:

            a=1, b=2, c=4
       
            a=4, b=2, c=1
and
            a=1, b=4, c=2

while the above produces three different hash codes.
0
 
LVL 37

Expert Comment

by:zzynx
ID: 10869555
>> I need your advise
Hi krelman, what do you think of our advices so far?
0
 

Author Comment

by:krelman
ID: 10869625
Hi,
has you write all the previous solution don't have a uniq result.

Are you sure this have a uniq result ? ( I am checking it )

public int hashCode()
{
   return a + (b<<1) + (c<<2);
}
0
 

Author Comment

by:krelman
ID: 10869631
Hi,
has you right - all the previous solution don't have a uniq result.

Are you sure this have a uniq result ? ( I am checking it )

public int hashCode()
{
   return a + (b<<1) + (c<<2);
}
0
 
LVL 37

Expert Comment

by:zzynx
ID: 10869693
>>Are you sure this have a uniq result ?
No I'm not. I guess it isn't.
But it shouldn't be unique, it should be "as unique as possible".
If it isn't unique that is *no functional problem*: the item will be found.
No problem.

But it *could* be a performance problem: for one (nearly unique) key, multiple items are found.
And this leads to some extra comparisons.
0
 
LVL 37

Expert Comment

by:zzynx
ID: 10869770
>> I am checking it
Don't look any further

    a=0, b=0, c=4
    a=16, b=0, c=0
    a=0, b=8, c=0

all produce 16 as hash code. (No "real" problem as said before)

But for a,b,c values different of 0, it looks rather difficult to find two sets that produce the same code.
So, I guess you're rather safe with that.
0
 
LVL 86

Expert Comment

by:CEHJ
ID: 10869822
I haven't done any statistical research on this, but i'd guess that the introduction of primes could be of use, but don't get too hung up on this. As has already been said, complete uniqueness is not required
0
 
LVL 37

Expert Comment

by:zzynx
ID: 10869859
To cope with the 0 problem you could go further and use

public int hashCode() {
   return a + ((b+1)<<1) + ((c+1)<<2);
}

or

public int hashCode() {
   return ((a+1)<<1) + ((b+1)<<2) + ((c+1)<<3);
}

The sky is the limit.
But you have to ask yourself if the (slightly) better performance is worth the (looking for the holy grail-) effort.
0
 
LVL 37

Expert Comment

by:zzynx
ID: 10875566
Thanks for accepting.
That keeps us answering your future questions too.
0

Featured Post

PeopleSoft Has Never Been Easier

PeopleSoft Adoption Made Smooth & Simple!

On-The-Job Training Is made Intuitive & Easy With WalkMe's On-Screen Guidance Tool.  Claim Your Free WalkMe Account Now

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Go is an acronym of golang, is a programming language developed Google in 2007. Go is a new language that is mostly in the C family, with significant input from Pascal/Modula/Oberon family. Hence Go arisen as low-level language with fast compilation…
In this post we will learn how to connect and configure Android Device (Smartphone etc.) with Android Studio. After that we will run a simple Hello World Program.
This tutorial covers a practical example of lazy loading technique and early loading technique in a Singleton Design Pattern.
This tutorial explains how to use the VisualVM tool for the Java platform application. This video goes into detail on the Threads, Sampler, and Profiler tabs.

635 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question