TreeMap是可以保存键值对的一种方式,它的特殊之处是它可以自动以键进行升序排序。
下面举例说明它的用法。
首先定义一个实体类Person,有name和age属性:
- public class Person {
- private String name;
- private int age;
- public Person(String name, int age) {
- this.name = name;
- this.age = age;
- }
- public String getName() {
- return this.name;
- }
- public int getAge() {
- return this.age;
- }
- }
举例使用TreeMap的test类:
- import java.util.Iterator;
- import java.util.Map.Entry;
- import java.util.Set;
- import java.util.TreeMap;
- public class test {
- public static void main(String[] args) {
- TreeMap<Long, Object> treeMap = new TreeMap<Long, Object>();
- treeMap.put((long) 1, new Person("Json", 20));
- treeMap.put((long) 8, new Person("Peter", 22));
- treeMap.put((long) 9, new Person("Divid", 25));
- treeMap.put((long) 6, new Person("Aglia", 22));
- // Get a set of entries
- Set<Entry<Long, Object>> set = treeMap.entrySet();
- // Get an iterator
- Iterator<Entry<Long, Object>> iterator = set.iterator();
- // Display elements
- while (iterator.hasNext()) {
- Entry<?, ?> entry = (Entry<?, ?>) iterator.next();
- System.out.println(((Person)entry.getValue()).getName());
- }
- }
- }
控制台运行结果:
可以看出打印出来的是经过键升序排序的。这里的键可以是Integer,String等类型,默认按照升序进行排列。
原文链接:
http://blog.csdn.net/cangkukuaimanle/article/details/6882724