Java Tutorial

Java Operators

Java Control Statements

Object Oriented Programming

Java Built-in Classes

Java File Handling

Java Error & Exceptions

Java Multithreading

Java Synchronization

Java Networking

Java Collections

Java Interfaces

Java Data Structures

Java Collections Algorithms

Advanced Java

Java Miscellaneous

Java APIs & Frameworks

Java Class References

Java Useful Resources

Java - The LinkedHashMap Class

Previous
Quiz
Next

This class extends HashMap and maintains a linked list of the entries in the map, in the order in which they were inserted. This allows insertion-order iteration over the map. That is, when iterating a LinkedHashMap, the elements will be returned in the order in which they were inserted.

You can also create a LinkedHashMap that returns its elements in the order in which they were last accessed.

Following is the list of constructors supported by the LinkedHashMap class.

Sr.No. Constructor & Description
1

LinkedHashMap( )

This constructor constructs a default LinkedHashMap.
2

LinkedHashMap(Map m)

This constructor initializes the LinkedHashMap with the elements from the given Map class m.
3

LinkedHashMap(int capacity)

This constructor initializes a LinkedHashMap with the given capacity.
4

LinkedHashMap(int capacity, float fillRatio)

This constructor initializes both the capacity and the fill ratio. The meaning of capacity and fill ratio are the same as for HashMap.
5

LinkedHashMap(int capacity, float fillRatio, boolean Order)

This constructor allows you to specify whether the elements will be stored in the linked list by insertion order, or by order of last access. If Order is true, then access order is used. If Order is false, then insertion order is used.

Apart from the methods inherited from its parent classes, LinkedHashMap defines the following methods −

Sr.No. Method & Description
1

void clear()

Removes all mappings from this map.
2

boolean containsKey(Object key)

Returns true if this map maps one or more keys to the specified value.
3

Object get(Object key)

Returns the value to which this map maps the specified key.
4

protected boolean removeEldestEntry(Map.Entry eldest)

Returns true if this map should remove its eldest entry.

Example

The following program illustrates several of the methods supported by this collection −

import java.util.*;
public class LinkedHashMapDemo {

   public static void main(String args[]) {
      // Create a hash map
      LinkedHashMap lhm = new LinkedHashMap();
      
      // Put elements to the map
      lhm.put("Zara", new Double(3434.34));
      lhm.put("Mahnaz", new Double(123.22));
      lhm.put("Ayan", new Double(1378.00));
      lhm.put("Daisy", new Double(99.22));
      lhm.put("Qadir", new Double(-19.08));
      
      // Get a set of the entries
      Set set = lhm.entrySet();
      
      // Get an iterator
      Iterator i = set.iterator();
      
      // Display elements
      while(i.hasNext()) {
         Map.Entry me = (Map.Entry)i.next();
         System.out.print(me.getKey() + ": ");
         System.out.println(me.getValue());
      }
      System.out.println();
      
      // Deposit 1000 into Zara's account
      double balance = ((Double)lhm.get("Zara")).doubleValue();
      lhm.put("Zara", new Double(balance + 1000));
      System.out.println("Zara's new balance: " + lhm.get("Zara"));
   }
}

This will produce the following result −

Output

Zara: 3434.34
Mahnaz: 123.22
Ayan: 1378.0
Daisy: 99.22
Qadir: -19.08

Zara's new balance: 4434.34
java_collections.htm
Print Page
Previous
Next
Advertisements