public synchronized boolean containsValue(int value) { LongIntLinkedEntry tab[] = table; for (int i = tab.length; i-- > 0;) { for (LongIntLinkedEntry e = tab[i]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.value, value)) { return true; } } } return false; }
public synchronized boolean containsValue(int value) { IntIntEntry tab[] = table; int i = tab.length; while (i-- > 0) { for (IntIntEntry e = tab[i]; e != null; e = e.next) { if (CompareUtil.equals(e.value, value)) { return true; } } } return false; }
public synchronized boolean containsValue(int value) { IntLongLinkedEntry tab[] = table; for (int i = tab.length; i-- > 0;) { for (IntLongLinkedEntry e = tab[i]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.value, value)) { return true; } } } return false; }
public boolean equals(Object o) { if (!(o instanceof LinkedSetry)) return false; LinkedSetry e = (LinkedSetry) o; return CompareUtil.equals(e.key, key); }
public synchronized boolean containsValue(float value) { LongFloatLinkedEntry tab[] = table; for (int i = tab.length; i-- > 0;) { for (LongFloatLinkedEntry e = tab[i]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.value, value)) { return true; } } } return false; }
public synchronized int get(long key) { 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)) { return e.value; } } return NONE; }
public synchronized V get(byte[] key) { ByteArrayKeyLinkedEntry<V> tab[] = table; int index = hash(key) % tab.length; for (ByteArrayKeyLinkedEntry<V> e = tab[index]; e != null; e = e.next) { if (CompareUtil.equals(e.key, key)) { return e.value; } } return null; }
public synchronized boolean containsKey(int key) { IntKeyLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (IntKeyLinkedEntry e = tab[index]; e != null; e = e.next) { if (CompareUtil.equals(e.key, key)) { return true; } } return false; }
public synchronized boolean contains(int key) { IntLinkedSetry buk[] = table; int index = hash(key) % buk.length; for (IntLinkedSetry e = buk[index]; e != null; e = e.next) { if (CompareUtil.equals(e.key, key)) { return true; } } return false; }
public synchronized V get(int key) { IntKeyLinkedEntry<V> tab[] = table; int index = hash(key) % tab.length; for (IntKeyLinkedEntry<V> e = tab[index]; e != null; e = e.next) { if (CompareUtil.equals(e.key, key)) { return e.value; } } return null; }
public synchronized boolean containsKey(int key) { IntLongLinkedEntry tab[] = table; int index = hash(key) % tab.length; IntLongLinkedEntry e = tab[index]; while (e != null) { if (CompareUtil.equals(e.key, key)) { return true; } e = e.hash_next; } return false; }
public synchronized float get(long key) { LongFloatLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (LongFloatLinkedEntry e = tab[index]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.key, key)) { return e.value; } } return NONE; }
public synchronized V get(K key) { if (key == null) return null; LinkedEntry<K, V> tab[] = table; int index = hash(key) % tab.length; for (LinkedEntry<K, V> e = tab[index]; e != null; e = e.next) { if (CompareUtil.equals(e.key, key)) { return e.value; } } return null; }
public synchronized V get(String key) { if (key == null) return null; StringKeyLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (StringKeyLinkedEntry<V> e = tab[index]; e != null; e = e.next) { if (CompareUtil.equals(e.key, key)) { return e.value; } } return null; }
public synchronized int get(int key) { IntIntLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (IntIntLinkedEntry e = tab[index]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.key, key)) { return e.value; } } return NONE; }
public synchronized long get(int key) { IntLongLinkedEntry tab[] = table; int index = hash(key) % tab.length; for (IntLongLinkedEntry e = tab[index]; e != null; e = e.hash_next) { if (CompareUtil.equals(e.key, key)) { return e.value; } } return NONE; }
public synchronized V get(long key) { if (this.size() == 0) return null; LongKeyLinkedEntry<V> tab[] = table; int index = hash(key) % tab.length; for (LongKeyLinkedEntry<V> e = tab[index]; e != null; e = e.next) { if (CompareUtil.equals(e.key, key)) { return e.value; } } return null; }