Java 爪哇学习(五) 基础

Old代码

package x;

import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Properties;
import java.util.Set;

public class App {
    public static String name = "cat";
    public static void main(String[] args) {
        StringBuffer sb = new StringBuffer("AAAABBAAA");
        sb.append("ABC");
        sb.insert(3, "ED");
        sb.setCharAt(2,'c');
        sb.replace(2,4,"aa");


        //System/Runtime
        Properties properties = System.getProperties();
        System.out.println(properties);
        Set<String> propertyNames = properties.stringPropertyNames();
        for (String key:propertyNames){
            String  value = System.getProperty((key));
            System.out.println(value);
        }

        long startTime = System.currentTimeMillis();  //1970/1/1
        int n=1000000000;
        while(n-- == 0){
            n--;
        }
        System.out.println(System.currentTimeMillis()-startTime);


        ArrayList list =new ArrayList();
        list.add(333);
        list.add("dkjdk");

        list.forEach(obj -> System.out.println(obj));
        for (Object i : list){
            System.out.println(i);
        }
        
        
    }

}

Collection

Set 接口

TressSet HashSet

Hashset

⚠️：不允许重复–>?好像是用hashcode 判断。🉑️重写

TreeSet

Comparable 接口

CompareTo(Object)

⚠️：要自己实现 对应类 compareTo的方法 在Comparable 的接口中

排序

1.自然排序 Comparable - CompareTo

2.定制排序 和TreeSet关联 compare 🥉优先

TreeSet ts = new TreeSet();
ts.add(2);
ts.add(3);
ts.add(1);
System.out.println(ts);

//定制排序
TreeSet ts2 = new TreeSet((Object obj1,Object obj2)->{
    String s1 = (String) obj1;
    String s2 = (String) obj2;
    return s1.length() - s2.length();
});

Map–》HashMap

遍历

1.Iterator迭代器

2.forEach方法

 Set entrySet = map.keySet();
Iterator it = entrySet.iterator();
while(it.hasNext()){
  Object key = it.next();
  Object value = map.get(key);
  System.out.println(key+":"+value);
}


map.forEach((key,value)->{
  System.out.println(key+":"+value);
});

Map TreeMap

左子树 1

右子树 -1

Key1 < key2 -1. -->中序 递增

Key2 < Key1 -1 —>中序 递减

CustonPare

Properties 集合

  			 				Map

HashTable(线程安全) HashMap(不安全)

​ |

Properties集合

⚠️：读配置文件用的比较多

泛型

C++ 中:

template<T>

Class xxx<T>{

	T i;

}