1 |
|
/* |
2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
< |
* http://creativecommons.org/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
|
package jsr166x; |
119 |
|
*/ |
120 |
|
public Object clone() { |
121 |
|
ConcurrentSkipListSet<E> clone = null; |
122 |
< |
try { |
123 |
< |
clone = (ConcurrentSkipListSet<E>) super.clone(); |
124 |
< |
} catch (CloneNotSupportedException e) { |
125 |
< |
throw new InternalError(); |
126 |
< |
} |
122 |
> |
try { |
123 |
> |
clone = (ConcurrentSkipListSet<E>) super.clone(); |
124 |
> |
} catch (CloneNotSupportedException e) { |
125 |
> |
throw new InternalError(); |
126 |
> |
} |
127 |
|
|
128 |
|
clone.m.initialize(); |
129 |
|
clone.addAll(this); |
149 |
|
* @return the number of elements in this set. |
150 |
|
*/ |
151 |
|
public int size() { |
152 |
< |
return m.size(); |
152 |
> |
return m.size(); |
153 |
|
} |
154 |
|
|
155 |
|
/** |
157 |
|
* @return <tt>true</tt> if this set contains no elements. |
158 |
|
*/ |
159 |
|
public boolean isEmpty() { |
160 |
< |
return m.isEmpty(); |
160 |
> |
return m.isEmpty(); |
161 |
|
} |
162 |
|
|
163 |
|
/** |
167 |
|
* @return <tt>true</tt> if this set contains the specified element. |
168 |
|
* |
169 |
|
* @throws ClassCastException if the specified object cannot be compared |
170 |
< |
* with the elements currently in the set. |
170 |
> |
* with the elements currently in the set. |
171 |
|
* @throws NullPointerException if o is <tt>null</tt>. |
172 |
|
*/ |
173 |
|
public boolean contains(Object o) { |
174 |
< |
return m.containsKey(o); |
174 |
> |
return m.containsKey(o); |
175 |
|
} |
176 |
|
|
177 |
|
/** |
182 |
|
* element. |
183 |
|
* |
184 |
|
* @throws ClassCastException if the specified object cannot be compared |
185 |
< |
* with the elements currently in the set. |
185 |
> |
* with the elements currently in the set. |
186 |
|
* @throws NullPointerException if o is <tt>null</tt>. |
187 |
|
*/ |
188 |
|
public boolean add(E o) { |
189 |
< |
return m.putIfAbsent(o, Boolean.TRUE) == null; |
189 |
> |
return m.putIfAbsent(o, Boolean.TRUE) == null; |
190 |
|
} |
191 |
|
|
192 |
|
/** |
196 |
|
* @return <tt>true</tt> if the set contained the specified element. |
197 |
|
* |
198 |
|
* @throws ClassCastException if the specified object cannot be compared |
199 |
< |
* with the elements currently in the set. |
199 |
> |
* with the elements currently in the set. |
200 |
|
* @throws NullPointerException if o is <tt>null</tt>. |
201 |
|
*/ |
202 |
|
public boolean remove(Object o) { |
203 |
< |
return m.removep(o); |
203 |
> |
return m.removep(o); |
204 |
|
} |
205 |
|
|
206 |
|
/** |
207 |
|
* Removes all of the elements from this set. |
208 |
|
*/ |
209 |
|
public void clear() { |
210 |
< |
m.clear(); |
210 |
> |
m.clear(); |
211 |
|
} |
212 |
|
|
213 |
|
/** |
217 |
|
* @return an iterator over the elements in this set. |
218 |
|
*/ |
219 |
|
public Iterator<E> iterator() { |
220 |
< |
return m.keyIterator(); |
220 |
> |
return m.keyIterator(); |
221 |
|
} |
222 |
|
|
223 |
|
/** |
227 |
|
* @return an iterator over the elements in this set. |
228 |
|
*/ |
229 |
|
public Iterator<E> descendingIterator() { |
230 |
< |
return m.descendingKeyIterator(); |
230 |
> |
return m.descendingKeyIterator(); |
231 |
|
} |
232 |
|
|
233 |
|
/* ---------------- AbstractSet Overrides -------------- */ |
246 |
|
*/ |
247 |
|
public boolean equals(Object o) { |
248 |
|
// Override AbstractSet version to avoid calling size() |
249 |
< |
if (o == this) |
250 |
< |
return true; |
251 |
< |
if (!(o instanceof Set)) |
252 |
< |
return false; |
253 |
< |
Collection c = (Collection) o; |
249 |
> |
if (o == this) |
250 |
> |
return true; |
251 |
> |
if (!(o instanceof Set)) |
252 |
> |
return false; |
253 |
> |
Collection c = (Collection) o; |
254 |
|
try { |
255 |
|
return containsAll(c) && c.containsAll(this); |
256 |
< |
} catch(ClassCastException unused) { |
256 |
> |
} catch (ClassCastException unused) { |
257 |
|
return false; |
258 |
< |
} catch(NullPointerException unused) { |
258 |
> |
} catch (NullPointerException unused) { |
259 |
|
return false; |
260 |
|
} |
261 |
|
} |
411 |
|
* @param fromElement low endpoint (inclusive) of the subSet. |
412 |
|
* @param toElement high endpoint (exclusive) of the subSet. |
413 |
|
* @return a view of the portion of this set whose elements range from |
414 |
< |
* <tt>fromElement</tt>, inclusive, to <tt>toElement</tt>, |
415 |
< |
* exclusive. |
414 |
> |
* <tt>fromElement</tt>, inclusive, to <tt>toElement</tt>, |
415 |
> |
* exclusive. |
416 |
|
* @throws ClassCastException if <tt>fromElement</tt> and |
417 |
|
* <tt>toElement</tt> cannot be compared to one another using |
418 |
|
* this set's comparator (or, if the set has no comparator, |
420 |
|
* @throws IllegalArgumentException if <tt>fromElement</tt> is |
421 |
|
* greater than <tt>toElement</tt>. |
422 |
|
* @throws NullPointerException if <tt>fromElement</tt> or |
423 |
< |
* <tt>toElement</tt> is <tt>null</tt>. |
423 |
> |
* <tt>toElement</tt> is <tt>null</tt>. |
424 |
|
*/ |
425 |
|
public NavigableSet<E> subSet(E fromElement, E toElement) { |
426 |
< |
return new ConcurrentSkipListSubSet<E>(m, fromElement, toElement); |
426 |
> |
return new ConcurrentSkipListSubSet<E>(m, fromElement, toElement); |
427 |
|
} |
428 |
|
|
429 |
|
/** |
433 |
|
* set, and vice-versa. |
434 |
|
* @param toElement high endpoint (exclusive) of the headSet. |
435 |
|
* @return a view of the portion of this set whose elements are strictly |
436 |
< |
* less than toElement. |
436 |
> |
* less than toElement. |
437 |
|
* @throws ClassCastException if <tt>toElement</tt> is not compatible |
438 |
|
* with this set's comparator (or, if the set has no comparator, |
439 |
|
* if <tt>toElement</tt> does not implement <tt>Comparable</tt>). |
440 |
|
* @throws NullPointerException if <tt>toElement</tt> is <tt>null</tt>. |
441 |
|
*/ |
442 |
|
public NavigableSet<E> headSet(E toElement) { |
443 |
< |
return new ConcurrentSkipListSubSet<E>(m, null, toElement); |
443 |
> |
return new ConcurrentSkipListSubSet<E>(m, null, toElement); |
444 |
|
} |
445 |
|
|
446 |
|
|
459 |
|
* @throws NullPointerException if <tt>fromElement</tt> is <tt>null</tt>. |
460 |
|
*/ |
461 |
|
public NavigableSet<E> tailSet(E fromElement) { |
462 |
< |
return new ConcurrentSkipListSubSet<E>(m, fromElement, null); |
462 |
> |
return new ConcurrentSkipListSubSet<E>(m, fromElement, null); |
463 |
|
} |
464 |
|
|
465 |
|
/** |
471 |
|
* in {@link IllegalArgumentException}. Instances of this class are |
472 |
|
* constructed only using the <tt>subSet</tt>, <tt>headSet</tt>, and |
473 |
|
* <tt>tailSet</tt> methods of their underlying sets. |
474 |
– |
* |
474 |
|
*/ |
475 |
|
static class ConcurrentSkipListSubSet<E> |
476 |
|
extends AbstractSet<E> |
486 |
|
* @param fromElement inclusive least value, or <tt>null</tt> if from start |
487 |
|
* @param toElement exclusive upper bound or <tt>null</tt> if to end |
488 |
|
* @throws IllegalArgumentException if fromElement and toElement |
489 |
< |
* nonnull and fromElement greater than toElement |
489 |
> |
* non-null and fromElement greater than toElement |
490 |
|
*/ |
491 |
|
ConcurrentSkipListSubSet(ConcurrentSkipListMap<E,Object> map, |
492 |
|
E fromElement, E toElement) { |
540 |
|
} |
541 |
|
public E pollFirst() { |
542 |
|
Map.Entry<E,?> e = s.pollFirstEntry(); |
543 |
< |
return (e == null)? null : e.getKey(); |
543 |
> |
return (e == null) ? null : e.getKey(); |
544 |
|
} |
545 |
|
public E pollLast() { |
546 |
|
Map.Entry<E,?> e = s.pollLastEntry(); |
547 |
< |
return (e == null)? null : e.getKey(); |
547 |
> |
return (e == null) ? null : e.getKey(); |
548 |
|
} |
549 |
|
|
550 |
|
} |