快速业务通道

Java:比较与排序 - 编程入门网

作者 佚名技术 来源 NET编程 浏览 发布时间 2012-06-18
20{Jeff A}, 30{Mary A}, 20{Ada B}, 40{Walton B}, 61{Peter B}, 20{Bush B}] [20{Ada B}, 20{Bush B}, 20{Jeff A}, 30{Mary A}, 61{Peter B}, 20{Tom A}, 40{Walton B}] [20{Jeff A}, 30{Mary A}, 20{Tom A}, 20{Ada B}, 20{Bush B}, 61{Peter B}, 40{Walton B}]

3.3 测试TreeSet

TreeSetUnit.java

package com.zj.sort.comparator; import java.util.TreeSet; public class TreeSetUnit {   public static void main(String[] args) {     TreeSet<Person> firstNameSet = new TreeSet<Person>(        new FirstNameComparator());     firstNameSet.add(new Person(20, "Tom", "A"));     firstNameSet.add(new Person(20, "Jeff", "A"));     firstNameSet.add(new Person(30, "Mary", "A"));     firstNameSet.add(new Person(20, "Ada", "B"));     firstNameSet.add(new Person(40, "Walton", "B"));     firstNameSet.add(new Person(61, "Peter", "B"));     firstNameSet.add(new Person(20, "Bush", "B"));     System.out.println(firstNameSet);     TreeSet<Person> lastNameSet = new TreeSet<Person>(        new LastNameComparator());     lastNameSet.addAll(firstNameSet);     System.out.println(lastNameSet);   } }

结果:

[20{Ada B}, 20{Bush B}, 20{Jeff A}, 30{Mary A}, 61{Peter B}, 20{Tom A}, 40{Walton B}] [20{Jeff A}, 30{Mary A}, 20{Tom A}, 20{Ada B}, 20{Bush B}, 61{Peter B}, 40{Walton B}]

Java:±è??ó???Dò(6)

ê±??:2011-02-25 zhangjunhd

3.4 2aê?TreeMap

TreeMapUnit.java

package com.zj.sort.comparator; import java.util.TreeMap; public class TreeMapUnit { ????public static void main(String[] args) { ?????? TreeMap<Person, String> firstNameMap = new TreeMap<Person, String>( ??????????????new FirstNameComparator()); ?????? firstNameMap.put(new Person(20, "Tom", "A"), "Tom A"); ?????? firstNameMap.put(new Person(20, "Jeff", "A"), "Jeff A"); ?????? firstNameMap.put(new Person(30, "Mary", "A"), "Mary A"); ?????? firstNameMap.put(new Person(20, "Ada", "B"), "Ada B"); ?????? firstNameMap.put(new Person(40, "Walton", "B"), "Walton B"); ?????? firstNameMap.put(new Person(61, "Peter", "B"), "Peter B"); ?????? firstNameMap.put(new Person(20, "Bush", "B"), "Bush B"); ?????? System.out.println(firstNameMap); ?????? TreeMap<Person, String> lastNameMap = new TreeMap<Person, String>( ??????????????new LastNameComparator()); ?????? lastNameMap.putAll(firstNameMap); ?????? System.out.println(lastNameMap); ????} }

?á1?£o

{20{Ada B}=Ada B, 20{Bush B}=Bush B, 20{Jeff A}=Jeff A, 30{Mary A}=Mary A, 61{Peter B}=Peter B, 20{Tom A}=Tom A, 40{Walton B}=Walton B} {20{Jeff A}=Jeff A, 30{Mary A}=Mary A, 20{Tom A}=Tom A, 20{Ada B}=Ada B, 20{Bush B}=Bush B, 61{Peter B}=Peter B, 40{

凌众科技专业提供服务器租用、服务器托管、企业邮局、虚拟主机等服务,公司网站:http://www.lingzhong.cn 为了给广大客户了解更多的技术信息,本技术文章收集来源于网络,凌众科技尊重文章作者的版权,如果有涉及你的版权有必要删除你的文章,请和我们联系。以上信息与文章正文是不可分割的一部分,如果您要转载本文章,请保留以上信息,谢谢!

分享到: 更多

Copyright ©1999-2011 厦门凌众科技有限公司 厦门优通互联科技开发有限公司 All rights reserved

地址(ADD):厦门软件园二期望海路63号701E(东南融通旁) 邮编(ZIP):361008

电话:0592-5908028 传真:0592-5908039 咨询信箱:web@lingzhong.cn 咨询OICQ:173723134

《中华人民共和国增值电信业务经营许可证》闽B2-20100024  ICP备案:闽ICP备05037997号