@Override
    public boolean add(final Map<String, Object> e) {
        return parent.add(e);
    }

    @Override
    public void add(final int index, final Map<String, Object> element) {
        parent.add(index, element);
    }

    @Override
    public boolean addAll(final Collection<? extends Map<String, Object>> c) {
        return parent.addAll(c);
    }

    @Override

    }

    @Override
    public List<@Nullable V> combine(List<@Nullable Present<V>> values) {
      List<@Nullable V> result = newArrayListWithCapacity(values.size());
      for (Present<V> element : values) {
        result.add(element != null ? element.value : null);
      }
      return unmodifiableList(result);
    }
  }

  /** The result of a successful {@code Future}. */

  public int count(@Nullable Object element) {
    return delegate().count(element);
  }

  @CanIgnoreReturnValue
  @Override
  public int add(@ParametricNullness E element, int occurrences) {
    return delegate().add(element, occurrences);
  }

  @CanIgnoreReturnValue
  @Override
  public int remove(@Nullable Object element, int occurrences) {
    return delegate().remove(element, occurrences);
  }

  @Override

Por ejemplo, supongamos que quieres tener una *path operation* que permita actualizar elementos, y devuelva códigos de estado HTTP de 200 "OK" cuando sea exitoso.

Pero también quieres que acepte nuevos elementos. Y cuando los elementos no existían antes, los crea y devuelve un código de estado HTTP de 201 "Created".

        return as(type, tagged.getBaseObject());
    }

    /**
     * Gets an element from a DLSequence at the specified index and casts it to the specified type
     * @param <T> the target ASN.1 primitive type
     * @param type the target class type
     * @param sequence the DLSequence
     * @param index the element index
     * @return sequence element cast to type
     * @throws PACDecodingException if types are incompatible
     */

     * any of the algorithm name is not supported. The returned collection has equal count of elements as passed in
     * collection of names, and if names contains duplicated elements, the returned list of algorithms will have
     * duplicates as well.
     *
     * @throws ChecksumAlgorithmServiceException if any asked algorithm name is not supported.

/**
 * An empty iterator implementation for SMB resources.
 * This iterator contains no elements and immediately returns false for hasNext().
 *
 * @author mbechler
 */
public class EmptyIterator implements CloseableIterator<SmbResource> {

    /**
     * Default constructor for EmptyIterator.
     * Creates an empty iterator with no elements.
     */
    public EmptyIterator() {
        // Default constructor
    }

    return new Enums();
  }

  @Override
  public Multiset<AnEnum> create(Object... elements) {
    AnEnum[] array = new AnEnum[elements.length];
    int i = 0;
    for (Object e : elements) {
      array[i++] = (AnEnum) e;
    }
    return create(array);
  }

  protected abstract Multiset<AnEnum> create(AnEnum[] elements);

  @Override
  public AnEnum[] createArray(int length) {
    return new AnEnum[length];

        for (final int[] element : DOS_ERROR_CODES) {
            dosErrorCodeStatusesTmp.put(element[0], element[1]);
            final int mappedNtCode = element[1];
            final String mappedNtMessage = errorCodeMessagesTmp.get(mappedNtCode);
            if (mappedNtMessage != null) {
                errorCodeMessagesTmp.put(element[0], mappedNtMessage);
            }
        }

        /* If a target address to query was not specified explicitly
         * with the addr parameter we fall into this resolveOrder routine.
         */

        for (final int element : resolveOrder) {
            try {
                switch (element) {
                case RESOLVER_LMHOSTS:
                    final NbtAddress ans = Lmhosts.getByName(name);
                    if (ans != null) {