1.hashset 让set集合去重复 TreeSet 自定义排序
package test2;
import java.util.*;
/**
hashset
让set集合去重复
TreeSet 自定义排序
*/
public class Demo11 {
public static void main(String[] args) {
Set<Student> stus = new HashSet<>();
Student s1 = new Student("小白",20,'男');
Student s2 = new Student("小红",21,'女');
Student s3 = new Student("小黑",21,'男');
Student s4 = new Student("小白",20,'男');
// System.out.println(s1.hashCode());
// System.out.println(s2.hashCode());
// System.out.println(s3.hashCode());
// System.out.println(s4.hashCode());
stus.add(s1);
stus.add(s2);
stus.add(s3);
stus.add(s4);
System.out.println(stus);
Set<Student> students = new TreeSet<>(); //ctrl+F6 快速改名快捷键
students.add(new Student("小白",20,'男'));
students.add(new Student("小黑",22,'男'));
students.add(new Student("小绿",21,'男'));
students.add(new Student("小蓝",22,'男'));
// Collections.sort(students,( o1, o2)-> Integer.compare(o1.getage(),o2.getage()));
System.out.println(students);
List<String> names = new ArrayList<>();
Collections.addAll(names,"小白","小黑","小兰"); //可变参数
System.out.println(names);
}
}
2.Map 类似字典
package test2;
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Set;
import java.util.function.BiConsumer;
/**
* Map 类似字典
* {key=value,...}
* put remove(key) void clear boolean containsKey(key) boolean containsValue(value) putAll(map)
* Set<key> keySet() 获取所以键的集合 V get(key) 根据键获取值
* lambda 遍历
*/
public class Demo12 {
public static void main(String[] args) {
Map<String,Integer> maps = new LinkedHashMap<>();
maps.put("xiaobai",180);
maps.put("xiaohong",160);
System.out.println(maps);
Set<String> keys = maps.keySet();
for (String key:keys) {
int value = maps.get(key);
System.out.println(key+":::"+value);
}
System.out.println("================ ===================");
}
}
3.不可变集合 -- stream流 -- 认识异常体系 -- 日志框架
package test2;
import java.io.FileInputStream;
import java.io.InputStream;
import java.text.SimpleDateFormat;
import java.util.*;
/**
* 不可变集合 -- stream流 -- 认识异常体系 -- 日志框架
*
*/
public class Demo13 {
public static void main(String[] args) {
List<Double> lists = List.of(560.3,541.1,570.9,590.3);//不可变集合
// lists.add(560.33);
System.out.println(lists);
Set<String> sets = Set.of("小红","小白","小黑","小绿","张强");
System.out.println("=============================================================");
List<String> names = new ArrayList<>();
Collections.addAll(names,"张无忌","张三丰","周芷若","赵敏");
System.out.println(names);
//
// List<String> zhang = new ArrayList<>();
// for (String name:names) {
// if (name.startsWith("张")) {
// zhang.add(name);
// }
// }
// System.out.println(zhang);
names.stream().filter(s -> s.startsWith("张")).filter(s->s.length() == 3).forEach(s -> System.out.println(s));
System.out.println("================================================================");
System.out.println("程序开始");
try {
parseTime("2001-01-01 11:11:11");
System.out.println("操作成功");
}catch (Exception e){
e.printStackTrace();
System.out.println("操作失败");
}
System.out.println("结束");
}
private static void parseTime(String date) throws Exception{
SimpleDateFormat sdf = new SimpleDateFormat("yyyy-MM-dd HH:mm:ss");
Date d = sdf.parse(date);
System.out.println(d);
InputStream is = new FileInputStream("D:/meinv.jpg");
}
}