【无标题】

package week2.shixun0129;

import org.junit.Test;

import java.util.*;

public class CollectionTest {

    @Test
    public void coectionTest(){
        //接口类型的引用指向实现的对象，行成多态
        Collection collection = new ArrayList();
        //[]
        System.out.println(collection);
        //向集合中添加元素,该方法的形参要求是Object类型
        //[one]
        boolean b = collection.add("one");
        //ture
        System.out.println("b = "+ b);
        //[one, 2]
        collection.add(2);
        //[one, 2, a]
        collection.add('a');
        //[one, 2, a, 3.14]
        collection.add(3.14);
        //[one, 2, a, 3.14, 永远永远]
        collection.add("永远永远");
        System.out.println(collection);
        System.out.println("------------------");
        //判断是否包含对象
        b = collection.contains("two");
        //false
        System.out.println("b = "+ b);
        b = collection.contains("one");
        //true
        System.out.println("b = "+ b);
        //判断集合是否为空
        b = collection.isEmpty();
        //false
        System.out.println("b = "+ b);
        System.out.println("==================");
        System.out.println("集合中的元素有："+collection);
        b = collection.remove("one");
        //true
        System.out.println("b = "+ b);
        System.out.println("集合中的元素有："+collection);
        System.out.println("==================");
        //将集合转换成数组
        Object[] objects = collection.toArray( );
        //遍历数组中的元素
        for (int i = 0; i < objects.length; i++){
            System.out.println(objects[i]);
        }
        //将数组转换成集合
        List objects1 = Arrays.asList(objects);
        System.out.println(objects1);
        System.out.println("------------------");
        //迭代器，遍历集合中的元素
        Iterator it = objects1.iterator();
//        b = it.hasNext();
//        //true
//        System.out.println("b = "+ b);
//        Object obj = it.next();
//        System.out.println("元素：" + obj);
        while (it.hasNext() == true){
            Object obj = it.next();
            System.out.println(obj);
        }
        System.out.println("===================");
        //遍历集合中的元素,方法三
        for (Object o : objects1){
            System.out.println(o);
        }
    }
    @Test
    public void ListTest(){
        List list = new ArrayList();
        int size = list.size();
        System.out.println(size);
        System.out.println(list);
        //向集合中添加元素
        list.add(0,"one");
        list.add(1,2);
        list.add(2,'3');
        list.add(3,3.14);
        System.out.println(list);
        List list1 = new ArrayList();
        list1.add("two");
        list1.add(10);
        list.addAll(list1);
        System.out.println(list);
        System.out.println("-------------");
        //根据下标查看集合中指定位置的元素
        Object o = list.get(3);
        System.out.println(o);
        //根据下标修改集合中指定位置的元素
        o = list.set(0,1);
        System.out.println("下标为e的位置修改为:" +o);
        System.out.println(list);
        //根据下标删除集合指定位置的元素
        o = list.remove(0);
        System.out.println("删除的元素为：" + o);
        System.out.println("==================");
        System.out.println(list);
        List list2 = list.subList(0,3);
        System.out.println("list集合：" + list);
        System.out.println("子集合中的元素：" + list2);
        //list2.remove(0);
        List sublist = new ArrayList(list2);
        sublist.remove(0);
        list2 = sublist;
        System.out.println("list集合：" + list);
        System.out.println("子集合中的元素：" + list2);
    }
    @Test
    public void collectionTest02(){
        Collection<String> collection = new ArrayList<>();
        collection.add("AA");
        collection.add("BB");
        collection.add("CC");
        collection.add("DD");
        System.out.println(collection);
    }
    @Test
    public void queueTest(){
        // 准备一个Queue集合，
        Queue<Integer> queue = new LinkedList<>();
        //将数据11、22、33、44、55依次入队并打印,
        for (int i = 1; i <= 5; i++){
            queue.offer(i*11);
            System.out.println(queue);
        }
        //然后查看队首元素并打印
        Integer it = queue.peek();
        System.out.println("队首元素：" + it);
        //然后将队列中所有数据依次出队并打印。
        int len = queue.size();
        for (int i = 1; i <= len; i++){
            Integer it1 = queue.poll();
            System.out.println(it1);
        }
    }
}