ViewVC Help

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

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

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

#	Line 64 | Line 64 | public class ConcurrentSkipListSubMapTes
64		}
65
66		/**
67	<	*  clear removes all pairs
67	>	* clear removes all pairs
68		*/
69		public void testClear() {
70		ConcurrentNavigableMap map = map5();
#	Line 74 | Line 74 | public class ConcurrentSkipListSubMapTes
74
75
76		/**
77	<	*  Maps with same contents are equal
77	>	* Maps with same contents are equal
78		*/
79		public void testEquals() {
80		ConcurrentNavigableMap map1 = map5();
#	Line 87 | Line 87 | public class ConcurrentSkipListSubMapTes
87		}
88
89		/**
90	<	*  containsKey returns true for contained key
90	>	* containsKey returns true for contained key
91		*/
92		public void testContainsKey() {
93		ConcurrentNavigableMap map = map5();
#	Line 96 | Line 96 | public class ConcurrentSkipListSubMapTes
96		}
97
98		/**
99	<	*  containsValue returns true for held values
99	>	* containsValue returns true for held values
100		*/
101		public void testContainsValue() {
102		ConcurrentNavigableMap map = map5();
#	Line 105 | Line 105 | public class ConcurrentSkipListSubMapTes
105		}
106
107		/**
108	<	*  get returns the correct element at the given key,
109	<	*  or null if not present
108	>	* get returns the correct element at the given key,
109	>	* or null if not present
110		*/
111		public void testGet() {
112		ConcurrentNavigableMap map = map5();
#	Line 116 | Line 116 | public class ConcurrentSkipListSubMapTes
116		}
117
118		/**
119	<	*  isEmpty is true of empty map and false for non-empty
119	>	* isEmpty is true of empty map and false for non-empty
120		*/
121		public void testIsEmpty() {
122		ConcurrentNavigableMap empty = map0();
#	Line 126 | Line 126 | public class ConcurrentSkipListSubMapTes
126		}
127
128		/**
129	<	*   firstKey returns first key
129	>	* firstKey returns first key
130		*/
131		public void testFirstKey() {
132		ConcurrentNavigableMap map = map5();
#	Line 134 | Line 134 | public class ConcurrentSkipListSubMapTes
134		}
135
136		/**
137	<	*   lastKey returns last key
137	>	* lastKey returns last key
138		*/
139		public void testLastKey() {
140		ConcurrentNavigableMap map = map5();
#	Line 143 | Line 143 | public class ConcurrentSkipListSubMapTes
143
144
145		/**
146	<	*   keySet returns a Set containing all the keys
146	>	* keySet returns a Set containing all the keys
147		*/
148		public void testKeySet() {
149		ConcurrentNavigableMap map = map5();
#	Line 157 | Line 157 | public class ConcurrentSkipListSubMapTes
157		}
158
159		/**
160	<	*   keySet is ordered
160	>	* keySet is ordered
161		*/
162		public void testKeySetOrder() {
163		ConcurrentNavigableMap map = map5();
#	Line 187 | Line 187 | public class ConcurrentSkipListSubMapTes
187		}
188
189		/**
190	<	*  keySet.toArray returns contains all keys
190	>	* keySet.toArray returns contains all keys
191		*/
192		public void testKeySetToArray() {
193		ConcurrentNavigableMap map = map5();
#	Line 200 | Line 200 | public class ConcurrentSkipListSubMapTes
200		}
201
202		/**
203	<	*  descendingkeySet.toArray returns contains all keys
203	>	* descendingkeySet.toArray returns contains all keys
204		*/
205		public void testDescendingKeySetToArray() {
206		ConcurrentNavigableMap map = map5();
#	Line 213 | Line 213 | public class ConcurrentSkipListSubMapTes
213		}
214
215		/**
216	<	*  Values.toArray contains all values
216	>	* Values.toArray contains all values
217		*/
218		public void testValuesToArray() {
219		ConcurrentNavigableMap map = map5();
#	Line 249 | Line 249 | public class ConcurrentSkipListSubMapTes
249		}
250
251		/**
252	<	*   putAll  adds all key-value pairs from the given map
252	>	* putAll adds all key-value pairs from the given map
253		*/
254		public void testPutAll() {
255		ConcurrentNavigableMap empty = map0();
#	Line 264 | Line 264 | public class ConcurrentSkipListSubMapTes
264		}
265
266		/**
267	<	*   putIfAbsent works when the given key is not present
267	>	* putIfAbsent works when the given key is not present
268		*/
269		public void testPutIfAbsent() {
270		ConcurrentNavigableMap map = map5();
#	Line 273 | Line 273 | public class ConcurrentSkipListSubMapTes
273		}
274
275		/**
276	<	*   putIfAbsent does not add the pair if the key is already present
276	>	* putIfAbsent does not add the pair if the key is already present
277		*/
278		public void testPutIfAbsent2() {
279		ConcurrentNavigableMap map = map5();
#	Line 281 | Line 281 | public class ConcurrentSkipListSubMapTes
281		}
282
283		/**
284	<	*   replace fails when the given key is not present
284	>	* replace fails when the given key is not present
285		*/
286		public void testReplace() {
287		ConcurrentNavigableMap map = map5();
#	Line 290 | Line 290 | public class ConcurrentSkipListSubMapTes
290		}
291
292		/**
293	<	*   replace succeeds if the key is already present
293	>	* replace succeeds if the key is already present
294		*/
295		public void testReplace2() {
296		ConcurrentNavigableMap map = map5();
#	Line 321 | Line 321 | public class ConcurrentSkipListSubMapTes
321
322
323		/**
324	<	*   remove removes the correct key-value pair from the map
324	>	* remove removes the correct key-value pair from the map
325		*/
326		public void testRemove() {
327		ConcurrentNavigableMap map = map5();
#	Line 472 | Line 472 | public class ConcurrentSkipListSubMapTes
472		}
473
474		/**
475	<	*   size returns the correct values
475	>	* size returns the correct values
476		*/
477		public void testSize() {
478		ConcurrentNavigableMap map = map5();
#	Line 751 | Line 751 | public class ConcurrentSkipListSubMapTes
751		}
752
753		/**
754	<	*  clear removes all pairs
754	>	* clear removes all pairs
755		*/
756		public void testDescendingClear() {
757		ConcurrentNavigableMap map = dmap5();
#	Line 761 | Line 761 | public class ConcurrentSkipListSubMapTes
761
762
763		/**
764	<	*  Maps with same contents are equal
764	>	* Maps with same contents are equal
765		*/
766		public void testDescendingEquals() {
767		ConcurrentNavigableMap map1 = dmap5();
#	Line 774 | Line 774 | public class ConcurrentSkipListSubMapTes
774		}
775
776		/**
777	<	*  containsKey returns true for contained key
777	>	* containsKey returns true for contained key
778		*/
779		public void testDescendingContainsKey() {
780		ConcurrentNavigableMap map = dmap5();
#	Line 783 | Line 783 | public class ConcurrentSkipListSubMapTes
783		}
784
785		/**
786	<	*  containsValue returns true for held values
786	>	* containsValue returns true for held values
787		*/
788		public void testDescendingContainsValue() {
789		ConcurrentNavigableMap map = dmap5();
#	Line 792 | Line 792 | public class ConcurrentSkipListSubMapTes
792		}
793
794		/**
795	<	*  get returns the correct element at the given key,
796	<	*  or null if not present
795	>	* get returns the correct element at the given key,
796	>	* or null if not present
797		*/
798		public void testDescendingGet() {
799		ConcurrentNavigableMap map = dmap5();
#	Line 803 | Line 803 | public class ConcurrentSkipListSubMapTes
803		}
804
805		/**
806	<	*  isEmpty is true of empty map and false for non-empty
806	>	* isEmpty is true of empty map and false for non-empty
807		*/
808		public void testDescendingIsEmpty() {
809		ConcurrentNavigableMap empty = dmap0();
#	Line 813 | Line 813 | public class ConcurrentSkipListSubMapTes
813		}
814
815		/**
816	<	*   firstKey returns first key
816	>	* firstKey returns first key
817		*/
818		public void testDescendingFirstKey() {
819		ConcurrentNavigableMap map = dmap5();
#	Line 821 | Line 821 | public class ConcurrentSkipListSubMapTes
821		}
822
823		/**
824	<	*   lastKey returns last key
824	>	* lastKey returns last key
825		*/
826		public void testDescendingLastKey() {
827		ConcurrentNavigableMap map = dmap5();
#	Line 830 | Line 830 | public class ConcurrentSkipListSubMapTes
830
831
832		/**
833	<	*   keySet returns a Set containing all the keys
833	>	* keySet returns a Set containing all the keys
834		*/
835		public void testDescendingKeySet() {
836		ConcurrentNavigableMap map = dmap5();
#	Line 844 | Line 844 | public class ConcurrentSkipListSubMapTes
844		}
845
846		/**
847	<	*   keySet is ordered
847	>	* keySet is ordered
848		*/
849		public void testDescendingKeySetOrder() {
850		ConcurrentNavigableMap map = dmap5();
#	Line 874 | Line 874 | public class ConcurrentSkipListSubMapTes
874		}
875
876		/**
877	<	*  keySet.toArray returns contains all keys
877	>	* keySet.toArray returns contains all keys
878		*/
879		public void testDescendingAscendingKeySetToArray() {
880		ConcurrentNavigableMap map = dmap5();
#	Line 887 | Line 887 | public class ConcurrentSkipListSubMapTes
887		}
888
889		/**
890	<	*  descendingkeySet.toArray returns contains all keys
890	>	* descendingkeySet.toArray returns contains all keys
891		*/
892		public void testDescendingDescendingKeySetToArray() {
893		ConcurrentNavigableMap map = dmap5();
#	Line 900 | Line 900 | public class ConcurrentSkipListSubMapTes
900		}
901
902		/**
903	<	*  Values.toArray contains all values
903	>	* Values.toArray contains all values
904		*/
905		public void testDescendingValuesToArray() {
906		ConcurrentNavigableMap map = dmap5();
#	Line 936 | Line 936 | public class ConcurrentSkipListSubMapTes
936		}
937
938		/**
939	<	*   putAll  adds all key-value pairs from the given map
939	>	* putAll adds all key-value pairs from the given map
940		*/
941		public void testDescendingPutAll() {
942		ConcurrentNavigableMap empty = dmap0();
#	Line 951 | Line 951 | public class ConcurrentSkipListSubMapTes
951		}
952
953		/**
954	<	*   putIfAbsent works when the given key is not present
954	>	* putIfAbsent works when the given key is not present
955		*/
956		public void testDescendingPutIfAbsent() {
957		ConcurrentNavigableMap map = dmap5();
#	Line 960 | Line 960 | public class ConcurrentSkipListSubMapTes
960		}
961
962		/**
963	<	*   putIfAbsent does not add the pair if the key is already present
963	>	* putIfAbsent does not add the pair if the key is already present
964		*/
965		public void testDescendingPutIfAbsent2() {
966		ConcurrentNavigableMap map = dmap5();
#	Line 968 | Line 968 | public class ConcurrentSkipListSubMapTes
968		}
969
970		/**
971	<	*   replace fails when the given key is not present
971	>	* replace fails when the given key is not present
972		*/
973		public void testDescendingReplace() {
974		ConcurrentNavigableMap map = dmap5();
#	Line 977 | Line 977 | public class ConcurrentSkipListSubMapTes
977		}
978
979		/**
980	<	*   replace succeeds if the key is already present
980	>	* replace succeeds if the key is already present
981		*/
982		public void testDescendingReplace2() {
983		ConcurrentNavigableMap map = dmap5();
#	Line 1008 | Line 1008 | public class ConcurrentSkipListSubMapTes
1008
1009
1010		/**
1011	<	*   remove removes the correct key-value pair from the map
1011	>	* remove removes the correct key-value pair from the map
1012		*/
1013		public void testDescendingRemove() {
1014		ConcurrentNavigableMap map = dmap5();
#	Line 1159 | Line 1159 | public class ConcurrentSkipListSubMapTes
1159		}
1160
1161		/**
1162	<	*   size returns the correct values
1162	>	* size returns the correct values
1163		*/
1164		public void testDescendingSize() {
1165		ConcurrentNavigableMap map = dmap5();

Diff Legend

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