What you can do with a TreeMap : HashTable Map « Collections Data Structure « Java

Java
1. 2D Graphics GUI
2. 3D
3. Advanced Graphics
4. Ant
5. Apache Common
6. Chart
7. Collections Data Structure
8. Database SQL JDBC
9. Design Pattern
10. Development Class
11. Email
12. Event
13. File Input Output
14. Game
15. Hibernate
16. J2EE
17. J2ME
18. JDK 6
19. JSP
20. JSTL
21. Language Basics
22. Network Protocol
23. PDF RTF
24. Regular Expressions
25. Security
26. Servlets
27. Spring
28. Swing Components
29. Swing JFC
30. SWT JFace Eclipse
31. Threads
32. Tiny Application
33. Velocity
34. Web Services SOA
35. XML
Microsoft Office Word 2007 Tutorial
Java Tutorial
Java Source Code / Java Documentation
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
C# / C Sharp
C# / CSharp Tutorial
ASP.Net
JavaScript DHTML
JavaScript Tutorial
JavaScript Reference
HTML / CSS
HTML CSS Reference
C / ANSI-C
C Tutorial
C++
C++ Tutorial
PHP
Python
SQL Server / T-SQL
Oracle PL / SQL
Oracle PL/SQL Tutorial
PostgreSQL
SQL / MySQL
MySQL Tutorial
VB.Net
VB.Net Tutorial
Java » Collections Data Structure » HashTable MapScreenshots 
What you can do with a TreeMap
What you can do with a TreeMap


// : c11:SortedMapDemo.java
//What you can do with a TreeMap.
//From 'Thinking in Java, 3rd ed.' (c) Bruce Eckel 2002
//www.BruceEckel.com. See copyright notice in CopyRight.txt.

import java.util.Iterator;
import java.util.TreeMap;

public class SortedMapDemo {

  public static void main(String[] args) {
    TreeMap sortedMap = new TreeMap();
    sortedMap.put("Adobe""Mountain View, CA");
    sortedMap.put("IBM""White Plains, NY");
    sortedMap.put("Learning Tree""Los Angeles, CA");
    sortedMap.put("Microsoft""Redmond, WA");
    sortedMap.put("Netscape""Mountain View, CA");
    sortedMap.put("O'Reilly""Sebastopol, CA");
    sortedMap.put("Sun""Mountain View, CA");
    System.out.println(sortedMap);
    Object low = sortedMap.firstKey(), high = sortedMap.lastKey();
    System.out.println(low);
    System.out.println(high);
    Iterator it = sortedMap.keySet().iterator();
    for (int i = 0; i <= 6; i++) {
      if (i == 3)
        low = it.next();
      if (i == 6)
        high = it.next();
      else
        it.next();
    }
    System.out.println(low);
    System.out.println(high);
    System.out.println(sortedMap.subMap(low, high));
    System.out.println(sortedMap.headMap(high));
    System.out.println(sortedMap.tailMap(low));
  }
///:~


           
       
Related examples in the same category
1. Associates keys with valuesAssociates keys with values
2. A simple Map implementationA simple Map implementation
3. Hash table with separate chaining
4. Hash table with linear probingHash table with linear probing
5. Hash table with double hashingHash table with double hashing
6. Working with Key-Value Pairs in a Hashtable
7. Demonstrate the Hashtable class, and an Enumeration
8. Demonstrate the HashMap class, and an IteratorDemonstrate the HashMap class, and an Iterator
9. Soft HashMap
10. MultiMap extends AbstractMap
11. Array Map extends AbstractMapArray Map extends AbstractMap
12. Demonstrating the WeakHashMapDemonstrating the WeakHashMap
13. Use treemapUse treemap
14. Sorting Elements in a TreeMapSorting Elements in a TreeMap
15. A Map implemented with ArrayLists
16. Simple demonstration of HashMapSimple demonstration of HashMap
w___w__w_.__j__a__v___a2__s__._c___om_ | Contact Us
Copyright 2003 - 08 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.