* License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *

        @Nonnull
        public ArtifactResolverRequestBuilder session(Session session) {
            this.session = session;
            return this;
        }

        @Nonnull
        public ArtifactResolverRequestBuilder trace(RequestTrace trace) {
            this.trace = trace;
            return this;
        }

        @Nonnull

     */
    public boolean isCompleted() {
        return completed;
    }

    /**
     * Mark request as completed
     */
    public void markCompleted() {
        this.completed = true;
    }

    /**
     * Mark request as failed with error
     *
     * @param error exception that caused the failure
     */
    public void markFailed(Exception error) {

     * @return The text.
     */
    public String getText() {
        return text;
    }

    /**
     * Returns the readings of the suggest item.
     * @return The readings.
     */
    public String[][] getReadings() {
        return readings;
    }

    /**
     * Returns the tags of the suggest item.
     * @return The tags.
     */
    public String[] getTags() {
        return tags;

/**
 * Tests for {@code LinkedListMultimap}.
 *
 * @author Mike Bostock
 */
@GwtCompatible
@NullMarked
public class LinkedListMultimapTest extends TestCase {

  @J2ktIncompatible
  @GwtIncompatible // suite
  @AndroidIncompatible // test-suite builders
  public static Test suite() {
    TestSuite suite = new TestSuite();
    suite.addTest(
        ListMultimapTestSuiteBuilder.using(

  public static HashFunction murmur3_128() {
    return Murmur3_128HashFunction.MURMUR3_128;
  }

  /**
   * Returns a hash function implementing the <a href="https://131002.net/siphash/">64-bit
   * SipHash-2-4 algorithm</a> using a seed value of {@code k = 00 01 02 ...}.
   *
   * @since 15.0
   */
  public static HashFunction sipHash24() {

import org.opensearch.search.aggregations.Aggregations;

public class SearchRenderDataTest extends UnitFessTestCase {

    private SearchRenderData searchRenderData;

    @Override
    public void setUp() throws Exception {
        super.setUp();
        searchRenderData = new SearchRenderData();
    }

    public void test_constructor() {
        assertNotNull(searchRenderData);

    }

    @Override
    public Iterator<T> iterator() {
      return Iterators.unmodifiableIterator(iterable.iterator());
    }

    @Override
    public void forEach(Consumer<? super T> action) {
      iterable.forEach(action);
    }

    @SuppressWarnings("unchecked") // safe upcast, assuming no one has a crazy Spliterator subclass
    @Override
    public Spliterator<T> spliterator() {

   * implement {@link Comparable}.
   */
  public static <E extends Comparable<?>> Builder<E> naturalOrder() {
    return new Builder<>(Ordering.natural());
  }

  /**
   * A builder for creating immutable sorted set instances, especially {@code public static final}
   * sets ("constant sets"), with a given comparator. Example:
   *
   * {@snippet :
   * public static final ImmutableSortedSet<Number> LUCKY_NUMBERS =

@AndroidIncompatible
@GwtIncompatible
@RunWith(JUnit4.class)
@NullUnmarked
public class FinalizableReferenceQueueTest {

  private @Nullable FinalizableReferenceQueue frq;

  @After
  public void tearDown() throws Exception {
    frq = null;
  }

  @Test
  public void testFinalizeReferentCalled() {
    MockReference reference = new MockReference(frq = new FinalizableReferenceQueue());