Sort based on the values : Map « Collections Data Structure « Java

Home
Java
1.2D Graphics GUI
2.3D
3.Advanced Graphics
4.Ant
5.Apache Common
6.Chart
7.Class
8.Collections Data Structure
9.Data Type
10.Database SQL JDBC
11.Design Pattern
12.Development Class
13.EJB3
14.Email
15.Event
16.File Input Output
17.Game
18.Generics
19.GWT
20.Hibernate
21.I18N
22.J2EE
23.J2ME
24.JDK 6
25.JNDI LDAP
26.JPA
27.JSP
28.JSTL
29.Language Basics
30.Network Protocol
31.PDF RTF
32.Reflection
33.Regular Expressions
34.Scripting
35.Security
36.Servlets
37.Spring
38.Swing Components
39.Swing JFC
40.SWT JFace Eclipse
41.Threads
42.Tiny Application
43.Velocity
44.Web Services SOA
45.XML
Java » Collections Data Structure » MapScreenshots 
Sort based on the values
         

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.TreeSet;

public class Main {
  public static void main(String[] a) {
    Map<String, String> yourMap = new HashMap<String, String>();
    yourMap.put("1""one");
    yourMap.put("2""two");
    yourMap.put("3""three");

    Map<String, Object> map = new LinkedHashMap<String, Object>();

    List<String> keyList = new ArrayList<String>(yourMap.keySet());
    List<String> valueList = new ArrayList<String>(yourMap.values());
    Set<String> sortedSet = new TreeSet<String>(valueList);
    
    Object[] sortedArray = sortedSet.toArray();
    int size = sortedArray.length;

    for (int i = 0; i < size; i++) {
      map.put(keyList.get(valueList.indexOf(sortedArray[i])), sortedArray[i]);
    }

    Set ref = map.keySet();
    Iterator it = ref.iterator();

    while (it.hasNext()) {
      String i = (Stringit.next();
      System.out.println(i);
    }
  }
}

   
    
    
    
    
    
    
    
    
  
Related examples in the same category
1.Creating and storing arrays in a map
2.Get a key from value with an HashMap
3.Retrieve environment variables (JDK1.5)
4.Creating a Type-Specific Map: creates a map whose keys are Integer objects and values are String objects.
5.A map declared to hold objects of a type T can also hold objects that extend from T
6.A value retrieved from a type-specific collection does not need to be casted
7.Map techniques.
8.Create an array containing the keys in a map
9.Create an array containing the values in a map
10.Creating a Hash Table
11.Creating a Map That Retains Order-of-Insertion
12.Automatically Removing an Unreferenced Element from a Hash Table
13.Creating a Type-Specific Map [5.0]
14.Use Iterator to loop through the HashMap class
15.Create type specific collections
16.Convert Properties into Map
17.A java.util.Map implementation using reference values
18.Utility method that return a String representation of a map. The elements will be represented as "key = value"
19.Utility method that return a String representation of a map. The elements will be represented as "key = value" (tab)
20.This program demonstrates the use of a map with key type String and value type Employee
21.Format a Map
22.A Map implementation that dumps its content when memory runs low.
23.A Map that stores the values in files within a directory.
24.Map List
25.Multi Value Map Array List
26.Multi Value Map Linked HashSet
27.An object that maps keys to values, and values back to keys.
28.LRU Map
29.A map acts like array.
30.Order Retaining Map
31.BinaryMap class implements a map from objects to integer objects where the only value is the integer with value 1.
32.A space-optimized map for associating char keys with values.
33.A Map implementation that grows to a fixed size and then retains only a fixed number of the highest (largest) keys.
34.Class which creates mapping between keys and a list of values.
35.A map of values by class.
36.History Map
37.Sorts map by values in ascending order.
38.Map from a given key to a list of values
39.Map from a given key to a set of values
40.Class which keeps a set of values and assigns each value a unique positive index.
41.Array Map
42.Array map
43.An ArrayMap is a very inefficient map type that is more robust in dealing with changes to its keys than other maps.
44.This Map stores it's keys as strings in upper case, null and duplicate keys are not allowed
45.Map to string
46.A simple class that stores key Strings as char[]'s in a hash table.
java2s.com  | Contact Us | Privacy Policy
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.