7.27作业

package test;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Set;

public class Books {
    String id; // 编号
    String name; // 名称
    double price; // 价格
    String press; // 出版社
    // 全参构造方法
 
    public Books(String id, String name, double price, String press) {
        super();
        this.id = id;
        this.name = name;
        this.price = price;
        this.press = press;
    }
 
    // 重写toString()
    @Override
    public String toString() {
        return "Books [id=" + id + ", name=" + name + ", price=" + price + ", press=" + press + "]";
    }
 
    public static void main(String[] args) {
        // new5个图书对象
        Books b1 = new Books("001", "第1本书", 55.8, "第1出版社");
        Books b2 = new Books("002", "第2本书", 49.9, "第2出版社");
        Books b3 = new Books("003", "第3本书", 55.0, "第3出版社");
        Books b4 = new Books("004", "第4本书", 48.5, "第4出版社");
        Books b5 = new Books("005", "第5本书", 55.8, "第5出版社");
        Books b6 = new Books("006", "第6本书", 53.6, "第6出版社");
 
        // new一个List对象
        List<Books> l = new ArrayList<Books>();
        // 添加图书对象到l
        l.add(b1);
        l.add(b2);
        l.add(b3);
        l.add(b4);
        l.add(b5);
        l.add(b6);
        // 遍历输出
        for (Books s : l) {
            System.out.println(s);
        }
        System.out.println("======================================================");
        // new一个HashMap对象
        HashMap<String, Books> hm = new HashMap<String, Books>();
        // 以编号做为key添加图书对象到hm
        hm.put(b1.id, b1);
        hm.put(b2.id, b2);
        hm.put(b3.id, b3);
        hm.put(b4.id, b4);
        hm.put(b5.id, b5);
        hm.put(b6.id, b6);
        // 获得所有key
        Set<String> ss = hm.keySet();
        // 遍历输出
        for (String s : ss) {
            System.out.println(hm.get(s));
        }
    }
}

package test;

import java.util.HashSet;
import java.util.Set;
import java.util.TreeSet;
import bean.TestSet;

public class TestSett {
    public static void main(String[] args) {    
        TestSet b1 = new TestSet(1994, "b1", 15.5, "wty");
        TestSet b1 = new TestSet(1994, "b1", 30, "wty");
        TestSet b2 = new TestSet(1994, "b2", 50, "wty");
        TestSet b3 = new TestSet(1993, "b3", 15.5, "wty");
        TestSet b4 = new TestSet(1992, "b4", 15.5, "wty");
        TestSet b5 = new TestSet(1991, "b5", 50, "wty1");
            //使用HashSet存储图书并遍历
            Set<TestSet> hashSet = new HashSet<TestSet>();
                hashSet.add(b1);
                hashSet.add(b1);
                hashSet.add(b2);
                hashSet.add(b3);
                hashSet.add(b4);
                hashSet.add(b5);
                hashSet.add(b1_1);
                System.out.println("遍历输出hashset");
                System.out.println(hashSet.size());
            
                for(TestSet book:hashSet){
                    System.out.println(book.toString());
                }
                //使用TreeSet存储图书并遍历
                Set<TestSet> treeSet = new TreeSet<TestSet>();
                treeSet.add(b1);
                treeSet.add(b1);
                treeSet.add(b2);
                treeSet.add(b3);
                treeSet.add(b4);
                treeSet.add(b5);
                treeSet.add(b1_1);    
                System.out.println("遍历输出treeset");
                System.out.println(treeSet.size());
                for(TestSet book:treeSet){
                    System.out.println(book.toString());
                }
        }
}


package bean;

public class TestSet implements Comparable<TestSet> {
    public int id;
    public String name;
    public double price;
    public String press;
    public TestSet() {
        super();
    }
    public TestSet(int id, String name, double price, String press) {
        super();
        this.id = id;
        this.name = name;
        this.price = price;
        this.press = press;
    }
    public int compareTo(TestSet o) {
        return this.id-o.id;
    }
    @Override
    public int hashCode() {
        final int prime = 31;
        int result = 1;
        result = prime * result + id;
        result = prime * result + ((name == null) ? 0 : name.hashCode());
        result = prime * result + ((press == null) ? 0 : press.hashCode());
        long temp;
        temp = Double.doubleToLongBits(price);
        result = prime * result + (int) (temp ^ (temp >>> 32));
        return result;
    }
    @Override
    public boolean equals(Object obj) {
        if (this == obj)
            return true;
        if (obj == null)
            return false;
        if (getClass() != obj.getClass())
            return false;
        TestSet other = (TestSet) obj;
        if (id != other.id)
            return false;
        if (name == null) {
            if (other.name != null)
                return false;
        } else if (!name.equals(other.name))
            return false;
        if (press == null) {
            if (other.press != null)
                return false;
        } else if (!press.equals(other.press))
            return false;
        if (Double.doubleToLongBits(price) != Double.doubleToLongBits(other.price))
            return false;
        return true;
    }
    @Override
    public String toString() {
        return "Book [id=" + id + ", name=" + name + ", press=" + press+ ", price=" + price + "]";
    }    
}

package test;

import java.util.HashMap;
import java.util.Map;

    public class Email {
        public static void main(String[] args) {
            String str = "aa@sohu.com,bb@163.com,cc@sina.com";
            System.out.println(str);
            //得到每一个email
            String strs[] = str.split(",");
            //存放分离后email的信息
            Map<String,String> emailMap = new HashMap<String, String>();
            for(String email:strs){
                String temp[] = email.split("@");
                //分割email存入map
                emailMap.put(temp[0], temp[1]);
            }
            System.out.println(emailMap.toString());
        }
}