Collection c = m.values(); for (Iterator iter = c.iterator(); iter.hasNext();) {
Collection beanCollection = new TreeSet(getACEBeanComparator()); beanCollection.addAll(m.values());   for (Iterator iter = beanCollection.iterator(); iter.hasNext();) {
	protected Collection getACEBeans(List l,String path) {		Map m = new TreeMap();		if(l!=null){			for (Iterator iter = l.iterator(); iter.hasNext();) {				AccessControlEntry ace = (AccessControlEntry) iter.next();				ACEBean bean = (ACEBean) m.get(ace.getPrincipal());				if(bean == null){					bean = new ACEBean(ace);					m.put(ace.getPrincipal(),bean);				} else {					if(ace.isNegative()){						bean.setNegativeAccessControlEntry(ace);					} else {						bean.setPositiveAccessControlEntry(ace);					}				}			}		}				Collection c = m.values();		for (Iterator iter = c.iterator(); iter.hasNext();) {			ACEBean aBean = (ACEBean) iter.next();			if(!aBean.hasNegativeAccessControlEntry()){				AccessControlEntry theOtherAce = aBean.getPositiveAccessControlEntry();				AccessControlEntry thisAce = new AccessControlEntry(theOtherAce.getPrincipal(),true,false,false,null,theOtherAce.getPrincipalType());				currentList.add(thisAce);				aBean.setNegativeAccessControlEntry(thisAce);			} else if(!aBean.hasPositiveAccessControlEntry()){				AccessControlEntry theOtherAce = aBean.getNegativeAccessControlEntry();				AccessControlEntry thisAce = new AccessControlEntry(theOtherAce.getPrincipal(),false,false,false,null,theOtherAce.getPrincipalType());				currentList.add(thisAce);				aBean.setPositiveAccessControlEntry(thisAce);			}		}				return m.values();	}