ViewVC Help

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

root/jsr166/jsr166/src/main/java/util/concurrent/ConcurrentSkipListMap.java

Comparing jsr166/src/main/java/util/concurrent/ConcurrentSkipListMap.java (file contents):
Revision 1.86 by jsr166, Wed Jan 16 21:25:33 2013 UTC vs.
Revision 1.87 by jsr166, Wed Jan 16 22:10:06 2013 UTC

#	Line 1411 | Line 1411 | public class ConcurrentSkipListMap<K,V>
1411		/**
1412		* Creates a new {@link Set} backed by a ConcurrentSkipListMap
1413		* from the given type to {@code Boolean.TRUE}, using the
1414	<	* given comparator
1414	>	* given comparator.
1415		*
1416		* @param comparator the comparator that will be used to order this map.
1417		*        If {@code null}, the {@linkplain Comparable natural
#	Line 2577 | Line 2577 | public class ConcurrentSkipListMap<K,V>
2577		private transient Collection<V> valuesView;
2578
2579		/**
2580	<	* Creates a new submap, initializing all fields
2580	>	* Creates a new submap, initializing all fields.
2581		*/
2582		SubMap(ConcurrentSkipListMap<K,V> map,
2583		K fromKey, boolean fromInclusive,
#	Line 2626 | Line 2626 | public class ConcurrentSkipListMap<K,V>
2626		}
2627
2628		/**
2629	<	* Returns true if node key is less than upper bound of range
2629	>	* Returns true if node key is less than upper bound of range.
2630		*/
2631		private boolean isBeforeEnd(ConcurrentSkipListMap.Node<K,V> n) {
2632		if (n == null)
#	Line 2644 | Line 2644 | public class ConcurrentSkipListMap<K,V>
2644
2645		/**
2646		* Returns lowest node. This node might not be in range, so
2647	<	* most usages need to check bounds
2647	>	* most usages need to check bounds.
2648		*/
2649		private ConcurrentSkipListMap.Node<K,V> loNode() {
2650		if (lo == null)
#	Line 2657 | Line 2657 | public class ConcurrentSkipListMap<K,V>
2657
2658		/**
2659		* Returns highest node. This node might not be in range, so
2660	<	* most usages need to check bounds
2660	>	* most usages need to check bounds.
2661		*/
2662		private ConcurrentSkipListMap.Node<K,V> hiNode() {
2663		if (hi == null)
#	Line 2669 | Line 2669 | public class ConcurrentSkipListMap<K,V>
2669		}
2670
2671		/**
2672	<	* Returns lowest absolute key (ignoring directonality)
2672	>	* Returns lowest absolute key (ignoring directonality).
2673		*/
2674		private K lowestKey() {
2675		ConcurrentSkipListMap.Node<K,V> n = loNode();
#	Line 2680 | Line 2680 | public class ConcurrentSkipListMap<K,V>
2680		}
2681
2682		/**
2683	<	* Returns highest absolute key (ignoring directonality)
2683	>	* Returns highest absolute key (ignoring directonality).
2684		*/
2685		private K highestKey() {
2686		ConcurrentSkipListMap.Node<K,V> n = hiNode();

Diff Legend

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