return nil, nil, err
	}

	// Wait up to 10 seconds for disks to come online.
	pools := obj.(*erasureServerPools)
	t := time.Now()
	for _, pool := range pools.serverPools {
		for _, sets := range pool.erasureDisks {
			for _, s := range sets {
				if !s.IsLocal() {
					for !s.IsOnline() {
						time.Sleep(100 * time.Millisecond)
						if time.Since(t) > 10*time.Second {

        /*
         * We can't inherit the normal implementation (which calls
         * Sets.removeAllImpl(Set, *Collection*)) because, under some
         * circumstances, it attempts to call columnKeySet().iterator().remove,
         * which is unsupported.
         */
        checkNotNull(c);
        return Sets.removeAllImpl(this, c.iterator());
      }

      @Override

      requireNonNull(connections.removeSuccessor(successor));
      --edgeCount;
    }
    if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal.
      // Since views are returned, we need to copy the predecessors that will be removed.
      // Thus we avoid modifying the underlying view while iterating over it.

    }

    /**
     * Checks if the response is extended.
     *
     * @return the isExtended
     */
    public final boolean isExtended() {
        return this.isExtended;
    }

    /**
     * Sets whether the response is extended.
     *
     * @param isExtended
     *            the isExtended to set
     */
    public final void setExtended(final boolean isExtended) {
        this.isExtended = isExtended;

    }

    /**
     * Unsets a specific flag
     * @param flag the flag to unset
     */
    public void unsetFlag(final int flag) {
        flags &= ~flag;
    }

    /**
     * Sets a specific flag
     * @param flag the flag to set
     */
    public void setFlag(final int flag) {
        flags |= flag;
    }

    /**
     * Get the result of the DCERPC call.

      return emptySet();
    } else {
      return emptyList();
    }
  }

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

  @Override
  Set<K> createKeySet() {
    return Sets.filter(unfiltered.keySet(), keyPredicate);
  }

  @Override
  public Collection<V> get(@ParametricNullness K key) {
    if (keyPredicate.apply(key)) {
      return unfiltered.get(key);

 *   <li>{@link Lists}
 *   <li>{@link Maps}
 *   <li>{@link MoreCollectors}
 *   <li>{@link Multimaps}
 *   <li>{@link Multisets}
 *   <li>{@link ObjectArrays}
 *   <li>{@link Queues}
 *   <li>{@link Sets}
 *   <li>{@link Streams}
 *   <li>{@link Tables}
 * </ul>
 *
 * <h2>Abstract implementations</h2>
 *
 * <ul>
 *   <li>{@link AbstractIterator}
 *   <li>{@link AbstractSequentialIterator}

      return emptySet();
    } else {
      return emptyList();
    }
  }

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

  @Override
  Set<K> createKeySet() {
    return Sets.filter(unfiltered.keySet(), keyPredicate);
  }

  @Override
  public Collection<V> get(@ParametricNullness K key) {
    if (keyPredicate.apply(key)) {
      return unfiltered.get(key);

Gardez à l'esprit que les dataclasses ne peuvent pas tout ce que peuvent faire les modèles Pydantic.

Vous pourriez donc avoir encore besoin d'utiliser des modèles Pydantic.

Mais si vous avez déjà un ensemble de dataclasses sous la main, c'est une astuce pratique pour les utiliser afin d'alimenter une API Web avec FastAPI. 🤓

///

## Utiliser des dataclasses dans `response_model` { #dataclasses-in-response-model }

            cb.query().addOrderBy_DuplicateHostName_Asc();
            cb.fetchFirst(fessConfig.getPageDuplicateHostMaxFetchSizeAsInteger());
        });
    }

    /**
     * Sets up the search conditions for listing duplicate host configurations.
     *
     * <p>This method configures the condition bean with search criteria from the pager,