/******************************************************************************* * Copyright (c) 2008, 2015 Matthew Hall and others. * All rights reserved. This program and the accompanying materials * are made available under the terms of the Eclipse Public License v1.0 * which accompanies this distribution, and is available at * http://www.eclipse.org/legal/epl-v10.html * * Contributors: * Matthew Hall - initial API and implementation (bug 215531) * Matthew Hall - bug 124684 * (through ViewerElementSet.java) * Matthew Hall - bugs 262269, 303847 ******************************************************************************/ package org.eclipse.core.internal.databinding; import java.lang.reflect.Array; import java.util.Collection; import java.util.HashSet; import java.util.Iterator; import java.util.Set; /** * A {@link Set} of elements where elements are added, removed and compared by * identity. Elements of the set are compared using <code>==</code> instead of * {@link #equals(Object)}. * <p> * This class is <i>not</i> a strict implementation the {@link Set} interface. * It intentionally violates the {@link Set} contract, which requires the use of * {@link #equals(Object)} when comparing elements. * * @since 1.2 */ public class IdentitySet implements Set { private final Set wrappedSet; /** * Constructs an IdentitySet. */ public IdentitySet() { this.wrappedSet = new HashSet(); } /** * Constructs an IdentitySet containing all the unique instances in the * specified collection. * * @param collection * the collection whose elements are to be added to this set. */ public IdentitySet(Collection collection) { this(); addAll(collection); } @Override public boolean add(Object o) { return wrappedSet.add(IdentityWrapper.wrap(o)); } @Override public boolean addAll(Collection c) { boolean changed = false; for (Iterator iterator = c.iterator(); iterator.hasNext();) changed |= wrappedSet.add(IdentityWrapper.wrap(iterator.next())); return changed; } @Override public void clear() { wrappedSet.clear(); } @Override public boolean contains(Object o) { return wrappedSet.contains(IdentityWrapper.wrap(o)); } @Override public boolean containsAll(Collection c) { for (Iterator iterator = c.iterator(); iterator.hasNext();) if (!wrappedSet.contains(IdentityWrapper.wrap(iterator.next()))) return false; return true; } @Override public boolean isEmpty() { return wrappedSet.isEmpty(); } @Override public Iterator iterator() { final Iterator wrappedIterator = wrappedSet.iterator(); return new Iterator() { @Override public boolean hasNext() { return wrappedIterator.hasNext(); } @Override public Object next() { return ((IdentityWrapper) wrappedIterator.next()).unwrap(); } @Override public void remove() { wrappedIterator.remove(); } }; } @Override public boolean remove(Object o) { return wrappedSet.remove(IdentityWrapper.wrap(o)); } @Override public boolean removeAll(Collection c) { boolean changed = false; for (Iterator iterator = c.iterator(); iterator.hasNext();) changed |= remove(iterator.next()); return changed; } @Override public boolean retainAll(Collection c) { // Have to do this the slow way to ensure correct comparisons. i.e. // cannot delegate to c.contains(it) since we can't be sure will // compare elements the way we want. boolean changed = false; Object[] retainAll = c.toArray(); outer: for (Iterator iterator = iterator(); iterator.hasNext();) { Object element = iterator.next(); for (int i = 0; i < retainAll.length; i++) { if (element == retainAll[i]) { continue outer; } } iterator.remove(); changed = true; } return changed; } @Override public int size() { return wrappedSet.size(); } @Override public Object[] toArray() { return toArray(new Object[wrappedSet.size()]); } @Override public Object[] toArray(Object[] a) { int size = wrappedSet.size(); IdentityWrapper[] wrappedArray = (IdentityWrapper[]) wrappedSet .toArray(new IdentityWrapper[size]); Object[] result = a; if (a.length < size) { result = (Object[]) Array.newInstance(a.getClass() .getComponentType(), size); } for (int i = 0; i < size; i++) result[i] = wrappedArray[i].unwrap(); return result; } @Override public boolean equals(Object obj) { if (obj == this) return true; if (!(obj instanceof Set)) return false; Set that = (Set) obj; return size() == that.size() && containsAll(that); } @Override public int hashCode() { int hash = 0; for (Iterator iterator = iterator(); iterator.hasNext();) { Object element = iterator.next(); hash += element == null ? 0 : element.hashCode(); } return hash; } }