ListSet.java

// Copyright 2010 Google Inc. All Rights Reserved
package org.waveprotocol.wave.model.util;

import java.util.AbstractSet;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;

/**
 * A set backed by an array list.  Modifying this set has linear complexity since
 * looking elements up in the backing list is linear, so this works best for small
 * sets.  On the other hand this type of set is compact and has efficient iteration.
 *
*
 *
 * @param <S> type of list elements
 */
public final class ListSet<S> extends AbstractSet<S> {

  private final ArrayList<S> store;

  public ListSet() {
    store = new ArrayList<S>();
  }

  public ListSet(ListSet<S> values) {
    store = new ArrayList<S>(values.store);
  }

  @Override
  public boolean remove(Object value) {
    return store.remove(value);
  }

  @Override
  public Iterator<S> iterator() {
    return store.iterator();
  }

  @Override
  public int size() {
    return store.size();
  }

  @Override
  public boolean contains(Object o) {
    return store.contains(o);
  }

  @Override
  public boolean containsAll(Collection<?> c) {
    return store.containsAll(c);
  }

  @Override
  public boolean add(S value) {
    if (store.contains(value)) {
      return false;
    } else {
      store.add(value);
      return true;
    }
  }

  @Override
  public boolean addAll(Collection<? extends S> c) {
    boolean addedElement = false;
    for (S elm : c) {
      if (add(elm)) {
        addedElement = true;
      }
    }
    return addedElement;
  }

  @Override
  public void clear() {
    store.clear();
  }

}