45  * An instance of LinkedHashMap has two parameters that affect its efficiency:
47  * between 0.0 and 1.0. When the number of mappings in the LinkedHashMap exceeds
54  * If many mappings are to be stored in a LinkedHashMap, creating it with a
60  * multiple threads access a LinkedHashMap concurrently, and at least one of the
61  * threads modifies the LinkedHashMap structurally, it <em>must</em> be
66  * object that naturally encapsulates the LinkedHashMap.  If no such object
67  * exists, the LinkedHashMap should be "wrapped" using the
69  * prevent accidental unsynchronized access to the LinkedHashMap:
71  *      Map m = Collections.synchronizedMap(new LinkedHashMap(...));
75  * by all of LinkedHashMap's "collection view methods" are <em>fail-fast</em>:
76  * if the LinkedHashMap is structurally modified at any time after the Iterator
96 public class LinkedHashMap extends AbstractMap implements Map, Serializable {
118      * The load factor for the LinkedHashMap.
123      * The number of times this LinkedHashMap has been structurally modified
125      * the LinkedHashMap or otherwise modify its internal structure (e.g.,
127      * the LinkedHashMap fail-fast.  (See ConcurrentModificationException).
132      * Constructs a new, empty LinkedHashMap with the specified initial
135      * @param      initialCapacity   the initial capacity of the LinkedHashMap.
141     public LinkedHashMap(int initialCapacity, float loadFactor) {
158      * Constructs a new, empty LinkedHashMap with the specified initial capacity
161      * @param   initialCapacity   the initial capacity of the LinkedHashMap.
163     public LinkedHashMap(int initialCapacity) {
168      * Constructs a new, empty LinkedHashMap with a default capacity and load
171     public LinkedHashMap() {
176      * Constructs a new LinkedHashMap with the same mappings as the given
177      * Map.  The LinkedHashMap is created with a capacity of thrice the number
181     public LinkedHashMap(Map t) {
201      * Returns true if this LinkedHashMap maps one or more keys to the specified
220      * Returns true if this LinkedHashMap contains a mapping for the specified
243      * Returns the value to which this LinkedHashMap maps the specified key.
244      * Returns null if the LinkedHashMap contains no mapping for this key.
246      * LinkedHashMap contains no mapping for the key; it's also possible that
247      * the LinkedHashMap explicitly maps the key to null.  The containsKey
258      * Returns the entry associated with the specified key in the LinkedHashMap.
259      * Returns null if the LinkedHashMap contains no mapping for this key.
280      * Rehashes the contents of the LinkedHashMap into a LinkedHashMap with a
282      * number of keys in the LinkedHashMap exceeds this LinkedHashMap's capacity
348      * LinkedHashMap. If the LinkedHashMap previously contained a mapping for
354      * return can also indicate that the LinkedHashMap previously associated
358         // Makes sure the key is not already in the LinkedHashMap.
401      * LinkedHashMap and position the mapping at the specified index.
402      * If the LinkedHashMap previously contained a mapping for this key,
413      *         the LinkedHashMap previously associated null with the specified
432      * LinkedHashMap. If the LinkedHashMap previously contained a mapping for
440      *         the LinkedHashMap previously associated null with the specified
448      * Removes the mapping for this key from this LinkedHashMap if present.
454      *         the LinkedHashMap previously associated null with the specified
505      * Copies all of the mappings from the specified Map to this LinkedHashMap
506      * These mappings will replace any mappings that this LinkedHashMap had for
520      * Removes all mappings from this LinkedHashMap.
532      * Returns a shallow copy of this LinkedHashMap. The keys and values
536         return new LinkedHashMap(this);
546      * Returns a Set view of the keys contained in this LinkedHashMap.  The Set
547      * is backed by the LinkedHashMap, so changes to the LinkedHashMap are
549      * which removes the corresponding mapping from the LinkedHashMap, via the
566                     return LinkedHashMap.this.remove(o) != null;
569                     LinkedHashMap.this.clear();
577      * Returns a Collection view of the values contained in this LinkedHashMap.
578      * The Collection is backed by the LinkedHashMap, so changes to the
579      * LinkedHashMap are reflected in the Collection, and vice-versa.  The
581      * mapping from the LinkedHashMap, via the Iterator.remove,
598                     LinkedHashMap.this.clear();
607      * LinkedHashMap. Each element in the returned collection is a Map.Entry.
608      * The Collection is backed by the LinkedHashMap, so changes to the
609      * LinkedHashMap are reflected in the Collection, and vice-versa.  The
611      * mapping from the LinkedHashMap, via the Iterator.remove,
671                     LinkedHashMap.this.clear();
681      * Returns true if the given object is also a LinkedHashMap and the two
706         if (!(o instanceof LinkedHashMap))
708         LinkedHashMap t = (LinkedHashMap) o;
735      * LinkedHashMap collision list entry.
794         private Entry[] table = LinkedHashMap.this.table;
808             this.entry = LinkedHashMap.this.header.after;
818             if (entry == LinkedHashMap.this.header)
832             Entry[] tab = LinkedHashMap.this.table;
855      * Save the state of the LinkedHashMap to a stream (i.e., serialize it).
879      * Reconstitute the LinkedHashMap from a stream (i.e., deserialize it).
897         // Read the keys and values, and put the mappings in the LinkedHashMap

Indexes created Tue Jul 24 14:28:13 CEST 2018