/usr/share/doc/libbackport-util-concurrent-java/api/edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.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 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 | <!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>ConcurrentSkipListMap</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="ConcurrentSkipListMap";
}
//-->
</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/ConcurrentNavigableMap.html" title="interface 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/ConcurrentSkipListSet.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/ConcurrentSkipListMap.html" target="_top">Frames</a></li>
<li><a href="ConcurrentSkipListMap.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><a href="#nested_classes_inherited_from_class_edu.emory.mathcs.backport.java.util.AbstractMap">Nested</a> | </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 ConcurrentSkipListMap" class="title">Class ConcurrentSkipListMap</h2>
</div>
<div class="contentContainer">
<ul class="inheritance">
<li>java.lang.Object</li>
<li>
<ul class="inheritance">
<li>java.util.AbstractMap</li>
<li>
<ul class="inheritance">
<li><a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractMap.html" title="class in edu.emory.mathcs.backport.java.util">edu.emory.mathcs.backport.java.util.AbstractMap</a></li>
<li>
<ul class="inheritance">
<li>edu.emory.mathcs.backport.java.util.concurrent.ConcurrentSkipListMap</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/concurrent/ConcurrentMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentMap</a>, <a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a>, <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a>, java.io.Serializable, java.lang.Cloneable, java.util.Map, java.util.SortedMap</dd>
</dl>
<hr>
<br>
<pre>public class <span class="strong">ConcurrentSkipListMap</span>
extends <a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractMap.html" title="class in edu.emory.mathcs.backport.java.util">AbstractMap</a>
implements <a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a>, java.lang.Cloneable, java.io.Serializable</pre>
<div class="block">A scalable concurrent <a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent"><code>ConcurrentNavigableMap</code></a> implementation.
The map is sorted according to the natural
ordering of its keys, or by a <code>Comparator</code> provided at map
creation time, depending on which constructor is used.
<p>This class implements a concurrent variant of <a
href="http://www.cs.umd.edu/~pugh/">SkipLists</a> providing
expected average <i>log(n)</i> time cost for the
<tt>containsKey</tt>, <tt>get</tt>, <tt>put</tt> and
<tt>remove</tt> operations and their variants. Insertion, removal,
update, and access operations safely execute concurrently by
multiple threads. Iterators are <i>weakly consistent</i>, returning
elements reflecting the state of the map 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 key ordered views and their iterators
are faster than descending ones.
<p>All <tt>Map.Entry</tt> pairs returned by methods in this class
and its views represent snapshots of mappings at the time they were
produced. They do <em>not</em> support the <tt>Entry.setValue</tt>
method. (Note however that it is possible to change mappings in the
associated map using <tt>put</tt>, <tt>putIfAbsent</tt>, or
<tt>replace</tt>, depending on exactly which effect you need.)
<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 maps, determining the current number
of elements requires a traversal of the elements. Additionally,
the bulk operations <tt>putAll</tt>, <tt>equals</tt>, and
<tt>clear</tt> are <em>not</em> guaranteed to be performed
atomically. For example, an iterator operating concurrently with a
<tt>putAll</tt> operation might view only some of the added
elements.
<p>This class and its views and iterators implement all of the
<em>optional</em> methods of the <code>Map</code> and <code>Iterator</code>
interfaces. Like most other concurrent collections, this class does
<em>not</em> permit the use of <tt>null</tt> keys or values because some
null 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.ConcurrentSkipListMap">Serialized Form</a></dd></dl>
</li>
</ul>
</div>
<div class="summary">
<ul class="blockList">
<li class="blockList">
<!-- ======== NESTED CLASS SUMMARY ======== -->
<ul class="blockList">
<li class="blockList"><a name="nested_class_summary">
<!-- -->
</a>
<h3>Nested Class Summary</h3>
<ul class="blockList">
<li class="blockList"><a name="nested_classes_inherited_from_class_edu.emory.mathcs.backport.java.util.AbstractMap">
<!-- -->
</a>
<h3>Nested classes/interfaces inherited from class edu.emory.mathcs.backport.java.util.<a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractMap.html" title="class in edu.emory.mathcs.backport.java.util">AbstractMap</a></h3>
<code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractMap.SimpleEntry.html" title="class in edu.emory.mathcs.backport.java.util">AbstractMap.SimpleEntry</a>, <a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractMap.SimpleImmutableEntry.html" title="class in edu.emory.mathcs.backport.java.util">AbstractMap.SimpleImmutableEntry</a></code></li>
</ul>
<ul class="blockList">
<li class="blockList"><a name="nested_classes_inherited_from_class_java.util.Map">
<!-- -->
</a>
<h3>Nested classes/interfaces inherited from interface java.util.Map</h3>
<code>java.util.Map.Entry</code></li>
</ul>
</li>
</ul>
<!-- ======== 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/ConcurrentSkipListMap.html#ConcurrentSkipListMap()">ConcurrentSkipListMap</a></strong>()</code>
<div class="block">Constructs a new, empty map, sorted according to the
natural ordering of the keys.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colOne"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#ConcurrentSkipListMap(java.util.Comparator)">ConcurrentSkipListMap</a></strong>(java.util.Comparator comparator)</code>
<div class="block">Constructs a new, empty map, sorted according to the specified
comparator.</div>
</td>
</tr>
<tr class="altColor">
<td class="colOne"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#ConcurrentSkipListMap(java.util.Map)">ConcurrentSkipListMap</a></strong>(java.util.Map m)</code>
<div class="block">Constructs a new map containing the same mappings as the given map,
sorted according to the natural ordering of
the keys.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colOne"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#ConcurrentSkipListMap(java.util.SortedMap)">ConcurrentSkipListMap</a></strong>(java.util.SortedMap m)</code>
<div class="block">Constructs a new map containing the same mappings and using the
same ordering as the specified sorted map.</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>java.util.Map.Entry</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#ceilingEntry(java.lang.Object)">ceilingEntry</a></strong>(java.lang.Object key)</code>
<div class="block">Returns a key-value mapping associated with the least key
greater than or equal to the given key, or <tt>null</tt> if
there is no such entry.</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/ConcurrentSkipListMap.html#ceilingKey(java.lang.Object)">ceilingKey</a></strong>(java.lang.Object key)</code>
<div class="block">Returns the least key greater than or equal to the given key,
or <code>null</code> if there is no such key.</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/ConcurrentSkipListMap.html#clear()">clear</a></strong>()</code>
<div class="block">Removes all of the mappings from this map.</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/ConcurrentSkipListMap.html#clone()">clone</a></strong>()</code>
<div class="block">Returns a shallow copy of this <tt>ConcurrentSkipListMap</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/ConcurrentSkipListMap.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/ConcurrentSkipListMap.html#containsKey(java.lang.Object)">containsKey</a></strong>(java.lang.Object key)</code>
<div class="block">Returns <tt>true</tt> if this map contains a mapping for the specified
key.</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/ConcurrentSkipListMap.html#containsValue(java.lang.Object)">containsValue</a></strong>(java.lang.Object value)</code>
<div class="block">Returns <tt>true</tt> if this map maps one or more keys to the
specified value.</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/ConcurrentSkipListMap.html#descendingKeySet()">descendingKeySet</a></strong>()</code>
<div class="block">Returns a reverse order <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util"><code>NavigableSet</code></a> view of the keys contained in this map.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#descendingMap()">descendingMap</a></strong>()</code>
<div class="block">Returns a reverse order view of the mappings contained in this map.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.util.Set</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#entrySet()">entrySet</a></strong>()</code>
<div class="block">Returns a <code>Set</code> view of the mappings contained in this map.</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/ConcurrentSkipListMap.html#equals(java.lang.Object)">equals</a></strong>(java.lang.Object o)</code>
<div class="block">Compares the specified object with this map for equality.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.util.Map.Entry</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#firstEntry()">firstEntry</a></strong>()</code>
<div class="block">Returns a key-value mapping associated with the least
key in this map, or <tt>null</tt> if the map is empty.</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/ConcurrentSkipListMap.html#firstKey()">firstKey</a></strong>()</code> </td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.util.Map.Entry</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#floorEntry(java.lang.Object)">floorEntry</a></strong>(java.lang.Object key)</code>
<div class="block">Returns a key-value mapping associated with the greatest key
less than or equal to the given key, or <tt>null</tt> if there
is no such key.</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/ConcurrentSkipListMap.html#floorKey(java.lang.Object)">floorKey</a></strong>(java.lang.Object key)</code>
<div class="block">Returns the greatest key less than or equal to the given key,
or <code>null</code> if there is no such key.</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/ConcurrentSkipListMap.html#get(java.lang.Object)">get</a></strong>(java.lang.Object key)</code>
<div class="block">Returns the value to which the specified key is mapped,
or <code>null</code> if this map contains no mapping for the key.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.SortedMap</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#headMap(java.lang.Object)">headMap</a></strong>(java.lang.Object toKey)</code></td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#headMap(java.lang.Object, boolean)">headMap</a></strong>(java.lang.Object toKey,
boolean inclusive)</code>
<div class="block">Returns a view of the portion of this map whose keys are less than (or
equal to, if <code>inclusive</code> is true) <code>toKey</code>.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.Map.Entry</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#higherEntry(java.lang.Object)">higherEntry</a></strong>(java.lang.Object key)</code>
<div class="block">Returns a key-value mapping associated with the least key
strictly greater than the given key, or <tt>null</tt> if there
is no such key.</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/ConcurrentSkipListMap.html#higherKey(java.lang.Object)">higherKey</a></strong>(java.lang.Object key)</code>
<div class="block">Returns the least key strictly greater than the given key, or
<code>null</code> if there is no such key.</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/ConcurrentSkipListMap.html#isEmpty()">isEmpty</a></strong>()</code>
<div class="block">Returns <tt>true</tt> if this map contains no key-value mappings.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.util.Set</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#keySet()">keySet</a></strong>()</code>
<div class="block">Returns a <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util"><code>NavigableSet</code></a> view of the keys contained in this map.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.Map.Entry</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#lastEntry()">lastEntry</a></strong>()</code>
<div class="block">Returns a key-value mapping associated with the greatest
key in this map, or <tt>null</tt> if the map 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/ConcurrentSkipListMap.html#lastKey()">lastKey</a></strong>()</code> </td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.Map.Entry</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#lowerEntry(java.lang.Object)">lowerEntry</a></strong>(java.lang.Object key)</code>
<div class="block">Returns a key-value mapping associated with the greatest key
strictly less than the given key, or <tt>null</tt> if there is
no such key.</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/ConcurrentSkipListMap.html#lowerKey(java.lang.Object)">lowerKey</a></strong>(java.lang.Object key)</code>
<div class="block">Returns the greatest key strictly less than the given key, or
<code>null</code> if there is no such key.</div>
</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/ConcurrentSkipListMap.html#navigableKeySet()">navigableKeySet</a></strong>()</code>
<div class="block">Returns a <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util"><code>NavigableSet</code></a> view of the keys contained in this map.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.util.Map.Entry</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#pollFirstEntry()">pollFirstEntry</a></strong>()</code>
<div class="block">Removes and returns a key-value mapping associated with
the least key in this map, or <tt>null</tt> if the map is empty.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.Map.Entry</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#pollLastEntry()">pollLastEntry</a></strong>()</code>
<div class="block">Removes and returns a key-value mapping associated with
the greatest key in this map, or <tt>null</tt> if the map 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/ConcurrentSkipListMap.html#put(java.lang.Object, java.lang.Object)">put</a></strong>(java.lang.Object key,
java.lang.Object value)</code>
<div class="block">Associates the specified value with the specified key in this map.</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/ConcurrentSkipListMap.html#putIfAbsent(java.lang.Object, java.lang.Object)">putIfAbsent</a></strong>(java.lang.Object key,
java.lang.Object value)</code>
<div class="block">If the specified key is not already associated
with a value, associate it with the given value.</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/ConcurrentSkipListMap.html#remove(java.lang.Object)">remove</a></strong>(java.lang.Object key)</code>
<div class="block">Removes the mapping for the specified key from this map if present.</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/ConcurrentSkipListMap.html#remove(java.lang.Object, java.lang.Object)">remove</a></strong>(java.lang.Object key,
java.lang.Object value)</code>
<div class="block">Removes the entry for a key only if currently mapped to a given value.</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/ConcurrentSkipListMap.html#replace(java.lang.Object, java.lang.Object)">replace</a></strong>(java.lang.Object key,
java.lang.Object value)</code>
<div class="block">Replaces the entry for a key only if currently mapped to some value.</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/ConcurrentSkipListMap.html#replace(java.lang.Object, java.lang.Object, java.lang.Object)">replace</a></strong>(java.lang.Object key,
java.lang.Object oldValue,
java.lang.Object newValue)</code>
<div class="block">Replaces the entry for a key only if currently mapped to a given value.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>int</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#size()">size</a></strong>()</code>
<div class="block">Returns the number of key-value mappings in this map.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#subMap(java.lang.Object, boolean, java.lang.Object, boolean)">subMap</a></strong>(java.lang.Object fromKey,
boolean fromInclusive,
java.lang.Object toKey,
boolean toInclusive)</code>
<div class="block">Returns a view of the portion of this map whose keys range from
<code>fromKey</code> to <code>toKey</code>.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.util.SortedMap</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#subMap(java.lang.Object, java.lang.Object)">subMap</a></strong>(java.lang.Object fromKey,
java.lang.Object toKey)</code></td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.SortedMap</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#tailMap(java.lang.Object)">tailMap</a></strong>(java.lang.Object fromKey)</code></td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#tailMap(java.lang.Object, boolean)">tailMap</a></strong>(java.lang.Object fromKey,
boolean inclusive)</code>
<div class="block">Returns a view of the portion of this map whose keys are greater than (or
equal to, if <code>inclusive</code> is true) <code>fromKey</code>.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.Collection</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentSkipListMap.html#values()">values</a></strong>()</code>
<div class="block">Returns a <code>Collection</code> view of the values contained in this map.</div>
</td>
</tr>
</table>
<ul class="blockList">
<li class="blockList"><a name="methods_inherited_from_class_java.util.AbstractMap">
<!-- -->
</a>
<h3>Methods inherited from class java.util.AbstractMap</h3>
<code>hashCode, putAll, 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.Map">
<!-- -->
</a>
<h3>Methods inherited from interface java.util.Map</h3>
<code>hashCode, putAll</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="ConcurrentSkipListMap()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ConcurrentSkipListMap</h4>
<pre>public ConcurrentSkipListMap()</pre>
<div class="block">Constructs a new, empty map, sorted according to the
natural ordering of the keys.</div>
</li>
</ul>
<a name="ConcurrentSkipListMap(java.util.Comparator)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ConcurrentSkipListMap</h4>
<pre>public ConcurrentSkipListMap(java.util.Comparator comparator)</pre>
<div class="block">Constructs a new, empty map, sorted 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 map.
If <tt>null</tt>, the natural
ordering of the keys will be used.</dd></dl>
</li>
</ul>
<a name="ConcurrentSkipListMap(java.util.Map)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ConcurrentSkipListMap</h4>
<pre>public ConcurrentSkipListMap(java.util.Map m)</pre>
<div class="block">Constructs a new map containing the same mappings as the given map,
sorted according to the natural ordering of
the keys.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>m</code> - the map whose mappings are to be placed in this map</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the keys in <tt>m</tt> are not
<code>Comparable</code>, or are not mutually comparable</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified map or any of its keys
or values are null</dd></dl>
</li>
</ul>
<a name="ConcurrentSkipListMap(java.util.SortedMap)">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>ConcurrentSkipListMap</h4>
<pre>public ConcurrentSkipListMap(java.util.SortedMap m)</pre>
<div class="block">Constructs a new map containing the same mappings and using the
same ordering as the specified sorted map.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>m</code> - the sorted map whose mappings are to be placed in this
map, and whose comparator is to be used to sort this map</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.NullPointerException</code> - if the specified sorted map or any of
its keys or values 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>ConcurrentSkipListMap</tt>
instance. (The keys and values themselves are not cloned.)</div>
<dl>
<dt><strong>Overrides:</strong></dt>
<dd><code>clone</code> in class <code>java.util.AbstractMap</code></dd>
<dt><span class="strong">Returns:</span></dt><dd>a shallow copy of this map</dd></dl>
</li>
</ul>
<a name="containsKey(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>containsKey</h4>
<pre>public boolean containsKey(java.lang.Object key)</pre>
<div class="block">Returns <tt>true</tt> if this map contains a mapping for the specified
key.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>containsKey</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>containsKey</code> in class <code>java.util.AbstractMap</code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - key whose presence in this map is to be tested</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if this map contains a mapping for the specified key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="get(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>get</h4>
<pre>public java.lang.Object get(java.lang.Object key)</pre>
<div class="block">Returns the value to which the specified key is mapped,
or <code>null</code> if this map contains no mapping for the key.
<p>More formally, if this map contains a mapping from a key
<code>k</code> to a value <code>v</code> such that <code>key</code> compares
equal to <code>k</code> according to the map's ordering, then this
method returns <code>v</code>; otherwise it returns <code>null</code>.
(There can be at most one such mapping.)</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>get</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>get</code> in class <code>java.util.AbstractMap</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="put(java.lang.Object, java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>put</h4>
<pre>public java.lang.Object put(java.lang.Object key,
java.lang.Object value)</pre>
<div class="block">Associates the specified value with the specified key in this map.
If the map previously contained a mapping for the key, the old
value is replaced.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>put</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>put</code> in class <code>java.util.AbstractMap</code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - key with which the specified value is to be associated</dd><dd><code>value</code> - value to be associated with the specified key</dd>
<dt><span class="strong">Returns:</span></dt><dd>the previous value associated with the specified key, or
<tt>null</tt> if there was no mapping for the key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key or value is null</dd></dl>
</li>
</ul>
<a name="remove(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>remove</h4>
<pre>public java.lang.Object remove(java.lang.Object key)</pre>
<div class="block">Removes the mapping for the specified key from this map if present.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>remove</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>remove</code> in class <code>java.util.AbstractMap</code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - key for which mapping should be removed</dd>
<dt><span class="strong">Returns:</span></dt><dd>the previous value associated with the specified key, or
<tt>null</tt> if there was no mapping for the key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="containsValue(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>containsValue</h4>
<pre>public boolean containsValue(java.lang.Object value)</pre>
<div class="block">Returns <tt>true</tt> if this map maps one or more keys to the
specified value. This operation requires time linear in the
map size.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>containsValue</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>containsValue</code> in class <code>java.util.AbstractMap</code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>value</code> - value whose presence in this map is to be tested</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if a mapping to <tt>value</tt> exists;
<tt>false</tt> otherwise</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.NullPointerException</code> - if the specified value is null</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 key-value mappings in this map. If this map
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 maps, 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.Map</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>size</code> in class <code>java.util.AbstractMap</code></dd>
<dt><span class="strong">Returns:</span></dt><dd>the number of elements in this map</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 map contains no key-value mappings.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>isEmpty</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>isEmpty</code> in class <code>java.util.AbstractMap</code></dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if this map contains no key-value mappings</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 mappings from this map.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>clear</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>clear</code> in class <code>java.util.AbstractMap</code></dd>
</dl>
</li>
</ul>
<a name="keySet()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>keySet</h4>
<pre>public java.util.Set keySet()</pre>
<div class="block">Returns a <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util"><code>NavigableSet</code></a> view of the keys contained in this map.
The set's iterator returns the keys in ascending order.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. The set supports element
removal, which removes the corresponding mapping from the map,
via the <code>Iterator.remove</code>, <code>Set.remove</code>,
<code>removeAll</code>, <code>retainAll</code>, and <code>clear</code>
operations. It does not support the <code>add</code> or <code>addAll</code>
operations.
<p>The view's <code>iterator</code> is a "weakly consistent" iterator
that will never throw <code>ConcurrentModificationException</code>,
and guarantees to traverse elements as they existed upon
construction of the iterator, and may (but is not guaranteed to)
reflect any modifications subsequent to construction.
<p>This method is equivalent to method <code>navigableKeySet</code>.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#keySet()">keySet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>keySet</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>keySet</code> in interface <code>java.util.SortedMap</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractMap.html#keySet()">keySet</a></code> in class <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/AbstractMap.html" title="class in edu.emory.mathcs.backport.java.util">AbstractMap</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>a navigable set view of the keys in this map</dd></dl>
</li>
</ul>
<a name="navigableKeySet()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>navigableKeySet</h4>
<pre>public <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a> navigableKeySet()</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#navigableKeySet()">ConcurrentNavigableMap</a></code></strong></div>
<div class="block">Returns a <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util"><code>NavigableSet</code></a> view of the keys contained in this map.
The set's iterator returns the keys in ascending order.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. The set supports element
removal, which removes the corresponding mapping from the map,
via the <code>Iterator.remove</code>, <code>Set.remove</code>,
<code>removeAll</code>, <code>retainAll</code>, and <code>clear</code>
operations. It does not support the <code>add</code> or <code>addAll</code>
operations.
<p>The view's <code>iterator</code> is a "weakly consistent" iterator
that will never throw <code>ConcurrentModificationException</code>,
and guarantees to traverse elements as they existed upon
construction of the iterator, and may (but is not guaranteed to)
reflect any modifications subsequent to construction.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#navigableKeySet()">navigableKeySet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#navigableKeySet()">navigableKeySet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>a navigable set view of the keys in this map</dd></dl>
</li>
</ul>
<a name="values()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>values</h4>
<pre>public java.util.Collection values()</pre>
<div class="block">Returns a <code>Collection</code> view of the values contained in this map.
The collection's iterator returns the values in ascending order
of the corresponding keys.
The collection is backed by the map, so changes to the map are
reflected in the collection, and vice-versa. The collection
supports element removal, which removes the corresponding
mapping from the map, via the <tt>Iterator.remove</tt>,
<tt>Collection.remove</tt>, <tt>removeAll</tt>,
<tt>retainAll</tt> and <tt>clear</tt> operations. It does not
support the <tt>add</tt> or <tt>addAll</tt> operations.
<p>The view's <tt>iterator</tt> is a "weakly consistent" iterator
that will never throw <code>ConcurrentModificationException</code>,
and guarantees to traverse elements as they existed upon
construction of the iterator, and may (but is not guaranteed to)
reflect any modifications subsequent to construction.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>values</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>values</code> in interface <code>java.util.SortedMap</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>values</code> in class <code>java.util.AbstractMap</code></dd>
</dl>
</li>
</ul>
<a name="entrySet()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>entrySet</h4>
<pre>public java.util.Set entrySet()</pre>
<div class="block">Returns a <code>Set</code> view of the mappings contained in this map.
The set's iterator returns the entries in ascending key order.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. The set supports element
removal, which removes the corresponding mapping from the map,
via the <tt>Iterator.remove</tt>, <tt>Set.remove</tt>,
<tt>removeAll</tt>, <tt>retainAll</tt> and <tt>clear</tt>
operations. It does not support the <tt>add</tt> or
<tt>addAll</tt> operations.
<p>The view's <tt>iterator</tt> is a "weakly consistent" iterator
that will never throw <code>ConcurrentModificationException</code>,
and guarantees to traverse elements as they existed upon
construction of the iterator, and may (but is not guaranteed to)
reflect any modifications subsequent to construction.
<p>The <tt>Map.Entry</tt> elements returned by
<tt>iterator.next()</tt> do <em>not</em> support the
<tt>setValue</tt> operation.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>entrySet</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>entrySet</code> in interface <code>java.util.SortedMap</code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>entrySet</code> in class <code>java.util.AbstractMap</code></dd>
<dt><span class="strong">Returns:</span></dt><dd>a set view of the mappings contained in this map,
sorted in ascending key order</dd></dl>
</li>
</ul>
<a name="descendingMap()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>descendingMap</h4>
<pre>public <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a> descendingMap()</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#descendingMap()">ConcurrentNavigableMap</a></code></strong></div>
<div class="block">Returns a reverse order view of the mappings contained in this map.
The descending map is backed by this map, so changes to the map are
reflected in the descending map, and vice-versa.
<p>The returned map 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>m.descendingMap().descendingMap()</code> returns a
view of <code>m</code> essentially equivalent to <code>m</code>.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#descendingMap()">descendingMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#descendingMap()">descendingMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>a reverse order view of this map</dd></dl>
</li>
</ul>
<a name="descendingKeySet()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>descendingKeySet</h4>
<pre>public <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableSet</a> descendingKeySet()</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#descendingKeySet()">ConcurrentNavigableMap</a></code></strong></div>
<div class="block">Returns a reverse order <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableSet.html" title="interface in edu.emory.mathcs.backport.java.util"><code>NavigableSet</code></a> view of the keys contained in this map.
The set's iterator returns the keys in descending order.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. The set supports element
removal, which removes the corresponding mapping from the map,
via the <code>Iterator.remove</code>, <code>Set.remove</code>,
<code>removeAll</code>, <code>retainAll</code>, and <code>clear</code>
operations. It does not support the <code>add</code> or <code>addAll</code>
operations.
<p>The view's <code>iterator</code> is a "weakly consistent" iterator
that will never throw <code>ConcurrentModificationException</code>,
and guarantees to traverse elements as they existed upon
construction of the iterator, and may (but is not guaranteed to)
reflect any modifications subsequent to construction.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#descendingKeySet()">descendingKeySet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#descendingKeySet()">descendingKeySet</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>a reverse order navigable set view of the keys in this map</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 map for equality.
Returns <tt>true</tt> if the given object is also a map and the
two maps represent the same mappings. More formally, two maps
<tt>m1</tt> and <tt>m2</tt> represent the same mappings if
<tt>m1.entrySet().equals(m2.entrySet())</tt>. This
operation may return misleading results if either map is
concurrently modified during execution of this method.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>equals</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>equals</code> in class <code>java.util.AbstractMap</code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>o</code> - object to be compared for equality with this map</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if the specified object is equal to this map</dd></dl>
</li>
</ul>
<a name="putIfAbsent(java.lang.Object, java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>putIfAbsent</h4>
<pre>public java.lang.Object putIfAbsent(java.lang.Object key,
java.lang.Object value)</pre>
<div class="block">If the specified key is not already associated
with a value, associate it with the given value.
This is equivalent to
<pre>
if (!map.containsKey(key))
return map.put(key, value);
else
return map.get(key);</pre>
except that the action is performed atomically.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentMap.html#putIfAbsent(java.lang.Object, java.lang.Object)">putIfAbsent</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - key with which the specified value is to be associated</dd><dd><code>value</code> - value to be associated with the specified key</dd>
<dt><span class="strong">Returns:</span></dt><dd>the previous value associated with the specified key,
or <tt>null</tt> if there was no mapping for the key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key or value is null</dd></dl>
</li>
</ul>
<a name="remove(java.lang.Object, java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>remove</h4>
<pre>public boolean remove(java.lang.Object key,
java.lang.Object value)</pre>
<div class="block">Removes the entry for a key only if currently mapped to a given value.
This is equivalent to
<pre>
if (map.containsKey(key) && map.get(key).equals(value)) {
map.remove(key);
return true;
} else return false;</pre>
except that the action is performed atomically.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentMap.html#remove(java.lang.Object, java.lang.Object)">remove</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - key with which the specified value is associated</dd><dd><code>value</code> - value expected to be associated with the specified key</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if the value was removed</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="replace(java.lang.Object, java.lang.Object, java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>replace</h4>
<pre>public boolean replace(java.lang.Object key,
java.lang.Object oldValue,
java.lang.Object newValue)</pre>
<div class="block">Replaces the entry for a key only if currently mapped to a given value.
This is equivalent to
<pre>
if (map.containsKey(key) && map.get(key).equals(oldValue)) {
map.put(key, newValue);
return true;
} else return false;</pre>
except that the action is performed atomically.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentMap.html#replace(java.lang.Object, java.lang.Object, java.lang.Object)">replace</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - key with which the specified value is associated</dd><dd><code>oldValue</code> - value expected to be associated with the specified key</dd><dd><code>newValue</code> - value to be associated with the specified key</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if the value was replaced</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if any of the arguments are null</dd></dl>
</li>
</ul>
<a name="replace(java.lang.Object, java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>replace</h4>
<pre>public java.lang.Object replace(java.lang.Object key,
java.lang.Object value)</pre>
<div class="block">Replaces the entry for a key only if currently mapped to some value.
This is equivalent to
<pre>
if (map.containsKey(key)) {
return map.put(key, value);
} else return null;</pre>
except that the action is performed atomically.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentMap.html#replace(java.lang.Object, java.lang.Object)">replace</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - key with which the specified value is associated</dd><dd><code>value</code> - value to be associated with the specified key</dd>
<dt><span class="strong">Returns:</span></dt><dd>the previous value associated with the specified key,
or <tt>null</tt> if there was no mapping for the key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key or value is null</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.SortedMap</code></dd>
</dl>
</li>
</ul>
<a name="firstKey()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>firstKey</h4>
<pre>public java.lang.Object firstKey()</pre>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>firstKey</code> in interface <code>java.util.SortedMap</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.util.NoSuchElementException</code></dd></dl>
</li>
</ul>
<a name="lastKey()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>lastKey</h4>
<pre>public java.lang.Object lastKey()</pre>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>lastKey</code> in interface <code>java.util.SortedMap</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.util.NoSuchElementException</code></dd></dl>
</li>
</ul>
<a name="subMap(java.lang.Object, boolean, java.lang.Object, boolean)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>subMap</h4>
<pre>public <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a> subMap(java.lang.Object fromKey,
boolean fromInclusive,
java.lang.Object toKey,
boolean toInclusive)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#subMap(java.lang.Object, boolean, java.lang.Object, boolean)">NavigableMap</a></code></strong></div>
<div class="block">Returns a view of the portion of this map whose keys range from
<code>fromKey</code> to <code>toKey</code>. If <code>fromKey</code> and
<code>toKey</code> are equal, the returned map is empty unless
<code>fromExclusive</code> and <code>toExclusive</code> are both true. The
returned map is backed by this map, so changes in the returned map are
reflected in this map, and vice-versa. The returned map supports all
optional map operations that this map supports.
<p>The returned map will throw an <code>IllegalArgumentException</code>
on an attempt to insert a key outside of its range, or to construct a
submap either of whose endpoints lie outside its range.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#subMap(java.lang.Object, boolean, java.lang.Object, boolean)">subMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#subMap(java.lang.Object, boolean, java.lang.Object, boolean)">subMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>fromKey</code> - low endpoint of the keys in the returned map</dd><dd><code>fromInclusive</code> - <code>true</code> if the low endpoint
is to be included in the returned view</dd><dd><code>toKey</code> - high endpoint of the keys in the returned map</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 map whose keys range from
<code>fromKey</code> to <code>toKey</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if <code>fromKey</code> and <code>toKey</code>
cannot be compared to one another using this map's comparator
(or, if the map has no comparator, using natural ordering).
Implementations may, but are not required to, throw this
exception if <code>fromKey</code> or <code>toKey</code>
cannot be compared to keys currently in the map.</dd>
<dd><code>java.lang.NullPointerException</code> - if <code>fromKey</code> or <code>toKey</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code> - if <code>fromKey</code> is greater than
<code>toKey</code>; or if this map itself has a restricted
range, and <code>fromKey</code> or <code>toKey</code> lies
outside the bounds of the range</dd></dl>
</li>
</ul>
<a name="headMap(java.lang.Object, boolean)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>headMap</h4>
<pre>public <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a> headMap(java.lang.Object toKey,
boolean inclusive)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#headMap(java.lang.Object, boolean)">NavigableMap</a></code></strong></div>
<div class="block">Returns a view of the portion of this map whose keys are less than (or
equal to, if <code>inclusive</code> is true) <code>toKey</code>. The returned
map is backed by this map, so changes in the returned map are reflected
in this map, and vice-versa. The returned map supports all optional
map operations that this map supports.
<p>The returned map will throw an <code>IllegalArgumentException</code>
on an attempt to insert a key outside its range.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#headMap(java.lang.Object, boolean)">headMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#headMap(java.lang.Object, boolean)">headMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>toKey</code> - high endpoint of the keys in the returned map</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 map whose keys are less than
(or equal to, if <code>inclusive</code> is true) <code>toKey</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if <code>toKey</code> is not compatible
with this map's comparator (or, if the map has no comparator,
if <code>toKey</code> does not implement <code>Comparable</code>).
Implementations may, but are not required to, throw this
exception if <code>toKey</code> cannot be compared to keys
currently in the map.</dd>
<dd><code>java.lang.NullPointerException</code> - if <code>toKey</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code> - if this map itself has a
restricted range, and <code>toKey</code> lies outside the
bounds of the range</dd></dl>
</li>
</ul>
<a name="tailMap(java.lang.Object, boolean)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>tailMap</h4>
<pre>public <a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a> tailMap(java.lang.Object fromKey,
boolean inclusive)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#tailMap(java.lang.Object, boolean)">NavigableMap</a></code></strong></div>
<div class="block">Returns a view of the portion of this map whose keys are greater than (or
equal to, if <code>inclusive</code> is true) <code>fromKey</code>. The returned
map is backed by this map, so changes in the returned map are reflected
in this map, and vice-versa. The returned map supports all optional
map operations that this map supports.
<p>The returned map will throw an <code>IllegalArgumentException</code>
on an attempt to insert a key outside its range.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#tailMap(java.lang.Object, boolean)">tailMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#tailMap(java.lang.Object, boolean)">tailMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>fromKey</code> - low endpoint of the keys in the returned map</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 map whose keys are greater than
(or equal to, if <code>inclusive</code> is true) <code>fromKey</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if <code>fromKey</code> is not compatible
with this map's comparator (or, if the map has no comparator,
if <code>fromKey</code> does not implement <code>Comparable</code>).
Implementations may, but are not required to, throw this
exception if <code>fromKey</code> cannot be compared to keys
currently in the map.</dd>
<dd><code>java.lang.NullPointerException</code> - if <code>fromKey</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code> - if this map itself has a
restricted range, and <code>fromKey</code> lies outside the
bounds of the range</dd></dl>
</li>
</ul>
<a name="subMap(java.lang.Object, java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>subMap</h4>
<pre>public java.util.SortedMap subMap(java.lang.Object fromKey,
java.lang.Object toKey)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#subMap(java.lang.Object, java.lang.Object)">NavigableMap</a></code></strong></div>
<div class="block">
<p>Equivalent to <code>subMap(fromKey, true, toKey, false)</code>.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#subMap(java.lang.Object, java.lang.Object)">subMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#subMap(java.lang.Object, java.lang.Object)">subMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>subMap</code> in interface <code>java.util.SortedMap</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code></dd>
<dd><code>java.lang.NullPointerException</code> - if <code>fromKey</code> or <code>toKey</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code></dd></dl>
</li>
</ul>
<a name="headMap(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>headMap</h4>
<pre>public java.util.SortedMap headMap(java.lang.Object toKey)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#headMap(java.lang.Object)">NavigableMap</a></code></strong></div>
<div class="block">
<p>Equivalent to <code>headMap(toKey, false)</code>.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#headMap(java.lang.Object)">headMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#headMap(java.lang.Object)">headMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>headMap</code> in interface <code>java.util.SortedMap</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code></dd>
<dd><code>java.lang.NullPointerException</code> - if <code>toKey</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code></dd></dl>
</li>
</ul>
<a name="tailMap(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>tailMap</h4>
<pre>public java.util.SortedMap tailMap(java.lang.Object fromKey)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#tailMap(java.lang.Object)">NavigableMap</a></code></strong></div>
<div class="block">
<p>Equivalent to <code>tailMap(fromKey, true)</code>.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html#tailMap(java.lang.Object)">tailMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentNavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentNavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#tailMap(java.lang.Object)">tailMap</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><strong>Specified by:</strong></dt>
<dd><code>tailMap</code> in interface <code>java.util.SortedMap</code></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code></dd>
<dd><code>java.lang.NullPointerException</code> - if <code>fromKey</code> is null</dd>
<dd><code>java.lang.IllegalArgumentException</code></dd></dl>
</li>
</ul>
<a name="lowerEntry(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>lowerEntry</h4>
<pre>public java.util.Map.Entry lowerEntry(java.lang.Object key)</pre>
<div class="block">Returns a key-value mapping associated with the greatest key
strictly less than the given key, or <tt>null</tt> if there is
no such key. The returned entry does <em>not</em> support the
<tt>Entry.setValue</tt> method.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#lowerEntry(java.lang.Object)">lowerEntry</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - the key</dd>
<dt><span class="strong">Returns:</span></dt><dd>an entry with the greatest key less than <code>key</code>,
or <code>null</code> if there is no such key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="lowerKey(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>lowerKey</h4>
<pre>public java.lang.Object lowerKey(java.lang.Object key)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#lowerKey(java.lang.Object)">NavigableMap</a></code></strong></div>
<div class="block">Returns the greatest key strictly less than the given key, or
<code>null</code> if there is no such key.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#lowerKey(java.lang.Object)">lowerKey</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - the key</dd>
<dt><span class="strong">Returns:</span></dt><dd>the greatest key less than <code>key</code>,
or <code>null</code> if there is no such key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="floorEntry(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>floorEntry</h4>
<pre>public java.util.Map.Entry floorEntry(java.lang.Object key)</pre>
<div class="block">Returns a key-value mapping associated with the greatest key
less than or equal to the given key, or <tt>null</tt> if there
is no such key. The returned entry does <em>not</em> support
the <tt>Entry.setValue</tt> method.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#floorEntry(java.lang.Object)">floorEntry</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - the key</dd>
<dt><span class="strong">Returns:</span></dt><dd>an entry with the greatest key less than or equal to
<code>key</code>, or <code>null</code> if there is no such key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="floorKey(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>floorKey</h4>
<pre>public java.lang.Object floorKey(java.lang.Object key)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#floorKey(java.lang.Object)">NavigableMap</a></code></strong></div>
<div class="block">Returns the greatest key less than or equal to the given key,
or <code>null</code> if there is no such key.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#floorKey(java.lang.Object)">floorKey</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - the key</dd>
<dt><span class="strong">Returns:</span></dt><dd>the greatest key less than or equal to <code>key</code>,
or <code>null</code> if there is no such key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="ceilingEntry(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ceilingEntry</h4>
<pre>public java.util.Map.Entry ceilingEntry(java.lang.Object key)</pre>
<div class="block">Returns a key-value mapping associated with the least key
greater than or equal to the given key, or <tt>null</tt> if
there is no such entry. The returned entry does <em>not</em>
support the <tt>Entry.setValue</tt> method.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#ceilingEntry(java.lang.Object)">ceilingEntry</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - the key</dd>
<dt><span class="strong">Returns:</span></dt><dd>an entry with the least key greater than or equal to
<code>key</code>, or <code>null</code> if there is no such key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="ceilingKey(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ceilingKey</h4>
<pre>public java.lang.Object ceilingKey(java.lang.Object key)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#ceilingKey(java.lang.Object)">NavigableMap</a></code></strong></div>
<div class="block">Returns the least key greater than or equal to the given key,
or <code>null</code> if there is no such key.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#ceilingKey(java.lang.Object)">ceilingKey</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - the key</dd>
<dt><span class="strong">Returns:</span></dt><dd>the least key greater than or equal to <code>key</code>,
or <code>null</code> if there is no such key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="higherEntry(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>higherEntry</h4>
<pre>public java.util.Map.Entry higherEntry(java.lang.Object key)</pre>
<div class="block">Returns a key-value mapping associated with the least key
strictly greater than the given key, or <tt>null</tt> if there
is no such key. The returned entry does <em>not</em> support
the <tt>Entry.setValue</tt> method.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#higherEntry(java.lang.Object)">higherEntry</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - the key</dd>
<dt><span class="strong">Returns:</span></dt><dd>an entry with the least key greater than <code>key</code>,
or <code>null</code> if there is no such key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="higherKey(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>higherKey</h4>
<pre>public java.lang.Object higherKey(java.lang.Object key)</pre>
<div class="block"><strong>Description copied from interface: <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#higherKey(java.lang.Object)">NavigableMap</a></code></strong></div>
<div class="block">Returns the least key strictly greater than the given key, or
<code>null</code> if there is no such key.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#higherKey(java.lang.Object)">higherKey</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - the key</dd>
<dt><span class="strong">Returns:</span></dt><dd>the least key greater than <code>key</code>,
or <code>null</code> if there is no such key</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.ClassCastException</code> - if the specified key cannot be compared
with the keys currently in the map</dd>
<dd><code>java.lang.NullPointerException</code> - if the specified key is null</dd></dl>
</li>
</ul>
<a name="firstEntry()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>firstEntry</h4>
<pre>public java.util.Map.Entry firstEntry()</pre>
<div class="block">Returns a key-value mapping associated with the least
key in this map, or <tt>null</tt> if the map is empty.
The returned entry does <em>not</em> support
the <tt>Entry.setValue</tt> method.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#firstEntry()">firstEntry</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>an entry with the least key,
or <code>null</code> if this map is empty</dd></dl>
</li>
</ul>
<a name="lastEntry()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>lastEntry</h4>
<pre>public java.util.Map.Entry lastEntry()</pre>
<div class="block">Returns a key-value mapping associated with the greatest
key in this map, or <tt>null</tt> if the map is empty.
The returned entry does <em>not</em> support
the <tt>Entry.setValue</tt> method.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#lastEntry()">lastEntry</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>an entry with the greatest key,
or <code>null</code> if this map is empty</dd></dl>
</li>
</ul>
<a name="pollFirstEntry()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>pollFirstEntry</h4>
<pre>public java.util.Map.Entry pollFirstEntry()</pre>
<div class="block">Removes and returns a key-value mapping associated with
the least key in this map, or <tt>null</tt> if the map is empty.
The returned entry does <em>not</em> support
the <tt>Entry.setValue</tt> method.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#pollFirstEntry()">pollFirstEntry</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>the removed first entry of this map,
or <code>null</code> if this map is empty</dd></dl>
</li>
</ul>
<a name="pollLastEntry()">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>pollLastEntry</h4>
<pre>public java.util.Map.Entry pollLastEntry()</pre>
<div class="block">Removes and returns a key-value mapping associated with
the greatest key in this map, or <tt>null</tt> if the map is empty.
The returned entry does <em>not</em> support
the <tt>Entry.setValue</tt> method.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html#pollLastEntry()">pollLastEntry</a></code> in interface <code><a href="../../../../../../../edu/emory/mathcs/backport/java/util/NavigableMap.html" title="interface in edu.emory.mathcs.backport.java.util">NavigableMap</a></code></dd>
<dt><span class="strong">Returns:</span></dt><dd>the removed last entry of this map,
or <code>null</code> if this map is empty</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/ConcurrentNavigableMap.html" title="interface 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/ConcurrentSkipListSet.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/ConcurrentSkipListMap.html" target="_top">Frames</a></li>
<li><a href="ConcurrentSkipListMap.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><a href="#nested_classes_inherited_from_class_edu.emory.mathcs.backport.java.util.AbstractMap">Nested</a> | </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>
|