Professional Documents
Culture Documents
Collections
Collections
Scanner;
// import java.util.function.*;
import java.util.List;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Vector;
import java.util.Deque;
import java.util.Queue;
import java.util.PriorityQueue;
import java.util.Stack;
import java.util.Set;
import java.util.HashSet;
import java.util.SortedSet;
import java.util.TreeSet;
import java.util.Map;
import java.util.HashMap;
import java.util.TreeMap;
// arrList.remove(1);
// // arrList.addAll(arrList1);
// // arrList.lastIndexOf(arrList);
// System.out.println(arrList.indexOf("Micah") + " index of Micah");
// System.out.println(arrList.size() + " size of List");
// arrList.forEach(n -> System.out.println(n));
// Iterator it = arrList.iterator();
// while (it.hasNext()) {
// if (arrList.contains("Bryan"))
// System.out.println(it.next());
// }
// Stack<String> stackList = new Stack<String>();
// stackList.add("Jack");
// stackList.add(1, "Jack");
// stackList.push("Queen");
// stackList.push("King");
// stackList.push("Ace");
// stackList.pop();
// System.out.println(stackList.peek());
// stackList.forEach(n -> System.out.println(n));
System.out.println(set.size());
set.forEach(n -> System.out.println(n));
System.out.println("");
SortedSet<String> treeset = new TreeSet<String>();
treeset.add("Vern");
treeset.add("vern");
treeset.add("Bryan");
treeset.add("bryan");