Examples of java.util.AbstractCollection

java.util.AbstractCollection
This class provides a skeletal implementation of the Collection interface, to minimize the effort required to implement this interface.
To implement an unmodifiable collection, the programmer needs only to extend this class and provide implementations for the iterator and size methods. (The iterator returned by the iterator method must implement hasNext and next.)
To implement a modifiable collection, the programmer must additionally override this class's add method (which otherwise throws an UnsupportedOperationException), and the iterator returned by the iterator method must additionally implement its remove method.
The programmer should generally provide a void (no argument) and Collection constructor, as per the recommendation in the Collection interface specification.
The documentation for each non-abstract method in this class describes its implementation in detail. Each of these methods may be overridden if the collection being implemented admits a more efficient implementation.
This class is a member of the Java Collections Framework. @author Josh Bloch @author Neal Gafter @version 1.38, 06/16/06 @see Collection @since 1.2

     * @return a collection view of the values contained in this map.
     */
    public Collection valuesByValue() {


        if (collectionOfValues[VALUE] == null) {
            collectionOfValues[VALUE] = new AbstractCollection() {


                public Iterator iterator() {


                    return new DoubleOrderedMapIterator(VALUE) {

View Full Code Here

     * @return a collection view of the values contained in this map.
     */
    public Collection values() {


        if (collectionOfValues[KEY] == null) {
            collectionOfValues[KEY] = new AbstractCollection() {


                public Iterator iterator() {


                    return new DoubleOrderedMapIterator(KEY) {

View Full Code Here

        list = getList();
        assertEquals("List shouldn't equal String", false, list.equals(""));
        verify();


        final List listForC = Arrays.asList(getFullElements());
        Collection c = new AbstractCollection() {
            public int size() {
                return listForC.size();
            }


            public Iterator iterator() {

View Full Code Here

     *
     *  @return a collection view of this map's values.
     */
    public Collection values() {
        if (values != null) return values;
        values = new AbstractCollection()  {
            public int size() {
                return ReferenceMap.this.size();
            }


            public void clear() {

View Full Code Here


    /**
     *  Implements {@link Map#values()}.
     */
    public Collection values() {
        return new AbstractCollection() {
            // required impl
            public Iterator iterator() {
                return new OrderedIterator(VALUE);
            }
            public boolean remove(Object value) {

View Full Code Here

      MyCollectionHandler handler = new MyCollectionHandler(aset);
      factory.setHandler(handler);
      factory.setSuperclass(java.util.AbstractCollection.class);
      Class[] sig = {};
      Object[] args = {};
      AbstractCollection proxy = (AbstractCollection) factory.create(sig, args);
      proxy.add("Add");
      assertEquals("size", 1, aset.size());
      proxy.remove("Add");
      assertEquals("size", 0, aset.size());
      assertEquals("isEmpty", true, proxy.isEmpty());
   }

View Full Code Here


    /**
     *  Implements {@link Map#values()}.
     */
    public Collection values() {
        return new AbstractCollection() {
            // required impl
            public Iterator iterator() {
                return new OrderedIterator(VALUE);
            }

View Full Code Here

   *
   * <p>Note: the performance of the size method of returned collection
   * is no good.
   */
  public Collection getItems() {
    return new AbstractCollection() {
      public int size() {
        return getItemCount();
      }
      public boolean isEmpty() {
        return getChildren().isEmpty();

View Full Code Here

  
  public Grid() {
    init();
  }
  private void init() {
    _heads = new AbstractCollection() {
      public int size() {
        int sz = getChildren().size();
        if (_rows != null) --sz;
        if (_foot != null) --sz;
        if (_paging != null) --sz;

View Full Code Here

  public Tree() {
    init();
  }
  private void init() {
    _selItems = new LinkedHashSet(5);
    _heads = new AbstractCollection() {
      public int size() {
        int sz = getChildren().size();
        if (_treechildren != null) --sz;
        if (_treefoot != null) --sz;
        if (_paging != null) --sz;

View Full Code Here

0 1 2 3 4 5 6 7 8

TOP

Related Classes of java.util.AbstractCollection

ariba.util.core.Hashtable

ariba.util.core.OrderedHashtable

com.bazaarvoice.commons.data.model.json.schema.types.JSONSchemaArrayType

com.sun.jdo.spi.persistence.utility.WeakValueHashMap

de.odysseus.calyxo.base.util.ListOrderedMap

freemarker.ext.util.IdentityHashMap

gnu.java.lang.CPStringBuilder

jodd.util.collection.IntHashMap

org.apache.axis.collections.SequencedHashMap

org.apache.commons.collections.DoubleOrderedMap

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.