@Override public V get(Object key) { @SuppressWarnings("unchecked") K typedKey = (K)key; if ( key==null ) return null; int b = getBucket(typedKey); LinkedList<Entry<K, V>> bucket = buckets[b]; if ( bucket==null ) return null; // no bucket for (Entry<K, V> e : bucket) { if ( comparator.equals(e.key, typedKey) ) { return e.value; } } 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 get(Object key) { @SuppressWarnings("unchecked") K typedKey = (K)key; if ( key==null ) return null; int b = getBucket(typedKey); LinkedList<Entry<K, V>> bucket = buckets[b]; if ( bucket==null ) return null; // no bucket for (Entry<K, V> e : bucket) { if ( comparator.equals(e.key, typedKey) ) { return e.value; } } return null; }
@Override public V get(Object key) { @SuppressWarnings("unchecked") K typedKey = (K)key; if ( key==null ) return null; int b = getBucket(typedKey); LinkedList<Entry<K, V>> bucket = buckets[b]; if ( bucket==null ) return null; // no bucket for (Entry<K, V> e : bucket) { if ( comparator.equals(e.key, typedKey) ) { return e.value; } } return null; }
@Override public V get(Object key) { @SuppressWarnings("unchecked") K typedKey = (K)key; if ( key==null ) return null; int b = getBucket(typedKey); LinkedList<Entry<K, V>> bucket = buckets[b]; if ( bucket==null ) return null; // no bucket for (Entry<K, V> e : bucket) { if ( comparator.equals(e.key, typedKey) ) { return e.value; } } return null; }
@Override public V get(Object key) { @SuppressWarnings("unchecked") K typedKey = (K)key; if ( key==null ) return null; int b = getBucket(typedKey); LinkedList<Entry<K, V>> bucket = buckets[b]; if ( bucket==null ) return null; // no bucket for (Entry<K, V> e : bucket) { if ( comparator.equals(e.key, typedKey) ) { return e.value; } } 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; }
@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; }