*/
  @SuppressWarnings("rawtypes") // https://github.com/google/guava/issues/989
  public static <E extends Comparable> TreeMultiset<E> create() {
    return new TreeMultiset<>(Ordering.natural());
  }

  /**
   * Creates a new, empty multiset, sorted according to the specified comparator. All elements
   * inserted into the multiset must be <i>mutually comparable</i> by the specified comparator:

        final LlmChatResponse response = new LlmChatResponse();
        response.setContent("Test content");
        assertEquals("Test content", response.getContent());

        response.setContent("Updated content");
        assertEquals("Updated content", response.getContent());
    }

    @Test
    public void test_setFinishReason() {
        final LlmChatResponse response = new LlmChatResponse();

        ThumbnailQueueCQ cq = new ThumbnailQueueCQ();
        if (queryLambda != null) {
            queryLambda.callback(cq);
        }
        FilterAggregationBuilder builder = regFilterA(name, cq.getQuery());
        if (opLambda != null) {
            opLambda.callback(builder);
        }
        if (aggsLambda != null) {
            ThumbnailQueueCA ca = new ThumbnailQueueCA();
            aggsLambda.callback(ca);

  }

  private final int[] factorials = new int[ARRAY_SIZE];
  private final int[][] binomials = new int[ARRAY_SIZE][2];
  private final int[][] nonnegInt = new int[ARRAY_SIZE][2];
  private final long[][] nonnegLong = new long[ARRAY_SIZE][2];
  private final int[][] intsToAdd = new int[ARRAY_SIZE][2];
  private final int[][] intsToMul = new int[ARRAY_SIZE][2];
  private final long[][] longsToAdd = new long[ARRAY_SIZE][2];

  }

  private final int[] factorials = new int[ARRAY_SIZE];
  private final int[][] binomials = new int[ARRAY_SIZE][2];
  private final int[][] nonnegInt = new int[ARRAY_SIZE][2];
  private final long[][] nonnegLong = new long[ARRAY_SIZE][2];
  private final int[][] intsToAdd = new int[ARRAY_SIZE][2];
  private final int[][] intsToMul = new int[ARRAY_SIZE][2];
  private final long[][] longsToAdd = new long[ARRAY_SIZE][2];

                Map<Object, Plugin> master = new LinkedHashMap<>(src.size() * 2);

                for (Plugin element : src) {
                    if (element.isInherited() || !element.getExecutions().isEmpty()) {
                        // NOTE: Enforce recursive merge to trigger merging/inheritance logic for executions
                        Plugin plugin = new Plugin();

    private CIFSContext transportContext;

    @Override
    public void init() throws ServletException {

        final StringBuilder sb = new StringBuilder();
        final byte[] buf = new byte[1024];
        int n;
        String name;

        final Properties p = new Properties();
        p.putAll(System.getProperties());
        p.setProperty("jcifs.smb.client.soTimeout", "600000");

     */
    protected static void updateDefaultBadwords() {
        if (defaultWords != null) {
            return;
        }

        final List<String> list = new ArrayList<>();
        try (BufferedReader br = new BufferedReader(new InputStreamReader(
                Thread.currentThread().getContextClassLoader().getResourceAsStream("suggest_settings/default-badwords.txt")))) {

            String line;

    static byte[] srcBytes = new byte[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };

    static String srcString = "ABCDEFGHIJKLMN";

    static String urlString = "あいうえお";

    InputStream is = new ByteArrayInputStream(srcBytes);

    ByteArrayOutputStream os = new ByteArrayOutputStream();

    Reader reader = new StringReader(srcString);

    StringWriter writer = new StringWriter();

@NullUnmarked
public class ForwardingObjectTest extends TestCase {

  public void testEqualsReflexive() {
    Object delegate = new Object();
    ForwardingObject forward =
        new ForwardingObject() {
          @Override
          protected Object delegate() {
            return delegate;
          }
        };
    new EqualsTester().addEqualityGroup(forward).testEquals();
  }

  public void testEqualsSymmetric() {