value = v;             next = n;            key = k;            hash = h;        }        public Object getKey() {            return unmaskNull(key);        }        public Object getValue() {            return value;        }            public Object setValue(Object newValue) {            Object oldValue = value;            value = newValue;            return oldValue;        }            public boolean equals(Object o) {            if (!(o instanceof Map.Entry))                return false;            Map.Entry e = (Map.Entry)o;            Object k1 = getKey();            Object k2 = e.getKey();            if (k1 == k2 || (k1 != null && k1.equals(k2))) {                Object v1 = getValue();                Object v2 = e.getValue();                if (v1 == v2 || (v1 != null && v1.equals(v2)))                     return true;            }            return false;        }            public int hashCode() {            return (key==NULL_KEY ? 0 : key.hashCode()) ^                   (value==null   ? 0 : value.hashCode());        }            public String toString() {            return getKey() + "=" + getValue();        }        /**         * This method is invoked whenever the value in an entry is         * overwritten by an invocation of put(k,v) for a key k that's already         * in the HashMap.         */        void recordAccess(HashMap m) {        }        /**         * This method is invoked whenever the entry is         * removed from the table.         */        void recordRemoval(HashMap m) {        }    }    /**     * Add a new entry with the specified key, value and hash code to     * the specified bucket.  It is the responsibility of this      * method to resize the table if appropriate.     *     * Subclass overrides this to alter the behavior of put method.     */    void addEntry(int hash, Object key, Object value, int bucketIndex) {        table[bucketIndex] = new Entry(hash, key, value, table[bucketIndex]);        if (size++ >= threshold)             resize(2 * table.length);    }    /**     * Like addEntry except that this version is used when creating entries     * as part of Map construction or "pseudo-construction" (cloning,     * deserialization).  This version needn't worry about resizing the table.     *     * Subclass overrides this to alter the behavior of HashMap(Map),     * clone, and readObject.     */    void createEntry(int hash, Object key, Object value, int bucketIndex) {        table[bucketIndex] = new Entry(hash, key, value, table[bucketIndex]);        size++;    }    private abstract class HashIterator implements Iterator {        Entry next;                  // next entry to return        int expectedModCount;        // For fast-fail         int index;                   // current slot         Entry current;               // current entry        HashIterator() {            expectedModCount = modCount;            Entry[] t = table;            int i = t.length;            Entry n = null;            if (size != 0) { // advance to first entry                while (i > 0 && (n = t[--i]) == null)                    ;            }            next = n;            index = i;        }        public boolean hasNext() {            return next != null;        }        Entry nextEntry() {             if (modCount != expectedModCount)                throw new ConcurrentModificationException();            Entry e = next;            if (e == null)                 throw new NoSuchElementException();                            Entry n = e.next;            Entry[] t = table;            int i = index;            while (n == null && i > 0)                n = t[--i];            index = i;            next = n;            return current = e;        }        public void remove() {            if (current == null)                throw new IllegalStateException();            if (modCount != expectedModCount)                throw new ConcurrentModificationException();            Object k = current.key;            current = null;            HashMap.this.removeEntryForKey(k);            expectedModCount = modCount;        }    }    private class ValueIterator extends HashIterator {        public Object next() {            return nextEntry().value;        }    }    private class KeyIterator extends HashIterator {        public Object next() {            return nextEntry().getKey();        }    }    private class EntryIterator extends HashIterator {        public Object next() {            return nextEntry();        }    }    // Subclass overrides these to alter behavior of views' iterator() method    Iterator newKeyIterator()   {        return new KeyIterator();    }    Iterator newValueIterator()   {        return new ValueIterator();    }    Iterator newEntryIterator()   {        return new EntryIterator();    }    // Views    private transient Set entrySet = null;    /**     * Returns a set 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.     *     * @return a set view of the keys contained in this map.     */    public Set keySet() {        Set ks = keySet;        return (ks != null ? ks : (keySet = new KeySet()));    }    private class KeySet extends AbstractSet {        public Iterator iterator() {            return newKeyIterator();        }        public int size() {            return size;        }        public boolean contains(Object o) {            return containsKey(o);        }        public boolean remove(Object o) {            return HashMap.this.removeEntryForKey(o) != null;        }        public void clear() {            HashMap.this.clear();        }    }    /**     * Returns a collection 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.     *     * @return a collection view of the values contained in this map.     */    public Collection values() {        Collection vs = values;        return (vs != null ? vs : (values = new Values()));    }    private class Values extends AbstractCollection {        public Iterator iterator() {            return newValueIterator();        }        public int size() {            return size;        }        public boolean contains(Object o) {            return containsValue(o);        }        public void clear() {            HashMap.this.clear();        }    }    /**     * Returns a collection view of the mappings contained in this map.  Each     * element in the returned collection is a <tt>Map.Entry</tt>.  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.     *     * @return a collection view of the mappings contained in this map.     * @see Map.Entry     */    public Set entrySet() {        Set es = entrySet;        return (es != null ? es : (entrySet = new EntrySet()));    }    private class EntrySet extends AbstractSet {        public Iterator iterator() {            return newEntryIterator();        }        public boolean contains(Object o) {            if (!(o instanceof Map.Entry))                return false;            Map.Entry e = (Map.Entry)o;            Entry candidate = getEntry(e.getKey());            return candidate != null && candidate.equals(e);        }        public boolean remove(Object o) {            return removeMapping(o) != null;        }        public int size() {            return size;        }        public void clear() {            HashMap.this.clear();        }    }    /**     * Save the state of the <tt>HashMap</tt> instance to a stream (i.e.,     * serialize it).     *     * @serialData The <i>capacity</i> of the HashMap (the length of the     *		   bucket array) is emitted (int), followed  by the     *		   <i>size</i> of the HashMap (the number of key-value     *		   mappings), followed by the key (Object) and value (Object)     *		   for each key-value mapping represented by the HashMap     *             The key-value mappings are emitted in the order that they     *             are returned by <tt>entrySet().iterator()</tt>.     *      */    private void writeObject(java.io.ObjectOutputStream s)        throws IOException    {	// Write out the threshold, loadfactor, and any hidden stuff	s.defaultWriteObject();	// Write out number of buckets	s.writeInt(table.length);	// Write out size (number of Mappings)	s.writeInt(size);        // Write out keys and values (alternating)        for (Iterator i = entrySet().iterator(); i.hasNext(); ) {            Map.Entry e = (Map.Entry) i.next();            s.writeObject(e.getKey());            s.writeObject(e.getValue());        }    }    private static final long serialVersionUID = 362498820763181265L;    /**     * Reconstitute the <tt>HashMap</tt> instance from a stream (i.e.,     * deserialize it).     */    private void readObject(java.io.ObjectInputStream s)         throws IOException, ClassNotFoundException    {	// Read in the threshold, loadfactor, and any hidden stuff	s.defaultReadObject();	// Read in number of buckets and allocate the bucket array;	int numBuckets = s.readInt();	table = new Entry[numBuckets];        init();  // Give subclass a chance to do its thing.	// Read in size (number of Mappings)	int size = s.readInt();	// Read the keys and values, and put the mappings in the HashMap	for (int i=0; i<size; i++) {	    Object key = s.readObject();	    Object value = s.readObject();	    putForCreate(key, value);	}    }    // These methods are used when serializing HashSets    int   capacity()     { return table.length; }    float loadFactor()   { return loadFactor;   }}