1 files changed, 0 insertions, 206 deletions
diff --git a/bundles/org.eclipse.team.ui/src/org/eclipse/team/ui/sync/SyncInfoSet.java b/bundles/org.eclipse.team.ui/src/org/eclipse/team/ui/sync/SyncInfoSet.java
deleted file mode 100644
index b6daf1ce5..000000000
--- a/bundles/org.eclipse.team.ui/src/org/eclipse/team/ui/sync/SyncInfoSet.java
+++ /dev/null
@@ -1,206 +0,0 @@
-/*******************************************************************************
- * Copyright (c) 2000, 2003 IBM Corporation and others.
- * All rights reserved. This program and the accompanying materials 
- * are made available under the terms of the Common Public License v1.0
- * which accompanies this distribution, and is available at
- * http://www.eclipse.org/legal/cpl-v10.html
- * 
- * Contributors:
- *     IBM Corporation - initial API and implementation
- *******************************************************************************/
-package org.eclipse.team.ui.sync;
-
-import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.HashSet;
-import java.util.Iterator;
-import java.util.List;
-import java.util.Set;
-
-import org.eclipse.core.resources.IResource;
-import org.eclipse.team.core.subscribers.SyncInfo;
-
-public class SyncInfoSet {
-
-	Set set = new HashSet();
-	
-	public SyncInfoSet(SyncInfo[] resources) {
-		set.addAll(Arrays.asList(resources));
-	}
-	/**
-	 * Returns true if there are any conflicting nodes in the set, and
-	 * false otherwise.
-	 */
-	public boolean hasConflicts() {
-		return hasNodes(new SyncInfoDirectionFilter(SyncInfo.CONFLICTING));
-	}
-	
-	/**
-	 * Returns true if this sync set has incoming changes.
-	 * Note that conflicts are not considered to be incoming changes.
-	 */
-	public boolean hasIncomingChanges() {
-		return hasNodes(new SyncInfoDirectionFilter(SyncInfo.INCOMING));
-	}
-
-	/**
-	 * Returns true if this sync set has outgoing changes.
-	 * Note that conflicts are not considered to be outgoing changes.
-	 */
-	public boolean hasOutgoingChanges() {
-		return hasNodes(new SyncInfoDirectionFilter(SyncInfo.OUTGOING));
-	}
-	
-	/**
-	 * Returns true if this sync set has auto-mergeable conflicts.
-	 */
-	public boolean hasAutoMergeableConflicts() {
-		return hasNodes(new AutomergableFilter());
-	}
-	
-	/**
-	 * Removes all conflicting nodes from this set.
-	 */
-	public void removeConflictingNodes() {
-		rejectNodes(new SyncInfoDirectionFilter(SyncInfo.CONFLICTING));
-	}
-	/**
-	 * Removes all outgoing nodes from this set.
-	 */
-	public void removeOutgoingNodes() {
-		rejectNodes(new SyncInfoDirectionFilter(SyncInfo.OUTGOING));
-	}
-	/**
-	 * Removes all incoming nodes from this set.
-	 */
-	public void removeIncomingNodes() {
-		rejectNodes(new SyncInfoDirectionFilter(SyncInfo.INCOMING));
-	}
-	
-	/**
-	 * Removes all nodes from this set that are not auto-mergeable conflicts
-	 */
-	public void removeNonMergeableNodes() {
-		for (Iterator it = set.iterator(); it.hasNext();) {
-			SyncInfo node = (SyncInfo)it.next();
-			if ((node.getKind() & SyncInfo.MANUAL_CONFLICT) != 0) {
-				it.remove();
-			} else if ((node.getKind() & SyncInfo.DIRECTION_MASK) != SyncInfo.CONFLICTING) {
-				it.remove();
-			}
-		}
-	}
-
-	/**
-	 * Indicate whether the set has nodes matching the given filter
-	 */
-	public boolean hasNodes(SyncInfoFilter filter) {
-		for (Iterator it = set.iterator(); it.hasNext();) {
-			SyncInfo info = (SyncInfo)it.next();
-			if (info != null && filter.select(info)) {
-				return true;
-			}
-		}
-		return false;
-	}
-	
-	/**
-	 * Removes all nodes from this set that do not match the given filter
-	 */
-	public void selectNodes(SyncInfoFilter filter) {
-		for (Iterator it = set.iterator(); it.hasNext();) {
-			SyncInfo info = (SyncInfo)it.next();
-			if (info == null || !filter.select(info)) {
-				it.remove();
-			}
-		}
-	}
-	
-	/**
-	 * Removes all nodes from this set that match the given filter
-	 */
-	public void rejectNodes(SyncInfoFilter filter) {
-		for (Iterator it = set.iterator(); it.hasNext();) {
-			SyncInfo info = (SyncInfo)it.next();
-			if (info != null && filter.select(info)) {
-				it.remove();
-			}
-		}
-	}
-	
-	/**
-	 * Return all nodes in this set that match the given filter
-	 */
-	public SyncInfo[] getNodes(SyncInfoFilter filter) {
-		List result = new ArrayList();
-		for (Iterator it = set.iterator(); it.hasNext();) {
-			SyncInfo info = (SyncInfo)it.next();
-			if (info != null && filter.select(info)) {
-				result.add(info);
-			}
-		}
-		return (SyncInfo[]) result.toArray(new SyncInfo[result.size()]);
-	}
-	
-	public SyncInfo[] getSyncInfos() {
-		return (SyncInfo[]) set.toArray(new SyncInfo[set.size()]);
-	}
-	
-	/**
-	 * Returns the resources from all the nodes in this set.
-	 */
-	public IResource[] getResources() {
-		SyncInfo[] changed = getSyncInfos();
-		IResource[] resources = new IResource[changed.length];
-		for (int i = 0; i < changed.length; i++) {
-			resources[i] = changed[i].getLocal();
-		}
-		return resources;
-	}
-	
-	public boolean isEmpty() {
-		return set.isEmpty();
-	}
-	
-	public void removeResources(IResource[] resources) {
-		for (int i = 0; i < resources.length; i++) {
-			IResource resource = resources[i];
-			removeResource(resource);
-		}
-	}	
-
-	private void removeResource(IResource resource) {
-		for (Iterator it = set.iterator(); it.hasNext();) {
-			SyncInfo node = (SyncInfo)it.next();
-			if (node.getLocal().equals(resource)) {
-				it.remove();
-				// short-circuit the operation once a match is found
-				return;
-			}
-		}
-	}
-
-	public int size() {
-		return set.size();
-	}
-
-	public SyncInfo getNodeFor(IResource resource) {
-		for (Iterator it = set.iterator(); it.hasNext();) {
-			SyncInfo node = (SyncInfo)it.next();
-			if (node.getLocal().equals(resource)) {
-				return node;
-			}
-		}
-		return null;
-	}
-	
-	public void addAll(SyncInfoSet set) {
-		SyncInfo[] resources = set.getSyncInfos();
-		for (int i = 0; i < resources.length; i++) {
-			SyncInfo resource = resources[i];
-			this.set.add(resource);
-		}
-		
-	}
-}
-