Iterator<String> iterator = Lists.newArrayList("manny", "mo", "jack").iterator();
    assertEquals(1, Iterators.indexOf(iterator, equalTo("mo")));
    assertEquals("jack", iterator.next());
    assertFalse(iterator.hasNext());
  }

  public void testIndexOf_consumedDataWithDuplicates() {
    Iterator<String> iterator = Lists.newArrayList("manny", "mo", "mo", "jack").iterator();

    Iterator<String> iterator = Lists.newArrayList("manny", "mo", "jack").iterator();
    assertEquals(1, Iterators.indexOf(iterator, equalTo("mo")));
    assertEquals("jack", iterator.next());
    assertFalse(iterator.hasNext());
  }

  public void testIndexOf_consumedDataWithDuplicates() {
    Iterator<String> iterator = Lists.newArrayList("manny", "mo", "mo", "jack").iterator();

      },
      "french_stop": {
        "type":       "stop",
        "stopwords":  "_french_"
      },
      "french_keywords": {
        "type":       "keyword_marker",
        "keywords": ["Bonjour", "monde", "recherche"]
      },
      "french_stemmer": {
        "type":       "stemmer",
        "language":   "light_french"
      },
      "german_stop": {
        "type":       "stop",

   * SoftReference} (by default, strong references are used). Softly-referenced objects will be
   * garbage-collected in a <i>globally</i> least-recently-used manner, in response to memory
   * demand.
   *
   * <p><b>Warning:</b> in most circumstances it is better to set a per-cache {@linkplain

      },
      "french_stop": {
        "type":       "stop",
        "stopwords":  "_french_"
      },
      "french_keywords": {
        "type":       "keyword_marker",
        "keywords": ["Bonjour", "monde", "recherche"]
      },
      "french_stemmer": {
        "type":       "stemmer",
        "language":   "light_french"
      },
      "german_stop": {
        "type":       "stop",

  final int concurrencyLevel;

  /** Strategy for comparing keys. */
  final Equivalence<Object> keyEquivalence;

  /** Strategy for handling entries and segments in a type-safe and efficient manner. */
  final transient InternalEntryHelper<K, V, E, S> entryHelper;

  /**
   * Creates a new, empty map with the specified strategy, initial capacity and concurrency level.
   */

 * determining whether a given domain name is an effective top-level domain (public suffix).
 *
 * <p>Because this class is used in GWT, the data members are stored in a space-efficient manner.
 * See {@link TrieParser}.
 *
 * @since 16.0
 */
@GwtCompatible
@Beta
public final class PublicSuffixPatterns {
  private PublicSuffixPatterns() {}