ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/ConcurrentHashMapTest.java

Comparing jsr166/src/test/tck/ConcurrentHashMapTest.java (file contents):
Revision 1.21 by jsr166, Wed Aug 25 00:07:03 2010 UTC vs.
Revision 1.22 by jsr166, Sat Oct 9 19:30:34 2010 UTC

#	Line 37 | Line 37 | public class ConcurrentHashMapTest exten
37		}
38
39		/**
40	<	*  clear removes all pairs
40	>	* clear removes all pairs
41		*/
42		public void testClear() {
43		ConcurrentHashMap map = map5();
#	Line 46 | Line 46 | public class ConcurrentHashMapTest exten
46		}
47
48		/**
49	<	*  Maps with same contents are equal
49	>	* Maps with same contents are equal
50		*/
51		public void testEquals() {
52		ConcurrentHashMap map1 = map5();
#	Line 59 | Line 59 | public class ConcurrentHashMapTest exten
59		}
60
61		/**
62	<	*  contains returns true for contained value
62	>	* contains returns true for contained value
63		*/
64		public void testContains() {
65		ConcurrentHashMap map = map5();
#	Line 68 | Line 68 | public class ConcurrentHashMapTest exten
68		}
69
70		/**
71	<	*  containsKey returns true for contained key
71	>	* containsKey returns true for contained key
72		*/
73		public void testContainsKey() {
74		ConcurrentHashMap map = map5();
#	Line 77 | Line 77 | public class ConcurrentHashMapTest exten
77		}
78
79		/**
80	<	*  containsValue returns true for held values
80	>	* containsValue returns true for held values
81		*/
82		public void testContainsValue() {
83		ConcurrentHashMap map = map5();
#	Line 86 | Line 86 | public class ConcurrentHashMapTest exten
86		}
87
88		/**
89	<	*   enumeration returns an enumeration containing the correct
90	<	*   elements
89	>	* enumeration returns an enumeration containing the correct
90	>	* elements
91		*/
92		public void testEnumeration() {
93		ConcurrentHashMap map = map5();
#	Line 101 | Line 101 | public class ConcurrentHashMapTest exten
101		}
102
103		/**
104	<	*  get returns the correct element at the given key,
105	<	*  or null if not present
104	>	* get returns the correct element at the given key,
105	>	* or null if not present
106		*/
107		public void testGet() {
108		ConcurrentHashMap map = map5();
#	Line 112 | Line 112 | public class ConcurrentHashMapTest exten
112		}
113
114		/**
115	<	*  isEmpty is true of empty map and false for non-empty
115	>	* isEmpty is true of empty map and false for non-empty
116		*/
117		public void testIsEmpty() {
118		ConcurrentHashMap empty = new ConcurrentHashMap();
#	Line 122 | Line 122 | public class ConcurrentHashMapTest exten
122		}
123
124		/**
125	<	*   keys returns an enumeration containing all the keys from the map
125	>	* keys returns an enumeration containing all the keys from the map
126		*/
127		public void testKeys() {
128		ConcurrentHashMap map = map5();
#	Line 136 | Line 136 | public class ConcurrentHashMapTest exten
136		}
137
138		/**
139	<	*   keySet returns a Set containing all the keys
139	>	* keySet returns a Set containing all the keys
140		*/
141		public void testKeySet() {
142		ConcurrentHashMap map = map5();
#	Line 150 | Line 150 | public class ConcurrentHashMapTest exten
150		}
151
152		/**
153	<	*  keySet.toArray returns contains all keys
153	>	* keySet.toArray returns contains all keys
154		*/
155		public void testKeySetToArray() {
156		ConcurrentHashMap map = map5();
#	Line 163 | Line 163 | public class ConcurrentHashMapTest exten
163		}
164
165		/**
166	<	*  Values.toArray contains all values
166	>	* Values.toArray contains all values
167		*/
168		public void testValuesToArray() {
169		ConcurrentHashMap map = map5();
#	Line 179 | Line 179 | public class ConcurrentHashMapTest exten
179		}
180
181		/**
182	<	*  entrySet.toArray contains all entries
182	>	* entrySet.toArray contains all entries
183		*/
184		public void testEntrySetToArray() {
185		ConcurrentHashMap map = map5();
#	Line 226 | Line 226 | public class ConcurrentHashMapTest exten
226		}
227
228		/**
229	<	*   putAll  adds all key-value pairs from the given map
229	>	* putAll adds all key-value pairs from the given map
230		*/
231		public void testPutAll() {
232		ConcurrentHashMap empty = new ConcurrentHashMap();
#	Line 241 | Line 241 | public class ConcurrentHashMapTest exten
241		}
242
243		/**
244	<	*   putIfAbsent works when the given key is not present
244	>	* putIfAbsent works when the given key is not present
245		*/
246		public void testPutIfAbsent() {
247		ConcurrentHashMap map = map5();
#	Line 250 | Line 250 | public class ConcurrentHashMapTest exten
250		}
251
252		/**
253	<	*   putIfAbsent does not add the pair if the key is already present
253	>	* putIfAbsent does not add the pair if the key is already present
254		*/
255		public void testPutIfAbsent2() {
256		ConcurrentHashMap map = map5();
#	Line 258 | Line 258 | public class ConcurrentHashMapTest exten
258		}
259
260		/**
261	<	*   replace fails when the given key is not present
261	>	* replace fails when the given key is not present
262		*/
263		public void testReplace() {
264		ConcurrentHashMap map = map5();
#	Line 267 | Line 267 | public class ConcurrentHashMapTest exten
267		}
268
269		/**
270	<	*   replace succeeds if the key is already present
270	>	* replace succeeds if the key is already present
271		*/
272		public void testReplace2() {
273		ConcurrentHashMap map = map5();
#	Line 298 | Line 298 | public class ConcurrentHashMapTest exten
298
299
300		/**
301	<	*   remove removes the correct key-value pair from the map
301	>	* remove removes the correct key-value pair from the map
302		*/
303		public void testRemove() {
304		ConcurrentHashMap map = map5();
#	Line 321 | Line 321 | public class ConcurrentHashMapTest exten
321		}
322
323		/**
324	<	*   size returns the correct values
324	>	* size returns the correct values
325		*/
326		public void testSize() {
327		ConcurrentHashMap map = map5();

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines