HashMap functions get vs put

Hi!

I recently created a programme where I used a HashMap for storing a large number of (key, value) pairs. I needed to check if an entry was present and if not, add the entry and if so, change the value of the entry.
In the code below, CoOccurrence is an object storing a key and value pair.

I first tried with:

Code:

---

public void updateHashMap(CoOccurrence co) {
                CoOccurrence temp = this.get(co.getKey());
                if( temp != null ){
                        temp.increaseValueByOne();
                }
                else{
                        this.put(co.getKey(),co.getValue());
                }
        }

---

This way of going about made my programme run for hours, actually up to 12 hours. Then I decided to try the following:

Code:

---

public void updateHashMap(CoOccurrence co) {
                CoOccurrence temp = this.put(co.getKey(), co.getValue());
                if( temp != null ){
                        temp.increaseValueByOne();
                        this.put(co.getKey(), temp.getValue());
                }
        }

---

and this only took seconds to execute.
Anyone with a guess as to why it behaved like this? Is the put-operation faster than the get?

-tahni.

temp != null?
at the very beginning, hashmap contains no key-value pairs...

in second method, you run if statement and always return false

and in first method, temp.incrementFrequency(), had incrementFrequency method put the updated value to hashmap "this"?

First of all, my bad, it should be increaseValueByOne() in both versions of the code. I renamed so it would be more intuitive.


""temp != null?
at the very beginning, hashmap contains no key-value pairs...""

Yes, at first there are no key-value pairs in the hashmap and hence we keep adding key-value pairs until the first time we find one that we have already encountered before, then temp != null and we get to increase the value.


""in second method, you run if statement and always return false""

No, when doing a put operation on a HashMap it will return null if the object is new and the old object if it is already in the HashMap. Look it up under the java api.

And for your last comment, no, the increaseValueByOne function does not 'replace' the object in the HashMap. This is as I understand it not necessary since we change the object it self and the hashmap is only pointing to that object.

Thanks for your input.
-tahni

There is no reason, from what you posted, for your program to loop at all. I assume the class that contains the method extends HashMap, since you use "this." You could just use an ArrayList, since you are incrementing the "value" contained in the key. The value object in the HashMap will always be whatever the key's value was when it was first added, which seems a bit odd.

I suggest looking at whatever is calling this method to see what is causing the looping. Also, does CoOccurrence override equals()? If not, why would you call your method with the same instance more than once? I'm not sure this code is accomplishing what you want it to do.