HashOjbect之HashObjectMap(4)

iteye_20681

于 2011-01-14 14:59:41 发布

阅读量64

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/iteye_20681/article/details/81999681

本文详细介绍了哈希表中各种核心操作的实现方法，包括获取、移除元素及检查元素是否存在等关键功能，并提供了具体的代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

public BaseHashObject get(BaseHashObject object) {
if (object == null)
return null;
int hash = object.keyHashCode();
for (BaseHashObject e = table[indexFor(hash, table.length)];
e != null;
e = e.getNext()) {
if (e.keyHashCode() == hash && e.keyEquals(object)) {
return e;
}
}
return null;
}

public boolean containsKey(BaseHashObject object){
return get(object)==null ? false : true;
}
public HashObject remove(BaseHashObject Object) {
BaseHashObject e = removeObjectForKey(Object);
return e;
}

final BaseHashObject removeObjectForKey(BaseHashObject object) {
int hash = (object == null) ? 0 : object.keyHashCode();
int i = indexFor(hash, table.length);
BaseHashObject prev = table[i];
BaseHashObject e = prev;

while (e != null) {
BaseHashObject next = e.getNext();
if (e.keyHashCode() == hash && e.keyEquals(object)) {
modCount++;
size--;
if (prev == e)
table[i] = next;
else
prev.setNext(next);
e.recordRemoval(this);
if(logger.isDebugEnabled())
{
logger.debug("size--:"+size);
}
return e;
}
prev = e;
e = next;
}

return e;
}
public void clear() {
modCount++;
BaseHashObject[] tab = table;
for (int i = 0; i < tab.length; i++)
tab[i] = null;
size = 0;
}

public boolean containsObject(BaseHashObject object) {
return getObject(object) != null;
}

final T getObject(BaseHashObject object) {
int hash = (object == null) ? 0 : object.keyHashCode();
for (BaseHashObject e = table[indexFor(hash, table.length)];
e != null;
e = e.getNext()) {
if (e.keyHashCode() == hash && e.keyEquals(object)){
return (T)e;
}
}
return null;
}

Iterator<T> newObjectIterator(){
return new ObjectIterator();
}

private final class ObjectIterator extends HashIterator {
public T next() {
return nextObject();
}
}