对象比较

package com.zj.sort.comparable; public class Person implements Comparable<person> { private int age; private String name; public Person(int age,String name){ this.age=age; this.name=name; } public int compareTo(Person person) { int cop=age-person.getAge(); if(cop!=0) return cop; else return name.compareTo(person.getName()); } public int getAge() { return age; } public void setAge(int age) { this.age = age; } public String getName() { return name; } public void setName(String name) { this.name = name; } public int hashCode(){ int result=17; result=37*result+age; result=37*result+name.hashCode(); return result; } public boolean equals(Object o){ if(!(o instanceof Person)) return false; Person person=(Person)o; return (age==person.age)&&(name.equals(person.name)); } public String toString(){ return (age+"{"+name+"}"); } } /* * 测试Arrays.sort()方法 */ package com.zj.sort.comparable; import java.util.Arrays; public class ArraysSortUnit { public static void main(String args[]){ Person[]ps={new Person(20,"Tom"),new Person(20,"Jeff"), new Person(30,"Mary"),new Person(20,"Ada"), new Person(40,"Walton"),new Person(61,"Peter"), new Person(20,"Bush")}; System.out.println(Arrays.toString(ps)); Arrays.sort(ps); System.out.println(Arrays.toString(ps)); } } /* * 测试Collections.sort()方法 */ package com.zj.sort.comparable; import java.util.Collections; import java.util.Arrays; public class CollctionsSortUnit { public static void main(String args[]){ Person[]ps={new Person(20,"Tom"), new Person(20,"Jeff"),new Person(30,"Mary"), new Person(20,"Ada"),new Person(40,"Walton"), new Person(61,"Peter"),new Person(20,"Bush") }; System.out.println(Arrays.toString(ps)); Collections.sort(Arrays.asList(ps)); System.out.println(Arrays.toString(ps)); } } /* * TreeMap测试 */ package com.zj.sort.comparable; import java.util.TreeMap; public class TreeMapUnit { public static void main(String args[]){ TreeMap<person,string> map=new TreeMap<person,string>(); map.put(new Person(20,"Tom"), "Tom"); map.put( new Person(20, "Jeff" ), "Jeff" ); map.put( new Person(30, "Mary" ), "Mary" ); map.put( new Person(20, "Ada" ), "Ada" ); map.put( new Person(40, "Walton" ), "Walton" ); map.put( new Person(61, "Peter" ), "Peter" ); map.put( new Person(20, "Bush" ), "Bush" ); System. out .println(map); } } /* * TreeSet测试 */ package com.zj.sort.comparable; import java.util.TreeSet; public class TreeSetUnit { public static void main(String args[]){ TreeSet<person> set=new TreeSet<person>(); set.add(new Person(20,"Tom")); set.add(new Person(20,"Jeff")); set.add(new Person(30,"Mary")); set.add(new Person(20,"Ada")); set.add(new Person(40,"Walton")); set.add(new Person(61,"Peter")); set.add(new Person(20,"Bush")); System.out.println(set); } }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值