Compares the efficiency of the hash map implementation with the tree map : Hashtable « Collections Data Structure « C# / C Sharp

C# / C Sharp
1. 2D Graphics
2. Class Interface
3. Collections Data Structure
4. Components
5. Data Types
6. Database ADO.net
7. Design Patterns
8. Development Class
9. Event
10. File Stream
11. Generics
12. GUI Windows Form
13. Language Basics
14. LINQ
15. Network
16. Office
17. Reflection
18. Regular Expressions
19. Security
20. Services Event
21. Thread
22. Web Services
23. Windows
24. XML
25. XML LINQ
Java
Java Tutorial
Java Source Code / Java Documentation
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
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
Flash / Flex / ActionScript
VBA / Excel / Access / Word
Microsoft Office PowerPoint 2007 Tutorial
Microsoft Office Excel 2007 Tutorial
Microsoft Office Word 2007 Tutorial
C# / C Sharp » Collections Data Structure » HashtableScreenshots 
Compares the efficiency of the hash map implementation with the tree map
Compares the efficiency of the hash map implementation with the tree map

using System;
using System.Collections;

public class CompareMaps {
  public const int MAX  = 50000000;

  public static String time(IDictionary map) {
    Object value = null;
    long starttime = Environment.TickCount;
    for (int i = 0; i < MAX; i++) {
        value = map[i];
    
    long stoptime = Environment.TickCount;
    return value + " took " (stoptime - starttime);
  }          
  
  public static void Main(String[] args) {
    int SIZE = 1000;
    IDictionary hash = new Hashtable(2*SIZE);
    IDictionary tree = new SortedList();
    
    Random random = new Random();
    int i = random.Next(5000000);
    
    for (int j = 0; j < SIZE; j++) {
       if(!hash.Contains(i))
          hash.Add(i, i);
       if(!tree.Contains(i))
          tree.Add(i, i);
    }
    Console.WriteLine("Hash for {0}", time(hash));
    Console.WriteLine("Tree for {0}", time(tree));
  }
}    

           
       
Related examples in the same category
1. Implement GetHashCode method and store it in a hashtableImplement GetHashCode method and store it in a hashtable
2. Add value to Hashtable and loop through the value key pairsAdd value to Hashtable and loop through the value key pairs
3. Enumerating a hash table collectionEnumerating a hash table collection
4. illustrates the use of a Hashtableillustrates the use of a Hashtable
5. illustrates the use of the Hashtable methodsillustrates the use of the Hashtable methods
6. Demonstrate HashtableDemonstrate Hashtable
7. Get IDictionaryEnumerator enumerator from Hashtable
w___w__w_.__j___a___v__a___2_s___.c___o___m__ | Contact Us
Copyright 2003 - 08 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.