【Java开源代码栏目提醒】:网学会员,鉴于大家对Java开源代码十分关注,论文会员在此为大家搜集整理了“CollectionsDemo2.java”一文,供大家参考学习!
package chapter9;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
public class CollectionsDemo2 {
public static void main(String[] args) {
double array[] = { 111, 111, 23, 456, 231 };
List list = new ArrayList();
List li = new ArrayList();
//initial list
for (int i = 0; i < array.length; i++) {
list.add(new Double(array[i]));
}
//initial li
double arr[] = { 111 };
for (int j = 0; j < arr.length; j++) {
li.add(new Double(arr[j]));
}
//add array2 to list and li
double array2[] = { 112, 111, 23, 456, 231 };
for (int i = 0; i < array.length; i++) {
list.add(new Double(array2[i]));
li.add(new Double(array2[i]));
}
//print li and list
System.out.println("\nthe li is :");
for (int i = 0; i < li.size(); i++) {
System.out.print(li.get(i)+"||");
}
System.out.println("\nthe list is :");
for (int i = 0; i < list.size(); i++) {
System.out.print(list.get(i)+"||");
}
//混排(shuffle)
System.out.println("\nthe shuffle order of list :");
Collections.shuffle(list);
for (int i = 0; i < list.size(); i++) {
System.out.print(list.get(i)+"||");
}
//排序(sort)
System.out.println("\nthe ordered list is :");
Collections.sort(list);
for (int i = 0; i < list.size(); i++) {
System.out.print(list.get(i)+"||");
}
//反转
System.out.println("\nthe reverse order of the li is :");
Collections.reverse(li);
for (int i = 0; i < li.size(); i++) {
System.out.print(li.get(i)+"||");
}
//移动所有元素
System.out.println("\nthe new order of the li is :");
Collections.rotate(li, -1);
for (int i = 0; i < li.size(); i++) {
System.out.print(li.get(i)+"||");
}
// 替换所有元素
System.out.println("\nthe new li is :");
Collections.fill(li, new Double(2.2));
for (int i = 0; i < li.size(); i++) {
System.out.print(li.get(i)+"||");
}
}
}