Java/ConcurrentSkipList - Revision history

Admin: /* View Methods */

2017-06-30T06:07:42Z

View Methods

@@ Line 397: / Line 397: @@
          EntrySet es = entrySet;
          return (es != null) ? es : (entrySet = new EntrySet(this));
+}
 </pre>

Admin: /* Random index */

2017-06-30T06:07:07Z

Random index

← Older revision		Revision as of 06:07, 30 June 2017
Line 413:		Line 413:

	There are some nice submap methods available as well. Three sub-map methods are implemented: one method taking two keys (start/end), one method taking a single key and returning every item with a key above that key, and one method taking a single key and returning every item with a key below that key.		There are some nice submap methods available as well. Three sub-map methods are implemented: one method taking two keys (start/end), one method taking a single key and returning every item with a key above that key, and one method taking a single key and returning every item with a key below that key.

			==Iterator methods==

			The class implements an Iterator class, with the usual set of methods, plus a KeyIterator class, a ValueIterator class, and an EntryIterator class.

	==Random index==		==Random index==

Admin: /* Size */

2017-06-30T06:03:45Z

Size

@@ Line 368: / Line 368: @@
+}
 </pre>
 ==Random index==

Admin: /* Map interface */

2017-06-30T05:56:57Z

Map interface

@@ Line 344: / Line 344: @@
          return doPut(key, value, false);
+     }
 </pre>

Admin: /* Map interface */

2017-06-30T05:33:03Z

Map interface

← Older revision		Revision as of 05:33, 30 June 2017
Line 343:		Line 343:
	throw new NullPointerException();		throw new NullPointerException();
	return doPut(key, value, false);		return doPut(key, value, false);
	}		}
	</pre>		</pre>

Admin: /* Map interface */

2017-06-30T05:32:54Z

Map interface

← Older revision		Revision as of 05:32, 30 June 2017
Line 336:		Line 336:
	public V get(Object key) {		public V get(Object key) {
	return doGet(key);		return doGet(key);
	}		}
	~~</pre>~~

	~~<pre>~~
	public V put(K key, V value) {		public V put(K key, V value) {
	if (value == null)		if (value == null)

Admin: /* Random index */

2017-06-30T05:32:25Z

Random index

← Older revision		Revision as of 05:32, 30 June 2017
Line 318:		Line 318:

	More methods for serialization of these objects: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89a19a29bb9f9807d2a28351ed7f7df/src/share/classes/java/util/concurrent/ConcurrentSkipListMap.java#L1507		More methods for serialization of these objects: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89a19a29bb9f9807d2a28351ed7f7df/src/share/classes/java/util/concurrent/ConcurrentSkipListMap.java#L1507

			==Map interface==

			There are several methods implemented to make this conform to the Map ADT: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89a19a29bb9f9807d2a28351ed7f7df/src/share/classes/java/util/concurrent/ConcurrentSkipListMap.java#L1595

			These all utilize the private versions of get/put/remove. For example, here is the containsKey method:

			<pre>
			public boolean containsKey(Object key) {
			return doGet(key) != null;
			}
			</pre>

			The get and put methods:

			<pre>
			public V get(Object key) {
			return doGet(key);
			}
			</pre>

			<pre>
			public V put(K key, V value) {
			if (value == null)
			throw new NullPointerException();
			return doPut(key, value, false);
			}
			</pre>

	==Random index==		==Random index==

Admin: /* Special first-node and last-node versions */

2017-06-30T05:31:02Z

Special first-node and last-node versions

← Older revision		Revision as of 05:31, 30 June 2017
Line 299:		Line 299:
	This relies on an understanding of some of the other details of the class - the marker and head nodes, for example, and how they are identified.		This relies on an understanding of some of the other details of the class - the marker and head nodes, for example, and how they are identified.

	==Special first-node and last-node versions==		==Special first-node and last-node versions of modifier methods==

	There are a few methods of the put/remove/get methods that deal with the case of it being the first node: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89a19a29bb9f9807d2a28351ed7f7df/src/share/classes/java/util/concurrent/ConcurrentSkipListMap.java#L1123		There are a few methods of the put/remove/get methods that deal with the case of it being the first node: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89a19a29bb9f9807d2a28351ed7f7df/src/share/classes/java/util/concurrent/ConcurrentSkipListMap.java#L1123

Admin: /* Deletion */

2017-06-30T05:30:40Z

Deletion

← Older revision		Revision as of 05:30, 30 June 2017
Line 298:		Line 298:

	This relies on an understanding of some of the other details of the class - the marker and head nodes, for example, and how they are identified.		This relies on an understanding of some of the other details of the class - the marker and head nodes, for example, and how they are identified.

			==Special first-node and last-node versions==

			There are a few methods of the put/remove/get methods that deal with the case of it being the first node: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89a19a29bb9f9807d2a28351ed7f7df/src/share/classes/java/util/concurrent/ConcurrentSkipListMap.java#L1123

			Similarly, dealing with the case of finding the last/next-to-last node: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89a19a29bb9f9807d2a28351ed7f7df/src/share/classes/java/util/concurrent/ConcurrentSkipListMap.java#L1188

			==Comparisons==

			An operation called findNear (finding nearest node that matches a condition) is defined: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89a19a29bb9f9807d2a28351ed7f7df/src/share/classes/java/util/concurrent/ConcurrentSkipListMap.java#L1314

			==Constructors==

			All the constructors are defined on line 1376: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89a19a29bb9f9807d2a28351ed7f7df/src/share/classes/java/util/concurrent/ConcurrentSkipListMap.java#L1376

			This includes quite a few specialist methods/constructors for building skip lists from other structures.

			==Serialization==

			More methods for serialization of these objects: https://github.com/openjdk-mirror/jdk7u-jdk/blob/f4d80957e89a19a29bb9f9807d2a28351ed7f7df/src/share/classes/java/util/concurrent/ConcurrentSkipListMap.java#L1507

	==Random index==		==Random index==

Admin: /* ETc */

2017-06-30T05:19:09Z

ETc

← Older revision		Revision as of 05:19, 30 June 2017
Line 298:		Line 298:

	This relies on an understanding of some of the other details of the class - the marker and head nodes, for example, and how they are identified.		This relies on an understanding of some of the other details of the class - the marker and head nodes, for example, and how they are identified.

	~~==ETc==~~

	==Random index==		==Random index==