CSC/ECE 517 Fall 2007/wiki1 1 aman
HashMaps in Java vs hashes in Ruby
Maps in java or hashes in ruby is any unordered object which stores associations between keys and their corresponding values, in which both keys and the values are objects. The key is unique , however the values may not necessarily be unique. The key, is used to retrieve a value from the map at a later stage after having had stored the values.
Comparing HashMaps and Hashes
1. Both in Java and Ruby, data structures are treated as objects. Hence both HashMaps and Hashes are used to store and manipulate objects which can be instantiated using the new method.
in Java using : HashMap h = new HashMap; in Ruby using : h = hash.new
2. In Ruby there is no difference between primitive data types and objects.Hence any variable or object can be put directly into the hashes container and methods can be invoked on them. However in Java primitive objects needs to be type casted to an Object class in order to use in built methods on the created HashMaps.
3. Ruby has the same syntactic sugar for hashes as well as arrays which makes the implementing hashes as simple as implementing an array. In Java however, since HashMaps implement the Collections framework, objects have to be inserted using the put method.
in Java using : h.put (New Integer(0234), "Peter Drake");
in Ruby using : h = {0234 => "Peter Drake"}
4. Inbuilt iterator feature of ruby enables accessing items one at a time. However in java, Hashmaps cannot implement the Iterator interface. To implement the iteration feature , a collection view of the map for example a Set needs to be used.
in Java using : Iterator itr = h.keySet().iterator();
in Ruby using : h.each_pair{|key,value| puts key,value, " "}
Sample Codes
The following sample codes compares simplicity in implementing a HashMap in Java with Hashes in Ruby . The following codes creates a hashmap to associate names of people as keys with their ages as values. The code prints out the keys and values and also finds the average age of the group.
Java Code :
package assgn1;
import java.util.*;
class StudentInfo{
private String name;
private int studentID;
StudentInfo(String n, int sid){
name = n;
studentID =sid;
}
public String toString(){
return name + " " + studentID;
}
}
public class Hashes {
public static void main(String args[]){
HashMap h = new HashMap();
h.put(new StudentInfo("Tom sanders", 56746), new Integer(19));
h.put(new StudentInfo ("Dave Patterson", 34578), new Integer(14));
h.put(new StudentInfo ("Julia Myers",23678), new Integer(18));
h.put(new StudentInfo ("Scott Stephenson",56743 ), new Integer(24));
h.put(new StudentInfo("Betty Matthews",75456), new Integer(22));
h.put(new StudentInfo("Billy Johnson",93456), new Integer(26));
int sum =0 , count = 0;
Set set = h.entrySet();
Iterator i = set.iterator();
while (i.hasNext()){
Map.Entry mpentry = (Map.Entry)i.next();
Object element = mpentry.getKey();
System.out.println(" Name and StudentId :" + element);
System.out.println(" Age" + mpentry.getValue());
sum += ((Integer)mpentry.getValue()).intValue();
count = count +1;
}
int avg = sum/count;
System.out.println("Average age of class is " + avg);
}
}
Ruby Code:
h={["Tom Sanders"," " ,56746] => 19,["Billy Johnson"," " ,93456] =>26, ["Dave Patterson", " ",23678] => 14,["Julia Myers",
" ",23768]=>18,["Scott Stephenson"," ",56743]=>24,["Betty Matthews"," ",75456]=>22}
sum= 0;
avg = 0;
h.each{|key,values| sum = sum +values; puts "#{key}=>#{values}"; avg = sum/h.size }
puts "Average age is " , avg
Conclusion
It can be concluded that since Ruby is a purely Object oriented language, the syntax is very terse and concise, which increases program productivity. Data structures in ruby like arrays and hashes are built in and are re-sizable and also code blocks facilitates easy iteration which eases programming complexity. Hence implementing Hashes in ruby is definitely more concise and lead to writing more elegant codes.
References