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.12 by jsr166, Mon May 2 03:04:41 2005 UTC vs.
Revision 1.13 by jsr166, Mon May 2 03:16:16 2005 UTC

#	Line 323 | Line 323 | public class ConcurrentSkipListMap<K,V>
323		private transient DescendingEntrySet descendingEntrySet;
324
325		/**
326	<	* Initialize or reset state. Needed by constructors, clone,
326	>	* Initializes or resets state. Needed by constructors, clone,
327		* clear, readObject. and ConcurrentSkipListSet.clone.
328		* (Note that comparator must be separately initialized.)
329		*/
#	Line 2077 | Line 2077 | public class ConcurrentSkipListMap<K,V>
2077		}
2078
2079		/**
2080	<	* Replace entry for key only if currently mapped to given value.
2080	>	* Replaces entry for key only if currently mapped to given value.
2081		* Acts as
2082		* <pre>
2083		*  if (map.containsKey(key) && map.get(key).equals(oldValue)) {
#	Line 2114 | Line 2114 | public class ConcurrentSkipListMap<K,V>
2114		}
2115
2116		/**
2117	<	* Replace entry for key only if currently mapped to some value.
2117	>	* Replaces entry for key only if currently mapped to some value.
2118		* Acts as
2119		* <pre>
2120		*  if (map.containsKey(key)) {
#	Line 2527 | Line 2527 | public class ConcurrentSkipListMap<K,V>
2527		return next != null;
2528		}
2529
2530	<	/** initialize ascending iterator for entire range  */
2530	>	/** Initializes ascending iterator for entire range. */
2531		final void initAscending() {
2532		for (;;) {
2533		next = findFirst();
#	Line 2540 | Line 2540 | public class ConcurrentSkipListMap<K,V>
2540		}
2541
2542		/**
2543	<	* initialize ascending iterator starting at given least key,
2543	>	* Initializes ascending iterator starting at given least key,
2544		* or first node if least is <tt>null</tt>, but not greater or
2545		* equal to fence, or end if fence is <tt>null</tt>.
2546		*/
#	Line 2559 | Line 2559 | public class ConcurrentSkipListMap<K,V>
2559		}
2560		}
2561		}
2562	<	/** advance next to higher entry */
2562	>	/** Advances next to higher entry. */
2563		final void ascend() {
2564		if ((last = next) == null)
2565		throw new NoSuchElementException();
#	Line 2594 | Line 2594 | public class ConcurrentSkipListMap<K,V>
2594		}
2595		}
2596
2597	<	/** initialize descending iterator for entire range  */
2597	>	/** Initializes descending iterator for entire range. */
2598		final void initDescending() {
2599		for (;;) {
2600		next = findLast();
#	Line 2607 | Line 2607 | public class ConcurrentSkipListMap<K,V>
2607		}
2608
2609		/**
2610	<	* initialize descending iterator starting at key less
2610	>	* Initializes descending iterator starting at key less
2611		* than or equal to given fence key, or
2612		* last node if fence is <tt>null</tt>, but not less than
2613		* least, or beginning if lest is <tt>null</tt>.
#	Line 2628 | Line 2628 | public class ConcurrentSkipListMap<K,V>
2628		}
2629		}
2630
2631	<	/** advance next to lower entry */
2631	>	/** Advances next to lower entry. */
2632		final void descend() {
2633		if ((last = next) == null)
2634		throw new NoSuchElementException();

Diff Legend

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