Several Methods to Traverse Key and value in hashtable

Several Methods to Traverse Key and value in hashtable

 

[Java]View plaincopy

1. Package corejava;
3. Import java. util. enumeration;
4. Import java. util. hashtable;
5. Import java. util. iterator;
6. /*
7. * Processing Principle: extract the key first and then use the key to obtain the value.
8. */
9. Public class hashtabledemo {
10. Public static void main (string [] ARGs ){
11. Hashtable <string, string> ht = new hashtable <string, string> ();
12. For (INT I = 0; I <10; I ++ ){
13. Ht. Put ("key" + I, "value" + I );
14. }
15. // Cyclically Traverse Key and Value
16. For (iterator <string> itr = HT. keyset (). iterator (); itr. hasnext ();){
17. String key = (string) itr. Next ();
18. String value = (string) Ht. Get (key );
19. System. Out. println (Key + "(for)" + value );
20. }
21. // Cyclically Traverse Key and Value
22. Iterator <string> itr = HT. keyset (). iterator ();
23. While (itr. hasnext ()){
24. String STR = (string) itr. Next ();
25. System. Out. println (STR + "(while)" + Ht. Get (STR ));
26. }
27. // Obtain value using Enumeration
28. Enumeration <string> E = HT. Elements ();
29. While (E. hasmoreelements ()){
30. System. Out. println (E. nextelement ());
31. }
32. // Obtain the key: Value Pair using Enumeration
33. Enumeration <string> E2 = Ht. Keys ();
34. While (e2.hasmoreelements ()){
35. String key = e2.nextelement ();
36. System. Out. println (Key + "=" + Ht. Get (key ));
37. }
38. }
40. }