TestCh19_Jim

// Jim Herrero - CH19TESTimport java.util.Collection; import java.util.Set;import java.util.TreeSet; import java.util.List;import java.util.Queue; import java.util.Stack;import java.util.LinkedList;public class test{  public Set<Integer> intersect(Collection<Integer> c1, Collection<Integer> c2)  {    TreeSet<Integer> set = new TreeSet<Integer>();    for(Integer i:c1)      if(c2.contains(i))        set.add(i);    return set;  }  public void printReverse(List<Object> list)  { //not sure if this is how it should be done. prolly not.    String temp = "";    for(Object o:list)      temp = o.toString() + "\n\r" + temp;    System.out.println(temp);  }  public void removeConsecDuplicates(List<String> list)  {    String prev = "";    int i = 0;    for(String s:list)    {      if(s.equals(prev))        list.remove(i);      prev = s;      i++;    }  }  public Queue<Integer> reverseChunks(Queue<Integer> q)  {    Stack<Integer> stk = new Stack<Integer>();    Queue<Integer> ret = new LinkedList<Integer>();    Integer i;    for(i = q.remove(); i != null; i = q.poll())    {      if(!stk.isEmpty() && stk.peek() > i)        while(!stk.isEmpty())          ret.offer(stk.pop());      stk.push(i);    }    while(!stk.isEmpty())      ret.offer(stk.pop());    return ret;  }}