02_List Set Map contains方法调用

对于集合List Set Map当调用其方法contains,是不是包含某元素时,会自动调用对象的equals方法,对于ArrayList只需要覆盖对象的equals即可,但对于Set Map,还需要覆盖对象的hashCode,不然得不到预期的结果

 

测试代码:

public class Name {

	private String firstName;
	private String lastName;
	
	public Name(String firstName, String lastName) {
		this.firstName = firstName;
		this.lastName = lastName;
	}

	@Override
	public boolean equals(Object obj) {
		Name name = (Name)obj;
System.out.println(name.firstName.equals(firstName)&&name.lastName.equals(lastName));	
		return name.firstName.equals(firstName)&&name.lastName.equals(lastName);
	}
	
	@Override
	public int hashCode() {
		return firstName.hashCode()*lastName.hashCode();
	}

}

 

public class TestContains {

	static void testHashSet(){
		Set s = new HashSet();
		Name name = new Name("hello","world");
		s.add(name);
		System.out.println(s.contains(new Name("hello","world")));
		//System.out.println(s.contains(name));
	}
	
	static void testHashMap(){
		Map map = new HashMap();
		Name name = new Name("hello","world");
		map.put(name, name);
		System.out.println(map.containsKey( new Name("hello","world")));
	}
	
	static void testArrayList(){
		List list = new ArrayList();
		Name name = new Name("hello","world");
		list.add(name);
		System.out.println(list.contains(new Name("hello","world")));
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		testArrayList();
		testHashSet();
		testHashMap();
	}

}
 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值