25.06/11.82 * 25.06/11.82 * To implement an unmodifiable collection, the programmer needs only to 25.06/11.82 * extend this class and provide implementations for the iterator and 25.06/11.82 * size methods. (The iterator returned by the iterator 25.06/11.82 * method must implement hasNext and next.)
25.06/11.82 * 25.06/11.82 * To implement a modifiable collection, the programmer must additionally 25.06/11.82 * override this class's add method (which otherwise throws an 25.06/11.82 * UnsupportedOperationException), and the iterator returned by the 25.06/11.82 * iterator method must additionally implement its remove 25.06/11.82 * method.
25.06/11.82 * 25.06/11.82 * The programmer should generally provide a void (no argument) and 25.06/11.82 * Collection constructor, as per the recommendation in the 25.06/11.82 * Collection interface specification.
25.06/11.82 * 25.06/11.82 * The documentation for each non-abstract method in this class describes its 25.06/11.82 * implementation in detail. Each of these methods may be overridden if 25.06/11.82 * the collection being implemented admits a more efficient implementation.
25.06/11.82 *
25.06/11.82 * This class is a member of the
25.06/11.82 *
25.06/11.82 * Java Collections Framework.
25.06/11.82 *
25.06/11.82 * @author Josh Bloch
25.06/11.82 * @author Neal Gafter
25.06/11.82 * @see Collection
25.06/11.82 * @since 1.2
25.06/11.82 */
25.06/11.82
25.06/11.82 public abstract class AbstractCollection This implementation returns size() == 0.
25.06/11.82 */
25.06/11.82 public boolean isEmpty() {
25.06/11.82 return size() == 0;
25.06/11.82 }
25.06/11.82
25.06/11.82 /**
25.06/11.82 * {@inheritDoc}
25.06/11.82 *
25.06/11.82 * This implementation iterates over the elements in the collection,
25.06/11.82 * checking each element in turn for equality with the specified element.
25.06/11.82 *
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 */
25.06/11.82 public boolean contains(Object o) {
25.06/11.82 Iterator This implementation always throws an
25.06/11.82 * UnsupportedOperationException.
25.06/11.82 *
25.06/11.82 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 * @throws IllegalArgumentException {@inheritDoc}
25.06/11.82 * @throws IllegalStateException {@inheritDoc}
25.06/11.82 */
25.06/11.82 public boolean add(E e) {
25.06/11.82 throw new UnsupportedOperationException();
25.06/11.82 }
25.06/11.82
25.06/11.82 /**
25.06/11.82 * {@inheritDoc}
25.06/11.82 *
25.06/11.82 * This implementation iterates over the collection looking for the
25.06/11.82 * specified element. If it finds the element, it removes the element
25.06/11.82 * from the collection using the iterator's remove method.
25.06/11.82 *
25.06/11.82 * Note that this implementation throws an
25.06/11.82 * UnsupportedOperationException if the iterator returned by this
25.06/11.82 * collection's iterator method does not implement the remove
25.06/11.82 * method and this collection contains the specified object.
25.06/11.82 *
25.06/11.82 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 */
25.06/11.82 public boolean remove(Object o) {
25.06/11.82 Iterator This implementation iterates over the specified collection,
25.06/11.82 * checking each element returned by the iterator in turn to see
25.06/11.82 * if it's contained in this collection. If all elements are so
25.06/11.82 * contained true is returned, otherwise false.
25.06/11.82 *
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 * @see #contains(Object)
25.06/11.82 */
25.06/11.82 public boolean containsAll(Collection c) {
25.06/11.82 Iterator e = c.iterator();
25.06/11.82 while (e.hasNext())
25.06/11.82 if (!contains(e.next()))
25.06/11.82 return false;
25.06/11.82 return true;
25.06/11.82 }
25.06/11.82
25.06/11.82 /**
25.06/11.82 * {@inheritDoc}
25.06/11.82 *
25.06/11.82 * This implementation iterates over the specified collection, and adds
25.06/11.82 * each object returned by the iterator to this collection, in turn.
25.06/11.82 *
25.06/11.82 * Note that this implementation will throw an
25.06/11.82 * UnsupportedOperationException unless add is
25.06/11.82 * overridden (assuming the specified collection is non-empty).
25.06/11.82 *
25.06/11.82 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 * @throws IllegalArgumentException {@inheritDoc}
25.06/11.82 * @throws IllegalStateException {@inheritDoc}
25.06/11.82 *
25.06/11.82 * @see #add(Object)
25.06/11.82 */
25.06/11.82 public boolean addAll(Collection c) {
25.06/11.82 boolean modified = false;
25.06/11.82 Iterator e = c.iterator();
25.06/11.82 while (e.hasNext()) {
25.06/11.82 if (add(e.next()))
25.06/11.82 modified = true;
25.06/11.82 }
25.06/11.82 return modified;
25.06/11.82 }
25.06/11.82
25.06/11.82 /**
25.06/11.82 * {@inheritDoc}
25.06/11.82 *
25.06/11.82 * This implementation iterates over this collection, checking each
25.06/11.82 * element returned by the iterator in turn to see if it's contained
25.06/11.82 * in the specified collection. If it's so contained, it's removed from
25.06/11.82 * this collection with the iterator's remove method.
25.06/11.82 *
25.06/11.82 * Note that this implementation will throw an
25.06/11.82 * UnsupportedOperationException if the iterator returned by the
25.06/11.82 * iterator method does not implement the remove method
25.06/11.82 * and this collection contains one or more elements in common with the
25.06/11.82 * specified collection.
25.06/11.82 *
25.06/11.82 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 *
25.06/11.82 * @see #remove(Object)
25.06/11.82 * @see #contains(Object)
25.06/11.82 */
25.06/11.82 public boolean removeAll(Collection c) {
25.06/11.82 boolean modified = false;
25.06/11.82 Iterator e = iterator();
25.06/11.82 while (e.hasNext()) {
25.06/11.82 if (c.contains(e.next())) {
25.06/11.82 e.remove();
25.06/11.82 modified = true;
25.06/11.82 }
25.06/11.82 }
25.06/11.82 return modified;
25.06/11.82 }
25.06/11.82
25.06/11.82 /**
25.06/11.82 * {@inheritDoc}
25.06/11.82 *
25.06/11.82 * This implementation iterates over this collection, checking each
25.06/11.82 * element returned by the iterator in turn to see if it's contained
25.06/11.82 * in the specified collection. If it's not so contained, it's removed
25.06/11.82 * from this collection with the iterator's remove method.
25.06/11.82 *
25.06/11.82 * Note that this implementation will throw an
25.06/11.82 * UnsupportedOperationException if the iterator returned by the
25.06/11.82 * iterator method does not implement the remove method
25.06/11.82 * and this collection contains one or more elements not present in the
25.06/11.82 * specified collection.
25.06/11.82 *
25.06/11.82 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 *
25.06/11.82 * @see #remove(Object)
25.06/11.82 * @see #contains(Object)
25.06/11.82 */
25.06/11.82 public boolean retainAll(Collection c) {
25.06/11.82 boolean modified = false;
25.06/11.82 Iterator This implementation iterates over this collection, removing each
25.06/11.82 * element using the Iterator.remove operation. Most
25.06/11.82 * implementations will probably choose to override this method for
25.06/11.82 * efficiency.
25.06/11.82 *
25.06/11.82 * Note that this implementation will throw an
25.06/11.82 * UnsupportedOperationException if the iterator returned by this
25.06/11.82 * collection's iterator method does not implement the
25.06/11.82 * remove method and this collection is non-empty.
25.06/11.82 *
25.06/11.82 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.82 */
25.06/11.82 public void clear() {
25.06/11.82 Iterator To implement an unmodifiable map, the programmer needs only to extend this
25.06/11.82 * class and provide an implementation for the entrySet method, which
25.06/11.82 * returns a set-view of the map's mappings. Typically, the returned set
25.06/11.82 * will, in turn, be implemented atop AbstractSet. This set should
25.06/11.82 * not support the add or remove methods, and its iterator
25.06/11.82 * should not support the remove method.
25.06/11.82 *
25.06/11.82 * To implement a modifiable map, the programmer must additionally override
25.06/11.82 * this class's put method (which otherwise throws an
25.06/11.82 * UnsupportedOperationException), and the iterator returned by
25.06/11.82 * entrySet().iterator() must additionally implement its
25.06/11.82 * remove method.
25.06/11.82 *
25.06/11.82 * The programmer should generally provide a void (no argument) and map
25.06/11.82 * constructor, as per the recommendation in the Map interface
25.06/11.82 * specification.
25.06/11.82 *
25.06/11.82 * The documentation for each non-abstract method in this class describes its
25.06/11.82 * implementation in detail. Each of these methods may be overridden if the
25.06/11.82 * map being implemented admits a more efficient implementation.
25.06/11.82 *
25.06/11.82 * This class is a member of the
25.06/11.82 *
25.06/11.82 * Java Collections Framework.
25.06/11.82 *
25.06/11.82 * @param This implementation returns entrySet().size().
25.06/11.82 */
25.06/11.82 public int size() {
25.06/11.82 return entrySet().size();
25.06/11.82 }
25.06/11.82
25.06/11.82 /**
25.06/11.82 * {@inheritDoc}
25.06/11.82 *
25.06/11.82 * This implementation returns size() == 0.
25.06/11.82 */
25.06/11.82 public boolean isEmpty() {
25.06/11.82 return size() == 0;
25.06/11.82 }
25.06/11.82
25.06/11.82 /**
25.06/11.82 * {@inheritDoc}
25.06/11.82 *
25.06/11.82 * This implementation iterates over entrySet() searching
25.06/11.82 * for an entry with the specified value. If such an entry is found,
25.06/11.82 * true is returned. If the iteration terminates without
25.06/11.82 * finding such an entry, false is returned. Note that this
25.06/11.82 * implementation requires linear time in the size of the map.
25.06/11.82 *
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 */
25.06/11.82 public boolean containsValue(Object value) {
25.06/11.82 Iterator This implementation iterates over entrySet() searching
25.06/11.82 * for an entry with the specified key. If such an entry is found,
25.06/11.82 * true is returned. If the iteration terminates without
25.06/11.82 * finding such an entry, false is returned. Note that this
25.06/11.82 * implementation requires linear time in the size of the map; many
25.06/11.82 * implementations will override this method.
25.06/11.82 *
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 */
25.06/11.82 public boolean containsKey(Object key) {
25.06/11.82 Iterator This implementation iterates over entrySet() searching
25.06/11.82 * for an entry with the specified key. If such an entry is found,
25.06/11.82 * the entry's value is returned. If the iteration terminates without
25.06/11.82 * finding such an entry, null is returned. Note that this
25.06/11.82 * implementation requires linear time in the size of the map; many
25.06/11.82 * implementations will override this method.
25.06/11.82 *
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 */
25.06/11.82 public V get(Object key) {
25.06/11.82 Iterator This implementation always throws an
25.06/11.82 * UnsupportedOperationException.
25.06/11.82 *
25.06/11.82 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 * @throws IllegalArgumentException {@inheritDoc}
25.06/11.82 */
25.06/11.82 public V put(K key, V value) {
25.06/11.82 throw new UnsupportedOperationException();
25.06/11.82 }
25.06/11.82
25.06/11.82 /**
25.06/11.82 * {@inheritDoc}
25.06/11.82 *
25.06/11.82 * This implementation iterates over entrySet() searching for an
25.06/11.82 * entry with the specified key. If such an entry is found, its value is
25.06/11.82 * obtained with its getValue operation, the entry is removed
25.06/11.82 * from the collection (and the backing map) with the iterator's
25.06/11.82 * remove operation, and the saved value is returned. If the
25.06/11.82 * iteration terminates without finding such an entry, null is
25.06/11.82 * returned. Note that this implementation requires linear time in the
25.06/11.82 * size of the map; many implementations will override this method.
25.06/11.82 *
25.06/11.82 * Note that this implementation throws an
25.06/11.82 * UnsupportedOperationException if the entrySet
25.06/11.82 * iterator does not support the remove method and this map
25.06/11.82 * contains a mapping for the specified key.
25.06/11.82 *
25.06/11.82 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 */
25.06/11.82 public V remove(Object key) {
25.06/11.82 Iterator This implementation iterates over the specified map's
25.06/11.82 * entrySet() collection, and calls this map's put
25.06/11.82 * operation once for each entry returned by the iteration.
25.06/11.82 *
25.06/11.82 * Note that this implementation throws an
25.06/11.82 * UnsupportedOperationException if this map does not support
25.06/11.82 * the put operation and the specified map is nonempty.
25.06/11.82 *
25.06/11.82 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.82 * @throws ClassCastException {@inheritDoc}
25.06/11.82 * @throws NullPointerException {@inheritDoc}
25.06/11.82 * @throws IllegalArgumentException {@inheritDoc}
25.06/11.82 */
25.06/11.82 public void putAll(Map m) {
25.06/11.82 Iterator it = m.entrySet().iterator();
25.06/11.82 while (it.hasNext()) {
25.06/11.82 Map.Entry e = (Map.Entry) it.next();
25.06/11.82 put((K) e.getKey(), (V) e.getValue());
25.06/11.82 }
25.06/11.82 }
25.06/11.82
25.06/11.82 /**
25.06/11.82 * {@inheritDoc}
25.06/11.82 *
25.06/11.82 * This implementation calls entrySet().clear().
25.06/11.82 *
25.06/11.82 * Note that this implementation throws an
25.06/11.82 * UnsupportedOperationException if the entrySet
25.06/11.82 * does not support the clear operation.
25.06/11.82 *
25.06/11.82 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.82 */
25.06/11.82 public void clear() {
25.06/11.82 entrySet().clear();
25.06/11.82 }
25.06/11.82
25.06/11.82
25.06/11.82 // Views
25.06/11.82
25.06/11.82 /**
25.06/11.82 * Each of these fields are initialized to contain an instance of the
25.06/11.82 * appropriate view the first time this view is requested. The views are
25.06/11.82 * stateless, so there's no reason to create more than one of each.
25.06/11.82 */
25.06/11.82 transient volatile Set This implementation returns a set that subclasses {@link AbstractSet}.
25.06/11.82 * The subclass's iterator method returns a "wrapper object" over this
25.06/11.82 * map's entrySet() iterator. The size method
25.06/11.82 * delegates to this map's size method and the
25.06/11.82 * contains method delegates to this map's
25.06/11.82 * containsKey method.
25.06/11.82 *
25.06/11.82 * The set is created the first time this method is called,
25.06/11.82 * and returned in response to all subsequent calls. No synchronization
25.06/11.82 * is performed, so there is a slight chance that multiple calls to this
25.06/11.82 * method will not all return the same set.
25.06/11.82 */
25.06/11.82 public Set This implementation returns a collection that subclasses {@link
25.06/11.82 * AbstractCollection}. The subclass's iterator method returns a
25.06/11.82 * "wrapper object" over this map's entrySet() iterator.
25.06/11.82 * The size method delegates to this map's size
25.06/11.82 * method and the contains method delegates to this map's
25.06/11.82 * containsValue method.
25.06/11.82 *
25.06/11.82 * The collection is created the first time this method is called, and
25.06/11.82 * returned in response to all subsequent calls. No synchronization is
25.06/11.82 * performed, so there is a slight chance that multiple calls to this
25.06/11.82 * method will not all return the same collection.
25.06/11.82 */
25.06/11.82 public Collection This implementation first checks if the specified object is this map;
25.06/11.82 * if so it returns true. Then, it checks if the specified
25.06/11.82 * object is a map whose size is identical to the size of this map; if
25.06/11.82 * not, it returns false. If so, it iterates over this map's
25.06/11.82 * entrySet collection, and checks that the specified map
25.06/11.82 * contains each mapping that this map contains. If the specified map
25.06/11.82 * fails to contain such a mapping, false is returned. If the
25.06/11.82 * iteration completes, true is returned.
25.06/11.82 *
25.06/11.82 * @param o object to be compared for equality with this map
25.06/11.82 * @return true if the specified object is equal to this map
25.06/11.82 */
25.06/11.82 public boolean equals(Object o) {
25.06/11.82 if (o == this)
25.06/11.82 return true;
25.06/11.82
25.06/11.82 if (!(o instanceof Map))
25.06/11.82 return false;
25.06/11.82 Map This implementation iterates over entrySet(), calling
25.06/11.82 * {@link Map.Entry#hashCode hashCode()} on each element (entry) in the
25.06/11.82 * set, and adding up the results.
25.06/11.82 *
25.06/11.82 * @return the hash code value for this map
25.06/11.82 * @see Map.Entry#hashCode()
25.06/11.82 * @see Object#equals(Object)
25.06/11.82 * @see Set#equals(Object)
25.06/11.82 */
25.06/11.82 public int hashCode() {
25.06/11.82 int h = 0;
25.06/11.82 Iterator
25.06/11.83 *
25.06/11.83 * The process of implementing a set by extending this class is identical
25.06/11.83 * to that of implementing a Collection by extending AbstractCollection,
25.06/11.83 * except that all of the methods and constructors in subclasses of this
25.06/11.83 * class must obey the additional constraints imposed by the Set
25.06/11.83 * interface (for instance, the add method must not permit addition of
25.06/11.83 * multiple instances of an object to a set).
25.06/11.83 *
25.06/11.83 * Note that this class does not override any of the implementations from
25.06/11.83 * the AbstractCollection class. It merely adds implementations
25.06/11.83 * for equals and hashCode.
25.06/11.83 *
25.06/11.83 * This class is a member of the
25.06/11.83 *
25.06/11.83 * Java Collections Framework.
25.06/11.83 *
25.06/11.83 * @param
25.06/11.83 *
25.06/11.83 * This implementation first checks if the specified object is this
25.06/11.83 * set; if so it returns true. Then, it checks if the
25.06/11.83 * specified object is a set whose size is identical to the size of
25.06/11.83 * this set; if not, it returns false. If so, it returns
25.06/11.83 * containsAll((Collection) o).
25.06/11.83 *
25.06/11.83 * @param o object to be compared for equality with this set
25.06/11.83 * @return true if the specified object is equal to this set
25.06/11.83 */
25.06/11.83 public boolean equals(Object o) {
25.06/11.83 if (o == this)
25.06/11.83 return true;
25.06/11.83
25.06/11.83 if (!(o instanceof Set))
25.06/11.83 return false;
25.06/11.83 Collection c = (Collection) o;
25.06/11.83 if (c.size() != size())
25.06/11.83 return false;
25.06/11.83 try {
25.06/11.83 return containsAll(c);
25.06/11.83 } catch (ClassCastException unused) {
25.06/11.83 return false;
25.06/11.83 } catch (NullPointerException unused) {
25.06/11.83 return false;
25.06/11.83 }
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Returns the hash code value for this set. The hash code of a set is
25.06/11.83 * defined to be the sum of the hash codes of the elements in the set,
25.06/11.83 * where the hash code of a null element is defined to be zero.
25.06/11.83 * This ensures that s1.equals(s2) implies that
25.06/11.83 * s1.hashCode()==s2.hashCode() for any two sets s1
25.06/11.83 * and s2, as required by the general contract of
25.06/11.83 * {@link Object#hashCode}.
25.06/11.83 *
25.06/11.83 * This implementation iterates over the set, calling the
25.06/11.83 * hashCode method on each element in the set, and adding up
25.06/11.83 * the results.
25.06/11.83 *
25.06/11.83 * @return the hash code value for this set
25.06/11.83 * @see Object#equals(Object)
25.06/11.83 * @see Set#equals(Object)
25.06/11.83 */
25.06/11.83 public int hashCode() {
25.06/11.83 int h = 0;
25.06/11.83 Iterator This implementation determines which is the smaller of this set
25.06/11.83 * and the specified collection, by invoking the size
25.06/11.83 * method on each. If this set has fewer elements, then the
25.06/11.83 * implementation iterates over this set, checking each element
25.06/11.83 * returned by the iterator in turn to see if it is contained in
25.06/11.83 * the specified collection. If it is so contained, it is removed
25.06/11.83 * from this set with the iterator's remove method. If
25.06/11.83 * the specified collection has fewer elements, then the
25.06/11.83 * implementation iterates over the specified collection, removing
25.06/11.83 * from this set each element returned by the iterator, using this
25.06/11.83 * set's remove method.
25.06/11.83 *
25.06/11.83 * Note that this implementation will throw an
25.06/11.83 * UnsupportedOperationException if the iterator returned by the
25.06/11.83 * iterator method does not implement the remove method.
25.06/11.83 *
25.06/11.83 * @param c collection containing elements to be removed from this set
25.06/11.83 * @return true if this set changed as a result of the call
25.06/11.83 * @throws UnsupportedOperationException if the removeAll operation
25.06/11.83 * is not supported by this set
25.06/11.83 * @throws ClassCastException if the class of an element of this set
25.06/11.83 * is incompatible with the specified collection (optional)
25.06/11.83 * @throws NullPointerException if this set contains a null element and the
25.06/11.83 * specified collection does not permit null elements (optional),
25.06/11.83 * or if the specified collection is null
25.06/11.83 * @see #remove(Object)
25.06/11.83 * @see #contains(Object)
25.06/11.83 */
25.06/11.83 public boolean removeAll(Collection c) {
25.06/11.83 boolean modified = false;
25.06/11.83
25.06/11.83 if (size() > c.size()) {
25.06/11.83 for (Iterator i = c.iterator(); i.hasNext(); )
25.06/11.83 modified |= remove(i.next());
25.06/11.83 } else {
25.06/11.83 for (Iterator i = iterator(); i.hasNext(); ) {
25.06/11.83 if (c.contains(i.next())) {
25.06/11.83 i.remove();
25.06/11.83 modified = true;
25.06/11.83 }
25.06/11.83 }
25.06/11.83 }
25.06/11.83 return modified;
25.06/11.83 }
25.06/11.83
25.06/11.83 }
25.06/11.83
25.06/11.83
25.06/11.83 /*
25.06/11.83 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.83 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.83 *
25.06/11.83 * This code is free software; you can redistribute it and/or modify it
25.06/11.83 * under the terms of the GNU General Public License version 2 only, as
25.06/11.83 * published by the Free Software Foundation. Sun designates this
25.06/11.83 * particular file as subject to the "Classpath" exception as provided
25.06/11.83 * by Sun in the LICENSE file that accompanied this code.
25.06/11.83 *
25.06/11.83 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.83 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.83 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.83 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.83 * accompanied this code).
25.06/11.83 *
25.06/11.83 * You should have received a copy of the GNU General Public License version
25.06/11.83 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.83 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.83 *
25.06/11.83 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.83 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.83 * have any questions.
25.06/11.83 */
25.06/11.83
25.06/11.83 package javaUtilEx;
25.06/11.83
25.06/11.83 /**
25.06/11.83 * The root interface in the collection hierarchy. A collection
25.06/11.83 * represents a group of objects, known as its elements. Some
25.06/11.83 * collections allow duplicate elements and others do not. Some are ordered
25.06/11.83 * and others unordered. The JDK does not provide any direct
25.06/11.83 * implementations of this interface: it provides implementations of more
25.06/11.83 * specific subinterfaces like Set and List. This interface
25.06/11.83 * is typically used to pass collections around and manipulate them where
25.06/11.83 * maximum generality is desired.
25.06/11.83 *
25.06/11.83 * Bags or multisets (unordered collections that may contain
25.06/11.83 * duplicate elements) should implement this interface directly.
25.06/11.83 *
25.06/11.83 * All general-purpose Collection implementation classes (which
25.06/11.83 * typically implement Collection indirectly through one of its
25.06/11.83 * subinterfaces) should provide two "standard" constructors: a void (no
25.06/11.83 * arguments) constructor, which creates an empty collection, and a
25.06/11.83 * constructor with a single argument of type Collection, which
25.06/11.83 * creates a new collection with the same elements as its argument. In
25.06/11.83 * effect, the latter constructor allows the user to copy any collection,
25.06/11.83 * producing an equivalent collection of the desired implementation type.
25.06/11.83 * There is no way to enforce this convention (as interfaces cannot contain
25.06/11.83 * constructors) but all of the general-purpose Collection
25.06/11.83 * implementations in the Java platform libraries comply.
25.06/11.83 *
25.06/11.83 * The "destructive" methods contained in this interface, that is, the
25.06/11.83 * methods that modify the collection on which they operate, are specified to
25.06/11.83 * throw UnsupportedOperationException if this collection does not
25.06/11.83 * support the operation. If this is the case, these methods may, but are not
25.06/11.83 * required to, throw an UnsupportedOperationException if the
25.06/11.83 * invocation would have no effect on the collection. For example, invoking
25.06/11.83 * the {@link #addAll(Collection)} method on an unmodifiable collection may,
25.06/11.83 * but is not required to, throw the exception if the collection to be added
25.06/11.83 * is empty.
25.06/11.83 *
25.06/11.83 * Some collection implementations have restrictions on the elements that
25.06/11.83 * they may contain. For example, some implementations prohibit null elements,
25.06/11.83 * and some have restrictions on the types of their elements. Attempting to
25.06/11.83 * add an ineligible element throws an unchecked exception, typically
25.06/11.83 * NullPointerException or ClassCastException. Attempting
25.06/11.83 * to query the presence of an ineligible element may throw an exception,
25.06/11.83 * or it may simply return false; some implementations will exhibit the former
25.06/11.83 * behavior and some will exhibit the latter. More generally, attempting an
25.06/11.83 * operation on an ineligible element whose completion would not result in
25.06/11.83 * the insertion of an ineligible element into the collection may throw an
25.06/11.83 * exception or it may succeed, at the option of the implementation.
25.06/11.83 * Such exceptions are marked as "optional" in the specification for this
25.06/11.83 * interface.
25.06/11.83 *
25.06/11.83 * It is up to each collection to determine its own synchronization
25.06/11.83 * policy. In the absence of a stronger guarantee by the
25.06/11.83 * implementation, undefined behavior may result from the invocation
25.06/11.83 * of any method on a collection that is being mutated by another
25.06/11.83 * thread; this includes direct invocations, passing the collection to
25.06/11.83 * a method that might perform invocations, and using an existing
25.06/11.83 * iterator to examine the collection.
25.06/11.83 *
25.06/11.83 * Many methods in Collections Framework interfaces are defined in
25.06/11.83 * terms of the {@link Object#equals(Object) equals} method. For example,
25.06/11.83 * the specification for the {@link #contains(Object) contains(Object o)}
25.06/11.83 * method says: "returns true if and only if this collection
25.06/11.83 * contains at least one element e such that
25.06/11.83 * (o==null ? e==null : o.equals(e))." This specification should
25.06/11.83 * not be construed to imply that invoking Collection.contains
25.06/11.83 * with a non-null argument o will cause o.equals(e) to be
25.06/11.83 * invoked for any element e. Implementations are free to implement
25.06/11.83 * optimizations whereby the equals invocation is avoided, for
25.06/11.83 * example, by first comparing the hash codes of the two elements. (The
25.06/11.83 * {@link Object#hashCode()} specification guarantees that two objects with
25.06/11.83 * unequal hash codes cannot be equal.) More generally, implementations of
25.06/11.83 * the various Collections Framework interfaces are free to take advantage of
25.06/11.83 * the specified behavior of underlying {@link Object} methods wherever the
25.06/11.83 * implementor deems it appropriate.
25.06/11.83 *
25.06/11.83 * This interface is a member of the
25.06/11.83 *
25.06/11.83 * Java Collections Framework.
25.06/11.83 *
25.06/11.83 * @author Josh Bloch
25.06/11.83 * @author Neal Gafter
25.06/11.83 * @see Set
25.06/11.83 * @see List
25.06/11.83 * @see Map
25.06/11.83 * @see SortedSet
25.06/11.83 * @see SortedMap
25.06/11.83 * @see HashSet
25.06/11.83 * @see TreeSet
25.06/11.83 * @see ArrayList
25.06/11.83 * @see LinkedList
25.06/11.83 * @see Vector
25.06/11.83 * @see Collections
25.06/11.83 * @see Arrays
25.06/11.83 * @see AbstractCollection
25.06/11.83 * @since 1.2
25.06/11.83 */
25.06/11.83
25.06/11.83 public interface Collection
25.06/11.83 *
25.06/11.83 * Collections that support this operation may place limitations on what
25.06/11.83 * elements may be added to this collection. In particular, some
25.06/11.83 * collections will refuse to add null elements, and others will
25.06/11.83 * impose restrictions on the type of elements that may be added.
25.06/11.83 * Collection classes should clearly specify in their documentation any
25.06/11.83 * restrictions on what elements may be added.
25.06/11.83 *
25.06/11.83 * If a collection refuses to add a particular element for any reason
25.06/11.83 * other than that it already contains the element, it must throw
25.06/11.83 * an exception (rather than returning false). This preserves
25.06/11.83 * the invariant that a collection always contains the specified element
25.06/11.83 * after this call returns.
25.06/11.83 *
25.06/11.83 * @param e element whose presence in this collection is to be ensured
25.06/11.83 * @return true if this collection changed as a result of the
25.06/11.83 * call
25.06/11.83 * @throws UnsupportedOperationException if the add operation
25.06/11.83 * is not supported by this collection
25.06/11.83 * @throws ClassCastException if the class of the specified element
25.06/11.83 * prevents it from being added to this collection
25.06/11.83 * @throws NullPointerException if the specified element is null and this
25.06/11.83 * collection does not permit null elements
25.06/11.83 * @throws IllegalArgumentException if some property of the element
25.06/11.83 * prevents it from being added to this collection
25.06/11.83 * @throws IllegalStateException if the element cannot be added at this
25.06/11.83 * time due to insertion restrictions
25.06/11.83 */
25.06/11.83 boolean add(E e);
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Removes a single instance of the specified element from this
25.06/11.83 * collection, if it is present (optional operation). More formally,
25.06/11.83 * removes an element e such that
25.06/11.83 * (o==null ? e==null : o.equals(e)), if
25.06/11.83 * this collection contains one or more such elements. Returns
25.06/11.83 * true if this collection contained the specified element (or
25.06/11.83 * equivalently, if this collection changed as a result of the call).
25.06/11.83 *
25.06/11.83 * @param o element to be removed from this collection, if present
25.06/11.83 * @return true if an element was removed as a result of this call
25.06/11.83 * @throws ClassCastException if the type of the specified element
25.06/11.83 * is incompatible with this collection (optional)
25.06/11.83 * @throws NullPointerException if the specified element is null and this
25.06/11.83 * collection does not permit null elements (optional)
25.06/11.83 * @throws UnsupportedOperationException if the remove operation
25.06/11.83 * is not supported by this collection
25.06/11.83 */
25.06/11.83 boolean remove(Object o);
25.06/11.83
25.06/11.83
25.06/11.83 // Bulk Operations
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Returns true if this collection contains all of the elements
25.06/11.83 * in the specified collection.
25.06/11.83 *
25.06/11.83 * @param c collection to be checked for containment in this collection
25.06/11.83 * @return true if this collection contains all of the elements
25.06/11.83 * in the specified collection
25.06/11.83 * @throws ClassCastException if the types of one or more elements
25.06/11.83 * in the specified collection are incompatible with this
25.06/11.83 * collection (optional)
25.06/11.83 * @throws NullPointerException if the specified collection contains one
25.06/11.83 * or more null elements and this collection does not permit null
25.06/11.83 * elements (optional), or if the specified collection is null
25.06/11.83 * @see #contains(Object)
25.06/11.83 */
25.06/11.83 boolean containsAll(Collection c);
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Adds all of the elements in the specified collection to this collection
25.06/11.83 * (optional operation). The behavior of this operation is undefined if
25.06/11.83 * the specified collection is modified while the operation is in progress.
25.06/11.83 * (This implies that the behavior of this call is undefined if the
25.06/11.83 * specified collection is this collection, and this collection is
25.06/11.83 * nonempty.)
25.06/11.83 *
25.06/11.83 * @param c collection containing elements to be added to this collection
25.06/11.83 * @return true if this collection changed as a result of the call
25.06/11.83 * @throws UnsupportedOperationException if the addAll operation
25.06/11.83 * is not supported by this collection
25.06/11.83 * @throws ClassCastException if the class of an element of the specified
25.06/11.83 * collection prevents it from being added to this collection
25.06/11.83 * @throws NullPointerException if the specified collection contains a
25.06/11.83 * null element and this collection does not permit null elements,
25.06/11.83 * or if the specified collection is null
25.06/11.83 * @throws IllegalArgumentException if some property of an element of the
25.06/11.83 * specified collection prevents it from being added to this
25.06/11.83 * collection
25.06/11.83 * @throws IllegalStateException if not all the elements can be added at
25.06/11.83 * this time due to insertion restrictions
25.06/11.83 * @see #add(Object)
25.06/11.83 */
25.06/11.83 boolean addAll(Collection c);
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Removes all of this collection's elements that are also contained in the
25.06/11.83 * specified collection (optional operation). After this call returns,
25.06/11.83 * this collection will contain no elements in common with the specified
25.06/11.83 * collection.
25.06/11.83 *
25.06/11.83 * @param c collection containing elements to be removed from this collection
25.06/11.83 * @return true if this collection changed as a result of the
25.06/11.83 * call
25.06/11.83 * @throws UnsupportedOperationException if the removeAll method
25.06/11.83 * is not supported by this collection
25.06/11.83 * @throws ClassCastException if the types of one or more elements
25.06/11.83 * in this collection are incompatible with the specified
25.06/11.83 * collection (optional)
25.06/11.83 * @throws NullPointerException if this collection contains one or more
25.06/11.83 * null elements and the specified collection does not support
25.06/11.83 * null elements (optional), or if the specified collection is null
25.06/11.83 * @see #remove(Object)
25.06/11.83 * @see #contains(Object)
25.06/11.83 */
25.06/11.83 boolean removeAll(Collection c);
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Retains only the elements in this collection that are contained in the
25.06/11.83 * specified collection (optional operation). In other words, removes from
25.06/11.83 * this collection all of its elements that are not contained in the
25.06/11.83 * specified collection.
25.06/11.83 *
25.06/11.83 * @param c collection containing elements to be retained in this collection
25.06/11.83 * @return true if this collection changed as a result of the call
25.06/11.83 * @throws UnsupportedOperationException if the retainAll operation
25.06/11.83 * is not supported by this collection
25.06/11.83 * @throws ClassCastException if the types of one or more elements
25.06/11.83 * in this collection are incompatible with the specified
25.06/11.83 * collection (optional)
25.06/11.83 * @throws NullPointerException if this collection contains one or more
25.06/11.83 * null elements and the specified collection does not permit null
25.06/11.83 * elements (optional), or if the specified collection is null
25.06/11.83 * @see #remove(Object)
25.06/11.83 * @see #contains(Object)
25.06/11.83 */
25.06/11.83 boolean retainAll(Collection c);
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Removes all of the elements from this collection (optional operation).
25.06/11.83 * The collection will be empty after this method returns.
25.06/11.83 *
25.06/11.83 * @throws UnsupportedOperationException if the clear operation
25.06/11.83 * is not supported by this collection
25.06/11.83 */
25.06/11.83 void clear();
25.06/11.83
25.06/11.83
25.06/11.83 // Comparison and hashing
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Compares the specified object with this collection for equality.
25.06/11.83 *
25.06/11.83 * While the Collection interface adds no stipulations to the
25.06/11.83 * general contract for the Object.equals, programmers who
25.06/11.83 * implement the Collection interface "directly" (in other words,
25.06/11.83 * create a class that is a Collection but is not a Set
25.06/11.83 * or a List) must exercise care if they choose to override the
25.06/11.83 * Object.equals. It is not necessary to do so, and the simplest
25.06/11.83 * course of action is to rely on Object's implementation, but
25.06/11.83 * the implementor may wish to implement a "value comparison" in place of
25.06/11.83 * the default "reference comparison." (The List and
25.06/11.83 * Set interfaces mandate such value comparisons.)
25.06/11.83 *
25.06/11.83 * The general contract for the Object.equals method states that
25.06/11.83 * equals must be symmetric (in other words, a.equals(b) if and
25.06/11.83 * only if b.equals(a)). The contracts for List.equals
25.06/11.83 * and Set.equals state that lists are only equal to other lists,
25.06/11.83 * and sets to other sets. Thus, a custom equals method for a
25.06/11.83 * collection class that implements neither the List nor
25.06/11.83 * Set interface must return false when this collection
25.06/11.83 * is compared to any list or set. (By the same logic, it is not possible
25.06/11.83 * to write a class that correctly implements both the Set and
25.06/11.83 * List interfaces.)
25.06/11.83 *
25.06/11.83 * @param o object to be compared for equality with this collection
25.06/11.83 * @return true if the specified object is equal to this
25.06/11.83 * collection
25.06/11.83 *
25.06/11.83 * @see Object#equals(Object)
25.06/11.83 * @see Set#equals(Object)
25.06/11.83 * @see List#equals(Object)
25.06/11.83 */
25.06/11.83 boolean equals(Object o);
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Returns the hash code value for this collection. While the
25.06/11.83 * Collection interface adds no stipulations to the general
25.06/11.83 * contract for the Object.hashCode method, programmers should
25.06/11.83 * take note that any class that overrides the Object.equals
25.06/11.83 * method must also override the Object.hashCode method in order
25.06/11.83 * to satisfy the general contract for the Object.hashCodemethod.
25.06/11.83 * In particular, c1.equals(c2) implies that
25.06/11.83 * c1.hashCode()==c2.hashCode().
25.06/11.83 *
25.06/11.83 * @return the hash code value for this collection
25.06/11.83 *
25.06/11.83 * @see Object#hashCode()
25.06/11.83 * @see Object#equals(Object)
25.06/11.83 */
25.06/11.83 int hashCode();
25.06/11.83 }
25.06/11.83
25.06/11.83
25.06/11.83 /*
25.06/11.83 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.83 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.83 *
25.06/11.83 * This code is free software; you can redistribute it and/or modify it
25.06/11.83 * under the terms of the GNU General Public License version 2 only, as
25.06/11.83 * published by the Free Software Foundation. Sun designates this
25.06/11.83 * particular file as subject to the "Classpath" exception as provided
25.06/11.83 * by Sun in the LICENSE file that accompanied this code.
25.06/11.83 *
25.06/11.83 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.83 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.83 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.83 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.83 * accompanied this code).
25.06/11.83 *
25.06/11.83 * You should have received a copy of the GNU General Public License version
25.06/11.83 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.83 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.83 *
25.06/11.83 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.83 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.83 * have any questions.
25.06/11.83 */
25.06/11.83
25.06/11.83 package javaUtilEx;
25.06/11.83
25.06/11.83 /**
25.06/11.83 * This exception may be thrown by methods that have detected concurrent
25.06/11.83 * modification of an object when such modification is not permissible.
25.06/11.83 *
25.06/11.83 * For example, it is not generally permissible for one thread to modify a Collection
25.06/11.83 * while another thread is iterating over it. In general, the results of the
25.06/11.83 * iteration are undefined under these circumstances. Some Iterator
25.06/11.83 * implementations (including those of all the general purpose collection implementations
25.06/11.83 * provided by the JRE) may choose to throw this exception if this behavior is
25.06/11.83 * detected. Iterators that do this are known as fail-fast iterators,
25.06/11.83 * as they fail quickly and cleanly, rather that risking arbitrary,
25.06/11.83 * non-deterministic behavior at an undetermined time in the future.
25.06/11.83 *
25.06/11.83 * Note that this exception does not always indicate that an object has
25.06/11.83 * been concurrently modified by a different thread. If a single
25.06/11.83 * thread issues a sequence of method invocations that violates the
25.06/11.83 * contract of an object, the object may throw this exception. For
25.06/11.83 * example, if a thread modifies a collection directly while it is
25.06/11.83 * iterating over the collection with a fail-fast iterator, the iterator
25.06/11.83 * will throw this exception.
25.06/11.83 *
25.06/11.83 * Note that fail-fast behavior cannot be guaranteed as it is, generally
25.06/11.83 * speaking, impossible to make any hard guarantees in the presence of
25.06/11.83 * unsynchronized concurrent modification. Fail-fast operations
25.06/11.83 * throw ConcurrentModificationException on a best-effort basis.
25.06/11.83 * Therefore, it would be wrong to write a program that depended on this
25.06/11.83 * exception for its correctness: ConcurrentModificationException
25.06/11.83 * should be used only to detect bugs.
25.06/11.83 *
25.06/11.83 * @author Josh Bloch
25.06/11.83 * @see Collection
25.06/11.83 * @see Iterator
25.06/11.83 * @see ListIterator
25.06/11.83 * @see Vector
25.06/11.83 * @see LinkedList
25.06/11.83 * @see HashSet
25.06/11.83 * @see Hashtable
25.06/11.83 * @see TreeMap
25.06/11.83 * @see AbstractList
25.06/11.83 * @since 1.2
25.06/11.83 */
25.06/11.83 public class ConcurrentModificationException extends RuntimeException {
25.06/11.83 /**
25.06/11.83 * Constructs a ConcurrentModificationException with no
25.06/11.83 * detail message.
25.06/11.83 */
25.06/11.83 public ConcurrentModificationException() {
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Constructs a ConcurrentModificationException with the
25.06/11.83 * specified detail message.
25.06/11.83 *
25.06/11.83 * @param message the detail message pertaining to this exception.
25.06/11.83 */
25.06/11.83 public ConcurrentModificationException(String message) {
25.06/11.83 super(message);
25.06/11.83 }
25.06/11.83 }
25.06/11.83
25.06/11.83
25.06/11.83 /*
25.06/11.83 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.83 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.83 *
25.06/11.83 * This code is free software; you can redistribute it and/or modify it
25.06/11.83 * under the terms of the GNU General Public License version 2 only, as
25.06/11.83 * published by the Free Software Foundation. Sun designates this
25.06/11.83 * particular file as subject to the "Classpath" exception as provided
25.06/11.83 * by Sun in the LICENSE file that accompanied this code.
25.06/11.83 *
25.06/11.83 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.83 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.83 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.83 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.83 * accompanied this code).
25.06/11.83 *
25.06/11.83 * You should have received a copy of the GNU General Public License version
25.06/11.83 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.83 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.83 *
25.06/11.83 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.83 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.83 * have any questions.
25.06/11.83 */
25.06/11.83
25.06/11.83 package javaUtilEx;
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Hash table based implementation of the Map interface. This
25.06/11.83 * implementation provides all of the optional map operations, and permits
25.06/11.83 * null values and the null key. (The HashMap
25.06/11.83 * class is roughly equivalent to Hashtable, except that it is
25.06/11.83 * unsynchronized and permits nulls.) This class makes no guarantees as to
25.06/11.83 * the order of the map; in particular, it does not guarantee that the order
25.06/11.83 * will remain constant over time.
25.06/11.83 *
25.06/11.83 * This implementation provides constant-time performance for the basic
25.06/11.83 * operations (get and put), assuming the hash function
25.06/11.83 * disperses the elements properly among the buckets. Iteration over
25.06/11.83 * collection views requires time proportional to the "capacity" of the
25.06/11.83 * HashMap instance (the number of buckets) plus its size (the number
25.06/11.83 * of key-value mappings). Thus, it's very important not to set the initial
25.06/11.83 * capacity too high (or the load factor too low) if iteration performance is
25.06/11.83 * important.
25.06/11.83 *
25.06/11.83 * An instance of HashMap has two parameters that affect its
25.06/11.83 * performance: initial capacity and load factor. The
25.06/11.83 * capacity is the number of buckets in the hash table, and the initial
25.06/11.83 * capacity is simply the capacity at the time the hash table is created. The
25.06/11.83 * load factor is a measure of how full the hash table is allowed to
25.06/11.83 * get before its capacity is automatically increased. When the number of
25.06/11.83 * entries in the hash table exceeds the product of the load factor and the
25.06/11.83 * current capacity, the hash table is rehashed (that is, internal data
25.06/11.83 * structures are rebuilt) so that the hash table has approximately twice the
25.06/11.83 * number of buckets.
25.06/11.83 *
25.06/11.83 * As a general rule, the default load factor (.75) offers a good tradeoff
25.06/11.83 * between time and space costs. Higher values decrease the space overhead
25.06/11.83 * but increase the lookup cost (reflected in most of the operations of the
25.06/11.83 * HashMap class, including get and put). The
25.06/11.83 * expected number of entries in the map and its load factor should be taken
25.06/11.83 * into account when setting its initial capacity, so as to minimize the
25.06/11.83 * number of rehash operations. If the initial capacity is greater
25.06/11.83 * than the maximum number of entries divided by the load factor, no
25.06/11.83 * rehash operations will ever occur.
25.06/11.83 *
25.06/11.83 * If many mappings are to be stored in a HashMap instance,
25.06/11.83 * creating it with a sufficiently large capacity will allow the mappings to
25.06/11.83 * be stored more efficiently than letting it perform automatic rehashing as
25.06/11.83 * needed to grow the table.
25.06/11.83 *
25.06/11.83 * Note that this implementation is not synchronized.
25.06/11.83 * If multiple threads access a hash map concurrently, and at least one of
25.06/11.83 * the threads modifies the map structurally, it must be
25.06/11.83 * synchronized externally. (A structural modification is any operation
25.06/11.83 * that adds or deletes one or more mappings; merely changing the value
25.06/11.83 * associated with a key that an instance already contains is not a
25.06/11.83 * structural modification.) This is typically accomplished by
25.06/11.83 * synchronizing on some object that naturally encapsulates the map.
25.06/11.83 *
25.06/11.83 * If no such object exists, the map should be "wrapped" using the
25.06/11.83 * {@link Collections#synchronizedMap Collections.synchronizedMap}
25.06/11.83 * method. This is best done at creation time, to prevent accidental
25.06/11.83 * unsynchronized access to the map: The iterators returned by all of this class's "collection view methods"
25.06/11.83 * are fail-fast: if the map is structurally modified at any time after
25.06/11.83 * the iterator is created, in any way except through the iterator's own
25.06/11.83 * remove method, the iterator will throw a
25.06/11.83 * {@link ConcurrentModificationException}. Thus, in the face of concurrent
25.06/11.83 * modification, the iterator fails quickly and cleanly, rather than risking
25.06/11.83 * arbitrary, non-deterministic behavior at an undetermined time in the
25.06/11.83 * future.
25.06/11.83 *
25.06/11.83 * Note that the fail-fast behavior of an iterator cannot be guaranteed
25.06/11.83 * as it is, generally speaking, impossible to make any hard guarantees in the
25.06/11.83 * presence of unsynchronized concurrent modification. Fail-fast iterators
25.06/11.83 * throw ConcurrentModificationException on a best-effort basis.
25.06/11.83 * Therefore, it would be wrong to write a program that depended on this
25.06/11.83 * exception for its correctness: the fail-fast behavior of iterators
25.06/11.83 * should be used only to detect bugs.
25.06/11.83 *
25.06/11.83 * This class is a member of the
25.06/11.83 *
25.06/11.83 * Java Collections Framework.
25.06/11.83 *
25.06/11.83 * @param More formally, if this map contains a mapping from a key
25.06/11.83 * {@code k} to a value {@code v} such that {@code (key==null ? k==null :
25.06/11.83 * key.equals(k))}, then this method returns {@code v}; otherwise
25.06/11.83 * it returns {@code null}. (There can be at most one such mapping.)
25.06/11.83 *
25.06/11.83 * A return value of {@code null} does not necessarily
25.06/11.83 * indicate that the map contains no mapping for the key; it's also
25.06/11.83 * possible that the map explicitly maps the key to {@code null}.
25.06/11.83 * The {@link #containsKey containsKey} operation may be used to
25.06/11.83 * distinguish these two cases.
25.06/11.83 *
25.06/11.83 * @see #put(Object, Object)
25.06/11.83 */
25.06/11.83 public V get(Object key) {
25.06/11.83 if (key == null)
25.06/11.83 return getForNullKey();
25.06/11.83 int hash = hash(key.hashCode());
25.06/11.83 for (Entry Note that the detail message associated with Note that the detail message associated with This interface is a member of the
25.06/11.84 *
25.06/11.84 * Java Collections Framework.
25.06/11.84 *
25.06/11.84 * @author Josh Bloch
25.06/11.84 * @see Collection
25.06/11.84 * @see ListIterator
25.06/11.84 * @see Iterable
25.06/11.84 * @since 1.2
25.06/11.84 */
25.06/11.84 public interface Iterator This interface takes the place of the Dictionary class, which
25.06/11.84 * was a totally abstract class rather than an interface.
25.06/11.84 *
25.06/11.84 * The Map interface provides three collection views, which
25.06/11.84 * allow a map's contents to be viewed as a set of keys, collection of values,
25.06/11.84 * or set of key-value mappings. The order of a map is defined as
25.06/11.84 * the order in which the iterators on the map's collection views return their
25.06/11.84 * elements. Some map implementations, like the TreeMap class, make
25.06/11.84 * specific guarantees as to their order; others, like the HashMap
25.06/11.84 * class, do not.
25.06/11.84 *
25.06/11.84 * Note: great care must be exercised if mutable objects are used as map
25.06/11.84 * keys. The behavior of a map is not specified if the value of an object is
25.06/11.84 * changed in a manner that affects equals comparisons while the
25.06/11.84 * object is a key in the map. A special case of this prohibition is that it
25.06/11.84 * is not permissible for a map to contain itself as a key. While it is
25.06/11.84 * permissible for a map to contain itself as a value, extreme caution is
25.06/11.84 * advised: the equals and hashCode methods are no longer
25.06/11.84 * well defined on such a map.
25.06/11.84 *
25.06/11.84 * All general-purpose map implementation classes should provide two
25.06/11.84 * "standard" constructors: a void (no arguments) constructor which creates an
25.06/11.84 * empty map, and a constructor with a single argument of type Map,
25.06/11.84 * which creates a new map with the same key-value mappings as its argument.
25.06/11.84 * In effect, the latter constructor allows the user to copy any map,
25.06/11.84 * producing an equivalent map of the desired class. There is no way to
25.06/11.84 * enforce this recommendation (as interfaces cannot contain constructors) but
25.06/11.84 * all of the general-purpose map implementations in the JDK comply.
25.06/11.84 *
25.06/11.84 * The "destructive" methods contained in this interface, that is, the
25.06/11.84 * methods that modify the map on which they operate, are specified to throw
25.06/11.84 * UnsupportedOperationException if this map does not support the
25.06/11.84 * operation. If this is the case, these methods may, but are not required
25.06/11.84 * to, throw an UnsupportedOperationException if the invocation would
25.06/11.84 * have no effect on the map. For example, invoking the {@link #putAll(Map)}
25.06/11.84 * method on an unmodifiable map may, but is not required to, throw the
25.06/11.84 * exception if the map whose mappings are to be "superimposed" is empty.
25.06/11.84 *
25.06/11.84 * Some map implementations have restrictions on the keys and values they
25.06/11.84 * may contain. For example, some implementations prohibit null keys and
25.06/11.84 * values, and some have restrictions on the types of their keys. Attempting
25.06/11.84 * to insert an ineligible key or value throws an unchecked exception,
25.06/11.84 * typically NullPointerException or ClassCastException.
25.06/11.84 * Attempting to query the presence of an ineligible key or value may throw an
25.06/11.84 * exception, or it may simply return false; some implementations will exhibit
25.06/11.84 * the former behavior and some will exhibit the latter. More generally,
25.06/11.84 * attempting an operation on an ineligible key or value whose completion
25.06/11.84 * would not result in the insertion of an ineligible element into the map may
25.06/11.84 * throw an exception or it may succeed, at the option of the implementation.
25.06/11.84 * Such exceptions are marked as "optional" in the specification for this
25.06/11.84 * interface.
25.06/11.84 *
25.06/11.84 * This interface is a member of the
25.06/11.84 *
25.06/11.84 * Java Collections Framework.
25.06/11.84 *
25.06/11.84 * Many methods in Collections Framework interfaces are defined
25.06/11.84 * in terms of the {@link Object#equals(Object) equals} method. For
25.06/11.84 * example, the specification for the {@link #containsKey(Object)
25.06/11.84 * containsKey(Object key)} method says: "returns true if and
25.06/11.84 * only if this map contains a mapping for a key k such that
25.06/11.84 * (key==null ? k==null : key.equals(k))." This specification should
25.06/11.84 * not be construed to imply that invoking Map.containsKey
25.06/11.84 * with a non-null argument key will cause key.equals(k) to
25.06/11.84 * be invoked for any key k. Implementations are free to
25.06/11.84 * implement optimizations whereby the equals invocation is avoided,
25.06/11.84 * for example, by first comparing the hash codes of the two keys. (The
25.06/11.84 * {@link Object#hashCode()} specification guarantees that two objects with
25.06/11.84 * unequal hash codes cannot be equal.) More generally, implementations of
25.06/11.84 * the various Collections Framework interfaces are free to take advantage of
25.06/11.84 * the specified behavior of underlying {@link Object} methods wherever the
25.06/11.84 * implementor deems it appropriate.
25.06/11.84 *
25.06/11.84 * @param More formally, if this map contains a mapping from a key
25.06/11.84 * {@code k} to a value {@code v} such that {@code (key==null ? k==null :
25.06/11.84 * key.equals(k))}, then this method returns {@code v}; otherwise
25.06/11.84 * it returns {@code null}. (There can be at most one such mapping.)
25.06/11.84 *
25.06/11.84 * If this map permits null values, then a return value of
25.06/11.84 * {@code null} does not necessarily indicate that the map
25.06/11.84 * contains no mapping for the key; it's also possible that the map
25.06/11.84 * explicitly maps the key to {@code null}. The {@link #containsKey
25.06/11.84 * containsKey} operation may be used to distinguish these two cases.
25.06/11.84 *
25.06/11.84 * @param key the key whose associated value is to be returned
25.06/11.84 * @return the value to which the specified key is mapped, or
25.06/11.84 * {@code null} if this map contains no mapping for the key
25.06/11.84 * @throws ClassCastException if the key is of an inappropriate type for
25.06/11.84 * this map (optional)
25.06/11.84 * @throws NullPointerException if the specified key is null and this map
25.06/11.84 * does not permit null keys (optional)
25.06/11.84 */
25.06/11.84 V get(Object key);
25.06/11.84
25.06/11.84 // Modification Operations
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Associates the specified value with the specified key in this map
25.06/11.84 * (optional operation). If the map previously contained a mapping for
25.06/11.84 * the key, the old value is replaced by the specified value. (A map
25.06/11.84 * m is said to contain a mapping for a key k if and only
25.06/11.84 * if {@link #containsKey(Object) m.containsKey(k)} would return
25.06/11.84 * true.)
25.06/11.84 *
25.06/11.84 * @param key key with which the specified value is to be associated
25.06/11.84 * @param value value to be associated with the specified key
25.06/11.84 * @return the previous value associated with key, or
25.06/11.84 * null if there was no mapping for key.
25.06/11.84 * (A null return can also indicate that the map
25.06/11.84 * previously associated null with key,
25.06/11.84 * if the implementation supports null values.)
25.06/11.84 * @throws UnsupportedOperationException if the put operation
25.06/11.84 * is not supported by this map
25.06/11.84 * @throws ClassCastException if the class of the specified key or value
25.06/11.84 * prevents it from being stored in this map
25.06/11.84 * @throws NullPointerException if the specified key or value is null
25.06/11.84 * and this map does not permit null keys or values
25.06/11.84 * @throws IllegalArgumentException if some property of the specified key
25.06/11.84 * or value prevents it from being stored in this map
25.06/11.84 */
25.06/11.84 V put(K key, V value);
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Removes the mapping for a key from this map if it is present
25.06/11.84 * (optional operation). More formally, if this map contains a mapping
25.06/11.84 * from key k to value v such that
25.06/11.84 * Returns the value to which this map previously associated the key,
25.06/11.84 * or null if the map contained no mapping for the key.
25.06/11.84 *
25.06/11.84 * If this map permits null values, then a return value of
25.06/11.84 * null does not necessarily indicate that the map
25.06/11.84 * contained no mapping for the key; it's also possible that the map
25.06/11.84 * explicitly mapped the key to null.
25.06/11.84 *
25.06/11.84 * The map will not contain a mapping for the specified key once the
25.06/11.84 * call returns.
25.06/11.84 *
25.06/11.84 * @param key key whose mapping is to be removed from the map
25.06/11.84 * @return the previous value associated with key, or
25.06/11.84 * null if there was no mapping for key.
25.06/11.84 * @throws UnsupportedOperationException if the remove operation
25.06/11.84 * is not supported by this map
25.06/11.84 * @throws ClassCastException if the key is of an inappropriate type for
25.06/11.84 * this map (optional)
25.06/11.84 * @throws NullPointerException if the specified key is null and this
25.06/11.84 * map does not permit null keys (optional)
25.06/11.84 */
25.06/11.84 V remove(Object key);
25.06/11.84
25.06/11.84
25.06/11.84 // Bulk Operations
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Copies all of the mappings from the specified map to this map
25.06/11.84 * (optional operation). The effect of this call is equivalent to that
25.06/11.84 * of calling {@link #put(Object,Object) put(k, v)} on this map once
25.06/11.84 * for each mapping from key k to value v in the
25.06/11.84 * specified map. The behavior of this operation is undefined if the
25.06/11.84 * specified map is modified while the operation is in progress.
25.06/11.84 *
25.06/11.84 * @param m mappings to be stored in this map
25.06/11.84 * @throws UnsupportedOperationException if the putAll operation
25.06/11.84 * is not supported by this map
25.06/11.84 * @throws ClassCastException if the class of a key or value in the
25.06/11.84 * specified map prevents it from being stored in this map
25.06/11.84 * @throws NullPointerException if the specified map is null, or if
25.06/11.84 * this map does not permit null keys or values, and the
25.06/11.84 * specified map contains null keys or values
25.06/11.84 * @throws IllegalArgumentException if some property of a key or value in
25.06/11.84 * the specified map prevents it from being stored in this map
25.06/11.84 */
25.06/11.84 void putAll(Map m);
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Removes all of the mappings from this map (optional operation).
25.06/11.84 * The map will be empty after this call returns.
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException if the clear operation
25.06/11.84 * is not supported by this map
25.06/11.84 */
25.06/11.84 void clear();
25.06/11.84
25.06/11.84
25.06/11.84 // Views
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Returns a {@link Set} view of the keys contained in this map.
25.06/11.84 * The set is backed by the map, so changes to the map are
25.06/11.84 * reflected in the set, and vice-versa. If the map is modified
25.06/11.84 * while an iteration over the set is in progress (except through
25.06/11.84 * the iterator's own remove operation), the results of
25.06/11.84 * the iteration are undefined. The set supports element removal,
25.06/11.84 * which removes the corresponding mapping from the map, via the
25.06/11.84 * Iterator.remove, Set.remove,
25.06/11.84 * removeAll, retainAll, and clear
25.06/11.84 * operations. It does not support the add or addAll
25.06/11.84 * operations.
25.06/11.84 *
25.06/11.84 * @return a set view of the keys contained in this map
25.06/11.84 */
25.06/11.84 Set The Set interface places additional stipulations, beyond those
25.06/11.84 * inherited from the Collection interface, on the contracts of all
25.06/11.84 * constructors and on the contracts of the add, equals and
25.06/11.84 * hashCode methods. Declarations for other inherited methods are
25.06/11.84 * also included here for convenience. (The specifications accompanying these
25.06/11.84 * declarations have been tailored to the Set interface, but they do
25.06/11.84 * not contain any additional stipulations.)
25.06/11.84 *
25.06/11.84 * The additional stipulation on constructors is, not surprisingly,
25.06/11.84 * that all constructors must create a set that contains no duplicate elements
25.06/11.84 * (as defined above).
25.06/11.84 *
25.06/11.84 * Note: Great care must be exercised if mutable objects are used as set
25.06/11.84 * elements. The behavior of a set is not specified if the value of an object
25.06/11.84 * is changed in a manner that affects equals comparisons while the
25.06/11.84 * object is an element in the set. A special case of this prohibition is
25.06/11.84 * that it is not permissible for a set to contain itself as an element.
25.06/11.84 *
25.06/11.84 * Some set implementations have restrictions on the elements that
25.06/11.84 * they may contain. For example, some implementations prohibit null elements,
25.06/11.84 * and some have restrictions on the types of their elements. Attempting to
25.06/11.84 * add an ineligible element throws an unchecked exception, typically
25.06/11.84 * NullPointerException or ClassCastException. Attempting
25.06/11.84 * to query the presence of an ineligible element may throw an exception,
25.06/11.84 * or it may simply return false; some implementations will exhibit the former
25.06/11.84 * behavior and some will exhibit the latter. More generally, attempting an
25.06/11.84 * operation on an ineligible element whose completion would not result in
25.06/11.84 * the insertion of an ineligible element into the set may throw an
25.06/11.84 * exception or it may succeed, at the option of the implementation.
25.06/11.84 * Such exceptions are marked as "optional" in the specification for this
25.06/11.84 * interface.
25.06/11.84 *
25.06/11.84 * This interface is a member of the
25.06/11.84 *
25.06/11.84 * Java Collections Framework.
25.06/11.84 *
25.06/11.84 * @param The returned array will be "safe" in that no references to it
25.06/11.84 * are maintained by this set. (In other words, this method must
25.06/11.84 * allocate a new array even if this set is backed by an array).
25.06/11.84 * The caller is thus free to modify the returned array.
25.06/11.84 *
25.06/11.84 * This method acts as bridge between array-based and collection-based
25.06/11.84 * APIs.
25.06/11.84 *
25.06/11.84 * @return an array containing all the elements in this set
25.06/11.84 */
25.06/11.84 Object[] toArray();
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Returns an array containing all of the elements in this set; the
25.06/11.84 * runtime type of the returned array is that of the specified array.
25.06/11.84 * If the set fits in the specified array, it is returned therein.
25.06/11.84 * Otherwise, a new array is allocated with the runtime type of the
25.06/11.84 * specified array and the size of this set.
25.06/11.84 *
25.06/11.84 * If this set fits in the specified array with room to spare
25.06/11.84 * (i.e., the array has more elements than this set), the element in
25.06/11.84 * the array immediately following the end of the set is set to
25.06/11.84 * null. (This is useful in determining the length of this
25.06/11.84 * set only if the caller knows that this set does not contain
25.06/11.84 * any null elements.)
25.06/11.84 *
25.06/11.84 * If this set makes any guarantees as to what order its elements
25.06/11.84 * are returned by its iterator, this method must return the elements
25.06/11.84 * in the same order.
25.06/11.84 *
25.06/11.84 * Like the {@link #toArray()} method, this method acts as bridge between
25.06/11.84 * array-based and collection-based APIs. Further, this method allows
25.06/11.84 * precise control over the runtime type of the output array, and may,
25.06/11.84 * under certain circumstances, be used to save allocation costs.
25.06/11.84 *
25.06/11.84 * Suppose x is a set known to contain only strings.
25.06/11.84 * The following code can be used to dump the set into a newly allocated
25.06/11.84 * array of String:
25.06/11.84 *
25.06/11.84 * The stipulation above does not imply that sets must accept all
25.06/11.84 * elements; sets may refuse to add any particular element, including
25.06/11.84 * null, and throw an exception, as described in the
25.06/11.84 * specification for {@link Collection#add Collection.add}.
25.06/11.84 * Individual set implementations should clearly document any
25.06/11.84 * restrictions on the elements that they may contain.
25.06/11.84 *
25.06/11.84 * @param e element to be added to this set
25.06/11.84 * @return true if this set did not already contain the specified
25.06/11.84 * element
25.06/11.84 * @throws UnsupportedOperationException if the add operation
25.06/11.84 * is not supported by this set
25.06/11.84 * @throws ClassCastException if the class of the specified element
25.06/11.84 * prevents it from being added to this set
25.06/11.84 * @throws NullPointerException if the specified element is null and this
25.06/11.84 * set does not permit null elements
25.06/11.84 * @throws IllegalArgumentException if some property of the specified element
25.06/11.84 * prevents it from being added to this set
25.06/11.84 */
25.06/11.84 boolean add(E e);
25.06/11.84
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Removes the specified element from this set if it is present
25.06/11.84 * (optional operation). More formally, removes an element e
25.06/11.84 * such that
25.06/11.84 * (o==null ? e==null : o.equals(e)), if
25.06/11.84 * this set contains such an element. Returns true if this set
25.06/11.84 * contained the element (or equivalently, if this set changed as a
25.06/11.84 * result of the call). (This set will not contain the element once the
25.06/11.84 * call returns.)
25.06/11.84 *
25.06/11.84 * @param o object to be removed from this set, if present
25.06/11.84 * @return true if this set contained the specified element
25.06/11.84 * @throws ClassCastException if the type of the specified element
25.06/11.84 * is incompatible with this set (optional)
25.06/11.84 * @throws NullPointerException if the specified element is null and this
25.06/11.84 * set does not permit null elements (optional)
25.06/11.84 * @throws UnsupportedOperationException if the remove operation
25.06/11.84 * is not supported by this set
25.06/11.84 */
25.06/11.84 boolean remove(Object o);
25.06/11.84
25.06/11.84
25.06/11.84 // Bulk Operations
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Returns true if this set contains all of the elements of the
25.06/11.84 * specified collection. If the specified collection is also a set, this
25.06/11.84 * method returns true if it is a subset of this set.
25.06/11.84 *
25.06/11.84 * @param c collection to be checked for containment in this set
25.06/11.84 * @return true if this set contains all of the elements of the
25.06/11.84 * specified collection
25.06/11.84 * @throws ClassCastException if the types of one or more elements
25.06/11.84 * in the specified collection are incompatible with this
25.06/11.84 * set (optional)
25.06/11.84 * @throws NullPointerException if the specified collection contains one
25.06/11.84 * or more null elements and this set does not permit null
25.06/11.84 * elements (optional), or if the specified collection is null
25.06/11.84 * @see #contains(Object)
25.06/11.84 */
25.06/11.84 boolean containsAll(Collection c);
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Adds all of the elements in the specified collection to this set if
25.06/11.84 * they're not already present (optional operation). If the specified
25.06/11.84 * collection is also a set, the addAll operation effectively
25.06/11.84 * modifies this set so that its value is the union of the two
25.06/11.84 * sets. The behavior of this operation is undefined if the specified
25.06/11.84 * collection is modified while the operation is in progress.
25.06/11.84 *
25.06/11.84 * @param c collection containing elements to be added to this set
25.06/11.84 * @return true if this set changed as a result of the call
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException if the addAll operation
25.06/11.84 * is not supported by this set
25.06/11.84 * @throws ClassCastException if the class of an element of the
25.06/11.84 * specified collection prevents it from being added to this set
25.06/11.84 * @throws NullPointerException if the specified collection contains one
25.06/11.84 * or more null elements and this set does not permit null
25.06/11.84 * elements, or if the specified collection is null
25.06/11.84 * @throws IllegalArgumentException if some property of an element of the
25.06/11.84 * specified collection prevents it from being added to this set
25.06/11.84 * @see #add(Object)
25.06/11.84 */
25.06/11.84 boolean addAll(Collection c);
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Retains only the elements in this set that are contained in the
25.06/11.84 * specified collection (optional operation). In other words, removes
25.06/11.84 * from this set all of its elements that are not contained in the
25.06/11.84 * specified collection. If the specified collection is also a set, this
25.06/11.84 * operation effectively modifies this set so that its value is the
25.06/11.84 * intersection of the two sets.
25.06/11.84 *
25.06/11.84 * @param c collection containing elements to be retained in this set
25.06/11.84 * @return true if this set changed as a result of the call
25.06/11.84 * @throws UnsupportedOperationException if the retainAll operation
25.06/11.84 * is not supported by this set
25.06/11.84 * @throws ClassCastException if the class of an element of this set
25.06/11.84 * is incompatible with the specified collection (optional)
25.06/11.84 * @throws NullPointerException if this set contains a null element and the
25.06/11.84 * specified collection does not permit null elements (optional),
25.06/11.84 * or if the specified collection is null
25.06/11.84 * @see #remove(Object)
25.06/11.84 */
25.06/11.84 boolean retainAll(Collection c);
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Removes from this set all of its elements that are contained in the
25.06/11.84 * specified collection (optional operation). If the specified
25.06/11.84 * collection is also a set, this operation effectively modifies this
25.06/11.84 * set so that its value is the asymmetric set difference of
25.06/11.84 * the two sets.
25.06/11.84 *
25.06/11.84 * @param c collection containing elements to be removed from this set
25.06/11.84 * @return true if this set changed as a result of the call
25.06/11.84 * @throws UnsupportedOperationException if the removeAll operation
25.06/11.84 * is not supported by this set
25.06/11.84 * @throws ClassCastException if the class of an element of this set
25.06/11.84 * is incompatible with the specified collection (optional)
25.06/11.84 * @throws NullPointerException if this set contains a null element and the
25.06/11.84 * specified collection does not permit null elements (optional),
25.06/11.84 * or if the specified collection is null
25.06/11.84 * @see #remove(Object)
25.06/11.84 * @see #contains(Object)
25.06/11.84 */
25.06/11.84 boolean removeAll(Collection c);
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Removes all of the elements from this set (optional operation).
25.06/11.84 * The set will be empty after this call returns.
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException if the clear method
25.06/11.84 * is not supported by this set
25.06/11.84 */
25.06/11.84 void clear();
25.06/11.84
25.06/11.84
25.06/11.84 // Comparison and hashing
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Compares the specified object with this set for equality. Returns
25.06/11.84 * true if the specified object is also a set, the two sets
25.06/11.84 * have the same size, and every member of the specified set is
25.06/11.84 * contained in this set (or equivalently, every member of this set is
25.06/11.84 * contained in the specified set). This definition ensures that the
25.06/11.84 * equals method works properly across different implementations of the
25.06/11.84 * set interface.
25.06/11.84 *
25.06/11.84 * @param o object to be compared for equality with this set
25.06/11.84 * @return true if the specified object is equal to this set
25.06/11.84 */
25.06/11.84 boolean equals(Object o);
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Returns the hash code value for this set. The hash code of a set is
25.06/11.84 * defined to be the sum of the hash codes of the elements in the set,
25.06/11.84 * where the hash code of a null element is defined to be zero.
25.06/11.84 * This ensures that s1.equals(s2) implies that
25.06/11.84 * s1.hashCode()==s2.hashCode() for any two sets s1
25.06/11.84 * and s2, as required by the general contract of
25.06/11.84 * {@link Object#hashCode}.
25.06/11.84 *
25.06/11.84 * @return the hash code value for this set
25.06/11.84 * @see Object#equals(Object)
25.06/11.84 * @see Set#equals(Object)
25.06/11.84 */
25.06/11.84 int hashCode();
25.06/11.84 }
25.06/11.84
25.06/11.84
25.06/11.84 /*
25.06/11.84 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.84 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.84 *
25.06/11.84 * This code is free software; you can redistribute it and/or modify it
25.06/11.84 * under the terms of the GNU General Public License version 2 only, as
25.06/11.84 * published by the Free Software Foundation. Sun designates this
25.06/11.84 * particular file as subject to the "Classpath" exception as provided
25.06/11.84 * by Sun in the LICENSE file that accompanied this code.
25.06/11.84 *
25.06/11.84 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.84 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.84 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.84 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.84 * accompanied this code).
25.06/11.84 *
25.06/11.84 * You should have received a copy of the GNU General Public License version
25.06/11.84 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.84 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.84 *
25.06/11.84 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.84 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.84 * have any questions.
25.06/11.84 */
25.06/11.84
25.06/11.84 package javaUtilEx;
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Thrown to indicate that the requested operation is not supported.
25.06/11.84 *
25.06/11.84 * This class is a member of the
25.06/11.84 *
25.06/11.84 * Java Collections Framework.
25.06/11.84 *
25.06/11.84 * @author Josh Bloch
25.06/11.84 * @since 1.2
25.06/11.84 */
25.06/11.84 public class UnsupportedOperationException extends RuntimeException {
25.06/11.84 /**
25.06/11.84 * Constructs an UnsupportedOperationException with no detail message.
25.06/11.84 */
25.06/11.84 public UnsupportedOperationException() {
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Constructs an UnsupportedOperationException with the specified
25.06/11.84 * detail message.
25.06/11.84 *
25.06/11.84 * @param message the detail message
25.06/11.84 */
25.06/11.84 public UnsupportedOperationException(String message) {
25.06/11.84 super(message);
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Constructs a new exception with the specified detail message and
25.06/11.84 * cause.
25.06/11.84 *
25.06/11.84 * Note that the detail message associated with
25.06/11.84 *
25.06/11.84 * To implement an unmodifiable collection, the programmer needs only to
25.06/11.84 * extend this class and provide implementations for the iterator and
25.06/11.84 * size methods. (The iterator returned by the iterator
25.06/11.84 * method must implement hasNext and next.)
25.06/11.84 *
25.06/11.84 * To implement a modifiable collection, the programmer must additionally
25.06/11.84 * override this class's add method (which otherwise throws an
25.06/11.84 * UnsupportedOperationException), and the iterator returned by the
25.06/11.84 * iterator method must additionally implement its remove
25.06/11.84 * method.
25.06/11.84 *
25.06/11.84 * The programmer should generally provide a void (no argument) and
25.06/11.84 * Collection constructor, as per the recommendation in the
25.06/11.84 * Collection interface specification.
25.06/11.84 *
25.06/11.84 * The documentation for each non-abstract method in this class describes its
25.06/11.84 * implementation in detail. Each of these methods may be overridden if
25.06/11.84 * the collection being implemented admits a more efficient implementation.
25.06/11.84 *
25.06/11.84 * This class is a member of the
25.06/11.84 *
25.06/11.84 * Java Collections Framework.
25.06/11.84 *
25.06/11.84 * @author Josh Bloch
25.06/11.84 * @author Neal Gafter
25.06/11.84 * @see Collection
25.06/11.84 * @since 1.2
25.06/11.84 */
25.06/11.84
25.06/11.84 public abstract class AbstractCollection This implementation returns size() == 0.
25.06/11.84 */
25.06/11.84 public boolean isEmpty() {
25.06/11.84 return size() == 0;
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * {@inheritDoc}
25.06/11.84 *
25.06/11.84 * This implementation iterates over the elements in the collection,
25.06/11.84 * checking each element in turn for equality with the specified element.
25.06/11.84 *
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 */
25.06/11.84 public boolean contains(Object o) {
25.06/11.84 Iterator This implementation always throws an
25.06/11.84 * UnsupportedOperationException.
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 * @throws IllegalArgumentException {@inheritDoc}
25.06/11.84 * @throws IllegalStateException {@inheritDoc}
25.06/11.84 */
25.06/11.84 public boolean add(E e) {
25.06/11.84 throw new UnsupportedOperationException();
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * {@inheritDoc}
25.06/11.84 *
25.06/11.84 * This implementation iterates over the collection looking for the
25.06/11.84 * specified element. If it finds the element, it removes the element
25.06/11.84 * from the collection using the iterator's remove method.
25.06/11.84 *
25.06/11.84 * Note that this implementation throws an
25.06/11.84 * UnsupportedOperationException if the iterator returned by this
25.06/11.84 * collection's iterator method does not implement the remove
25.06/11.84 * method and this collection contains the specified object.
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 */
25.06/11.84 public boolean remove(Object o) {
25.06/11.84 Iterator This implementation iterates over the specified collection,
25.06/11.84 * checking each element returned by the iterator in turn to see
25.06/11.84 * if it's contained in this collection. If all elements are so
25.06/11.84 * contained true is returned, otherwise false.
25.06/11.84 *
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 * @see #contains(Object)
25.06/11.84 */
25.06/11.84 public boolean containsAll(Collection c) {
25.06/11.84 Iterator e = c.iterator();
25.06/11.84 while (e.hasNext())
25.06/11.84 if (!contains(e.next()))
25.06/11.84 return false;
25.06/11.84 return true;
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * {@inheritDoc}
25.06/11.84 *
25.06/11.84 * This implementation iterates over the specified collection, and adds
25.06/11.84 * each object returned by the iterator to this collection, in turn.
25.06/11.84 *
25.06/11.84 * Note that this implementation will throw an
25.06/11.84 * UnsupportedOperationException unless add is
25.06/11.84 * overridden (assuming the specified collection is non-empty).
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 * @throws IllegalArgumentException {@inheritDoc}
25.06/11.84 * @throws IllegalStateException {@inheritDoc}
25.06/11.84 *
25.06/11.84 * @see #add(Object)
25.06/11.84 */
25.06/11.84 public boolean addAll(Collection c) {
25.06/11.84 boolean modified = false;
25.06/11.84 Iterator e = c.iterator();
25.06/11.84 while (e.hasNext()) {
25.06/11.84 if (add(e.next()))
25.06/11.84 modified = true;
25.06/11.84 }
25.06/11.84 return modified;
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * {@inheritDoc}
25.06/11.84 *
25.06/11.84 * This implementation iterates over this collection, checking each
25.06/11.84 * element returned by the iterator in turn to see if it's contained
25.06/11.84 * in the specified collection. If it's so contained, it's removed from
25.06/11.84 * this collection with the iterator's remove method.
25.06/11.84 *
25.06/11.84 * Note that this implementation will throw an
25.06/11.84 * UnsupportedOperationException if the iterator returned by the
25.06/11.84 * iterator method does not implement the remove method
25.06/11.84 * and this collection contains one or more elements in common with the
25.06/11.84 * specified collection.
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 *
25.06/11.84 * @see #remove(Object)
25.06/11.84 * @see #contains(Object)
25.06/11.84 */
25.06/11.84 public boolean removeAll(Collection c) {
25.06/11.84 boolean modified = false;
25.06/11.84 Iterator e = iterator();
25.06/11.84 while (e.hasNext()) {
25.06/11.84 if (c.contains(e.next())) {
25.06/11.84 e.remove();
25.06/11.84 modified = true;
25.06/11.84 }
25.06/11.84 }
25.06/11.84 return modified;
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * {@inheritDoc}
25.06/11.84 *
25.06/11.84 * This implementation iterates over this collection, checking each
25.06/11.84 * element returned by the iterator in turn to see if it's contained
25.06/11.84 * in the specified collection. If it's not so contained, it's removed
25.06/11.84 * from this collection with the iterator's remove method.
25.06/11.84 *
25.06/11.84 * Note that this implementation will throw an
25.06/11.84 * UnsupportedOperationException if the iterator returned by the
25.06/11.84 * iterator method does not implement the remove method
25.06/11.84 * and this collection contains one or more elements not present in the
25.06/11.84 * specified collection.
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 *
25.06/11.84 * @see #remove(Object)
25.06/11.84 * @see #contains(Object)
25.06/11.84 */
25.06/11.84 public boolean retainAll(Collection c) {
25.06/11.84 boolean modified = false;
25.06/11.84 Iterator This implementation iterates over this collection, removing each
25.06/11.84 * element using the Iterator.remove operation. Most
25.06/11.84 * implementations will probably choose to override this method for
25.06/11.84 * efficiency.
25.06/11.84 *
25.06/11.84 * Note that this implementation will throw an
25.06/11.84 * UnsupportedOperationException if the iterator returned by this
25.06/11.84 * collection's iterator method does not implement the
25.06/11.84 * remove method and this collection is non-empty.
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.84 */
25.06/11.84 public void clear() {
25.06/11.84 Iterator To implement an unmodifiable map, the programmer needs only to extend this
25.06/11.84 * class and provide an implementation for the entrySet method, which
25.06/11.84 * returns a set-view of the map's mappings. Typically, the returned set
25.06/11.84 * will, in turn, be implemented atop AbstractSet. This set should
25.06/11.84 * not support the add or remove methods, and its iterator
25.06/11.84 * should not support the remove method.
25.06/11.84 *
25.06/11.84 * To implement a modifiable map, the programmer must additionally override
25.06/11.84 * this class's put method (which otherwise throws an
25.06/11.84 * UnsupportedOperationException), and the iterator returned by
25.06/11.84 * entrySet().iterator() must additionally implement its
25.06/11.84 * remove method.
25.06/11.84 *
25.06/11.84 * The programmer should generally provide a void (no argument) and map
25.06/11.84 * constructor, as per the recommendation in the Map interface
25.06/11.84 * specification.
25.06/11.84 *
25.06/11.84 * The documentation for each non-abstract method in this class describes its
25.06/11.84 * implementation in detail. Each of these methods may be overridden if the
25.06/11.84 * map being implemented admits a more efficient implementation.
25.06/11.84 *
25.06/11.84 * This class is a member of the
25.06/11.84 *
25.06/11.84 * Java Collections Framework.
25.06/11.84 *
25.06/11.84 * @param This implementation returns entrySet().size().
25.06/11.84 */
25.06/11.84 public int size() {
25.06/11.84 return entrySet().size();
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * {@inheritDoc}
25.06/11.84 *
25.06/11.84 * This implementation returns size() == 0.
25.06/11.84 */
25.06/11.84 public boolean isEmpty() {
25.06/11.84 return size() == 0;
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * {@inheritDoc}
25.06/11.84 *
25.06/11.84 * This implementation iterates over entrySet() searching
25.06/11.84 * for an entry with the specified value. If such an entry is found,
25.06/11.84 * true is returned. If the iteration terminates without
25.06/11.84 * finding such an entry, false is returned. Note that this
25.06/11.84 * implementation requires linear time in the size of the map.
25.06/11.84 *
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 */
25.06/11.84 public boolean containsValue(Object value) {
25.06/11.84 Iterator This implementation iterates over entrySet() searching
25.06/11.84 * for an entry with the specified key. If such an entry is found,
25.06/11.84 * true is returned. If the iteration terminates without
25.06/11.84 * finding such an entry, false is returned. Note that this
25.06/11.84 * implementation requires linear time in the size of the map; many
25.06/11.84 * implementations will override this method.
25.06/11.84 *
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 */
25.06/11.84 public boolean containsKey(Object key) {
25.06/11.84 Iterator This implementation iterates over entrySet() searching
25.06/11.84 * for an entry with the specified key. If such an entry is found,
25.06/11.84 * the entry's value is returned. If the iteration terminates without
25.06/11.84 * finding such an entry, null is returned. Note that this
25.06/11.84 * implementation requires linear time in the size of the map; many
25.06/11.84 * implementations will override this method.
25.06/11.84 *
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 */
25.06/11.84 public V get(Object key) {
25.06/11.84 Iterator This implementation always throws an
25.06/11.84 * UnsupportedOperationException.
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 * @throws IllegalArgumentException {@inheritDoc}
25.06/11.84 */
25.06/11.84 public V put(K key, V value) {
25.06/11.84 throw new UnsupportedOperationException();
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * {@inheritDoc}
25.06/11.84 *
25.06/11.84 * This implementation iterates over entrySet() searching for an
25.06/11.84 * entry with the specified key. If such an entry is found, its value is
25.06/11.84 * obtained with its getValue operation, the entry is removed
25.06/11.84 * from the collection (and the backing map) with the iterator's
25.06/11.84 * remove operation, and the saved value is returned. If the
25.06/11.84 * iteration terminates without finding such an entry, null is
25.06/11.84 * returned. Note that this implementation requires linear time in the
25.06/11.84 * size of the map; many implementations will override this method.
25.06/11.84 *
25.06/11.84 * Note that this implementation throws an
25.06/11.84 * UnsupportedOperationException if the entrySet
25.06/11.84 * iterator does not support the remove method and this map
25.06/11.84 * contains a mapping for the specified key.
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 */
25.06/11.84 public V remove(Object key) {
25.06/11.84 Iterator This implementation iterates over the specified map's
25.06/11.84 * entrySet() collection, and calls this map's put
25.06/11.84 * operation once for each entry returned by the iteration.
25.06/11.84 *
25.06/11.84 * Note that this implementation throws an
25.06/11.84 * UnsupportedOperationException if this map does not support
25.06/11.84 * the put operation and the specified map is nonempty.
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.84 * @throws ClassCastException {@inheritDoc}
25.06/11.84 * @throws NullPointerException {@inheritDoc}
25.06/11.84 * @throws IllegalArgumentException {@inheritDoc}
25.06/11.84 */
25.06/11.84 public void putAll(Map m) {
25.06/11.84 Iterator it = m.entrySet().iterator();
25.06/11.84 while (it.hasNext()) {
25.06/11.84 Map.Entry e = (Map.Entry) it.next();
25.06/11.84 put((K) e.getKey(), (V) e.getValue());
25.06/11.84 }
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * {@inheritDoc}
25.06/11.84 *
25.06/11.84 * This implementation calls entrySet().clear().
25.06/11.84 *
25.06/11.84 * Note that this implementation throws an
25.06/11.84 * UnsupportedOperationException if the entrySet
25.06/11.84 * does not support the clear operation.
25.06/11.84 *
25.06/11.84 * @throws UnsupportedOperationException {@inheritDoc}
25.06/11.84 */
25.06/11.84 public void clear() {
25.06/11.84 entrySet().clear();
25.06/11.84 }
25.06/11.84
25.06/11.84
25.06/11.84 // Views
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Each of these fields are initialized to contain an instance of the
25.06/11.84 * appropriate view the first time this view is requested. The views are
25.06/11.84 * stateless, so there's no reason to create more than one of each.
25.06/11.84 */
25.06/11.84 transient volatile Set This implementation returns a set that subclasses {@link AbstractSet}.
25.06/11.84 * The subclass's iterator method returns a "wrapper object" over this
25.06/11.84 * map's entrySet() iterator. The size method
25.06/11.84 * delegates to this map's size method and the
25.06/11.84 * contains method delegates to this map's
25.06/11.84 * containsKey method.
25.06/11.84 *
25.06/11.84 * The set is created the first time this method is called,
25.06/11.84 * and returned in response to all subsequent calls. No synchronization
25.06/11.84 * is performed, so there is a slight chance that multiple calls to this
25.06/11.84 * method will not all return the same set.
25.06/11.84 */
25.06/11.84 public Set This implementation returns a collection that subclasses {@link
25.06/11.84 * AbstractCollection}. The subclass's iterator method returns a
25.06/11.84 * "wrapper object" over this map's entrySet() iterator.
25.06/11.84 * The size method delegates to this map's size
25.06/11.84 * method and the contains method delegates to this map's
25.06/11.84 * containsValue method.
25.06/11.84 *
25.06/11.84 * The collection is created the first time this method is called, and
25.06/11.84 * returned in response to all subsequent calls. No synchronization is
25.06/11.84 * performed, so there is a slight chance that multiple calls to this
25.06/11.84 * method will not all return the same collection.
25.06/11.84 */
25.06/11.84 public Collection This implementation first checks if the specified object is this map;
25.06/11.84 * if so it returns true. Then, it checks if the specified
25.06/11.84 * object is a map whose size is identical to the size of this map; if
25.06/11.84 * not, it returns false. If so, it iterates over this map's
25.06/11.84 * entrySet collection, and checks that the specified map
25.06/11.84 * contains each mapping that this map contains. If the specified map
25.06/11.84 * fails to contain such a mapping, false is returned. If the
25.06/11.84 * iteration completes, true is returned.
25.06/11.84 *
25.06/11.84 * @param o object to be compared for equality with this map
25.06/11.84 * @return true if the specified object is equal to this map
25.06/11.84 */
25.06/11.84 public boolean equals(Object o) {
25.06/11.84 if (o == this)
25.06/11.84 return true;
25.06/11.84
25.06/11.84 if (!(o instanceof Map))
25.06/11.84 return false;
25.06/11.84 Map This implementation iterates over entrySet(), calling
25.06/11.84 * {@link Map.Entry#hashCode hashCode()} on each element (entry) in the
25.06/11.84 * set, and adding up the results.
25.06/11.84 *
25.06/11.84 * @return the hash code value for this map
25.06/11.84 * @see Map.Entry#hashCode()
25.06/11.84 * @see Object#equals(Object)
25.06/11.84 * @see Set#equals(Object)
25.06/11.84 */
25.06/11.84 public int hashCode() {
25.06/11.84 int h = 0;
25.06/11.84 Iterator
25.06/11.85 *
25.06/11.85 * The process of implementing a set by extending this class is identical
25.06/11.85 * to that of implementing a Collection by extending AbstractCollection,
25.06/11.85 * except that all of the methods and constructors in subclasses of this
25.06/11.85 * class must obey the additional constraints imposed by the Set
25.06/11.85 * interface (for instance, the add method must not permit addition of
25.06/11.85 * multiple instances of an object to a set).
25.06/11.85 *
25.06/11.85 * Note that this class does not override any of the implementations from
25.06/11.85 * the AbstractCollection class. It merely adds implementations
25.06/11.85 * for equals and hashCode.
25.06/11.85 *
25.06/11.85 * This class is a member of the
25.06/11.85 *
25.06/11.85 * Java Collections Framework.
25.06/11.85 *
25.06/11.85 * @param
25.06/11.85 *
25.06/11.85 * This implementation first checks if the specified object is this
25.06/11.85 * set; if so it returns true. Then, it checks if the
25.06/11.85 * specified object is a set whose size is identical to the size of
25.06/11.85 * this set; if not, it returns false. If so, it returns
25.06/11.85 * containsAll((Collection) o).
25.06/11.85 *
25.06/11.85 * @param o object to be compared for equality with this set
25.06/11.85 * @return true if the specified object is equal to this set
25.06/11.85 */
25.06/11.85 public boolean equals(Object o) {
25.06/11.85 if (o == this)
25.06/11.85 return true;
25.06/11.85
25.06/11.85 if (!(o instanceof Set))
25.06/11.85 return false;
25.06/11.85 Collection c = (Collection) o;
25.06/11.85 if (c.size() != size())
25.06/11.85 return false;
25.06/11.85 try {
25.06/11.85 return containsAll(c);
25.06/11.85 } catch (ClassCastException unused) {
25.06/11.85 return false;
25.06/11.85 } catch (NullPointerException unused) {
25.06/11.85 return false;
25.06/11.85 }
25.06/11.85 }
25.06/11.85
25.06/11.85 /**
25.06/11.85 * Returns the hash code value for this set. The hash code of a set is
25.06/11.85 * defined to be the sum of the hash codes of the elements in the set,
25.06/11.85 * where the hash code of a null element is defined to be zero.
25.06/11.85 * This ensures that s1.equals(s2) implies that
25.06/11.85 * s1.hashCode()==s2.hashCode() for any two sets s1
25.06/11.85 * and s2, as required by the general contract of
25.06/11.85 * {@link Object#hashCode}.
25.06/11.85 *
25.06/11.85 * This implementation iterates over the set, calling the
25.06/11.85 * hashCode method on each element in the set, and adding up
25.06/11.85 * the results.
25.06/11.85 *
25.06/11.85 * @return the hash code value for this set
25.06/11.85 * @see Object#equals(Object)
25.06/11.85 * @see Set#equals(Object)
25.06/11.85 */
25.06/11.85 public int hashCode() {
25.06/11.85 int h = 0;
25.06/11.85 Iterator This implementation determines which is the smaller of this set
25.06/11.85 * and the specified collection, by invoking the size
25.06/11.85 * method on each. If this set has fewer elements, then the
25.06/11.85 * implementation iterates over this set, checking each element
25.06/11.85 * returned by the iterator in turn to see if it is contained in
25.06/11.85 * the specified collection. If it is so contained, it is removed
25.06/11.85 * from this set with the iterator's remove method. If
25.06/11.85 * the specified collection has fewer elements, then the
25.06/11.85 * implementation iterates over the specified collection, removing
25.06/11.85 * from this set each element returned by the iterator, using this
25.06/11.85 * set's remove method.
25.06/11.85 *
25.06/11.85 * Note that this implementation will throw an
25.06/11.85 * UnsupportedOperationException if the iterator returned by the
25.06/11.85 * iterator method does not implement the remove method.
25.06/11.85 *
25.06/11.85 * @param c collection containing elements to be removed from this set
25.06/11.85 * @return true if this set changed as a result of the call
25.06/11.85 * @throws UnsupportedOperationException if the removeAll operation
25.06/11.85 * is not supported by this set
25.06/11.85 * @throws ClassCastException if the class of an element of this set
25.06/11.85 * is incompatible with the specified collection (optional)
25.06/11.85 * @throws NullPointerException if this set contains a null element and the
25.06/11.85 * specified collection does not permit null elements (optional),
25.06/11.85 * or if the specified collection is null
25.06/11.85 * @see #remove(Object)
25.06/11.85 * @see #contains(Object)
25.06/11.85 */
25.06/11.85 public boolean removeAll(Collection c) {
25.06/11.85 boolean modified = false;
25.06/11.85
25.06/11.85 if (size() > c.size()) {
25.06/11.85 for (Iterator i = c.iterator(); i.hasNext(); )
25.06/11.85 modified |= remove(i.next());
25.06/11.85 } else {
25.06/11.85 for (Iterator i = iterator(); i.hasNext(); ) {
25.06/11.85 if (c.contains(i.next())) {
25.06/11.85 i.remove();
25.06/11.85 modified = true;
25.06/11.85 }
25.06/11.85 }
25.06/11.85 }
25.06/11.85 return modified;
25.06/11.85 }
25.06/11.85
25.06/11.85 }
25.06/11.85
25.06/11.85
25.06/11.85 /*
25.06/11.85 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.85 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.85 *
25.06/11.85 * This code is free software; you can redistribute it and/or modify it
25.06/11.85 * under the terms of the GNU General Public License version 2 only, as
25.06/11.85 * published by the Free Software Foundation. Sun designates this
25.06/11.85 * particular file as subject to the "Classpath" exception as provided
25.06/11.85 * by Sun in the LICENSE file that accompanied this code.
25.06/11.85 *
25.06/11.85 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.85 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.85 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.85 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.85 * accompanied this code).
25.06/11.85 *
25.06/11.85 * You should have received a copy of the GNU General Public License version
25.06/11.85 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.85 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.85 *
25.06/11.85 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.85 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.85 * have any questions.
25.06/11.85 */
25.06/11.85
25.06/11.85 package javaUtilEx;
25.06/11.85
25.06/11.85 /**
25.06/11.85 * The root interface in the collection hierarchy. A collection
25.06/11.85 * represents a group of objects, known as its elements. Some
25.06/11.85 * collections allow duplicate elements and others do not. Some are ordered
25.06/11.85 * and others unordered. The JDK does not provide any direct
25.06/11.85 * implementations of this interface: it provides implementations of more
25.06/11.85 * specific subinterfaces like Set and List. This interface
25.06/11.85 * is typically used to pass collections around and manipulate them where
25.06/11.85 * maximum generality is desired.
25.06/11.85 *
25.06/11.85 * Bags or multisets (unordered collections that may contain
25.06/11.85 * duplicate elements) should implement this interface directly.
25.06/11.85 *
25.06/11.85 * All general-purpose Collection implementation classes (which
25.06/11.85 * typically implement Collection indirectly through one of its
25.06/11.85 * subinterfaces) should provide two "standard" constructors: a void (no
25.06/11.85 * arguments) constructor, which creates an empty collection, and a
25.06/11.85 * constructor with a single argument of type Collection, which
25.06/11.85 * creates a new collection with the same elements as its argument. In
25.06/11.85 * effect, the latter constructor allows the user to copy any collection,
25.06/11.85 * producing an equivalent collection of the desired implementation type.
25.06/11.85 * There is no way to enforce this convention (as interfaces cannot contain
25.06/11.85 * constructors) but all of the general-purpose Collection
25.06/11.85 * implementations in the Java platform libraries comply.
25.06/11.85 *
25.06/11.85 * The "destructive" methods contained in this interface, that is, the
25.06/11.85 * methods that modify the collection on which they operate, are specified to
25.06/11.85 * throw UnsupportedOperationException if this collection does not
25.06/11.85 * support the operation. If this is the case, these methods may, but are not
25.06/11.85 * required to, throw an UnsupportedOperationException if the
25.06/11.85 * invocation would have no effect on the collection. For example, invoking
25.06/11.85 * the {@link #addAll(Collection)} method on an unmodifiable collection may,
25.06/11.85 * but is not required to, throw the exception if the collection to be added
25.06/11.85 * is empty.
25.06/11.85 *
25.06/11.85 * Some collection implementations have restrictions on the elements that
25.06/11.85 * they may contain. For example, some implementations prohibit null elements,
25.06/11.85 * and some have restrictions on the types of their elements. Attempting to
25.06/11.85 * add an ineligible element throws an unchecked exception, typically
25.06/11.85 * NullPointerException or ClassCastException. Attempting
25.06/11.85 * to query the presence of an ineligible element may throw an exception,
25.06/11.85 * or it may simply return false; some implementations will exhibit the former
25.06/11.85 * behavior and some will exhibit the latter. More generally, attempting an
25.06/11.85 * operation on an ineligible element whose completion would not result in
25.06/11.85 * the insertion of an ineligible element into the collection may throw an
25.06/11.85 * exception or it may succeed, at the option of the implementation.
25.06/11.85 * Such exceptions are marked as "optional" in the specification for this
25.06/11.85 * interface.
25.06/11.85 *
25.06/11.85 * It is up to each collection to determine its own synchronization
25.06/11.85 * policy. In the absence of a stronger guarantee by the
25.06/11.85 * implementation, undefined behavior may result from the invocation
25.06/11.85 * of any method on a collection that is being mutated by another
25.06/11.85 * thread; this includes direct invocations, passing the collection to
25.06/11.85 * a method that might perform invocations, and using an existing
25.06/11.85 * iterator to examine the collection.
25.06/11.85 *
25.06/11.85 * Many methods in Collections Framework interfaces are defined in
25.06/11.85 * terms of the {@link Object#equals(Object) equals} method. For example,
25.06/11.85 * the specification for the {@link #contains(Object) contains(Object o)}
25.06/11.85 * method says: "returns true if and only if this collection
25.06/11.85 * contains at least one element e such that
25.06/11.85 * (o==null ? e==null : o.equals(e))." This specification should
25.06/11.85 * not be construed to imply that invoking Collection.contains
25.06/11.85 * with a non-null argument o will cause o.equals(e) to be
25.06/11.85 * invoked for any element e. Implementations are free to implement
25.06/11.85 * optimizations whereby the equals invocation is avoided, for
25.06/11.85 * example, by first comparing the hash codes of the two elements. (The
25.06/11.85 * {@link Object#hashCode()} specification guarantees that two objects with
25.06/11.85 * unequal hash codes cannot be equal.) More generally, implementations of
25.06/11.85 * the various Collections Framework interfaces are free to take advantage of
25.06/11.85 * the specified behavior of underlying {@link Object} methods wherever the
25.06/11.85 * implementor deems it appropriate.
25.06/11.85 *
25.06/11.85 * This interface is a member of the
25.06/11.85 *
25.06/11.85 * Java Collections Framework.
25.06/11.85 *
25.06/11.85 * @author Josh Bloch
25.06/11.85 * @author Neal Gafter
25.06/11.85 * @see Set
25.06/11.85 * @see List
25.06/11.85 * @see Map
25.06/11.85 * @see SortedSet
25.06/11.85 * @see SortedMap
25.06/11.85 * @see HashSet
25.06/11.85 * @see TreeSet
25.06/11.85 * @see ArrayList
25.06/11.85 * @see LinkedList
25.06/11.85 * @see Vector
25.06/11.85 * @see Collections
25.06/11.85 * @see Arrays
25.06/11.85 * @see AbstractCollection
25.06/11.85 * @since 1.2
25.06/11.85 */
25.06/11.85
25.06/11.85 public interface Collection
25.06/11.83 * (e1.getKey()==null ?
25.06/11.83 * e2.getKey()==null :
25.06/11.83 * e1.getKey().equals(e2.getKey()))
25.06/11.83 * &&
25.06/11.83 * (e1.getValue()==null ?
25.06/11.83 * e2.getValue()==null :
25.06/11.83 * e1.getValue().equals(e2.getValue()))
25.06/11.83 * This ensures that the {@code equals} method works properly across
25.06/11.83 * different implementations of the {@code Map.Entry} interface.
25.06/11.83 *
25.06/11.83 * @param o object to be compared for equality with this map entry
25.06/11.83 * @return {@code true} if the specified object is equal to this map
25.06/11.83 * entry
25.06/11.83 * @see #hashCode
25.06/11.83 */
25.06/11.83 public boolean equals(Object o) {
25.06/11.83 if (!(o instanceof Map.Entry))
25.06/11.83 return false;
25.06/11.83 Map.Entry e = (Map.Entry)o;
25.06/11.83 return eq(key, e.getKey()) && eq(value, e.getValue());
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Returns the hash code value for this map entry. The hash code
25.06/11.83 * of a map entry {@code e} is defined to be:
25.06/11.83 * (e.getKey()==null ? 0 : e.getKey().hashCode()) ^
25.06/11.83 * (e.getValue()==null ? 0 : e.getValue().hashCode())
25.06/11.83 * This ensures that {@code e1.equals(e2)} implies that
25.06/11.83 * {@code e1.hashCode()==e2.hashCode()} for any two Entries
25.06/11.83 * {@code e1} and {@code e2}, as required by the general
25.06/11.83 * contract of {@link Object#hashCode}.
25.06/11.83 *
25.06/11.83 * @return the hash code value for this map entry
25.06/11.83 * @see #equals
25.06/11.83 */
25.06/11.83 public int hashCode() {
25.06/11.83 return (key == null ? 0 : key.hashCode()) ^
25.06/11.83 (value == null ? 0 : value.hashCode());
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Returns a String representation of this map entry. This
25.06/11.83 * implementation returns the string representation of this
25.06/11.83 * entry's key followed by the equals character ("=")
25.06/11.83 * followed by the string representation of this entry's value.
25.06/11.83 *
25.06/11.83 * @return a String representation of this map entry
25.06/11.83 */
25.06/11.83 public String toString() {
25.06/11.83 return key + "=" + value;
25.06/11.83 }
25.06/11.83
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * An Entry maintaining an immutable key and value. This class
25.06/11.83 * does not support method setValue. This class may be
25.06/11.83 * convenient in methods that return thread-safe snapshots of
25.06/11.83 * key-value mappings.
25.06/11.83 *
25.06/11.83 * @since 1.6
25.06/11.83 */
25.06/11.83 public static class SimpleImmutableEntry
25.06/11.83 * (e1.getKey()==null ?
25.06/11.83 * e2.getKey()==null :
25.06/11.83 * e1.getKey().equals(e2.getKey()))
25.06/11.83 * &&
25.06/11.83 * (e1.getValue()==null ?
25.06/11.83 * e2.getValue()==null :
25.06/11.83 * e1.getValue().equals(e2.getValue()))
25.06/11.83 * This ensures that the {@code equals} method works properly across
25.06/11.83 * different implementations of the {@code Map.Entry} interface.
25.06/11.83 *
25.06/11.83 * @param o object to be compared for equality with this map entry
25.06/11.83 * @return {@code true} if the specified object is equal to this map
25.06/11.83 * entry
25.06/11.83 * @see #hashCode
25.06/11.83 */
25.06/11.83 public boolean equals(Object o) {
25.06/11.83 if (!(o instanceof Map.Entry))
25.06/11.83 return false;
25.06/11.83 Map.Entry e = (Map.Entry)o;
25.06/11.83 return eq(key, e.getKey()) && eq(value, e.getValue());
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Returns the hash code value for this map entry. The hash code
25.06/11.83 * of a map entry {@code e} is defined to be:
25.06/11.83 * (e.getKey()==null ? 0 : e.getKey().hashCode()) ^
25.06/11.83 * (e.getValue()==null ? 0 : e.getValue().hashCode())
25.06/11.83 * This ensures that {@code e1.equals(e2)} implies that
25.06/11.83 * {@code e1.hashCode()==e2.hashCode()} for any two Entries
25.06/11.83 * {@code e1} and {@code e2}, as required by the general
25.06/11.83 * contract of {@link Object#hashCode}.
25.06/11.83 *
25.06/11.83 * @return the hash code value for this map entry
25.06/11.83 * @see #equals
25.06/11.83 */
25.06/11.83 public int hashCode() {
25.06/11.83 return (key == null ? 0 : key.hashCode()) ^
25.06/11.83 (value == null ? 0 : value.hashCode());
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Returns a String representation of this map entry. This
25.06/11.83 * implementation returns the string representation of this
25.06/11.83 * entry's key followed by the equals character ("=")
25.06/11.83 * followed by the string representation of this entry's value.
25.06/11.83 *
25.06/11.83 * @return a String representation of this map entry
25.06/11.83 */
25.06/11.83 public String toString() {
25.06/11.83 return key + "=" + value;
25.06/11.83 }
25.06/11.83
25.06/11.83 }
25.06/11.83
25.06/11.83 }
25.06/11.83
25.06/11.83
25.06/11.83 /*
25.06/11.83 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.83 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.83 *
25.06/11.83 * This code is free software; you can redistribute it and/or modify it
25.06/11.83 * under the terms of the GNU General Public License version 2 only, as
25.06/11.83 * published by the Free Software Foundation. Sun designates this
25.06/11.83 * particular file as subject to the "Classpath" exception as provided
25.06/11.83 * by Sun in the LICENSE file that accompanied this code.
25.06/11.83 *
25.06/11.83 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.83 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.83 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.83 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.83 * accompanied this code).
25.06/11.83 *
25.06/11.83 * You should have received a copy of the GNU General Public License version
25.06/11.83 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.83 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.83 *
25.06/11.83 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.83 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.83 * have any questions.
25.06/11.83 */
25.06/11.83
25.06/11.83 package javaUtilEx;
25.06/11.83
25.06/11.83 /**
25.06/11.83 * This class provides a skeletal implementation of the Set
25.06/11.83 * interface to minimize the effort required to implement this
25.06/11.83 * interface.
25.06/11.83 * Map m = Collections.synchronizedMap(new HashMap(...));
25.06/11.83 *
25.06/11.83 * IllegalArgumentException with no
25.06/11.83 * detail message.
25.06/11.83 */
25.06/11.83 public IllegalArgumentException() {
25.06/11.83 super();
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Constructs an IllegalArgumentException with the
25.06/11.83 * specified detail message.
25.06/11.83 *
25.06/11.83 * @param s the detail message.
25.06/11.83 */
25.06/11.83 public IllegalArgumentException(String s) {
25.06/11.83 super(s);
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Constructs a new exception with the specified detail message and
25.06/11.83 * cause.
25.06/11.83 *
25.06/11.83 * cause is
25.06/11.83 * not automatically incorporated in this exception's detail
25.06/11.83 * message.
25.06/11.83 *
25.06/11.83 * @param message the detail message (which is saved for later retrieval
25.06/11.83 * by the {@link Throwable#getMessage()} method).
25.06/11.83 * @param cause the cause (which is saved for later retrieval by the
25.06/11.83 * {@link Throwable#getCause()} method). (A null value
25.06/11.83 * is permitted, and indicates that the cause is nonexistent or
25.06/11.83 * unknown.)
25.06/11.83 * @since 1.5
25.06/11.83 */
25.06/11.83 public IllegalArgumentException(String message, Throwable cause) {
25.06/11.83 super(message, cause);
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Constructs a new exception with the specified cause and a detail
25.06/11.83 * message of (cause==null ? null : cause.toString()) (which
25.06/11.83 * typically contains the class and detail message of cause).
25.06/11.83 * This constructor is useful for exceptions that are little more than
25.06/11.83 * wrappers for other throwables (for example, {@link
25.06/11.83 * java.security.PrivilegedActionException}).
25.06/11.83 *
25.06/11.83 * @param cause the cause (which is saved for later retrieval by the
25.06/11.83 * {@link Throwable#getCause()} method). (A null value is
25.06/11.83 * permitted, and indicates that the cause is nonexistent or
25.06/11.83 * unknown.)
25.06/11.83 * @since 1.5
25.06/11.83 */
25.06/11.83 public IllegalArgumentException(Throwable cause) {
25.06/11.83 super(cause);
25.06/11.83 }
25.06/11.83
25.06/11.83 private static final long serialVersionUID = -5365630128856068164L;
25.06/11.83 }
25.06/11.83
25.06/11.83
25.06/11.83 /*
25.06/11.83 * Copyright 1996-2003 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.83 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.83 *
25.06/11.83 * This code is free software; you can redistribute it and/or modify it
25.06/11.83 * under the terms of the GNU General Public License version 2 only, as
25.06/11.83 * published by the Free Software Foundation. Sun designates this
25.06/11.83 * particular file as subject to the "Classpath" exception as provided
25.06/11.83 * by Sun in the LICENSE file that accompanied this code.
25.06/11.83 *
25.06/11.83 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.83 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.83 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.83 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.83 * accompanied this code).
25.06/11.83 *
25.06/11.83 * You should have received a copy of the GNU General Public License version
25.06/11.83 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.83 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.83 *
25.06/11.83 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.83 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.83 * have any questions.
25.06/11.83 */
25.06/11.83
25.06/11.83 package javaUtilEx;
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Signals that a method has been invoked at an illegal or
25.06/11.83 * inappropriate time. In other words, the Java environment or
25.06/11.83 * Java application is not in an appropriate state for the requested
25.06/11.83 * operation.
25.06/11.83 *
25.06/11.83 * @author Jonni Kanerva
25.06/11.83 * @since JDK1.1
25.06/11.83 */
25.06/11.83 public
25.06/11.83 class IllegalStateException extends RuntimeException {
25.06/11.83 /**
25.06/11.83 * Constructs an IllegalStateException with no detail message.
25.06/11.83 * A detail message is a String that describes this particular exception.
25.06/11.83 */
25.06/11.83 public IllegalStateException() {
25.06/11.83 super();
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Constructs an IllegalStateException with the specified detail
25.06/11.83 * message. A detail message is a String that describes this particular
25.06/11.83 * exception.
25.06/11.83 *
25.06/11.83 * @param s the String that contains a detailed message
25.06/11.83 */
25.06/11.83 public IllegalStateException(String s) {
25.06/11.83 super(s);
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Constructs a new exception with the specified detail message and
25.06/11.83 * cause.
25.06/11.83 *
25.06/11.83 * cause is
25.06/11.83 * not automatically incorporated in this exception's detail
25.06/11.83 * message.
25.06/11.83 *
25.06/11.83 * @param message the detail message (which is saved for later retrieval
25.06/11.83 * by the {@link Throwable#getMessage()} method).
25.06/11.83 * @param cause the cause (which is saved for later retrieval by the
25.06/11.83 * {@link Throwable#getCause()} method). (A null value
25.06/11.83 * is permitted, and indicates that the cause is nonexistent or
25.06/11.83 * unknown.)
25.06/11.83 * @since 1.5
25.06/11.83 */
25.06/11.83 public IllegalStateException(String message, Throwable cause) {
25.06/11.83 super(message, cause);
25.06/11.83 }
25.06/11.83
25.06/11.83 /**
25.06/11.83 * Constructs a new exception with the specified cause and a detail
25.06/11.83 * message of (cause==null ? null : cause.toString()) (which
25.06/11.83 * typically contains the class and detail message of cause).
25.06/11.83 * This constructor is useful for exceptions that are little more than
25.06/11.83 * wrappers for other throwables (for example, {@link
25.06/11.83 * java.security.PrivilegedActionException}).
25.06/11.83 *
25.06/11.83 * @param cause the cause (which is saved for later retrieval by the
25.06/11.84 * {@link Throwable#getCause()} method). (A null value is
25.06/11.84 * permitted, and indicates that the cause is nonexistent or
25.06/11.84 * unknown.)
25.06/11.84 * @since 1.5
25.06/11.84 */
25.06/11.84 public IllegalStateException(Throwable cause) {
25.06/11.84 super(cause);
25.06/11.84 }
25.06/11.84
25.06/11.84 static final long serialVersionUID = -1848914673093119416L;
25.06/11.84 }
25.06/11.84
25.06/11.84
25.06/11.84 /*
25.06/11.84 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.84 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.84 *
25.06/11.84 * This code is free software; you can redistribute it and/or modify it
25.06/11.84 * under the terms of the GNU General Public License version 2 only, as
25.06/11.84 * published by the Free Software Foundation. Sun designates this
25.06/11.84 * particular file as subject to the "Classpath" exception as provided
25.06/11.84 * by Sun in the LICENSE file that accompanied this code.
25.06/11.84 *
25.06/11.84 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.84 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.84 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.84 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.84 * accompanied this code).
25.06/11.84 *
25.06/11.84 * You should have received a copy of the GNU General Public License version
25.06/11.84 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.84 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.84 *
25.06/11.84 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.84 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.84 * have any questions.
25.06/11.84 */
25.06/11.84
25.06/11.84 package javaUtilEx;
25.06/11.84
25.06/11.84 /**
25.06/11.84 * An iterator over a collection. {@code Iterator} takes the place of
25.06/11.84 * {@link Enumeration} in the Java Collections Framework. Iterators
25.06/11.84 * differ from enumerations in two ways:
25.06/11.84 *
25.06/11.84 *
25.06/11.84 *
25.06/11.84 *
25.06/11.84 * (key==null ? k==null : key.equals(k)), that mapping
25.06/11.84 * is removed. (The map can contain at most one such mapping.)
25.06/11.84 *
25.06/11.84 *
25.06/11.84 * (e1.getKey()==null ?
25.06/11.84 * e2.getKey()==null : e1.getKey().equals(e2.getKey())) &&
25.06/11.84 * (e1.getValue()==null ?
25.06/11.84 * e2.getValue()==null : e1.getValue().equals(e2.getValue()))
25.06/11.84 *
25.06/11.84 * This ensures that the equals method works properly across
25.06/11.84 * different implementations of the Map.Entry interface.
25.06/11.84 *
25.06/11.84 * @param o object to be compared for equality with this map entry
25.06/11.84 * @return true if the specified object is equal to this map
25.06/11.84 * entry
25.06/11.84 */
25.06/11.84 boolean equals(Object o);
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Returns the hash code value for this map entry. The hash code
25.06/11.84 * of a map entry e is defined to be:
25.06/11.84 * (e.getKey()==null ? 0 : e.getKey().hashCode()) ^
25.06/11.84 * (e.getValue()==null ? 0 : e.getValue().hashCode())
25.06/11.84 *
25.06/11.84 * This ensures that e1.equals(e2) implies that
25.06/11.84 * e1.hashCode()==e2.hashCode() for any two Entries
25.06/11.84 * e1 and e2, as required by the general
25.06/11.84 * contract of Object.hashCode.
25.06/11.84 *
25.06/11.84 * @return the hash code value for this map entry
25.06/11.84 * @see Object#hashCode()
25.06/11.84 * @see Object#equals(Object)
25.06/11.84 * @see #equals(Object)
25.06/11.84 */
25.06/11.84 int hashCode();
25.06/11.84 }
25.06/11.84
25.06/11.84 // Comparison and hashing
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Compares the specified object with this map for equality. Returns
25.06/11.84 * true if the given object is also a map and the two maps
25.06/11.84 * represent the same mappings. More formally, two maps m1 and
25.06/11.84 * m2 represent the same mappings if
25.06/11.84 * m1.entrySet().equals(m2.entrySet()). This ensures that the
25.06/11.84 * equals method works properly across different implementations
25.06/11.84 * of the Map interface.
25.06/11.84 *
25.06/11.84 * @param o object to be compared for equality with this map
25.06/11.84 * @return true if the specified object is equal to this map
25.06/11.84 */
25.06/11.84 boolean equals(Object o);
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Returns the hash code value for this map. The hash code of a map is
25.06/11.84 * defined to be the sum of the hash codes of each entry in the map's
25.06/11.84 * entrySet() view. This ensures that m1.equals(m2)
25.06/11.84 * implies that m1.hashCode()==m2.hashCode() for any two maps
25.06/11.84 * m1 and m2, as required by the general contract of
25.06/11.84 * {@link Object#hashCode}.
25.06/11.84 *
25.06/11.84 * @return the hash code value for this map
25.06/11.84 * @see Map.Entry#hashCode()
25.06/11.84 * @see Object#equals(Object)
25.06/11.84 * @see #equals(Object)
25.06/11.84 */
25.06/11.84 int hashCode();
25.06/11.84 }
25.06/11.84
25.06/11.84
25.06/11.84 /*
25.06/11.84 * Copyright 1994-1998 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.84 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.84 *
25.06/11.84 * This code is free software; you can redistribute it and/or modify it
25.06/11.84 * under the terms of the GNU General Public License version 2 only, as
25.06/11.84 * published by the Free Software Foundation. Sun designates this
25.06/11.84 * particular file as subject to the "Classpath" exception as provided
25.06/11.84 * by Sun in the LICENSE file that accompanied this code.
25.06/11.84 *
25.06/11.84 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.84 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.84 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.84 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.84 * accompanied this code).
25.06/11.84 *
25.06/11.84 * You should have received a copy of the GNU General Public License version
25.06/11.84 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.84 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.84 *
25.06/11.84 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.84 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.84 * have any questions.
25.06/11.84 */
25.06/11.84
25.06/11.84 package javaUtilEx;
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Thrown by the nextElement method of an
25.06/11.84 * Enumeration to indicate that there are no more
25.06/11.84 * elements in the enumeration.
25.06/11.84 *
25.06/11.84 * @author unascribed
25.06/11.84 * @see java.util.Enumeration
25.06/11.84 * @see java.util.Enumeration#nextElement()
25.06/11.84 * @since JDK1.0
25.06/11.84 */
25.06/11.84 public
25.06/11.84 class NoSuchElementException extends RuntimeException {
25.06/11.84 /**
25.06/11.84 * Constructs a NoSuchElementException with null
25.06/11.84 * as its error message string.
25.06/11.84 */
25.06/11.84 public NoSuchElementException() {
25.06/11.84 super();
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Constructs a NoSuchElementException, saving a reference
25.06/11.84 * to the error message string s for later retrieval by the
25.06/11.84 * getMessage method.
25.06/11.84 *
25.06/11.84 * @param s the detail message.
25.06/11.84 */
25.06/11.84 public NoSuchElementException(String s) {
25.06/11.84 super(s);
25.06/11.84 }
25.06/11.84 }
25.06/11.84
25.06/11.84
25.06/11.84 package javaUtilEx;
25.06/11.84
25.06/11.84 public class Random {
25.06/11.84 static String[] args;
25.06/11.84 static int index = 0;
25.06/11.84
25.06/11.84 public static int random() {
25.06/11.84 String string = args[index];
25.06/11.84 index++;
25.06/11.84 return string.length();
25.06/11.84 }
25.06/11.84 }
25.06/11.84
25.06/11.84
25.06/11.84 /*
25.06/11.84 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.84 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.84 *
25.06/11.84 * This code is free software; you can redistribute it and/or modify it
25.06/11.84 * under the terms of the GNU General Public License version 2 only, as
25.06/11.84 * published by the Free Software Foundation. Sun designates this
25.06/11.84 * particular file as subject to the "Classpath" exception as provided
25.06/11.84 * by Sun in the LICENSE file that accompanied this code.
25.06/11.84 *
25.06/11.84 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.84 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.84 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.84 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.84 * accompanied this code).
25.06/11.84 *
25.06/11.84 * You should have received a copy of the GNU General Public License version
25.06/11.84 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.84 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.84 *
25.06/11.84 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.84 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.84 * have any questions.
25.06/11.84 */
25.06/11.84
25.06/11.84 package javaUtilEx;
25.06/11.84
25.06/11.84 /**
25.06/11.84 * A collection that contains no duplicate elements. More formally, sets
25.06/11.84 * contain no pair of elements e1 and e2 such that
25.06/11.84 * e1.equals(e2), and at most one null element. As implied by
25.06/11.84 * its name, this interface models the mathematical set abstraction.
25.06/11.84 *
25.06/11.84 *
25.06/11.84 * String[] y = x.toArray(new String[0]);
25.06/11.84 *
25.06/11.84 * Note that toArray(new Object[0]) is identical in function to
25.06/11.84 * toArray().
25.06/11.84 *
25.06/11.84 * @param a the array into which the elements of this set are to be
25.06/11.84 * stored, if it is big enough; otherwise, a new array of the same
25.06/11.84 * runtime type is allocated for this purpose.
25.06/11.84 * @return an array containing all the elements in this set
25.06/11.84 * @throws ArrayStoreException if the runtime type of the specified array
25.06/11.84 * is not a supertype of the runtime type of every element in this
25.06/11.84 * set
25.06/11.84 * @throws NullPointerException if the specified array is null
25.06/11.84 */
25.06/11.84 cause is
25.06/11.84 * not automatically incorporated in this exception's detail
25.06/11.84 * message.
25.06/11.84 *
25.06/11.84 * @param message the detail message (which is saved for later retrieval
25.06/11.84 * by the {@link Throwable#getMessage()} method).
25.06/11.84 * @param cause the cause (which is saved for later retrieval by the
25.06/11.84 * {@link Throwable#getCause()} method). (A null value
25.06/11.84 * is permitted, and indicates that the cause is nonexistent or
25.06/11.84 * unknown.)
25.06/11.84 * @since 1.5
25.06/11.84 */
25.06/11.84 public UnsupportedOperationException(String message, Throwable cause) {
25.06/11.84 super(message, cause);
25.06/11.84 }
25.06/11.84
25.06/11.84 /**
25.06/11.84 * Constructs a new exception with the specified cause and a detail
25.06/11.84 * message of (cause==null ? null : cause.toString()) (which
25.06/11.84 * typically contains the class and detail message of cause).
25.06/11.84 * This constructor is useful for exceptions that are little more than
25.06/11.84 * wrappers for other throwables (for example, {@link
25.06/11.84 * java.security.PrivilegedActionException}).
25.06/11.84 *
25.06/11.84 * @param cause the cause (which is saved for later retrieval by the
25.06/11.84 * {@link Throwable#getCause()} method). (A null value is
25.06/11.84 * permitted, and indicates that the cause is nonexistent or
25.06/11.84 * unknown.)
25.06/11.84 * @since 1.5
25.06/11.84 */
25.06/11.84 public UnsupportedOperationException(Throwable cause) {
25.06/11.84 super(cause);
25.06/11.84 }
25.06/11.84
25.06/11.84 static final long serialVersionUID = -1242599979055084673L;
25.06/11.84 }
25.06/11.84
25.06/11.84
25.06/11.84
25.06/11.84 ----------------------------------------
25.06/11.84
25.06/11.84 (1) BareJBCToJBCProof (EQUIVALENT)
25.06/11.84 initialized classpath
25.06/11.84 ----------------------------------------
25.06/11.84
25.06/11.84 (2)
25.06/11.84 Obligation:
25.06/11.84 need to prove termination of the following program:
25.06/11.84 /*
25.06/11.84 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.84 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.84 *
25.06/11.84 * This code is free software; you can redistribute it and/or modify it
25.06/11.84 * under the terms of the GNU General Public License version 2 only, as
25.06/11.84 * published by the Free Software Foundation. Sun designates this
25.06/11.84 * particular file as subject to the "Classpath" exception as provided
25.06/11.84 * by Sun in the LICENSE file that accompanied this code.
25.06/11.84 *
25.06/11.84 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.84 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.84 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.84 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.84 * accompanied this code).
25.06/11.84 *
25.06/11.84 * You should have received a copy of the GNU General Public License version
25.06/11.84 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.84 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.84 *
25.06/11.84 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.84 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.84 * have any questions.
25.06/11.84 */
25.06/11.84
25.06/11.84 package javaUtilEx;
25.06/11.84
25.06/11.84 /**
25.06/11.84 * This class provides a skeletal implementation of the Collection
25.06/11.84 * interface, to minimize the effort required to implement this interface.
25.06/11.85 * (e1.getKey()==null ?
25.06/11.85 * e2.getKey()==null :
25.06/11.85 * e1.getKey().equals(e2.getKey()))
25.06/11.85 * &&
25.06/11.85 * (e1.getValue()==null ?
25.06/11.85 * e2.getValue()==null :
25.06/11.85 * e1.getValue().equals(e2.getValue()))
25.06/11.85 * This ensures that the {@code equals} method works properly across
25.06/11.85 * different implementations of the {@code Map.Entry} interface.
25.06/11.85 *
25.06/11.85 * @param o object to be compared for equality with this map entry
25.06/11.85 * @return {@code true} if the specified object is equal to this map
25.06/11.85 * entry
25.06/11.85 * @see #hashCode
25.06/11.85 */
25.06/11.85 public boolean equals(Object o) {
25.06/11.85 if (!(o instanceof Map.Entry))
25.06/11.85 return false;
25.06/11.85 Map.Entry e = (Map.Entry)o;
25.06/11.85 return eq(key, e.getKey()) && eq(value, e.getValue());
25.06/11.85 }
25.06/11.85
25.06/11.85 /**
25.06/11.85 * Returns the hash code value for this map entry. The hash code
25.06/11.85 * of a map entry {@code e} is defined to be:
25.06/11.85 * (e.getKey()==null ? 0 : e.getKey().hashCode()) ^
25.06/11.85 * (e.getValue()==null ? 0 : e.getValue().hashCode())
25.06/11.85 * This ensures that {@code e1.equals(e2)} implies that
25.06/11.85 * {@code e1.hashCode()==e2.hashCode()} for any two Entries
25.06/11.85 * {@code e1} and {@code e2}, as required by the general
25.06/11.85 * contract of {@link Object#hashCode}.
25.06/11.85 *
25.06/11.85 * @return the hash code value for this map entry
25.06/11.85 * @see #equals
25.06/11.85 */
25.06/11.85 public int hashCode() {
25.06/11.85 return (key == null ? 0 : key.hashCode()) ^
25.06/11.85 (value == null ? 0 : value.hashCode());
25.06/11.85 }
25.06/11.85
25.06/11.85 /**
25.06/11.85 * Returns a String representation of this map entry. This
25.06/11.85 * implementation returns the string representation of this
25.06/11.85 * entry's key followed by the equals character ("=")
25.06/11.85 * followed by the string representation of this entry's value.
25.06/11.85 *
25.06/11.85 * @return a String representation of this map entry
25.06/11.85 */
25.06/11.85 public String toString() {
25.06/11.85 return key + "=" + value;
25.06/11.85 }
25.06/11.85
25.06/11.85 }
25.06/11.85
25.06/11.85 /**
25.06/11.85 * An Entry maintaining an immutable key and value. This class
25.06/11.85 * does not support method setValue. This class may be
25.06/11.85 * convenient in methods that return thread-safe snapshots of
25.06/11.85 * key-value mappings.
25.06/11.85 *
25.06/11.85 * @since 1.6
25.06/11.85 */
25.06/11.85 public static class SimpleImmutableEntry
25.06/11.85 * (e1.getKey()==null ?
25.06/11.85 * e2.getKey()==null :
25.06/11.85 * e1.getKey().equals(e2.getKey()))
25.06/11.85 * &&
25.06/11.85 * (e1.getValue()==null ?
25.06/11.85 * e2.getValue()==null :
25.06/11.85 * e1.getValue().equals(e2.getValue()))
25.06/11.85 * This ensures that the {@code equals} method works properly across
25.06/11.85 * different implementations of the {@code Map.Entry} interface.
25.06/11.85 *
25.06/11.85 * @param o object to be compared for equality with this map entry
25.06/11.85 * @return {@code true} if the specified object is equal to this map
25.06/11.85 * entry
25.06/11.85 * @see #hashCode
25.06/11.85 */
25.06/11.85 public boolean equals(Object o) {
25.06/11.85 if (!(o instanceof Map.Entry))
25.06/11.85 return false;
25.06/11.85 Map.Entry e = (Map.Entry)o;
25.06/11.85 return eq(key, e.getKey()) && eq(value, e.getValue());
25.06/11.85 }
25.06/11.85
25.06/11.85 /**
25.06/11.85 * Returns the hash code value for this map entry. The hash code
25.06/11.85 * of a map entry {@code e} is defined to be:
25.06/11.85 * (e.getKey()==null ? 0 : e.getKey().hashCode()) ^
25.06/11.85 * (e.getValue()==null ? 0 : e.getValue().hashCode())
25.06/11.85 * This ensures that {@code e1.equals(e2)} implies that
25.06/11.85 * {@code e1.hashCode()==e2.hashCode()} for any two Entries
25.06/11.85 * {@code e1} and {@code e2}, as required by the general
25.06/11.85 * contract of {@link Object#hashCode}.
25.06/11.85 *
25.06/11.85 * @return the hash code value for this map entry
25.06/11.85 * @see #equals
25.06/11.85 */
25.06/11.85 public int hashCode() {
25.06/11.85 return (key == null ? 0 : key.hashCode()) ^
25.06/11.85 (value == null ? 0 : value.hashCode());
25.06/11.85 }
25.06/11.85
25.06/11.85 /**
25.06/11.85 * Returns a String representation of this map entry. This
25.06/11.85 * implementation returns the string representation of this
25.06/11.85 * entry's key followed by the equals character ("=")
25.06/11.85 * followed by the string representation of this entry's value.
25.06/11.85 *
25.06/11.85 * @return a String representation of this map entry
25.06/11.85 */
25.06/11.85 public String toString() {
25.06/11.85 return key + "=" + value;
25.06/11.85 }
25.06/11.85
25.06/11.85 }
25.06/11.85
25.06/11.85 }
25.06/11.85
25.06/11.85
25.06/11.85 /*
25.06/11.85 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
25.06/11.85 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
25.06/11.85 *
25.06/11.85 * This code is free software; you can redistribute it and/or modify it
25.06/11.85 * under the terms of the GNU General Public License version 2 only, as
25.06/11.85 * published by the Free Software Foundation. Sun designates this
25.06/11.85 * particular file as subject to the "Classpath" exception as provided
25.06/11.85 * by Sun in the LICENSE file that accompanied this code.
25.06/11.85 *
25.06/11.85 * This code is distributed in the hope that it will be useful, but WITHOUT
25.06/11.85 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
25.06/11.85 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25.06/11.85 * version 2 for more details (a copy is included in the LICENSE file that
25.06/11.85 * accompanied this code).
25.06/11.85 *
25.06/11.85 * You should have received a copy of the GNU General Public License version
25.06/11.85 * 2 along with this work; if not, write to the Free Software Foundation,
25.06/11.85 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
25.06/11.85 *
25.06/11.85 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
25.06/11.85 * CA 95054 USA or visit www.sun.com if you need additional information or
25.06/11.85 * have any questions.
25.06/11.85 */
25.06/11.85
25.06/11.85 package javaUtilEx;
25.06/11.85
25.06/11.85 /**
25.06/11.85 * This class provides a skeletal implementation of the Set
25.06/11.85 * interface to minimize the effort required to implement this
25.06/11.85 * interface.