@Override public V put(K key, V value) { if ( key==null ) return null; if ( n > threshold ) expand(); int b = getBucket(key); LinkedList<Entry<K, V>> bucket = buckets[b]; if ( bucket==null ) { bucket = buckets[b] = new LinkedList<Entry<K, V>>(); } for (Entry<K, V> e : bucket) { if ( comparator.equals(e.key, key) ) { V prev = e.value; e.value = value; n++; return prev; } } // not there bucket.add(new Entry<K, V>(key, value)); n++; return null; }
public String toTableString() { StringBuilder buf = new StringBuilder(); for (LinkedList<Entry<K, V>> bucket : buckets) { if ( bucket==null ) { buf.append("null\n"); continue; } buf.append('['); boolean first = true; for (Entry<K, V> e : bucket) { if ( first ) first=false; else buf.append(" "); if ( e==null ) buf.append("_"); else buf.append(e.toString()); } buf.append("]\n"); } return buf.toString(); }
@Override public V put(K key, V value) { if ( key==null ) return null; if ( n > threshold ) expand(); int b = getBucket(key); LinkedList<Entry<K, V>> bucket = buckets[b]; if ( bucket==null ) { bucket = buckets[b] = new LinkedList<Entry<K, V>>(); } for (Entry<K, V> e : bucket) { if ( comparator.equals(e.key, key) ) { V prev = e.value; e.value = value; n++; return prev; } } // not there bucket.add(new Entry<K, V>(key, value)); n++; return null; }
@Override public V put(K key, V value) { if ( key==null ) return null; if ( n > threshold ) expand(); int b = getBucket(key); LinkedList<Entry<K, V>> bucket = buckets[b]; if ( bucket==null ) { bucket = buckets[b] = new LinkedList<Entry<K, V>>(); } for (Entry<K, V> e : bucket) { if ( comparator.equals(e.key, key) ) { V prev = e.value; e.value = value; n++; return prev; } } // not there bucket.add(new Entry<K, V>(key, value)); n++; return null; }
@Override public V put(K key, V value) { if ( key==null ) return null; if ( n > threshold ) expand(); int b = getBucket(key); LinkedList<Entry<K, V>> bucket = buckets[b]; if ( bucket==null ) { bucket = buckets[b] = new LinkedList<Entry<K, V>>(); } for (Entry<K, V> e : bucket) { if ( comparator.equals(e.key, key) ) { V prev = e.value; e.value = value; n++; return prev; } } // not there bucket.add(new Entry<K, V>(key, value)); n++; return null; }
@Override public V put(K key, V value) { if ( key==null ) return null; if ( n > threshold ) expand(); int b = getBucket(key); LinkedList<Entry<K, V>> bucket = buckets[b]; if ( bucket==null ) { bucket = buckets[b] = new LinkedList<Entry<K, V>>(); } for (Entry<K, V> e : bucket) { if ( comparator.equals(e.key, key) ) { V prev = e.value; e.value = value; n++; return prev; } } // not there bucket.add(new Entry<K, V>(key, value)); n++; return null; }
public String toTableString() { StringBuilder buf = new StringBuilder(); for (LinkedList<Entry<K, V>> bucket : buckets) { if ( bucket==null ) { buf.append("null\n"); continue; } buf.append('['); boolean first = true; for (Entry<K, V> e : bucket) { if ( first ) first=false; else buf.append(" "); if ( e==null ) buf.append("_"); else buf.append(e.toString()); } buf.append("]\n"); } return buf.toString(); }
public String toTableString() { StringBuilder buf = new StringBuilder(); for (LinkedList<Entry<K, V>> bucket : buckets) { if ( bucket==null ) { buf.append("null\n"); continue; } buf.append('['); boolean first = true; for (Entry<K, V> e : bucket) { if ( first ) first=false; else buf.append(" "); if ( e==null ) buf.append("_"); else buf.append(e.toString()); } buf.append("]\n"); } return buf.toString(); }
public String toTableString() { StringBuilder buf = new StringBuilder(); for (LinkedList<Entry<K, V>> bucket : buckets) { if ( bucket==null ) { buf.append("null\n"); continue; } buf.append('['); boolean first = true; for (Entry<K, V> e : bucket) { if ( first ) first=false; else buf.append(" "); if ( e==null ) buf.append("_"); else buf.append(e.toString()); } buf.append("]\n"); } return buf.toString(); }
@Override public String toString() { if ( size()==0 ) return "{}"; StringBuilder buf = new StringBuilder(); buf.append('{'); boolean first = true; for (LinkedList<Entry<K, V>> bucket : buckets) { if ( bucket==null ) continue; for (Entry<K, V> e : bucket) { if ( e==null ) break; if ( first ) first=false; else buf.append(", "); buf.append(e.toString()); } } buf.append('}'); return buf.toString(); }
@Override public String toString() { if ( size()==0 ) return "{}"; StringBuilder buf = new StringBuilder(); buf.append('{'); boolean first = true; for (LinkedList<Entry<K, V>> bucket : buckets) { if ( bucket==null ) continue; for (Entry<K, V> e : bucket) { if ( e==null ) break; if ( first ) first=false; else buf.append(", "); buf.append(e.toString()); } } buf.append('}'); return buf.toString(); }
@Override public String toString() { if ( size()==0 ) return "{}"; StringBuilder buf = new StringBuilder(); buf.append('{'); boolean first = true; for (LinkedList<Entry<K, V>> bucket : buckets) { if ( bucket==null ) continue; for (Entry<K, V> e : bucket) { if ( e==null ) break; if ( first ) first=false; else buf.append(", "); buf.append(e.toString()); } } buf.append('}'); return buf.toString(); }
public String toTableString() { StringBuilder buf = new StringBuilder(); for (LinkedList<Entry<K, V>> bucket : buckets) { if ( bucket==null ) { buf.append("null\n"); continue; } buf.append('['); boolean first = true; for (Entry<K, V> e : bucket) { if ( first ) first=false; else buf.append(" "); if ( e==null ) buf.append("_"); else buf.append(e.toString()); } buf.append("]\n"); } return buf.toString(); }
@Override public String toString() { if ( size()==0 ) return "{}"; StringBuilder buf = new StringBuilder(); buf.append('{'); boolean first = true; for (LinkedList<Entry<K, V>> bucket : buckets) { if ( bucket==null ) continue; for (Entry<K, V> e : bucket) { if ( e==null ) break; if ( first ) first=false; else buf.append(", "); buf.append(e.toString()); } } buf.append('}'); return buf.toString(); }
@Override public String toString() { if ( size()==0 ) return "{}"; StringBuilder buf = new StringBuilder(); buf.append('{'); boolean first = true; for (LinkedList<Entry<K, V>> bucket : buckets) { if ( bucket==null ) continue; for (Entry<K, V> e : bucket) { if ( e==null ) break; if ( first ) first=false; else buf.append(", "); buf.append(e.toString()); } } buf.append('}'); return buf.toString(); }