How to use

FastTreeMap

in

org.apache.commons.collections

/**
 * Return a shallow copy of this <code>FastTreeMap</code> instance.
 * The keys and values themselves are not copied.
 * 
 * @return a clone of this map
 */
public Object clone() {
  FastTreeMap results = null;
  if (fast) {
    results = new FastTreeMap(map);
  } else {
    synchronized (map) {
      results = new FastTreeMap(map);
    }
  }
  results.setFast(getFast());
  return (results);
}

  public void remove() {
    if (lastReturned == null) {
      throw new IllegalStateException();
    }
    if (fast) {
      synchronized (FastTreeMap.this) {
        if (expected != map) {
          throw new ConcurrentModificationException();
        }
        FastTreeMap.this.remove(lastReturned.getKey());
        lastReturned = null;
        expected = map;
      }
    } else {
      iterator.remove();
      lastReturned = null;
    }
  }
}

public Map makeEmptyMap() {
  FastTreeMap ftm = new FastTreeMap();
  ftm.setFast(true);
  return (ftm);
}

super.put(key, value);
return null;

public Map makeEmptyMap() {
  FastTreeMap ftm = new FastTreeMap();
  ftm.setFast(false);
  return (ftm);
}

super.put(key, value);
return null;

/**
 * Return a shallow copy of this <code>FastTreeMap</code> instance.
 * The keys and values themselves are not copied.
 * 
 * @return a clone of this map
 */
public Object clone() {
  FastTreeMap results = null;
  if (fast) {
    results = new FastTreeMap(map);
  } else {
    synchronized (map) {
      results = new FastTreeMap(map);
    }
  }
  results.setFast(getFast());
  return (results);
}

  public void remove() {
    if (lastReturned == null) {
      throw new IllegalStateException();
    }
    if (fast) {
      synchronized (FastTreeMap.this) {
        if (expected != map) {
          throw new ConcurrentModificationException();
        }
        FastTreeMap.this.remove(lastReturned.getKey());
        lastReturned = null;
        expected = map;
      }
    } else {
      iterator.remove();
      lastReturned = null;
    }
  }
}

/**
 * Return a shallow copy of this <code>FastTreeMap</code> instance.
 * The keys and values themselves are not copied.
 * 
 * @return a clone of this map
 */
public Object clone() {
  FastTreeMap results = null;
  if (fast) {
    results = new FastTreeMap(map);
  } else {
    synchronized (map) {
      results = new FastTreeMap(map);
    }
  }
  results.setFast(getFast());
  return (results);
}

  public void remove() {
    if (lastReturned == null) {
      throw new IllegalStateException();
    }
    if (fast) {
      synchronized (FastTreeMap.this) {
        if (expected != map) {
          throw new ConcurrentModificationException();
        }
        FastTreeMap.this.remove(lastReturned.getKey());
        lastReturned = null;
        expected = map;
      }
    } else {
      iterator.remove();
      lastReturned = null;
    }
  }
}

/**
 * Return a shallow copy of this <code>FastTreeMap</code> instance.
 * The keys and values themselves are not copied.
 * 
 * @return a clone of this map
 */
public Object clone() {
  FastTreeMap results = null;
  if (fast) {
    results = new FastTreeMap(map);
  } else {
    synchronized (map) {
      results = new FastTreeMap(map);
    }
  }
  results.setFast(getFast());
  return (results);
}

  public void remove() {
    if (lastReturned == null) {
      throw new IllegalStateException();
    }
    if (fast) {
      synchronized (FastTreeMap.this) {
        if (expected != map) {
          throw new ConcurrentModificationException();
        }
        FastTreeMap.this.remove(lastReturned.getKey());
        lastReturned = null;
        expected = map;
      }
    } else {
      iterator.remove();
      lastReturned = null;
    }
  }
}

/**
 * Return a shallow copy of this <code>FastTreeMap</code> instance.
 * The keys and values themselves are not copied.
 * 
 * @return a clone of this map
 */
public Object clone() {
  FastTreeMap results = null;
  if (fast) {
    results = new FastTreeMap(map);
  } else {
    synchronized (map) {
      results = new FastTreeMap(map);
    }
  }
  results.setFast(getFast());
  return (results);
}

  public void remove() {
    if (lastReturned == null) {
      throw new IllegalStateException();
    }
    if (fast) {
      synchronized (FastTreeMap.this) {
        if (expected != map) {
          throw new ConcurrentModificationException();
        }
        FastTreeMap.this.remove(lastReturned.getKey());
        lastReturned = null;
        expected = map;
      }
    } else {
      iterator.remove();
      lastReturned = null;
    }
  }
}

/**
 * Return a shallow copy of this <code>FastTreeMap</code> instance.
 * The keys and values themselves are not copied.
 * 
 * @return a clone of this map
 */
public Object clone() {
  FastTreeMap results = null;
  if (fast) {
    results = new FastTreeMap(map);
  } else {
    synchronized (map) {
      results = new FastTreeMap(map);
    }
  }
  results.setFast(getFast());
  return (results);
}

  public void remove() {
    if (lastReturned == null) {
      throw new IllegalStateException();
    }
    if (fast) {
      synchronized (FastTreeMap.this) {
        if (expected != map) {
          throw new ConcurrentModificationException();
        }
        FastTreeMap.this.remove(lastReturned.getKey());
        lastReturned = null;
        expected = map;
      }
    } else {
      iterator.remove();
      lastReturned = null;
    }
  }
}

/**
 * Return a shallow copy of this <code>FastTreeMap</code> instance.
 * The keys and values themselves are not copied.
 * 
 * @return a clone of this map
 */
public Object clone() {
  FastTreeMap results = null;
  if (fast) {
    results = new FastTreeMap(map);
  } else {
    synchronized (map) {
      results = new FastTreeMap(map);
    }
  }
  results.setFast(getFast());
  return (results);
}

  public void remove() {
    if (lastReturned == null) {
      throw new IllegalStateException();
    }
    if (fast) {
      synchronized (FastTreeMap.this) {
        if (expected != map) {
          throw new ConcurrentModificationException();
        }
        FastTreeMap.this.remove(lastReturned.getKey());
        lastReturned = null;
        expected = map;
      }
    } else {
      iterator.remove();
      lastReturned = null;
    }
  }
}