fork download 
  1. class Ideone
  2. {
  3. 	public static void main(String[] args)
  4. 	{
  5. 		Hashtable<String, Integer> table =
  6. 			new Hashtable<String, Integer>();
  7. 		System.out.println(table.set("HOGE", Integer.valueOf(123)));
  8. 		System.out.println(table.set("HOGE", Integer.valueOf(345)));
  9. 		System.out.println(table.set("HAGE", Integer.valueOf(555)));
  10. 		System.out.println(table.set("abcd", Integer.valueOf(999)));
  11. 		System.out.println(table.set("xyz0", Integer.valueOf(111)));
  12.  
  13. 		Iterator<Integer> itr = table.items();
  14. 		while (itr.hasNext())
  15. 		{
  16. 			System.out.println(itr.next());
  17. 		}
  18. 	}
  19.  
  20. 	static interface Iterator<T>
  21. 	{
  22. 		boolean hasNext();
  23. 		T next();
  24. 	}
  25.  
  26. 	static class Hashtable<K,T>
  27. 	{
  28. 		static class List
  29. 		{
  30. 			public List next = null;
  31. 			public Object key = null;
  32. 			public Object obj = null;
  33. 			public List(Object key, Object obj)
  34. 			{
  35. 				this.key = key;
  36. 				this.obj = obj;
  37. 			}
  38. 		}
  39.  
  40. 		static final int TABLE_SIZE = 32;
  41.  
  42. 		List[] table = null;
  43. 		int count = 0;
  44.  
  45. 		Hashtable()
  46. 		{
  47. 			table = new List[TABLE_SIZE];
  48. 		}
  49.  
  50. 		public int getCount()
  51. 		{
  52. 			return count;
  53. 		}
  54.  
  55. 		public boolean set(K key, T item)
  56. 		{
  57. 			if (key == null || item == null)
  58. 			{
  59. 				return false;
  60. 			}
  61. 			int h = key.hashCode() % TABLE_SIZE;
  62. 			if (table[h] == null)
  63. 			{
  64. 				table[h] = new List(key, item);
  65. 			}
  66. 			else
  67. 			{
  68. 				List list = table[h];
  69. 				for (;;)
  70. 				{
  71. 					if (key.equals(list.key))
  72. 					{
  73. 						return false;
  74. 					}
  75. 					if (list.next == null)
  76. 					{
  77. 						break;
  78. 					}
  79. 					else
  80. 					{
  81. 						list = list.next;
  82. 					}
  83. 				}
  84. 				list.next = new List(key, item);
  85. 			}
  86. 			++count;
  87. 			return true;
  88. 		}
  89.  
  90. 		public Iterator<T> items()
  91. 		{
  92. 			return new Iterator<T>()
  93. 			{
  94. 				List[] t = table;
  95. 				int c = count;
  96. 				int i = 0;
  97. 				List list = null;
  98. 				@Override
  99. 				public boolean hasNext()
  100. 				{
  101. 					return c > 0;
  102. 				}
  103. 				@Override
  104. 				public T next()
  105. 				{
  106. 					if (c == 0)
  107. 					{
  108. 						return null;
  109. 					}
  110. 					List result = null;
  111. 					if (list == null)
  112. 					{
  113. 						for ( ; i < TABLE_SIZE; ++i)
  114. 						{
  115. 							if (t[i] != null)
  116. 							{
  117. 								result = t[i];
  118. 								++i;
  119. 								break;
  120. 							}
  121. 						}
  122. 					}
  123. 					else
  124. 					{
  125. 						result = list;
  126. 					}
  127. 					if (result == null)
  128. 					{
  129. 						return null;
  130. 					}
  131. 					list = result.next;
  132. 					--c;
  133. 					return (T)result.obj;
  134. 				}
  135. 			};
  136. 		}
  137. 	}
  138. }
Success #stdin #stdout 0.08s 380160KB
comments (?)
stdin 
Standard input is empty
stdout 
true
false
true
true
true
999
123
555
111
https://ideone.com/OTEtaJ
language:
Java (HotSpot 12)
created:
10 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!