splitIntoBuckets(
                LinkedList(subProjectTestClassTimes),
                SubprojectTestClassTime::totalTime,
                { largeElement, factor ->
                    List(factor) { SmallSubprojectBucket(largeElement.subProject, parallelization(factor)) }
                },
                { list ->
                    SmallSubprojectBucket(list.map { it.subProject }, parallelization(1))
                },

    private static final long serialVersionUID = 1L;

    /**
     * Default initial capacity.
     */
    protected static final int DEFAULT_INITIAL_CAPACITY = 16;

    /**
     * Default load factor.
     */
    protected static final float DEFAULT_LOAD_FACTOR = 0.75f;

    /**
     * Upper limit on the number of entries.
     */
    protected final int limitSize;

    /**

    }

    /**
     * Converts a phrase query to a query builder.
     *
     * @param context the query context
     * @param phraseQuery the phrase query
     * @param boost the boost factor
     * @return the query builder
     */
    protected QueryBuilder convertPhraseQuery(final QueryContext context, final PhraseQuery phraseQuery, final float boost) {
        final Term[] terms = phraseQuery.getTerms();

     *
     * @param context the query context containing search configuration
     * @param query the Lucene query to convert (must be a FuzzyQuery)
     * @param boost the boost factor to apply to the query
     * @return OpenSearch QueryBuilder for fuzzy matching
     * @throws InvalidQueryException if the query is not a FuzzyQuery
     */
    @Override

   * can hold setSize elements with the desired load factor.
   */
  @VisibleForTesting
  static int chooseTableSize(int setSize) {
    if (setSize == 1) {
      return 2;
    }
    // Correct the size for open addressing to match desired load factor.
    // Round up to the next highest power of 2.
    int tableSize = Integer.highestOneBit(setSize - 1) << 1;

     * Executes query processing through the filter chain.
     *
     * @param context the query context containing search parameters and state
     * @param query the Lucene query to be processed
     * @param boost the boost factor to apply to the query
     * @return the processed OpenSearch QueryBuilder
     */
    public QueryBuilder execute(final QueryContext context, final Query query, final float boost) {

          .isAtMost(
              2
                  * constructionAsymptotics.applyAsDouble(largeSize)
                  / constructionAsymptotics.applyAsDouble(smallSize));
      // allow up to 2x wobble in the constant factors
    }
  }

  public void testResistsHashFloodingOnQuery() {
    CallsCounter smallCounter = new CallsCounter();
    List<CountsHashCodeAndEquals> haveSameHashesSmall = createAdversarialInput(10, smallCounter);

   * can hold setSize elements with the desired load factor.
   */
  @VisibleForTesting
  static int chooseTableSize(int setSize) {
    if (setSize == 1) {
      return 2;
    }
    // Correct the size for open addressing to match desired load factor.
    // Round up to the next highest power of 2.
    int tableSize = Integer.highestOneBit(setSize - 1) << 1;

import org.lastaflute.core.message.UserMessages;
import org.opensearch.index.query.QueryBuilder;

/**
 * Query command implementation for handling Boost queries.
 * Processes Lucene BoostQuery objects and applies boost factors.
 */
public class BoostQueryCommand extends QueryCommand {
    /**
     * Default constructor for BoostQueryCommand.
     */
    public BoostQueryCommand() {
        super();
    }

Estas facturas tendrán un `id`, `title` (opcional), `customer` y `total`.

El usuario de tu API (un desarrollador externo) creará una factura en tu API con un request POST.

Luego tu API (imaginemos):

* Enviará la factura a algún cliente del desarrollador externo.
* Recogerá el dinero.
* Enviará una notificación de vuelta al usuario de la API (el desarrollador externo).