| IMPORTANT |
| -------------------------- |

      return ImmutableSortedSet.orderedBy(STRING_REVERSED).add(elements).build();
    }

    /*
     * While the current implementation returns `this`, that's not something we mean to guarantee.
     * Callers of TestContainerGenerator.order need to be prepared for implementations to return a new
     * collection.
     */
    @SuppressWarnings("CanIgnoreReturnValueSuggester")
    @Override

          releaseShared(finalState);
        } else if (getState() == COMPLETING) {
          // If some other thread is currently completing the future, block until
          // they are done so we can guarantee completion.
          acquireShared(-1);
        }
        return doCompletion;
      }
    }

    static CancellationException cancellationExceptionWithCause(

      return ImmutableSortedSet.orderedBy(STRING_REVERSED).add(elements).build();
    }

    /*
     * While the current implementation returns `this`, that's not something we mean to guarantee.
     * Callers of TestContainerGenerator.order need to be prepared for implementations to return a new
     * collection.
     */
    @SuppressWarnings("CanIgnoreReturnValueSuggester")
    @Override

 * <p>Note that this implementation is not synchronized. If multiple threads access the same cell of
 * an {@code ArrayTable} concurrently and one of the threads modifies its value, there is no
 * guarantee that the new value will be fully visible to the other threads. To guarantee that
 * modifications are visible, synchronize access to the table. Unlike other {@code Table}
 * implementations, synchronization is unnecessary between a thread that writes to one cell and a

          releaseShared(finalState);
        } else if (getState() == COMPLETING) {
          // If some other thread is currently completing the future, block until
          // they are done so we can guarantee completion.
          acquireShared(-1);
        }
        return doCompletion;
      }
    }

    static CancellationException cancellationExceptionWithCause(

  private void swap(int i, int j) {
    T tmp = buffer[i];
    buffer[i] = buffer[j];
    buffer[j] = tmp;
  }

  /*
   * While the current implementation returns `this`, that's not something we mean to guarantee.
   * Anyway, the purpose of this method is to implement a BinaryOperator combiner for a Collector,
   * so its return value will get used naturally.
   */
  @SuppressWarnings("CanIgnoreReturnValueSuggester")

    byte[] getBytesInternal() {
      return bytes;
    }

    @Override
    boolean equalsSameBits(HashCode that) {
      // We don't use MessageDigest.isEqual() here because its contract does not guarantee
      // constant-time evaluation (no short-circuiting).
      if (this.bytes.length != that.getBytesInternal().length) {
        return false;
      }

      boolean areEqual = true;

   * @param array the source array
   * @param minLength the minimum length the returned array must guarantee
   * @param padding an extra amount to "grow" the array by if growth is necessary
   * @throws IllegalArgumentException if {@code minLength} or {@code padding} is negative
   * @return an array containing the values of {@code array}, with guaranteed minimum length {@code
   *     minLength}
   */

  private void swap(int i, int j) {
    T tmp = buffer[i];
    buffer[i] = buffer[j];
    buffer[j] = tmp;
  }

  /*
   * While the current implementation returns `this`, that's not something we mean to guarantee.
   * Anyway, the purpose of this method is to implement a BinaryOperator combiner for a Collector,
   * so its return value will get used naturally.
   */
  @SuppressWarnings("CanIgnoreReturnValueSuggester")