c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenkpackage com.sun.tools.jdi;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenkimport java.io.*;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenkimport java.util.*;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenkimport java.io.Serializable;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenkpublic class LinkedHashMap extends AbstractMap implements Map, Serializable {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk private transient Entry table[];

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk private transient Entry header;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk private transient int count;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk private int threshold;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk private float loadFactor;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk private transient int modCount = 0;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk public LinkedHashMap(int initialCapacity, float loadFactor) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (initialCapacity < 0)

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk throw new IllegalArgumentException("Illegal Initial Capacity: "+

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk initialCapacity);

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if ((loadFactor > 1) || (loadFactor <= 0))

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk throw new IllegalArgumentException("Illegal Load factor: "+

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk loadFactor);

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (initialCapacity==0)

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk initialCapacity = 1;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk this.loadFactor = loadFactor;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk table = new Entry[initialCapacity];

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk threshold = (int)(initialCapacity * loadFactor);

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk header = new Entry(-1, null, null, null);

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk header.before = header.after = header;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk public LinkedHashMap(int initialCapacity) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk this(initialCapacity, 0.75f);

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk public LinkedHashMap() {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk this(101, 0.75f);

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk public LinkedHashMap(Map t) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk this(Math.max(3*t.size(), 11), 0.75f);

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk putAll(t);

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk public int size() {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return count;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk public boolean isEmpty() {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return count == 0;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk public boolean containsValue(Object value) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (value==null) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk for (Entry e = header.after; e != header; e = e.after)

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (e.value==null)

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return true;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk } else {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk for (Entry e = header.after; e != header; e = e.after)

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (value.equals(e.value))

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return true;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return false;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk public boolean containsKey(Object key) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk Entry tab[] = table;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (key != null) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk int hash = key.hashCode();

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk int index = (hash & 0x7FFFFFFF) % tab.length;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk for (Entry e = tab[index]; e != null; e = e.next)

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (e.hash==hash && e.key.equals(key))

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return true;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk } else {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk for (Entry e = tab[0]; e != null; e = e.next)

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (e.key==null)

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return true;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return false;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk public Object get(Object key) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk Entry e = getEntry(key);

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return e==null ? null : e.value;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk private Entry getEntry(Object key) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk Entry tab[] = table;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (key != null) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk int hash = key.hashCode();

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk int index = (hash & 0x7FFFFFFF) % tab.length;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk for (Entry e = tab[index]; e != null; e = e.next)

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if ((e.hash == hash) && e.key.equals(key))

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return e;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk } else {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk for (Entry e = tab[0]; e != null; e = e.next)

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (e.key==null)

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return e;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return null;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk private void rehash() {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk int oldCapacity = table.length;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk Entry oldMap[] = table;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk int newCapacity = oldCapacity * 2 + 1;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk Entry newMap[] = new Entry[newCapacity];

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk modCount++;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk threshold = (int)(newCapacity * loadFactor);

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk table = newMap;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk for (Entry e = header.after; e != header; e = e.after) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk int index = (e.hash & 0x7FFFFFFF) % newCapacity;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk e.next = newMap[index];

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk newMap[index] = e;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk private void listRemove(Entry entry) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (entry == null) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk return;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk entry.before.after = entry.after;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk entry.after.before = entry.before;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk private void listAddBefore(Entry entry, Entry existEntry) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk entry.after = existEntry;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk entry.before = existEntry.before;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk entry.before.after = entry;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk entry.after.before = entry;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk }

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk /**

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk public int indexOf(Object key) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk int i = 0;

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk if (key == null) {

c1350cf5bc50458ba79cc93ff9e0e5fe3f1aeeb0jeff.schenk for (Entry e = header.after; e != header; e = e.after, i++)

if (e.key == null)

return i;

} else {

for (Entry e = header.after; e != header; e = e.after, i++)

if(key.equals(e.key))

return i;

}

return -1;

}

/**

private Object putAhead(Object key, Object value, Entry existEntry) {

// Makes sure the key is not already in the LinkedHashMap.

Entry tab[] = table;

int hash = 0;

int index = 0;

if (key != null) {

hash = key.hashCode();

index = (hash & 0x7FFFFFFF) % tab.length;

for (Entry e = tab[index] ; e != null ; e = e.next) {

if ((e.hash == hash) && e.key.equals(key)) {

Object old = e.value;

e.value = value;

return old;

}

}

} else {

for (Entry e = tab[0] ; e != null ; e = e.next) {

if (e.key == null) {

Object old = e.value;

e.value = value;

return old;

}

}

}

modCount++;

if (count >= threshold) {

// Rehash the table if the threshold is exceeded

rehash();

tab = table;

index = (hash & 0x7FFFFFFF) % tab.length;

}

// Creates the new entry.

Entry e = new Entry(hash, key, value, tab[index]);

tab[index] = e;

listAddBefore(e, existEntry);

count++;

return null;

}

/**

public Object put(int index, Object key, Object value) {

if (index < 0 || index > count)

throw new IndexOutOfBoundsException();

Entry e = header.after;

if (index == count)

return putAhead(key, value, header); //fast approach for append

else {

for (int i = 0; i < index; i++)

e = e.after;

return putAhead(key, value, e);

}

}

/**

public Object put(Object key, Object value) {

return putAhead(key, value, header);

}

/**

public Object remove(Object key) {

Entry tab[] = table;

if (key != null) {

int hash = key.hashCode();

int index = (hash & 0x7FFFFFFF) % tab.length;

for (Entry e = tab[index], prev = null; e != null;

prev = e, e = e.next) {

if ((e.hash == hash) && e.key.equals(key)) {

modCount++;

if (prev != null)

prev.next = e.next;

else

tab[index] = e.next;

count--;

Object oldValue = e.value;

e.value = null;

listRemove(e);

return oldValue;

}

}

} else {

for (Entry e = tab[0], prev = null; e != null;

prev = e, e = e.next) {

if (e.key == null) {

modCount++;

if (prev != null)

prev.next = e.next;

else

tab[0] = e.next;

count--;

Object oldValue = e.value;

e.value = null;

listRemove(e);

return oldValue;

}

}

}

return null;

}

/**

public void putAll(Map t) {

Iterator i = t.entrySet().iterator();

while (i.hasNext()) {

Map.Entry e = (Map.Entry) i.next();

put(e.getKey(), e.getValue());

}

}

/**

public void clear() {

Entry tab[] = table;

modCount++;

for (int index = tab.length; --index >= 0; )

tab[index] = null;

count = 0;

header.before = header.after = header;

}

/**

public Object clone() {

return new LinkedHashMap(this);

}

// Views

private transient Set keySet = null;

private transient Set entries = null;

private transient Collection values = null;

/**

public Set keySet() {

if (keySet == null) {

keySet = new AbstractSet() {

public Iterator iterator() {

return new HashIterator(KEYS);

}

public int size() {

return count;

}

public boolean contains(Object o) {

return containsKey(o);

}

public boolean remove(Object o) {

return LinkedHashMap.this.remove(o) != null;

}

public void clear() {

LinkedHashMap.this.clear();

}

};

}

return keySet;

}

/**

public Collection values() {

if (values==null) {

values = new AbstractCollection() {

public Iterator iterator() {

return new HashIterator(VALUES);

}

public int size() {

return count;

}

public boolean contains(Object o) {

return containsValue(o);

}

public void clear() {

LinkedHashMap.this.clear();

}

};

}

return values;

}

/**

public Set entrySet() {

if (entries==null) {

entries = new AbstractSet() {

public Iterator iterator() {

return new HashIterator(ENTRIES);

}

public boolean contains(Object o) {

if (!(o instanceof Map.Entry))

return false;

Map.Entry entry = (Map.Entry)o;

Object key = entry.getKey();

Entry tab[] = table;

int hash = (key==null ? 0 : key.hashCode());

int index = (hash & 0x7FFFFFFF) % tab.length;

for (Entry e = tab[index]; e != null; e = e.next)

if (e.hash==hash && e.equals(entry))

return true;

return false;

}

public boolean remove(Object o) {

if (!(o instanceof Map.Entry))

return false;

Map.Entry entry = (Map.Entry)o;

Object key = entry.getKey();

Entry tab[] = table;

int hash = (key==null ? 0 : key.hashCode());

int index = (hash & 0x7FFFFFFF) % tab.length;

for (Entry e = tab[index], prev = null; e != null;

prev = e, e = e.next) {

if (e.hash==hash && e.equals(entry)) {

modCount++;

if (prev != null)

prev.next = e.next;

else

tab[index] = e.next;

count--;

e.value = null;

listRemove(e);

return true;

}

}

return false;

}

public int size() {

return count;

}

public void clear() {

LinkedHashMap.this.clear();

}

};

}

return entries;

}

/**

public boolean equals(Object o) {

if (o == this)

return true;

if (!(o instanceof LinkedHashMap))

return false;

LinkedHashMap t = (LinkedHashMap) o;

if (t.size() != size())

return false;

Iterator i1 = entrySet().iterator();

Iterator i2 = t.entrySet().iterator();

while (i1.hasNext()) {

Entry e1 = (Entry) i1.next();

Entry e2 = (Entry) i2.next();

Object key1 = e1.getKey();

Object value1 = e1.getValue();

Object key2 = e2.getKey();

Object value2 = e2.getValue();

if ((key1 == null ? key2 == null : key1.equals(key2)) &&

(value1 == null ? value2 == null : value1.equals(value2))) {

continue;

} else {

return false;

}

}

return true;

}

/**

private static class Entry implements Map.Entry {

int hash;

Object key;

Object value;

Entry next;

// These fields comprise the doubly linked list that is used for

// iteration.

Entry before, after;

Entry(int hash, Object key, Object value, Entry next) {

this.hash = hash;

this.key = key;

this.value = value;

this.next = next;

}

// Map.Entry Ops

public Object getKey() {

return key;

}

public Object getValue() {

return value;

}

public Object setValue(Object value) {

Object oldValue = this.value;

this.value = value;

return oldValue;

}

public boolean equals(Object o) {

if (!(o instanceof Map.Entry))

return false;

Map.Entry e = (Map.Entry)o;

return (key==null ? e.getKey()==null : key.equals(e.getKey())) &&

(value==null ? e.getValue()==null : value.equals(e.getValue()));

}

public int hashCode() {

return hash ^ (value==null ? 0 : value.hashCode());

}

public String toString() {

return key+"="+value;

}

}

// Types of Iterators

private static final int KEYS = 0;

private static final int VALUES = 1;

private static final int ENTRIES = 2;

private class HashIterator implements Iterator {

private Entry[] table = LinkedHashMap.this.table;

private Entry entry = null;

private Entry lastReturned = null;

private int type;

/**

private int expectedModCount = modCount;

HashIterator(int type) {

this.type = type;

this.entry = LinkedHashMap.this.header.after;

}

public boolean hasNext() {

return entry != header;

}

public Object next() {

if (modCount != expectedModCount)

throw new ConcurrentModificationException();

if (entry == LinkedHashMap.this.header)

throw new NoSuchElementException();

Entry e = lastReturned = entry;

entry = e.after;

return type == KEYS ? e.key : (type == VALUES ? e.value : e);

}

public void remove() {

if (lastReturned == null)

throw new IllegalStateException();

if (modCount != expectedModCount)

throw new ConcurrentModificationException();

Entry[] tab = LinkedHashMap.this.table;

int index = (lastReturned.hash & 0x7FFFFFFF) % tab.length;

for (Entry e = tab[index], prev = null; e != null;

prev = e, e = e.next) {

if (e == lastReturned) {

modCount++;

expectedModCount++;

if (prev == null)

tab[index] = e.next;

else

prev.next = e.next;

count--;

listRemove(e);

lastReturned = null;

return;

}

}

throw new ConcurrentModificationException();

}

}

/**

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(count);

// Write out keys and values (alternating)

for (Entry e = header.after; e != header; e = e.after) {

s.writeObject(e.key);

s.writeObject(e.value);

}

}

/**

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];

header = new Entry(-1, null, null, null);

header.before = header;

header.after = header;

// Read in size (number of Mappings)

int size = s.readInt();

// Read the keys and values, and put the mappings in the LinkedHashMap

for (int i=0; i<size; i++) {

Object key = s.readObject();

Object value = s.readObject();

put(key, value);

}

}

}