ViewVC Help

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

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

Comparing jsr166/src/test/tck/ConcurrentSkipListMapTest.java (file contents):
Revision 1.19 by jsr166, Wed Sep 1 20:12:39 2010 UTC vs.
Revision 1.20 by jsr166, Sat Oct 9 19:30:34 2010 UTC

#	Line 34 | Line 34 | public class ConcurrentSkipListMapTest e
34		}
35
36		/**
37	<	*  clear removes all pairs
37	>	* clear removes all pairs
38		*/
39		public void testClear() {
40		ConcurrentSkipListMap map = map5();
#	Line 52 | Line 52 | public class ConcurrentSkipListMapTest e
52		}
53
54		/**
55	<	*  Maps with same contents are equal
55	>	* Maps with same contents are equal
56		*/
57		public void testEquals() {
58		ConcurrentSkipListMap map1 = map5();
#	Line 65 | Line 65 | public class ConcurrentSkipListMapTest e
65		}
66
67		/**
68	<	*  containsKey returns true for contained key
68	>	* containsKey returns true for contained key
69		*/
70		public void testContainsKey() {
71		ConcurrentSkipListMap map = map5();
#	Line 74 | Line 74 | public class ConcurrentSkipListMapTest e
74		}
75
76		/**
77	<	*  containsValue returns true for held values
77	>	* containsValue returns true for held values
78		*/
79		public void testContainsValue() {
80		ConcurrentSkipListMap map = map5();
#	Line 83 | Line 83 | public class ConcurrentSkipListMapTest e
83		}
84
85		/**
86	<	*  get returns the correct element at the given key,
87	<	*  or null if not present
86	>	* get returns the correct element at the given key,
87	>	* or null if not present
88		*/
89		public void testGet() {
90		ConcurrentSkipListMap map = map5();
#	Line 94 | Line 94 | public class ConcurrentSkipListMapTest e
94		}
95
96		/**
97	<	*  isEmpty is true of empty map and false for non-empty
97	>	* isEmpty is true of empty map and false for non-empty
98		*/
99		public void testIsEmpty() {
100		ConcurrentSkipListMap empty = new ConcurrentSkipListMap();
#	Line 104 | Line 104 | public class ConcurrentSkipListMapTest e
104		}
105
106		/**
107	<	*   firstKey returns first key
107	>	* firstKey returns first key
108		*/
109		public void testFirstKey() {
110		ConcurrentSkipListMap map = map5();
#	Line 112 | Line 112 | public class ConcurrentSkipListMapTest e
112		}
113
114		/**
115	<	*   lastKey returns last key
115	>	* lastKey returns last key
116		*/
117		public void testLastKey() {
118		ConcurrentSkipListMap map = map5();
#	Line 121 | Line 121 | public class ConcurrentSkipListMapTest e
121
122
123		/**
124	<	*  keySet.toArray returns contains all keys
124	>	* keySet.toArray returns contains all keys
125		*/
126		public void testKeySetToArray() {
127		ConcurrentSkipListMap map = map5();
#	Line 134 | Line 134 | public class ConcurrentSkipListMapTest e
134		}
135
136		/**
137	<	*  descendingkeySet.toArray returns contains all keys
137	>	* descendingkeySet.toArray returns contains all keys
138		*/
139		public void testDescendingKeySetToArray() {
140		ConcurrentSkipListMap map = map5();
#	Line 147 | Line 147 | public class ConcurrentSkipListMapTest e
147		}
148
149		/**
150	<	*   keySet returns a Set containing all the keys
150	>	* keySet returns a Set containing all the keys
151		*/
152		public void testKeySet() {
153		ConcurrentSkipListMap map = map5();
#	Line 161 | Line 161 | public class ConcurrentSkipListMapTest e
161		}
162
163		/**
164	<	*   keySet is ordered
164	>	* keySet is ordered
165		*/
166		public void testKeySetOrder() {
167		ConcurrentSkipListMap map = map5();
#	Line 199 | Line 199 | public class ConcurrentSkipListMapTest e
199		}
200
201		/**
202	<	*   descendingKeySet is ordered
202	>	* descendingKeySet is ordered
203		*/
204		public void testDescendingKeySetOrder() {
205		ConcurrentSkipListMap map = map5();
#	Line 218 | Line 218 | public class ConcurrentSkipListMapTest e
218		}
219
220		/**
221	<	*  descending iterator of descendingKeySet is ordered
221	>	* descending iterator of descendingKeySet is ordered
222		*/
223		public void testDescendingKeySetDescendingIteratorOrder() {
224		ConcurrentSkipListMap map = map5();
#	Line 237 | Line 237 | public class ConcurrentSkipListMapTest e
237		}
238
239		/**
240	<	*  Values.toArray contains all values
240	>	* Values.toArray contains all values
241		*/
242		public void testValuesToArray() {
243		ConcurrentSkipListMap map = map5();
#	Line 305 | Line 305 | public class ConcurrentSkipListMapTest e
305		}
306
307		/**
308	<	*  entrySet.toArray contains all entries
308	>	* entrySet.toArray contains all entries
309		*/
310		public void testEntrySetToArray() {
311		ConcurrentSkipListMap map = map5();
#	Line 319 | Line 319 | public class ConcurrentSkipListMapTest e
319		}
320
321		/**
322	<	*  descendingEntrySet.toArray contains all entries
322	>	* descendingEntrySet.toArray contains all entries
323		*/
324		public void testDescendingEntrySetToArray() {
325		ConcurrentSkipListMap map = map5();
#	Line 333 | Line 333 | public class ConcurrentSkipListMapTest e
333		}
334
335		/**
336	<	*   putAll  adds all key-value pairs from the given map
336	>	* putAll adds all key-value pairs from the given map
337		*/
338		public void testPutAll() {
339		ConcurrentSkipListMap empty = new ConcurrentSkipListMap();
#	Line 348 | Line 348 | public class ConcurrentSkipListMapTest e
348		}
349
350		/**
351	<	*   putIfAbsent works when the given key is not present
351	>	* putIfAbsent works when the given key is not present
352		*/
353		public void testPutIfAbsent() {
354		ConcurrentSkipListMap map = map5();
#	Line 357 | Line 357 | public class ConcurrentSkipListMapTest e
357		}
358
359		/**
360	<	*   putIfAbsent does not add the pair if the key is already present
360	>	* putIfAbsent does not add the pair if the key is already present
361		*/
362		public void testPutIfAbsent2() {
363		ConcurrentSkipListMap map = map5();
#	Line 365 | Line 365 | public class ConcurrentSkipListMapTest e
365		}
366
367		/**
368	<	*   replace fails when the given key is not present
368	>	* replace fails when the given key is not present
369		*/
370		public void testReplace() {
371		ConcurrentSkipListMap map = map5();
#	Line 374 | Line 374 | public class ConcurrentSkipListMapTest e
374		}
375
376		/**
377	<	*   replace succeeds if the key is already present
377	>	* replace succeeds if the key is already present
378		*/
379		public void testReplace2() {
380		ConcurrentSkipListMap map = map5();
#	Line 405 | Line 405 | public class ConcurrentSkipListMapTest e
405
406
407		/**
408	<	*   remove removes the correct key-value pair from the map
408	>	* remove removes the correct key-value pair from the map
409		*/
410		public void testRemove() {
411		ConcurrentSkipListMap map = map5();
#	Line 662 | Line 662 | public class ConcurrentSkipListMapTest e
662		}
663
664		/**
665	<	*   size returns the correct values
665	>	* size returns the correct values
666		*/
667		public void testSize() {
668		ConcurrentSkipListMap map = map5();

Diff Legend

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