TreeMap<K,V>的使用

来源:互联网 发布:php简单工厂模式 编辑:程序博客网 时间:2024/05/17 09:15


类 TreeMap<K,V>

public class TreeMap<K,V> extends AbstractMap<K,V>implements NavigableMap<K,V>, Cloneable, Serializable
 基于红黑树(Red-Black tree)的 NavigableMap 实现。 该映射根据其键的自然顺序进行排序, 或者根据创建映射时提供的 Comparator 进行排序,具体取决于使用的构造方法。  


 public TreeMap()
 使用键的自然顺序构造一个新的、空的树映射。 插入该映射的所有键都必须实现 Comparable 接口。 另外,所有这些键都必须是可互相比较的: 对于映射中的任意两个键 k1 和 k2,执行 k1.compareTo(k2) 都不得抛出 ClassCastException。 如果用户试图将违反此约束的键添加到映射中 (例如,用户试图将字符串键添加到键为整数的映射中), 则 put(Object key, Object value) 调用将抛出 ClassCastException。
  
public TreeMap(Comparator<? super K> comparator)
构造一个新的、空的树映射,该映射根据给定比较器进行排序。插入该映射的所有键都必须由给定比较器进行相互比较:对于映射中的任意两个键 k1 和 k2,执行 comparator.compare(k1, k2) 都不得抛出 ClassCastException。如果用户试图将违反此约束的键放入映射中,则 put(Object key, Object value) 调用将抛出 ClassCastException。 参数:comparator - 将用来对此映射进行排序的比较器。如果该参数为 null,则将使用键的自然顺序。

import java.util.Comparator;import java.util.TreeMap;import bean.Student;public class d {/** * TreeMap集合键是Student值是String的案例 */public static void main(String[] args) {// TODO Auto-generated method stubTreeMap<Student, String> tm = new TreeMap<>();tm.put(new Student("张三", 23), "北京");tm.put(new Student("李四", 13), "上海");tm.put(new Student("王五", 33), "广州");System.out.println(tm);//{Student [name=李四, age=13]=上海, //Student [name=张三, age=23]=北京,//Student [name=王五, age=33]=广州}TreeMap<Student, String> tm1 = new TreeMap<>(new Comparator<Student>() {@Overridepublic int compare(Student s1, Student s2) {int num = s1.getName().compareTo(s2.getName());//按照姓名比较return num == 0 ? s1.getAge() - s2.getAge() : num;}});tm1.put(new Student("张三", 23), "北京");tm1.put(new Student("李四", 13), "上海");tm1.put(new Student("王五", 33), "广州");System.out.println(tm1);/*{Student [name=张三, age=23]=北京, Student [name=李四, age=13]=上海, Student [name=王五, age=33]=广州}*/}}
附上student类

package bean;public class Student implements Comparable<Student> {String name;int age;public Student() {super();}public Student(String name, int age) {super();this.name = name;this.age = age;}public String getName() {return name;}public void setName(String name) {this.name = name;}public int getAge() {return age;}public void setAge(int age) {this.age = age;}@Overridepublic String toString() {return "Student [name=" + name + ", age=" + age + "]";}@Overridepublic int compareTo(Student obj) {// TODO Auto-generated method stub//return 0;//根元素为13 ,传入的为23,23这个对象调用 compareTo方法 23-13》0,在13的右边//return (this.age - obj.age);int num = this.age - obj.age;//age是主要判据//string里面重写了compareto方法,按字典顺序return num == 0 ? this.name.compareTo(obj.name) : num;}/* (non-Javadoc) * @see java.lang.Object#hashCode() */@Overridepublic int hashCode() {final int prime = 31;int result = 1;result = prime * result + age;result = prime * result + ((name == null) ? 0 : name.hashCode());return result;}/* (non-Javadoc) * @see java.lang.Object#equals(java.lang.Object) */@Overridepublic boolean equals(Object obj) {if (this == obj)return true;if (obj == null)return false;if (getClass() != obj.getClass())return false;Student other = (Student) obj;if (age != other.age)return false;if (name == null) {if (other.name != null)return false;} else if (!name.equals(other.name))return false;return true;}} 




0 0