PriorityQueue belongs to the Java Collections Framework. PriorityQueue is based on priority heap and it is an implementation of Queue interface. This data structure can be used when we need a Queue implementation and we have a requirement to maintain the elements of that collection in a specific sorted order based on each element’s priority. […]
Published to Java Tutorial on 01/09/2014.
To generate successive elements from a series, we can use java iterator. It is an improvement over Enumeration interface. Iterator takes the place of Enumeration since jdk 1.2 It is a nice utility for collections. Every collection is unique on its own and imagine if we have have to write logic on our own for […]
Published to Core Java Tutorial on 18/03/2012.
Hashtable is an implementation of a key-value pair data structure in java. You can store and retrieve a ‘value’ using a ‘key’ and it is an identifier of the value stored. It is obvious that the ‘key’ should be unique. java.util.Hashtable extends Dictionary and implements Map. Objects with non-null value can be used as a […]
Published to Core Java Tutorial on 17/08/2011.
I do build crazy buildings using my collection of Lego blocks. My 11 months old kid Ben curiously stares at me build it. He always wishes to get hold of it. After I complete the building when I give that to his hand, you know what the first thing he does. Modify the building blocks. […]
Published to Java Collection Tutorial on 25/09/2009.
java.util.Vector came along with the first version of java development kit (JDK). java.util.ArrayList was introduced in java version1.2, as part of java collections framework. As per java API, in Java 2 platform v1.2,vector has been retrofitted to implement List and vector also became a part of java collection framework. All the methods of Vector is […]
Published to Java Collection Tutorial on 04/06/2008.