TreeSet、ArrayList、HashMap

package com.exception;

import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;

public class TreeSetDemo {
	public static void main(String[] args){
		TreeSet<Person> ts=new TreeSet(new MyComparator());
		ts.add(new Person("1",20));
		ts.add(new Person("2",80));
		ts.add(new Person("3",60));
		ts.add(new Person("4",10));
		
		Iterator<Person> it=ts.iterator();
		while(it.hasNext()){
			Person p=it.next();
			System.out.println(p.getName()+"--"+p.getAge());
		}
		
	}

}
class Person {
//implements Comparable{    //第一种方式，在类中实现Compaeable接口  实现它的排序方法
	 
	private String name;
	private int age;
	Person p;
	
	public Person(String name,int age){
		this.name=name;
		this.age=age;
		
	}
	
	public void setName(String name) {
		this.name = name;
	}
	public String getName() {
		return name;
	}
	public void setAge(int age) {
		this.age = age;
	}
	public int getAge() {
		return age;
	}
	

	
	public int compareTo(Object o) {
		// TODO Auto-generated method stub
		p=(Person)o;
		if(this.age>p.age) return 1;
		else if(this.age==p.age) return 0;
		else return -1;
	}
}
class MyComparator implements Comparator<Person>{  //第二种方法，建立这个类，把MyComparator 作为参数传进TreeSet里边去


	@Override
	public int compare(Person o1, Person o2) {
		// TODO Auto-generated method stub
		if(o1.getAge()>o2.getAge()) return 1;
		else if(o1.getAge()==o2.getAge()) return 0;
		else return -1;
	}
	
}

package com.exception;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;

public class ListDemo {
	public static  void main(String[] args){
		List<Person> list =new ArrayList();
		list.add(new Person("1",28));
		list.add(new Person("2",15));
		list.add(new Person("3",42));
		list.add(new Person("4",10));
		readAll(list);
		// 比较器和Person类都在TreeSetDemo中
		Collections.sort(list);//如果Person类可比较（实现了compareable接口） 就可以直接比较
		Collections.sort(list,new MyComparator());//如果不可比较。就可以用自己的比较器来比较它
		
		System.out.println("-----------------------------------");
		readAll(list);
		System.out.println( "最大值--------------------"+Collections.max(list).getAge());
		
		Collections.swap(list, 2, 3);//交换顺序
		System.out.println("交换顺序以后-------------------------");
		readAll(list);
		System.out.println("随机以后--------------------------------");
		Collections.shuffle(list);
		readAll(list);
		System.out.println("反转顺序以后--------------------------------");
		Collections.reverse(list);
		readAll(list);
		
		
		
	}
	public static<T extends List> void readAll(T list){
		Iterator it=list.iterator();
		while(it.hasNext()){
			Person p= (Person) it.next();
			System.out.println(p.getName()+"--"+p.getAge());
		}
	}

}

package com.exception;

import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.TreeMap;

public class MapDemo {
	public static void main(String[] args){
		Map<String,String> map=new TreeMap();
		map.put("one", "123");
		map.put("three", "zxc");
		map.put("two", "asd");
		
		
		
		/*
		Set<String> keySet=map.keySet();
		Iterator<String > it=keySet.iterator();
		while(it.hasNext()){
			String key=it.next();
			String value=map.get(key);
			System.out.println(key+"--"+value);
		}
		*/
		
		/*
		 * 第二种常用迭代方法。
		 */
		Set<Map.Entry<String,String>> entry =map.entrySet();
		Iterator<Map.Entry<String,String>> ite= entry.iterator();
		while(ite.hasNext()){
			Entry<String, String>  me=ite.next();
			System.out.println(me.getKey()+"--"+me.getValue());
			
		}
		
	}

}