java hashtable 使用_java hashtable 使用

下面的代码记录了hashtable使用的基本方法和注意的情况。

1)hashtable不允许键值为null的情况

2)hashtable默认大小是11(、质数能分散hash值)

3)hashtable是线程安全的,put方法,remove方法等都有synchronized,故效率不如hashmap

package com.basic.util;

import java.util.HashMap;

import java.util.Hashtable;

import java.util.Iterator;

import java.util.Map.Entry;

public class BasicHashTable {

public static final Hashtable firstHashMap = new Hashtable();

public static void main(String[] args) {

threadTest();

Hashtable table = new Hashtable<>();

table.put(new Team("first", 1, 1.11f), "1");

table.put(new Team("second", 2, 1.22f), "2");

table.put(new Team("third", 3, 1.33f), "3");

Team t = new Team("team", 100, 100.111f);

table.put(t, "null");

table.remove(t);

Iterator> iter1 = table.entrySet().iterator();

while (iter1.hasNext()) {

Entry e = iter1.next();

if (e.getValue().equals("1")) {

iter1.remove();

}

}

Iterator> iter = table.entrySet().iterator();

while (iter.hasNext()) {

Entry e = iter.next();

System.out.println(e.getKey().toString() + " " + e.getValue());

}

}

public static void threadTest() {

Thread t1 = new Thread(new Runnable() {

@Override

public void run() {

for (int i = 1; i <= 25; i++) {

firstHashMap.put(String.valueOf(i), String.valueOf(i));

}

}

});

Thread t2 = new Thread(new Runnable() {

@Override

public void run() {

for (int i = 26; i <= 50; i++) {

firstHashMap.put(String.valueOf(i), String.valueOf(i));

}

}

});

Thread t3 = new Thread(new Runnable() {

@Override

public void run() {

for (int i = 51; i <= 75; i++) {

firstHashMap.put(String.valueOf(i), String.valueOf(i));

}

}

});

Thread t4 = new Thread(new Runnable() {

@Override

public void run() {

for (int i = 76; i <= 100; i++) {

firstHashMap.put(String.valueOf(i), String.valueOf(i));

}

}

});

t1.start();

t2.start();

t3.start();

t4.start();

try {

Thread.currentThread().sleep(6000);

} catch (InterruptedException e1) {

// TODO Auto-generated catch block

e1.printStackTrace();

}

System.out.println(firstHashMap.size());

Iterator> iter = firstHashMap.entrySet().iterator();

while (iter.hasNext()) {

Entry e = iter.next();

System.out.println(e.getKey() + " " + e.getValue());

}

}

}

class Team {

private String name;

private int age;

private float factor;

public Team(String name, int age, float factor) {

this.name = name;

this.age = age;

this.factor = factor;

}

@Override

public boolean equals(Object obj) {

if (null == obj) {

return false;

}

if (!(obj instanceof Team)) {

return false;

}

Team t = (Team) obj;

if (null == name) {

if (t.name != null) {

return false;

}

} else {

if (!name.equals(t.name)) {

return false;

}

}

if (age != t.age) {

return false;

}

if (Float.floatToIntBits(factor) != Float.floatToIntBits(t.factor)) {

return false;

}

return true;

}

@Override

public int hashCode() {

int result = 1;

final int prime = 31;

result = result*prime + name == null ? 0 : name.hashCode();

result = result*prime + age;

result = result*prime + Float.floatToIntBits(factor);

return result;

}

@Override

public String toString() {

String ret = "";

ret = name + " " + age + " " + factor;

return ret;

}

}

上面threadTest函数的允许结果,最后的size大小是100,而且key和value都是一样的。

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值