List<String> list = Lists.newArrayList("mary", "bob");
    assertEquals(0, Iterables.indexOf(list, equalTo("mary")));
    assertEquals(1, Iterables.indexOf(list, equalTo("bob")));
    assertEquals(-1, Iterables.indexOf(list, equalTo("jack")));
  }

  public void testIndexOf_withDuplicates() {
    List<String> list = Lists.newArrayList("mary", "bob", "bob", "bob", "sam");

    List<String> list = Lists.newArrayList("mary", "bob");
    assertEquals(0, Iterables.indexOf(list, equalTo("mary")));
    assertEquals(1, Iterables.indexOf(list, equalTo("bob")));
    assertEquals(-1, Iterables.indexOf(list, equalTo("jack")));
  }

  public void testIndexOf_withDuplicates() {
    List<String> list = Lists.newArrayList("mary", "bob", "bob", "bob", "sam");

import java.math.BigInteger;
import java.util.Random;
import org.jspecify.annotations.NullUnmarked;

/**
 * Utilities for benchmarks.
 *
 * <p>In many cases, we wish to vary the order of magnitude of the input as much as we want to vary
 * the input itself, so most methods which generate values use an exponential distribution varying
 * the order of magnitude of the generated values uniformly at random.
 *

          println("Server: ${response.header("Server")}")
          println("Date: ${response.header("Date")}")
          println("Vary: ${response.headers("Vary")}")
        }
      }
    ```

=== ":material-language-java: Java"
    ```java
      private final OkHttpClient client = new OkHttpClient();

      public void run() throws Exception {

   * without contention. Because assignment of entries to these partitions is not necessarily
   * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to
   * accommodate as many threads as will ever concurrently modify the table. Using a significantly
   * higher value than you need can waste space and time, and a significantly lower value can lead

            }
          }
          return true;
        }
      }
      return false;
    }

    /**
     * If more than this many consecutive positions are filled in a table of the specified size,
     * report probable hash flooding. ({@link #hashFloodingDetected} may also report hash flooding
     * if fewer consecutive positions are filled; see that method for details.)
     */

/*
 * Copyright (C) 2007 The Guava Authors
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,

   *
   * <p>The returned set isn't threadsafe or serializable, even if {@code unfiltered} is.
   *
   * <p>Many of the filtered set's methods, such as {@code size()}, iterate across every element in
   * the underlying set and determine which elements satisfy the filter. When a live view is
   * <i>not</i> needed, it may be faster to copy {@code Iterables.filter(unfiltered, predicate)} and
   * use the copy.
   *

        return value;
      }
    }
    return null;
  }

  /**
   * A sensible definition of {@link #clear} in terms of the {@code iterator} method of {@link
   * #entrySet}. In many cases, you may wish to override {@link #clear} to forward to this
   * implementation.
   *
   * @since 7.0
   */
  protected void standardClear() {
    Iterators.clear(entrySet().iterator());
  }

  /**

        assertFalse(validator.determineValid("too many fields here * * * * * * *"));
        assertFalse(validator.determineValid("* * * *"));
    }

    public void test_isValid_basicInvalidCronExpression() {
        final ConstraintValidatorContext context = null;
        assertFalse(validator.isValid("invalid cron", context));
        assertFalse(validator.isValid("too many fields * * * * * * *", context));