public int addFirst(long key, int value) { return _add(key, value, MODE.FORCE_FIRST); } private synchronized int _add(long key, int value, MODE m) {
public int put(long key, int value) { return _put(key, value, MODE.LAST); }
protected void rehash() { int oldCapacity = table.length; LongIntLinkedEntry oldMap[] = table; int newCapacity = oldCapacity * 2 + 1; LongIntLinkedEntry newMap[] = new LongIntLinkedEntry[newCapacity]; threshold = (int) (newCapacity * loadFactor); table = newMap; for (int i = oldCapacity; i-- > 0;) { LongIntLinkedEntry old = oldMap[i]; while (old != null) { LongIntLinkedEntry e = old; old = old.hash_next; long key = e.key; int index = hash(key) % newCapacity; e.hash_next = newMap[index]; newMap[index] = e; } } }
private synchronized int _add(long key, int value, MODE m) { LongIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongIntLinkedEntry e = tab[index]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.key, key)) { case FORCE_FIRST: if (header.link_next != e) { unchain(e); chain(header, header.link_next, e); unchain(e); chain(header.link_prev, header, e); case FIRST: while (count >= max) { removeLast(); case LAST: while (count >= max) { removeFirst(); rehash(); tab = table; index = hash(key) % tab.length; case FORCE_FIRST: case FIRST: chain(header, header.link_next, e); break;
private synchronized int _put(long key, int value, MODE m) { LongIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongIntLinkedEntry e = tab[index]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.key, key)) { case FORCE_FIRST: if (header.link_next != e) { unchain(e); chain(header, header.link_next, e); unchain(e); chain(header.link_prev, header, e); int v = remove(k); overflowed(k, v); int v = remove(k); overflowed(k, v); rehash(); tab = table; index = hash(key) % tab.length; case FORCE_FIRST: case FIRST: chain(header, header.link_next, e); break; case FORCE_LAST: case LAST:
public static void main(String[] args) { LongIntLinkedMap m = new LongIntLinkedMap().setMax(6); for (int i = 0; i < 10; i++) { m.put(i, i); System.out.println(m); LongEnumer en = m.keys(); while (en.hasMoreElements()) { m.remove(5); System.out.println(en.nextLong());
public String toFormatString() { StringBuffer buf = new StringBuffer(); Enumeration it = entries(); buf.append("{\n"); while (it.hasMoreElements()) { LongIntLinkedEntry e = (LongIntLinkedEntry) it.nextElement(); buf.append("\t").append(e.getKey() + "=" + e.getValue()).append("\n"); } buf.append("}"); return buf.toString(); }
private synchronized int _add(long key, int value, MODE m) { LongIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongIntLinkedEntry e = tab[index]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.key, key)) { case FORCE_FIRST: if (header.link_next != e) { unchain(e); chain(header, header.link_next, e); unchain(e); chain(header.link_prev, header, e); case FIRST: while (count >= max) { removeLast(); case LAST: while (count >= max) { removeFirst(); rehash(); tab = table; index = hash(key) % tab.length; case FORCE_FIRST: case FIRST: chain(header, header.link_next, e); break;
private synchronized int _put(long key, int value, MODE m) { LongIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongIntLinkedEntry e = tab[index]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.key, key)) { case FORCE_FIRST: if (header.link_next != e) { unchain(e); chain(header, header.link_next, e); unchain(e); chain(header.link_prev, header, e); int v = remove(k); overflowed(k, v); int v = remove(k); overflowed(k, v); rehash(); tab = table; index = hash(key) % tab.length; case FORCE_FIRST: case FIRST: chain(header, header.link_next, e); break; case FORCE_LAST: case LAST:
public static void main(String[] args) { LongIntLinkedMap m = new LongIntLinkedMap().setMax(6); for (int i = 0; i < 10; i++) { m.put(i, i); System.out.println(m); LongEnumer en = m.keys(); while (en.hasMoreElements()) { m.remove(5); System.out.println(en.nextLong());
public String toFormatString() { StringBuffer buf = new StringBuffer(); Enumeration it = entries(); buf.append("{\n"); while (it.hasMoreElements()) { LongIntLinkedEntry e = (LongIntLinkedEntry) it.nextElement(); buf.append("\t").append(e.getKey() + "=" + e.getValue()).append("\n"); } buf.append("}"); return buf.toString(); }
private synchronized int _add(long key, int value, MODE m) { LongIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongIntLinkedEntry e = tab[index]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.key, key)) { case FORCE_FIRST: if (header.link_next != e) { unchain(e); chain(header, header.link_next, e); unchain(e); chain(header.link_prev, header, e); case FIRST: while (count >= max) { removeLast(); case LAST: while (count >= max) { removeFirst(); rehash(); tab = table; index = hash(key) % tab.length; case FORCE_FIRST: case FIRST: chain(header, header.link_next, e); break;
private synchronized int _put(long key, int value, MODE m) { LongIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongIntLinkedEntry e = tab[index]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.key, key)) { case FORCE_FIRST: if (header.link_next != e) { unchain(e); chain(header, header.link_next, e); unchain(e); chain(header.link_prev, header, e); int v = remove(k); overflowed(k, v); int v = remove(k); overflowed(k, v); rehash(); tab = table; index = hash(key) % tab.length; case FORCE_FIRST: case FIRST: chain(header, header.link_next, e); break; case FORCE_LAST: case LAST:
public static void main(String[] args) { LongIntLinkedMap m = new LongIntLinkedMap().setMax(6); for (int i = 0; i < 10; i++) { m.put(i, i); System.out.println(m); LongEnumer en = m.keys(); while (en.hasMoreElements()) { m.remove(5); System.out.println(en.nextLong());