Collections工具类
package com.bjpowernode.javase.map;
import java.util.*;
public class CollectionsTest {
public static void main(String[] args) {
List<String> list = new ArrayList<>();
list.add("abf");
list.add("abx");
list.add("abc");
list.add("abe");
Collections.synchronizedList(list);
Collections.sort(list);
for(String s : list) {
System.out.println(s);
}
List<MyClass2> list2 = new ArrayList<>();
list2.add(new MyClass2(100));
list2.add(new MyClass2(200));
list2.add(new MyClass2(150));
Collections.sort(list2);
for(MyClass2 mc2 : list2) {
System.out.println(mc2);
}
Set<String> set = new HashSet<>();
set.add("abf");
set.add("abx");
set.add("abc");
set.add("abe");
List<String> myList = new ArrayList<>(set);
Collections.sort(myList);
for(String s : myList) {
System.out.println(s);
}
}
}
class MyClass2 implements Comparable<MyClass2>{
int age;
public MyClass2(int age) {
this.age = age;
}
@Override
public int compareTo(MyClass2 o) {
return this.age - o.age;
}
@Override
public String toString() {
StringBuilder builder = new StringBuilder();
builder.append("MyClass2 [age=").append(age).append("]");
return builder.toString();
}
}
集合复习
ArrayList
package com.bjpowernode.javase.review;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.LinkedList;
public class ArrayListTest {
public static void main(String[] args) {
LinkedList<String> list = new LinkedList<>();
list.add("zhangsan");
list.add("list");
list.add("wangwu");
String firstList = list.get(0);
System.out.println(firstList);
for(int i = 0; i < list.size(); i ++) {
System.out.println(list.get(i));
}
Iterator<String> it = list.iterator();
while(it.hasNext()) {
String s = it.next();
System.out.println(s);
}
for(String s : list) {
System.out.println(s);
}
}
}
HashSet
package com.bjpowernode.javase.review;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;
public class HashSetTest {
public static void main(String[] args) {
HashSet<String> hs = new HashSet<>();
hs.add("zhangsan");
hs.add("lisi");
hs.add("wangwu");
Iterator<String> it = hs.iterator();
while(it.hasNext()) {
System.out.println(it.next());
}
for(String s : hs) {
System.out.println(s);
}
hs.add("king");
hs.add("king");
hs.add("king");
System.out.println(hs.size());
Set<Student> students = new HashSet<>();
Student s1 = new Student(111, "zhangsan");
Student s2 = new Student(222, "lisi");
Student s3 = new Student(111, "zhangsan");
students.add(s1);
students.add(s2);
students.add(s3);
System.out.println(students.size());
for(Student stu : students) {
System.out.println(stu);
}
}
}
class Student{
int no;
String name;
public Student() {
super();
}
public Student(int no, String name) {
super();
this.no = no;
this.name = name;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((name == null) ? 0 : name.hashCode());
result = prime * result + no;
return result;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Student other = (Student) obj;
if (name == null) {
if (other.name != null)
return false;
} else if (!name.equals(other.name))
return false;
if (no != other.no)
return false;
return true;
}
@Override
public String toString() {
StringBuilder builder = new StringBuilder();
builder.append("Student [no=").append(no).append(", name=").append(name).append("]");
return builder.toString();
}
}
TreeSet
package com.bjpowernode.javase.review;
import java.util.Iterator;
import java.util.TreeSet;
import java.util.Comparator;
public class TreeSetTest {
public static void main(String[] args) {
TreeSet<Integer> ts = new TreeSet<>(new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) {
return o2 - o1;
}
});
ts.add(1);
ts.add(100);
ts.add(10);
ts.add(10);
ts.add(10);
ts.add(10);
ts.add(0);
Iterator<Integer> it = ts.iterator();
while(it.hasNext()) {
Integer i = it.next();
System.out.println(i);
}
for(Integer i : ts) {
System.out.println(i);
}
TreeSet<A> ts2 = new TreeSet<>();
ts2.add(new A(100));
ts2.add(new A(200));
ts2.add(new A(500));
ts2.add(new A(300));
ts2.add(new A(400));
ts2.add(new A(1000));
for(A a : ts2) {
System.out.println(a);
}
TreeSet<B> ts3 = new TreeSet<>(new Comparator<B>() {
@Override
public int compare(B o1, B o2) {
return o1.b - o2.b;
}
});
ts3.add(new B(500));
ts3.add(new B(100));
ts3.add(new B(200));
ts3.add(new B(600));
ts3.add(new B(300));
ts3.add(new B(50));
for(B b : ts3) {
System.out.println(b);
}
}
}
class A implements Comparable<A>{
int i;
public A(int i) {
super();
this.i = i;
}
@Override
public String toString() {
StringBuilder builder = new StringBuilder();
builder.append("A [i=").append(i).append("]");
return builder.toString();
}
@Override
public int compareTo(A o) {
return this.i - o.i;
}
}
class B{
int b;
public B(int b) {
super();
this.b = b;
}
@Override
public String toString() {
StringBuilder builder = new StringBuilder();
builder.append("B [b=").append(b).append("]");
return builder.toString();
}
}
HashMap
package com.bjpowernode.javase.review;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
public class HashMapTest {
public static void main(String[] args) {
Map<Integer, String> map = new HashMap<>();
map.put(1, "zhangsan");
map.put(2, "lisi");
map.put(3, "wangwu");
map.put(2, "king");
System.out.println(map.size());
System.out.println(map.get(2));
Set<Integer> keys = map.keySet();
for(Integer key : keys) {
System.out.println(key + "=" + map.get(key));
}
Set<Map.Entry<Integer, String>> set = map.entrySet();
for(Map.Entry<Integer, String> node : set) {
System.out.println(node.getKey() + "=" + node.getValue());
}
}
}
Properties
package com.bjpowernode.javase.review;
import java.util.Properties;
public class PropertiesTest {
public static void main(String[] args) {
Properties prop = new Properties();
prop.setProperty("username", "zhangsan");
prop.setProperty("password", "111");
System.out.println(prop.getProperty("username"));
System.out.println(prop.getProperty("password"));
}
}