OOP nikva ideq

import java.util.Iterator;
import java.util.List;
import java.util.SortedSet;
import java.util.TreeSet;

public class RectangleCollection {
	private SortedSet<ColorRectangle>rects = new TreeSet<ColorRectangle>();

	public ColorRectangle calcUnionColl() {
		ColorRectangle r=new ColorRectangle();
		for(Iterator<ColorRectangle> it = rects.iterator(); it.hasNext();) {
			ColorRectangle current = it.next();
			r = r.unionRect(current);
		}
	return r;}

public List<ColorRectangle>reverseList(){
	List<ColorRectangle>list1=new ArrayList<ColorRectangle>(rects);
	List<ColorRectangle>reversed=new ArrayList<ColorRectangle>();
	for(ListIterator<ColorRectangle>it=list1.listIterator(list1.size()); it.hasPrevious();) {
		reversed.add(it.previous());}
	return reversed;}
}