/usr/share/doc/libbackport-util-concurrent-java/api/edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html is in libbackport-util-concurrent-java-doc 3.1-3build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!-- NewPage -->
<html lang="en">
<head>
<!-- Generated by javadoc (version 1.7.0_03) on Fri May 18 11:21:07 UTC 2012 -->
<title>ConcurrentSkipListSet</title>
<meta name="date" content="2012-05-18">
<link rel="stylesheet" type="text/css" href="../../../../../../../stylesheet.css" title="Style">
</head>
<body>
<script type="text/javascript"><!--
if (location.href.indexOf('is-external=true') == -1) {
parent.document.title="ConcurrentSkipListSet";
}
//-->
</script>
<noscript>
<div>JavaScript is disabled on your browser.</div>
</noscript>
<!-- ========= START OF TOP NAVBAR ======= -->
<div class="topNav"><a name="navbar_top">
<!-- -->
</a><a href="#skip-navbar_top" title="Skip navigation links"></a><a name="navbar_top_firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../../../../overview-summary.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../../../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../../../../index-all.html">Index</a></li>
<li><a href="../../../../../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html" title="class in edu.emory.mathcs.backport.java.util.concurrent"><span class="strong">Prev Class</span></a></li>
<li><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/CopyOnWriteArrayList.html" title="class in edu.emory.mathcs.backport.java.util.concurrent"><span class="strong">Next Class</span></a></li>
</ul>
<ul class="navList">
<li><a href="../../../../../../../index.html?edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html" target="_top">Frames</a></li>
<li><a href="ConcurrentSkipListSet.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_top">
<li><a href="../../../../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_top");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<div>
<ul class="subNavList">
<li>Summary: </li>
<li>Nested | </li>
<li>Field | </li>
<li><a href="#constructor_summary">Constr</a> | </li>
<li><a href="#method_summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail: </li>
<li>Field | </li>
<li><a href="#constructor_detail">Constr</a> | </li>
<li><a href="#method_detail">Method</a></li>
</ul>
</div>
<a name="skip-navbar_top">
<!-- -->
</a></div>
<!-- ========= END OF TOP NAVBAR ========= -->
<!-- ======== START OF CLASS DATA ======== -->
<div class="header">
<div class="subTitle">edu.emory.mathcs.backport.java.util.concurrent</div>
<h2 title="Class ConcurrentSkipListSet" class="title">Class ConcurrentSkipListSet</h2>
</div>
<div class="contentContainer">
<ul class="inheritance">
<li>java.lang.Object</li>
<li>
<ul class="inheritance">
<li>java.util.AbstractCollection</li>
<li>
<ul class="inheritance">
<li>java.util.AbstractSet</li>
<li>
<ul class="inheritance">
<li><a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractSet.html" title="class in edu.emory.mathcs.backport.java.util">edu.emory.mathcs.backport.java.util.AbstractSet</a></li>
<li>
<ul class="inheritance">
<li>edu.emory.mathcs.backport.java.util.concurrent.ConcurrentSkipListSet</li>
</ul>
</li>
</ul>
</li>
</ul>
</li>
</ul>
</li>
</ul>
<div class="description">
<ul class="blockList">
<li class="blockList">
<dl>
<dt>All Implemented Interfaces:</dt>
<dd><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a>, java.io.Serializable, java.lang.Cloneable, java.lang.Iterable, java.util.Collection, java.util.Set, java.util.SortedSet</dd>
</dl>
<hr>
<br>
<pre>public class <span class="strong">ConcurrentSkipListSet</span>
extends <a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractSet.html" title="class in edu.emory.mathcs.backport.java.util">AbstractSet</a>
implements <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a>, java.lang.Cloneable, java.io.Serializable</pre>
<div class="block">A scalable concurrent <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util"><code>NavigableSet</code></a> implementation based on
a <a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html" title="class in edu.emory.mathcs.backport.java.util.concurrent"><code>ConcurrentSkipListMap</code></a>. The elements of the set are kept
sorted according to their natural ordering,
or by a <code>Comparator</code> provided at set creation time, depending
on which constructor is used.
<p>This implementation provides expected average <i>log(n)</i> time
cost for the <tt>contains</tt>, <tt>add</tt>, and <tt>remove</tt>
operations and their variants. Insertion, removal, and access
operations safely execute concurrently by multiple threads.
Iterators are <i>weakly consistent</i>, returning elements
reflecting the state of the set at some point at or since the
creation of the iterator. They do <em>not</em> throw <code>ConcurrentModificationException</code>, and may proceed concurrently with
other operations. Ascending ordered views and their iterators are
faster than descending ones.
<p>Beware that, unlike in most collections, the <tt>size</tt>
method is <em>not</em> a constant-time operation. Because of the
asynchronous nature of these sets, determining the current number
of elements requires a traversal of the elements. Additionally, the
bulk operations <tt>addAll</tt>, <tt>removeAll</tt>,
<tt>retainAll</tt>, and <tt>containsAll</tt> are <em>not</em>
guaranteed to be performed atomically. For example, an iterator
operating concurrently with an <tt>addAll</tt> operation might view
only some of the added elements.
<p>This class and its iterators implement all of the
<em>optional</em> methods of the <code>Set</code> and <code>Iterator</code>
interfaces. Like most other concurrent collection implementations,
this class does not permit the use of <tt>null</tt> elements,
because <tt>null</tt> arguments and return values cannot be reliably
distinguished from the absence of elements.
<p>This class is a member of the
<a href="../../../../../../../../technotes/guides/collections/index.html">
Java Collections Framework</a>.</div>
<dl><dt><span class="strong">Since:</span></dt>
<dd>1.6</dd>
<dt><span class="strong">Author:</span></dt>
<dd>Doug Lea</dd>
<dt><span class="strong">See Also:</span></dt><dd><a href="../../../../../../../serialized-form.html#edu.emory.mathcs.backport.java.util.concurrent.ConcurrentSkipListSet">Serialized Form</a></dd></dl>
</li>
</ul>
</div>
<div class="summary">
<ul class="blockList">
<li class="blockList">
<!-- ======== CONSTRUCTOR SUMMARY ======== -->
<ul class="blockList">
<li class="blockList"><a name="constructor_summary">
<!-- -->
</a>
<h3>Constructor Summary</h3>
<table class="overviewSummary" border="0" cellpadding="3" cellspacing="0" summary="Constructor Summary table, listing constructors, and an explanation">
<caption><span>Constructors</span><span class="tabEnd"> </span></caption>
<tr>
<th class="colOne" scope="col">Constructor and Description</th>
</tr>
<tr class="altColor">
<td class="colOne"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#ConcurrentSkipListSet()">ConcurrentSkipListSet</a></strong>()</code>
<div class="block">Constructs a new, empty set that orders its elements according to
their natural ordering.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colOne"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#ConcurrentSkipListSet(java.util.Collection)">ConcurrentSkipListSet</a></strong>(java.util.Collection c)</code>
<div class="block">Constructs a new set containing the elements in the specified
collection, that orders its elements according to their
natural ordering.</div>
</td>
</tr>
<tr class="altColor">
<td class="colOne"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#ConcurrentSkipListSet(java.util.Comparator)">ConcurrentSkipListSet</a></strong>(java.util.Comparator comparator)</code>
<div class="block">Constructs a new, empty set that orders its elements according to
the specified comparator.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colOne"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#ConcurrentSkipListSet(java.util.SortedSet)">ConcurrentSkipListSet</a></strong>(java.util.SortedSet s)</code>
<div class="block">Constructs a new set containing the same elements and using the
same ordering as the specified sorted set.</div>
</td>
</tr>
</table>
</li>
</ul>
<!-- ========== METHOD SUMMARY =========== -->
<ul class="blockList">
<li class="blockList"><a name="method_summary">
<!-- -->
</a>
<h3>Method Summary</h3>
<table class="overviewSummary" border="0" cellpadding="3" cellspacing="0" summary="Method Summary table, listing methods, and an explanation">
<caption><span>Methods</span><span class="tabEnd"> </span></caption>
<tr>
<th class="colFirst" scope="col">Modifier and Type</th>
<th class="colLast" scope="col">Method and Description</th>
</tr>
<tr class="altColor">
<td class="colFirst"><code>boolean</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#add(java.lang.Object)">add</a></strong>(java.lang.Object e)</code>
<div class="block">Adds the specified element to this set if it is not already present.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.lang.Object</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#ceiling(java.lang.Object)">ceiling</a></strong>(java.lang.Object e)</code>
<div class="block">Returns the least element in this set greater than or equal to
the given element, or <code>null</code> if there is no such element.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>void</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#clear()">clear</a></strong>()</code>
<div class="block">Removes all of the elements from this set.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.lang.Object</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#clone()">clone</a></strong>()</code>
<div class="block">Returns a shallow copy of this <tt>ConcurrentSkipListSet</tt>
instance.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.Comparator</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#comparator()">comparator</a></strong>()</code> </td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>boolean</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#contains(java.lang.Object)">contains</a></strong>(java.lang.Object o)</code>
<div class="block">Returns <tt>true</tt> if this set contains the specified element.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.Iterator</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#descendingIterator()">descendingIterator</a></strong>()</code>
<div class="block">Returns an iterator over the elements in this set in descending order.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#descendingSet()">descendingSet</a></strong>()</code>
<div class="block">Returns a reverse order view of the elements contained in this set.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>boolean</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#equals(java.lang.Object)">equals</a></strong>(java.lang.Object o)</code>
<div class="block">Compares the specified object with this set for equality.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.lang.Object</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#first()">first</a></strong>()</code> </td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.lang.Object</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#floor(java.lang.Object)">floor</a></strong>(java.lang.Object e)</code>
<div class="block">Returns the greatest element in this set less than or equal to
the given element, or <code>null</code> if there is no such element.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.util.SortedSet</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#headSet(java.lang.Object)">headSet</a></strong>(java.lang.Object toElement)</code></td>
</tr>
<tr class="altColor">
<td class="colFirst"><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#headSet(java.lang.Object, boolean)">headSet</a></strong>(java.lang.Object toElement,
boolean inclusive)</code>
<div class="block">Returns a view of the portion of this set whose elements are less than
(or equal to, if <code>inclusive</code> is true) <code>toElement</code>.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.lang.Object</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#higher(java.lang.Object)">higher</a></strong>(java.lang.Object e)</code>
<div class="block">Returns the least element in this set strictly greater than the
given element, or <code>null</code> if there is no such element.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>boolean</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#isEmpty()">isEmpty</a></strong>()</code>
<div class="block">Returns <tt>true</tt> if this set contains no elements.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.util.Iterator</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#iterator()">iterator</a></strong>()</code>
<div class="block">Returns an iterator over the elements in this set in ascending order.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.lang.Object</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#last()">last</a></strong>()</code> </td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.lang.Object</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#lower(java.lang.Object)">lower</a></strong>(java.lang.Object e)</code>
<div class="block">Returns the greatest element in this set strictly less than the
given element, or <code>null</code> if there is no such element.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.lang.Object</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#pollFirst()">pollFirst</a></strong>()</code>
<div class="block">Retrieves and removes the first (lowest) element,
or returns <code>null</code> if this set is empty.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.lang.Object</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#pollLast()">pollLast</a></strong>()</code>
<div class="block">Retrieves and removes the last (highest) element,
or returns <code>null</code> if this set is empty.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>boolean</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#remove(java.lang.Object)">remove</a></strong>(java.lang.Object o)</code>
<div class="block">Removes the specified element from this set if it is present.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>boolean</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#removeAll(java.util.Collection)">removeAll</a></strong>(java.util.Collection c)</code>
<div class="block">Removes from this set all of its elements that are contained in
the specified collection.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>int</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#size()">size</a></strong>()</code>
<div class="block">Returns the number of elements in this set.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#subSet(java.lang.Object, boolean, java.lang.Object, boolean)">subSet</a></strong>(java.lang.Object fromElement,
boolean fromInclusive,
java.lang.Object toElement,
boolean toInclusive)</code>
<div class="block">Returns a view of the portion of this set whose elements range from
<code>fromElement</code> to <code>toElement</code>.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.SortedSet</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#subSet(java.lang.Object, java.lang.Object)">subSet</a></strong>(java.lang.Object fromElement,
java.lang.Object toElement)</code></td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.util.SortedSet</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#tailSet(java.lang.Object)">tailSet</a></strong>(java.lang.Object fromElement)</code></td>
</tr>
<tr class="altColor">
<td class="colFirst"><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html#tailSet(java.lang.Object, boolean)">tailSet</a></strong>(java.lang.Object fromElement,
boolean inclusive)</code>
<div class="block">Returns a view of the portion of this set whose elements are greater
than (or equal to, if <code>inclusive</code> is true) <code>fromElement</code>.</div>
</td>
</tr>
</table>
<ul class="blockList">
<li class="blockList"><a name="methods_inherited_from_class_edu.emory.mathcs.backport.java.util.AbstractSet">
<!-- -->
</a>
<h3>Methods inherited from class edu.emory.mathcs.backport.java.util.<a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractSet.html" title="class in edu.emory.mathcs.backport.java.util">AbstractSet</a></h3>
<code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractSet.html#toArray()">toArray</a>, <a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractSet.html#toArray(java.lang.Object[])">toArray</a></code></li>
</ul>
<ul class="blockList">
<li class="blockList"><a name="methods_inherited_from_class_java.util.AbstractSet">
<!-- -->
</a>
<h3>Methods inherited from class java.util.AbstractSet</h3>
<code>hashCode</code></li>
</ul>
<ul class="blockList">
<li class="blockList"><a name="methods_inherited_from_class_java.util.AbstractCollection">
<!-- -->
</a>
<h3>Methods inherited from class java.util.AbstractCollection</h3>
<code>addAll, containsAll, retainAll, toString</code></li>
</ul>
<ul class="blockList">
<li class="blockList"><a name="methods_inherited_from_class_java.lang.Object">
<!-- -->
</a>
<h3>Methods inherited from class java.lang.Object</h3>
<code>finalize, getClass, notify, notifyAll, wait, wait, wait</code></li>
</ul>
<ul class="blockList">
<li class="blockList"><a name="methods_inherited_from_class_java.util.Set">
<!-- -->
</a>
<h3>Methods inherited from interface java.util.Set</h3>
<code>addAll, containsAll, hashCode, retainAll, toArray, toArray</code></li>
</ul>
</li>
</ul>
</li>
</ul>
</div>
<div class="details">
<ul class="blockList">
<li class="blockList">
<!-- ========= CONSTRUCTOR DETAIL ======== -->
<ul class="blockList">
<li class="blockList"><a name="constructor_detail">
<!-- -->
</a>
<h3>Constructor Detail</h3>
<a name="ConcurrentSkipListSet()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ConcurrentSkipListSet</h4>
<pre>public ConcurrentSkipListSet()</pre>
<div class="block">Constructs a new, empty set that orders its elements according to
their natural ordering.</div>
</li>
</ul>
<a name="ConcurrentSkipListSet(java.util.Comparator)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ConcurrentSkipListSet</h4>
<pre>public ConcurrentSkipListSet(java.util.Comparator comparator)</pre>
<div class="block">Constructs a new, empty set that orders its elements according to
the specified comparator.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>comparator</code> - the comparator that will be used to order this set.
If <tt>null</tt>, the natural
ordering of the elements will be used.</dd></dl>
</li>
</ul>
<a name="ConcurrentSkipListSet(java.util.Collection)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ConcurrentSkipListSet</h4>
<pre>public ConcurrentSkipListSet(java.util.Collection c)</pre>
<div class="block">Constructs a new set containing the elements in the specified
collection, that orders its elements according to their
natural ordering.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>c</code> - The elements that will comprise the new set</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the elements in <tt>c</tt> are
not <code>Comparable</code>, or are not mutually comparable</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified collection or any
of its elements are null</dd></dl>
</li>
</ul>
<a name="ConcurrentSkipListSet(java.util.SortedSet)">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>ConcurrentSkipListSet</h4>
<pre>public ConcurrentSkipListSet(java.util.SortedSet s)</pre>
<div class="block">Constructs a new set containing the same elements and using the
same ordering as the specified sorted set.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>s</code> - sorted set whose elements will comprise the new set</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.NullPointerException</code> - if the specified sorted set or any
of its elements are null</dd></dl>
</li>
</ul>
</li>
</ul>
<!-- ============ METHOD DETAIL ========== -->
<ul class="blockList">
<li class="blockList"><a name="method_detail">
<!-- -->
</a>
<h3>Method Detail</h3>
<a name="clone()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>clone</h4>
<pre>public java.lang.Object clone()</pre>
<div class="block">Returns a shallow copy of this <tt>ConcurrentSkipListSet</tt>
instance. (The elements themselves are not cloned.)</div>
<dl>
<dt><strong>Overrides:</strong></dt>
<dd><code>clone</code> in class <code>java.lang.Object</code></dd>
<dt><span class="strong">Returns:</span></dt><dd>a shallow copy of this set</dd></dl>
</li>
</ul>
<a name="size()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>size</h4>
<pre>public int size()</pre>
<div class="block">Returns the number of elements in this set. If this set
contains more than <tt>Integer.MAX_VALUE</tt> elements, it
returns <tt>Integer.MAX_VALUE</tt>.
<p>Beware that, unlike in most collections, this method is
<em>NOT</em> a constant-time operation. Because of the
asynchronous nature of these sets, determining the current
number of elements requires traversing them all to count them.
Additionally, it is possible for the size to change during
execution of this method, in which case the returned result
will be inaccurate. Thus, this method is typically not very
useful in concurrent applications.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>size</code> in interface <code>java.util.Collection</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>size</code> in interface <code>java.util.Set</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>size</code> in class <code>java.util.AbstractCollection</code></dd>
<dt><span class="strong">Returns:</span></dt><dd>the number of elements in this set</dd></dl>
</li>
</ul>
<a name="isEmpty()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>isEmpty</h4>
<pre>public boolean isEmpty()</pre>
<div class="block">Returns <tt>true</tt> if this set contains no elements.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>isEmpty</code> in interface <code>java.util.Collection</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>isEmpty</code> in interface <code>java.util.Set</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>isEmpty</code> in class <code>java.util.AbstractCollection</code></dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if this set contains no elements</dd></dl>
</li>
</ul>
<a name="contains(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>contains</h4>
<pre>public boolean contains(java.lang.Object o)</pre>
<div class="block">Returns <tt>true</tt> if this set contains the specified element.
More formally, returns <tt>true</tt> if and only if this set
contains an element <tt>e</tt> such that <tt>o.equals(e)</tt>.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>contains</code> in interface <code>java.util.Collection</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>contains</code> in interface <code>java.util.Set</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>contains</code> in class <code>java.util.AbstractCollection</code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>o</code> - object to be checked for containment in this set</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if this set contains the specified element</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified element cannot be
compared with the elements currently in this set</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified element is null</dd></dl>
</li>
</ul>
<a name="add(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
<pre>public boolean add(java.lang.Object e)</pre>
<div class="block">Adds the specified element to this set if it is not already present.
More formally, adds the specified element <tt>e</tt> to this set if
the set contains no element <tt>e2</tt> such that <tt>e.equals(e2)</tt>.
If this set already contains the element, the call leaves the set
unchanged and returns <tt>false</tt>.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>add</code> in interface <code>java.util.Collection</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>add</code> in interface <code>java.util.Set</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>add</code> in class <code>java.util.AbstractCollection</code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>e</code> - element to be added to this set</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if this set did not already contain the
specified element</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if <tt>e</tt> cannot be compared
with the elements currently in this set</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified element is null</dd></dl>
</li>
</ul>
<a name="remove(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>remove</h4>
<pre>public boolean remove(java.lang.Object o)</pre>
<div class="block">Removes the specified element from this set if it is present.
More formally, removes an element <tt>e</tt> such that
<tt>o.equals(e)</tt>, if this set contains such an element.
Returns <tt>true</tt> if this set contained the element (or
equivalently, if this set changed as a result of the call).
(This set will not contain the element once the call returns.)</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>remove</code> in interface <code>java.util.Collection</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>remove</code> in interface <code>java.util.Set</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>remove</code> in class <code>java.util.AbstractCollection</code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>o</code> - object to be removed from this set, if present</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if this set contained the specified element</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if <tt>o</tt> cannot be compared
with the elements currently in this set</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified element is null</dd></dl>
</li>
</ul>
<a name="clear()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>clear</h4>
<pre>public void clear()</pre>
<div class="block">Removes all of the elements from this set.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>clear</code> in interface <code>java.util.Collection</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>clear</code> in interface <code>java.util.Set</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>clear</code> in class <code>java.util.AbstractCollection</code></dd>
</dl>
</li>
</ul>
<a name="iterator()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>iterator</h4>
<pre>public java.util.Iterator iterator()</pre>
<div class="block">Returns an iterator over the elements in this set in ascending order.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#iterator()">iterator</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>iterator</code> in interface <code>java.lang.Iterable</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>iterator</code> in interface <code>java.util.Collection</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>iterator</code> in interface <code>java.util.Set</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>iterator</code> in class <code>java.util.AbstractCollection</code></dd>
<dt><span class="strong">Returns:</span></dt><dd>an iterator over the elements in this set in ascending order</dd></dl>
</li>
</ul>
<a name="descendingIterator()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>descendingIterator</h4>
<pre>public java.util.Iterator descendingIterator()</pre>
<div class="block">Returns an iterator over the elements in this set in descending order.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#descendingIterator()">descendingIterator</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>an iterator over the elements in this set in descending order</dd></dl>
</li>
</ul>
<a name="equals(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>equals</h4>
<pre>public boolean equals(java.lang.Object o)</pre>
<div class="block">Compares the specified object with this set for equality. Returns
<tt>true</tt> if the specified object is also a set, the two sets
have the same size, and every member of the specified set is
contained in this set (or equivalently, every member of this set is
contained in the specified set). This definition ensures that the
equals method works properly across different implementations of the
set interface.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>equals</code> in interface <code>java.util.Collection</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>equals</code> in interface <code>java.util.Set</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>equals</code> in class <code>java.util.AbstractSet</code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>o</code> - the object to be compared for equality with this set</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if the specified object is equal to this set</dd></dl>
</li>
</ul>
<a name="removeAll(java.util.Collection)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>removeAll</h4>
<pre>public boolean removeAll(java.util.Collection c)</pre>
<div class="block">Removes from this set all of its elements that are contained in
the specified collection. If the specified collection is also
a set, this operation effectively modifies this set so that its
value is the <i>asymmetric set difference</i> of the two sets.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>removeAll</code> in interface <code>java.util.Collection</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>removeAll</code> in interface <code>java.util.Set</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>removeAll</code> in class <code>java.util.AbstractSet</code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>c</code> - collection containing elements to be removed from this set</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if this set changed as a result of the call</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the types of one or more elements in this
set are incompatible with the specified collection</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified collection or any
of its elements are null</dd></dl>
</li>
</ul>
<a name="lower(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>lower</h4>
<pre>public java.lang.Object lower(java.lang.Object e)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#lower(java.lang.Object)">NavigableSet</a></code></strong></div>
<div class="block">Returns the greatest element in this set strictly less than the
given element, or <code>null</code> if there is no such element.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#lower(java.lang.Object)">lower</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>e</code> - the value to match</dd>
<dt><span class="strong">Returns:</span></dt><dd>the greatest element less than <code>e</code>,
or <code>null</code> if there is no such element</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified element cannot be
compared with the elements currently in the set</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified element is null</dd></dl>
</li>
</ul>
<a name="floor(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>floor</h4>
<pre>public java.lang.Object floor(java.lang.Object e)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#floor(java.lang.Object)">NavigableSet</a></code></strong></div>
<div class="block">Returns the greatest element in this set less than or equal to
the given element, or <code>null</code> if there is no such element.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#floor(java.lang.Object)">floor</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>e</code> - the value to match</dd>
<dt><span class="strong">Returns:</span></dt><dd>the greatest element less than or equal to <code>e</code>,
or <code>null</code> if there is no such element</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified element cannot be
compared with the elements currently in the set</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified element is null</dd></dl>
</li>
</ul>
<a name="ceiling(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ceiling</h4>
<pre>public java.lang.Object ceiling(java.lang.Object e)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#ceiling(java.lang.Object)">NavigableSet</a></code></strong></div>
<div class="block">Returns the least element in this set greater than or equal to
the given element, or <code>null</code> if there is no such element.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#ceiling(java.lang.Object)">ceiling</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>e</code> - the value to match</dd>
<dt><span class="strong">Returns:</span></dt><dd>the least element greater than or equal to <code>e</code>,
or <code>null</code> if there is no such element</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified element cannot be
compared with the elements currently in the set</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified element is null</dd></dl>
</li>
</ul>
<a name="higher(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>higher</h4>
<pre>public java.lang.Object higher(java.lang.Object e)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#higher(java.lang.Object)">NavigableSet</a></code></strong></div>
<div class="block">Returns the least element in this set strictly greater than the
given element, or <code>null</code> if there is no such element.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#higher(java.lang.Object)">higher</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>e</code> - the value to match</dd>
<dt><span class="strong">Returns:</span></dt><dd>the least element greater than <code>e</code>,
or <code>null</code> if there is no such element</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified element cannot be
compared with the elements currently in the set</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified element is null</dd></dl>
</li>
</ul>
<a name="pollFirst()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>pollFirst</h4>
<pre>public java.lang.Object pollFirst()</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#pollFirst()">NavigableSet</a></code></strong></div>
<div class="block">Retrieves and removes the first (lowest) element,
or returns <code>null</code> if this set is empty.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#pollFirst()">pollFirst</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>the first element, or <code>null</code> if this set is empty</dd></dl>
</li>
</ul>
<a name="pollLast()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>pollLast</h4>
<pre>public java.lang.Object pollLast()</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#pollLast()">NavigableSet</a></code></strong></div>
<div class="block">Retrieves and removes the last (highest) element,
or returns <code>null</code> if this set is empty.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#pollLast()">pollLast</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>the last element, or <code>null</code> if this set is empty</dd></dl>
</li>
</ul>
<a name="comparator()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>comparator</h4>
<pre>public java.util.Comparator comparator()</pre>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>comparator</code> in interface <code>java.util.SortedSet</code></dd>
</dl>
</li>
</ul>
<a name="first()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>first</h4>
<pre>public java.lang.Object first()</pre>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>first</code> in interface <code>java.util.SortedSet</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>NoSuchElementException</code></dd></dl>
</li>
</ul>
<a name="last()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>last</h4>
<pre>public java.lang.Object last()</pre>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>last</code> in interface <code>java.util.SortedSet</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>NoSuchElementException</code></dd></dl>
</li>
</ul>
<a name="subSet(java.lang.Object, boolean, java.lang.Object, boolean)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>subSet</h4>
<pre>public <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a> subSet(java.lang.Object fromElement,
boolean fromInclusive,
java.lang.Object toElement,
boolean toInclusive)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#subSet(java.lang.Object, boolean, java.lang.Object, boolean)">NavigableSet</a></code></strong></div>
<div class="block">Returns a view of the portion of this set whose elements range from
<code>fromElement</code> to <code>toElement</code>. If <code>fromElement</code> and
<code>toElement</code> are equal, the returned set is empty unless <code>fromExclusive</code> and <code>toExclusive</code> are both true. The returned set
is backed by this set, so changes in the returned set are reflected in
this set, and vice-versa. The returned set supports all optional set
operations that this set supports.
<p>The returned set will throw an <code>IllegalArgumentException</code>
on an attempt to insert an element outside its range.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#subSet(java.lang.Object, boolean, java.lang.Object, boolean)">subSet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>fromElement</code> - low endpoint of the returned set</dd><dd><code>fromInclusive</code> - <code>true</code> if the low endpoint
is to be included in the returned view</dd><dd><code>toElement</code> - high endpoint of the returned set</dd><dd><code>toInclusive</code> - <code>true</code> if the high endpoint
is to be included in the returned view</dd>
<dt><span class="strong">Returns:</span></dt><dd>a view of the portion of this set whose elements range from
<code>fromElement</code>, inclusive, to <code>toElement</code>, exclusive</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if <code>fromElement</code> and
<code>toElement</code> cannot be compared to one another using this
set's comparator (or, if the set has no comparator, using
natural ordering). Implementations may, but are not required
to, throw this exception if <code>fromElement</code> or
<code>toElement</code> cannot be compared to elements currently in
the set.</dd>
<dd><code>java.lang.NullPointerException</code> - if <code>fromElement</code> or
<code>toElement</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code> - if <code>fromElement</code> is
greater than <code>toElement</code>; or if this set itself
has a restricted range, and <code>fromElement</code> or
<code>toElement</code> lies outside the bounds of the range.</dd></dl>
</li>
</ul>
<a name="headSet(java.lang.Object, boolean)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>headSet</h4>
<pre>public <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a> headSet(java.lang.Object toElement,
boolean inclusive)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#headSet(java.lang.Object, boolean)">NavigableSet</a></code></strong></div>
<div class="block">Returns a view of the portion of this set whose elements are less than
(or equal to, if <code>inclusive</code> is true) <code>toElement</code>. The
returned set is backed by this set, so changes in the returned set are
reflected in this set, and vice-versa. The returned set supports all
optional set operations that this set supports.
<p>The returned set will throw an <code>IllegalArgumentException</code>
on an attempt to insert an element outside its range.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#headSet(java.lang.Object, boolean)">headSet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>toElement</code> - high endpoint of the returned set</dd><dd><code>inclusive</code> - <code>true</code> if the high endpoint
is to be included in the returned view</dd>
<dt><span class="strong">Returns:</span></dt><dd>a view of the portion of this set whose elements are less than
(or equal to, if <code>inclusive</code> is true) <code>toElement</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if <code>toElement</code> is not compatible
with this set's comparator (or, if the set has no comparator,
if <code>toElement</code> does not implement <code>Comparable</code>).
Implementations may, but are not required to, throw this
exception if <code>toElement</code> cannot be compared to elements
currently in the set.</dd>
<dd><code>java.lang.NullPointerException</code> - if <code>toElement</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code> - if this set itself has a
restricted range, and <code>toElement</code> lies outside the
bounds of the range</dd></dl>
</li>
</ul>
<a name="tailSet(java.lang.Object, boolean)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>tailSet</h4>
<pre>public <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a> tailSet(java.lang.Object fromElement,
boolean inclusive)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#tailSet(java.lang.Object, boolean)">NavigableSet</a></code></strong></div>
<div class="block">Returns a view of the portion of this set whose elements are greater
than (or equal to, if <code>inclusive</code> is true) <code>fromElement</code>.
The returned set is backed by this set, so changes in the returned set
are reflected in this set, and vice-versa. The returned set supports
all optional set operations that this set supports.
<p>The returned set will throw an <code>IllegalArgumentException</code>
on an attempt to insert an element outside its range.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#tailSet(java.lang.Object, boolean)">tailSet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>fromElement</code> - low endpoint of the returned set</dd><dd><code>inclusive</code> - <code>true</code> if the low endpoint
is to be included in the returned view</dd>
<dt><span class="strong">Returns:</span></dt><dd>a view of the portion of this set whose elements are greater
than or equal to <code>fromElement</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if <code>fromElement</code> is not compatible
with this set's comparator (or, if the set has no comparator,
if <code>fromElement</code> does not implement <code>Comparable</code>).
Implementations may, but are not required to, throw this
exception if <code>fromElement</code> cannot be compared to elements
currently in the set.</dd>
<dd><code>java.lang.NullPointerException</code> - if <code>fromElement</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code> - if this set itself has a
restricted range, and <code>fromElement</code> lies outside the
bounds of the range</dd></dl>
</li>
</ul>
<a name="subSet(java.lang.Object, java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>subSet</h4>
<pre>public java.util.SortedSet subSet(java.lang.Object fromElement,
java.lang.Object toElement)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#subSet(java.lang.Object, java.lang.Object)">NavigableSet</a></code></strong></div>
<div class="block">
<p>Equivalent to <code>subSet(fromElement, true, toElement, false)</code>.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#subSet(java.lang.Object, java.lang.Object)">subSet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>subSet</code> in interface <code>java.util.SortedSet</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code></dd>
<dd><code>java.lang.NullPointerException</code> - if <code>fromElement</code> or
<code>toElement</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code></dd></dl>
</li>
</ul>
<a name="headSet(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>headSet</h4>
<pre>public java.util.SortedSet headSet(java.lang.Object toElement)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#headSet(java.lang.Object)">NavigableSet</a></code></strong></div>
<div class="block">
<p>Equivalent to <code>headSet(toElement, false)</code>.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#headSet(java.lang.Object)">headSet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>headSet</code> in interface <code>java.util.SortedSet</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code></dd>
<dd><code>java.lang.NullPointerException</code> - if <code>toElement</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code></dd></dl>
</li>
</ul>
<a name="tailSet(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>tailSet</h4>
<pre>public java.util.SortedSet tailSet(java.lang.Object fromElement)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#tailSet(java.lang.Object)">NavigableSet</a></code></strong></div>
<div class="block">
<p>Equivalent to <code>tailSet(fromElement, true)</code>.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#tailSet(java.lang.Object)">tailSet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>tailSet</code> in interface <code>java.util.SortedSet</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code></dd>
<dd><code>java.lang.NullPointerException</code> - if <code>fromElement</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code></dd></dl>
</li>
</ul>
<a name="descendingSet()">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>descendingSet</h4>
<pre>public <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a> descendingSet()</pre>
<div class="block">Returns a reverse order view of the elements contained in this set.
The descending set is backed by this set, so changes to the set are
reflected in the descending set, and vice-versa.
<p>The returned set has an ordering equivalent to
<tt><a href="../../../../../../../edu/emory/mathcs/backport/java/util/Collections.html#reverseOrder(java.util.Comparator)"><code>Collections.reverseOrder</code></a>(comparator())</tt>.
The expression <code>s.descendingSet().descendingSet()</code> returns a
view of <code>s</code> essentially equivalent to <code>s</code>.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html#descendingSet()">descendingSet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>a reverse order view of this set</dd></dl>
</li>
</ul>
</li>
</ul>
</li>
</ul>
</div>
</div>
<!-- ========= END OF CLASS DATA ========= -->
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<div class="bottomNav"><a name="navbar_bottom">
<!-- -->
</a><a href="#skip-navbar_bottom" title="Skip navigation links"></a><a name="navbar_bottom_firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../../../../overview-summary.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../../../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../../../../index-all.html">Index</a></li>
<li><a href="../../../../../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html" title="class in edu.emory.mathcs.backport.java.util.concurrent"><span class="strong">Prev Class</span></a></li>
<li><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/CopyOnWriteArrayList.html" title="class in edu.emory.mathcs.backport.java.util.concurrent"><span class="strong">Next Class</span></a></li>
</ul>
<ul class="navList">
<li><a href="../../../../../../../index.html?edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListSet.html" target="_top">Frames</a></li>
<li><a href="ConcurrentSkipListSet.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_bottom">
<li><a href="../../../../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_bottom");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<div>
<ul class="subNavList">
<li>Summary: </li>
<li>Nested | </li>
<li>Field | </li>
<li><a href="#constructor_summary">Constr</a> | </li>
<li><a href="#method_summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail: </li>
<li>Field | </li>
<li><a href="#constructor_detail">Constr</a> | </li>
<li><a href="#method_detail">Method</a></li>
</ul>
</div>
<a name="skip-navbar_bottom">
<!-- -->
</a></div>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
</body>
</html>
|