void putAllForCreate(final IntHashMap<V> m) { for (Entry<V> entry : m.entrySet()) { putForCreate(entry.getKey(), entry.getValue()); } }
/** * @see java.util.Map#isEmpty() */ @Override public boolean isEmpty() { return size() == 0; }
@Override public String name(int value) { return mapValueToName.get(value); }
/** * @see java.util.Map#containsKey(java.lang.Object) */ @Override public boolean containsKey(final Object key) { return findKey(0, key) != -1; }
/** * @see IPageVersionManager#getVersions() */ public int getVersions() { return changeListStack.size(); }
/** * Constructs an empty <tt>HashMap</tt> with the default initial capacity (16) and the default * load factor (0.75). */ @SuppressWarnings("unchecked") public IntHashMap() { loadFactor = DEFAULT_LOAD_FACTOR; threshold = (int)(DEFAULT_INITIAL_CAPACITY * DEFAULT_LOAD_FACTOR); table = new Entry[DEFAULT_INITIAL_CAPACITY]; init(); }
/** * Constructs map with a single key and value pair. * * @param key * The key * @param value * The value */ public MicroMap(final K key, final V value) { put(key, value); }
/** * @see IPageVersionManager#expireOldestVersion() */ public void expireOldestVersion() { changeListStack.remove(0); }
@Override public BufferedWebResponse remove(Object key) { Value removedValue; synchronized (this) { removedValue = (Value)super.remove(key); } return removedValue != null ? removedValue.response : null; }
/** * @see java.util.AbstractCollection#remove(java.lang.Object) */ public boolean remove(Object o) { return removeMapping(o) != null; }
@Override public int size() { return MicroMap.this.size(); } };
@Override public BufferedWebResponse remove(Object key) { Value removedValue; synchronized (this) { removedValue = (Value)super.remove(key); } return removedValue != null ? removedValue.response : null; }
@Override public int size() { return MicroMap.this.size(); } };
@Override public int size() { return MicroMap.this.size(); } };
@Override public int size() { return MicroMap.this.size(); } };
/** * @return True if this MicroMap is full */ public boolean isFull() { return size() == MAX_ENTRIES; }