/usr/share/doc/libbackport-util-concurrent-java/api/edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.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 | <!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>ConcurrentHashMap</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="ConcurrentHashMap";
}
//-->
</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/CompletionService.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/ConcurrentLinkedQueue.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/ConcurrentHashMap.html" target="_top">Frames</a></li>
<li><a href="ConcurrentHashMap.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 ConcurrentHashMap" class="title">Class ConcurrentHashMap</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.ConcurrentHashMap</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>, java.io.Serializable, java.util.Map</dd>
</dl>
<hr>
<br>
<pre>public class <span class="strong">ConcurrentHashMap</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/ConcurrentMap.html" title="interface in edu.emory.mathcs.backport.java.util.concurrent">ConcurrentMap</a>, java.io.Serializable</pre>
<div class="block">A hash table supporting full concurrency of retrievals and
adjustable expected concurrency for updates. This class obeys the
same functional specification as <code>Hashtable</code>, and
includes versions of methods corresponding to each method of
<tt>Hashtable</tt>. However, even though all operations are
thread-safe, retrieval operations do <em>not</em> entail locking,
and there is <em>not</em> any support for locking the entire table
in a way that prevents all access. This class is fully
interoperable with <tt>Hashtable</tt> in programs that rely on its
thread safety but not on its synchronization details.
<p> Retrieval operations (including <tt>get</tt>) generally do not
block, so may overlap with update operations (including
<tt>put</tt> and <tt>remove</tt>). Retrievals reflect the results
of the most recently <em>completed</em> update operations holding
upon their onset. For aggregate operations such as <tt>putAll</tt>
and <tt>clear</tt>, concurrent retrievals may reflect insertion or
removal of only some entries. Similarly, Iterators and
Enumerations return elements reflecting the state of the hash table
at some point at or since the creation of the iterator/enumeration.
They do <em>not</em> throw <code>ConcurrentModificationException</code>.
However, iterators are designed to be used by only one thread at a time.
<p> The allowed concurrency among update operations is guided by
the optional <tt>concurrencyLevel</tt> constructor argument
(default <tt>16</tt>), which is used as a hint for internal sizing. The
table is internally partitioned to try to permit the indicated
number of concurrent updates without contention. Because placement
in hash tables is essentially random, the actual concurrency will
vary. Ideally, you should choose a value to accommodate as many
threads as will ever concurrently modify the table. Using a
significantly higher value than you need can waste space and time,
and a significantly lower value can lead to thread contention. But
overestimates and underestimates within an order of magnitude do
not usually have much noticeable impact. A value of one is
appropriate when it is known that only one thread will modify and
all others will only read. Also, resizing this or any other kind of
hash table is a relatively slow operation, so, when possible, it is
a good idea to provide estimates of expected table sizes in
constructors.
<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.
<p> Like <code>Hashtable</code> but unlike <code>HashMap</code>, this class
does <em>not</em> allow <tt>null</tt> to be used as a key or value.
<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.5</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.ConcurrentHashMap">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/ConcurrentHashMap.html#ConcurrentHashMap()">ConcurrentHashMap</a></strong>()</code>
<div class="block">Creates a new, empty map with a default initial capacity (16),
load factor (0.75) and concurrencyLevel (16).</div>
</td>
</tr>
<tr class="rowColor">
<td class="colOne"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.html#ConcurrentHashMap(int)">ConcurrentHashMap</a></strong>(int initialCapacity)</code>
<div class="block">Creates a new, empty map with the specified initial capacity,
and with default load factor (0.75) and concurrencyLevel (16).</div>
</td>
</tr>
<tr class="altColor">
<td class="colOne"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.html#ConcurrentHashMap(int, float)">ConcurrentHashMap</a></strong>(int initialCapacity,
float loadFactor)</code>
<div class="block">Creates a new, empty map with the specified initial capacity
and load factor and with the default concurrencyLevel (16).</div>
</td>
</tr>
<tr class="rowColor">
<td class="colOne"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.html#ConcurrentHashMap(int, float, int)">ConcurrentHashMap</a></strong>(int initialCapacity,
float loadFactor,
int concurrencyLevel)</code>
<div class="block">Creates a new, empty map with the specified initial
capacity, load factor and concurrency level.</div>
</td>
</tr>
<tr class="altColor">
<td class="colOne"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.html#ConcurrentHashMap(java.util.Map)">ConcurrentHashMap</a></strong>(java.util.Map m)</code>
<div class="block">Creates a new map with the same mappings as the given 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>void</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.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>boolean</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.html#contains(java.lang.Object)">contains</a></strong>(java.lang.Object value)</code>
<div class="block">Legacy method testing if some key maps into the specified value
in this table.</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/ConcurrentHashMap.html#containsKey(java.lang.Object)">containsKey</a></strong>(java.lang.Object key)</code>
<div class="block">Tests if the specified object is a key in this table.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>boolean</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.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="altColor">
<td class="colFirst"><code>java.util.Enumeration</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.html#elements()">elements</a></strong>()</code>
<div class="block">Returns an enumeration of the values in this table.</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/ConcurrentHashMap.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>java.lang.Object</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.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="rowColor">
<td class="colFirst"><code>boolean</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.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="altColor">
<td class="colFirst"><code>java.util.Enumeration</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.html#keys()">keys</a></strong>()</code>
<div class="block">Returns an enumeration of the keys in this table.</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/ConcurrentHashMap.html#keySet()">keySet</a></strong>()</code>
<div class="block">Returns a <code>Set</code> view of the keys contained 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/ConcurrentHashMap.html#put(java.lang.Object, java.lang.Object)">put</a></strong>(java.lang.Object key,
java.lang.Object value)</code>
<div class="block">Maps the specified key to the specified value in this table.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>void</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.html#putAll(java.util.Map)">putAll</a></strong>(java.util.Map m)</code>
<div class="block">Copies all of the mappings from the specified map to this one.</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/ConcurrentHashMap.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/ConcurrentHashMap.html#remove(java.lang.Object)">remove</a></strong>(java.lang.Object key)</code>
<div class="block">Removes the key (and its corresponding value) from 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/ConcurrentHashMap.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/ConcurrentHashMap.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/ConcurrentHashMap.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/ConcurrentHashMap.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>java.util.Collection</code></td>
<td class="colLast"><code><strong><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.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>clone, equals, hashCode, 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>equals, hashCode</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="ConcurrentHashMap(int, float, int)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ConcurrentHashMap</h4>
<pre>public ConcurrentHashMap(int initialCapacity,
float loadFactor,
int concurrencyLevel)</pre>
<div class="block">Creates a new, empty map with the specified initial
capacity, load factor and concurrency level.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>initialCapacity</code> - the initial capacity. The implementation
performs internal sizing to accommodate this many elements.</dd><dd><code>loadFactor</code> - the load factor threshold, used to control resizing.
Resizing may be performed when the average number of elements per
bin exceeds this threshold.</dd><dd><code>concurrencyLevel</code> - the estimated number of concurrently
updating threads. The implementation performs internal sizing
to try to accommodate this many threads.</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if the initial capacity is
negative or the load factor or concurrencyLevel are
nonpositive.</dd></dl>
</li>
</ul>
<a name="ConcurrentHashMap(int, float)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ConcurrentHashMap</h4>
<pre>public ConcurrentHashMap(int initialCapacity,
float loadFactor)</pre>
<div class="block">Creates a new, empty map with the specified initial capacity
and load factor and with the default concurrencyLevel (16).</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>initialCapacity</code> - The implementation performs internal
sizing to accommodate this many elements.</dd><dd><code>loadFactor</code> - the load factor threshold, used to control resizing.
Resizing may be performed when the average number of elements per
bin exceeds this threshold.</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if the initial capacity of
elements is negative or the load factor is nonpositive</dd><dt><span class="strong">Since:</span></dt>
<dd>1.6</dd></dl>
</li>
</ul>
<a name="ConcurrentHashMap(int)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ConcurrentHashMap</h4>
<pre>public ConcurrentHashMap(int initialCapacity)</pre>
<div class="block">Creates a new, empty map with the specified initial capacity,
and with default load factor (0.75) and concurrencyLevel (16).</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>initialCapacity</code> - the initial capacity. The implementation
performs internal sizing to accommodate this many elements.</dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if the initial capacity of
elements is negative.</dd></dl>
</li>
</ul>
<a name="ConcurrentHashMap()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>ConcurrentHashMap</h4>
<pre>public ConcurrentHashMap()</pre>
<div class="block">Creates a new, empty map with a default initial capacity (16),
load factor (0.75) and concurrencyLevel (16).</div>
</li>
</ul>
<a name="ConcurrentHashMap(java.util.Map)">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>ConcurrentHashMap</h4>
<pre>public ConcurrentHashMap(java.util.Map m)</pre>
<div class="block">Creates a new map with the same mappings as the given map.
The map is created with a capacity of 1.5 times the number
of mappings in the given map or 16 (whichever is greater),
and a default load factor (0.75) and concurrencyLevel (16).</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>m</code> - the map</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="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="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 the
map contains more than <tt>Integer.MAX_VALUE</tt> elements, returns
<tt>Integer.MAX_VALUE</tt>.</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 key-value mappings in this map</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.equals(k)</code>,
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.NullPointerException</code> - if the specified key is null</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">Tests if the specified object is a key in this table.</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> - possible key</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if and only if the specified object
is a key in this table, as determined by the
<tt>equals</tt> method; <tt>false</tt> otherwise.</dd>
<dt><span class="strong">Throws:</span></dt>
<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. Note: This method requires a full internal
traversal of the hash table, and so is much slower than
method <tt>containsKey</tt>.</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 this map maps one or more keys to the
specified value</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="contains(java.lang.Object)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>contains</h4>
<pre>public boolean contains(java.lang.Object value)</pre>
<div class="block">Legacy method testing if some key maps into the specified value
in this table. This method is identical in functionality to
<a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.html#containsValue(java.lang.Object)"><code>containsValue(java.lang.Object)</code></a>, and exists solely to ensure
full compatibility with class <code>Hashtable</code>,
which supported this method prior to introduction of the
Java Collections framework.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>value</code> - a value to search for</dd>
<dt><span class="strong">Returns:</span></dt><dd><tt>true</tt> if and only if some key maps to the
<tt>value</tt> argument in this table as
determined by the <tt>equals</tt> method;
<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="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">Maps the specified key to the specified value in this table.
Neither the key nor the value can be null.
<p> The value can be retrieved by calling the <tt>get</tt> method
with a key that is equal to the original key.</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 <tt>key</tt>, or
<tt>null</tt> if there was no mapping for <tt>key</tt></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.NullPointerException</code> - if the specified key or value is null</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.NullPointerException</code> - if the specified key or value is null</dd></dl>
</li>
</ul>
<a name="putAll(java.util.Map)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>putAll</h4>
<pre>public void putAll(java.util.Map m)</pre>
<div class="block">Copies all of the mappings from the specified map to this one.
These mappings replace any mappings that this map had for any of the
keys currently in the specified map.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>putAll</code> in interface <code>java.util.Map</code></dd>
<dt><strong>Overrides:</strong></dt>
<dd><code>putAll</code> in class <code>java.util.AbstractMap</code></dd>
<dt><span class="strong">Parameters:</span></dt><dd><code>m</code> - mappings to be stored in this map</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 key (and its corresponding value) from this map.
This method does nothing if the key is not in the map.</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> - the key that needs to be removed</dd>
<dt><span class="strong">Returns:</span></dt><dd>the previous value associated with <tt>key</tt>, or
<tt>null</tt> if there was no mapping for <tt>key</tt></dd>
<dt><span class="strong">Throws:</span></dt>
<dd><code>java.lang.NullPointerException</code> - if the specified key 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.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.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.NullPointerException</code> - if the specified key or value is null</dd></dl>
</li>
</ul>
<a name="clear()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>clear</h4>
<pre>public void clear()</pre>
<div class="block">Removes all of the 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 <code>Set</code> view of the keys contained in this map.
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 this 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.</div>
<dl>
<dt><strong>Specified by:</strong></dt>
<dd><code>keySet</code> in interface <code>java.util.Map</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>
</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 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 this 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>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 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.</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 class <code>java.util.AbstractMap</code></dd>
</dl>
</li>
</ul>
<a name="keys()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>keys</h4>
<pre>public java.util.Enumeration keys()</pre>
<div class="block">Returns an enumeration of the keys in this table.</div>
<dl><dt><span class="strong">Returns:</span></dt><dd>an enumeration of the keys in this table</dd><dt><span class="strong">See Also:</span></dt><dd><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.html#keySet()"><code>keySet()</code></a></dd></dl>
</li>
</ul>
<a name="elements()">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>elements</h4>
<pre>public java.util.Enumeration elements()</pre>
<div class="block">Returns an enumeration of the values in this table.</div>
<dl><dt><span class="strong">Returns:</span></dt><dd>an enumeration of the values in this table</dd><dt><span class="strong">See Also:</span></dt><dd><a href="../../../../../../../edu/emory/mathcs/backport/java/util/concurrent/ConcurrentHashMap.html#values()"><code>values()</code></a></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/CompletionService.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/ConcurrentLinkedQueue.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/ConcurrentHashMap.html" target="_top">Frames</a></li>
<li><a href="ConcurrentHashMap.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>
|