@Override
        @Nullable String chop(String str) {
          String result = i.chop(str);
          return result != null ? result : you.chop(str);
        }
      };
    }

    abstract @Nullable String chop(String str);

    static Chopper suffix(String suffix) {
      return new Chopper() {
        @Override
        @Nullable String chop(String str) {
          if (str.endsWith(suffix)) {

        @Override
        @Nullable String chop(String str) {
          String result = i.chop(str);
          return result != null ? result : you.chop(str);
        }
      };
    }

    abstract @Nullable String chop(String str);

    static Chopper suffix(String suffix) {
      return new Chopper() {
        @Override
        @Nullable String chop(String str) {
          if (str.endsWith(suffix)) {

  avatarUrl: https://avatars.githubusercontent.com/u/20477587?u=c5184dab6d021733d10c8f975b20e391856303d6&v=4
  url: https://github.com/jackleeio
choi-haram:
  login: choi-haram
  count: 2
  avatarUrl: https://avatars.githubusercontent.com/u/62204475?v=4
  url: https://github.com/choi-haram
imtiaz101325:
  login: imtiaz101325
  count: 2

    margin-bottom: 0.75rem;
    font-weight: 500;
}

.suggestion-chips {
    display: flex;
    flex-wrap: wrap;
    gap: 0.5rem;
    justify-content: center;
}

.suggestion-chip {
    padding: 0.5rem 1rem;
    border: 1px solid #dfe1e6;
    border-radius: 20px;
    background-color: white;
    color: #42526e;
    font-size: 0.875rem;
    cursor: pointer;

          }
        };
    assertThrows(IllegalStateException.class, iter::hasNext);
  }

  // Technically we should test other reentrant scenarios (4 combinations of
  // hasNext/next), but we'll cop out for now, knowing that
  // next() both start by invoking hasNext() anyway.

          }
        };
    assertThrows(IllegalStateException.class, iter::hasNext);
  }

  // Technically we should test other reentrant scenarios (9 combinations of
  // hasNext/next/peek), but we'll cop out for now, knowing that peek() and
  // next() both start by invoking hasNext() anyway.

          }
        };
    assertThrows(IllegalStateException.class, iter::hasNext);
  }

  // Technically we should test other reentrant scenarios (9 combinations of
  // hasNext/next/peek), but we'll cop out for now, knowing that peek() and
  // next() both start by invoking hasNext() anyway.

          }
        };
    assertThrows(IllegalStateException.class, iter::hasNext);
  }

  // Technically we should test other reentrant scenarios (4 combinations of
  // hasNext/next), but we'll cop out for now, knowing that
  // next() both start by invoking hasNext() anyway.

            if (itemCount <= 10) {
                $(this).find('.filter-search-wrapper').hide();
            }
        });

        // Suggestion chip click handlers
        $('.suggestion-chip').on('click', function() {
            var suggestion = $(this).data('suggestion');
            if (suggestion) {
                elements.chatInput.val(suggestion);
                updateCharCount();

  private static final ImmutableSet<String> VALID_NAME =
      ImmutableSet.of(
          // keep-sorted start
          "123.cn",
          "8server.shop",
          "a" + DELTA + "b.com",
          "abc.a23",
          "biz.com.ua",
          "f--1.com",
          "f--o",
          "f-_-o.cOM",
          "f11-1.com",
          "fOo",
          "f_a",